发布求助
文献互助 智能选刊 最新文献

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences最新文献

筛选
英文 中文
Proof of Achievability Part of Rate-Distortion Theorem without Random Coding 不需要随机编码的率失真定理可实现部分的证明
4区 计算机科学
Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023tap0009
Mikihiko NISHIARA, Yuki ITO
{"title":"Proof of Achievability Part of Rate-Distortion Theorem without Random Coding","authors":"Mikihiko NISHIARA, Yuki ITO","doi":"10.1587/transfun.2023tap0009","DOIUrl":"https://doi.org/10.1587/transfun.2023tap0009","url":null,"abstract":"The achievability part of the rate-distortion theorem is proved by showing existence of good codes. For i.i.d. sources, two methods showing existence are known; random coding and non-random coding. For general sources, however, no proof in which good codes are constructed with non-random coding is found. In this paper, with a non-random method of code construction, we prove the achievability part of the rate-distortion theorem for general sources. Moreover, we also prove a stochastic variation of the rate-distortion theorem with the same method.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136053111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A retinal vessel segmentation network fusing cross-modal features 融合跨模态特征的视网膜血管分割网络
4区 计算机科学
Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023eal2063
Xiaosheng YU, Jianning CHI, Ming XU
{"title":"A retinal vessel segmentation network fusing cross-modal features","authors":"Xiaosheng YU, Jianning CHI, Ming XU","doi":"10.1587/transfun.2023eal2063","DOIUrl":"https://doi.org/10.1587/transfun.2023eal2063","url":null,"abstract":"Accurate segmentation of fundus vessel structure can effectively assist doctors in diagnosing eye diseases. In this paper, we propose a fundus blood vessel segmentation network combined with cross-modal features and verify our method on the public data set OCTA-500. Experimental results show that our method has high accuracy and robustness.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135268269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Short DL-based Blacklistable Ring Signatures from DualRing 来自DualRing的基于dl的黑名单环签名
4区 计算机科学
Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023tap0008
Toru NAKANISHI, Atsuki IRIBOSHI, Katsunobu IMAI
{"title":"Short DL-based Blacklistable Ring Signatures from DualRing","authors":"Toru NAKANISHI, Atsuki IRIBOSHI, Katsunobu IMAI","doi":"10.1587/transfun.2023tap0008","DOIUrl":"https://doi.org/10.1587/transfun.2023tap0008","url":null,"abstract":"As one of privacy-enhancing authentications suitable for decentralized environments, ring signatures have intensively been researched. In ring signatures, each user can choose any ad-hoc set of users (specified by public keys) called a ring, and anonymously sign a message as one of the users. However, in applications of anonymous authentications, users may misbehave the service due to the anonymity, and thus a mechanism to exclude the anonymous misbehaving users is required. However, in the existing ring signature scheme, a trusted entity to open the identity of the user is needed, but it is not suitable for the decentralized environments. On the other hand, as another type of anonymous authentications, a decentralized blacklistable anonymous credential system is proposed, where anonymous misbehaving users can be detected and excluded by a blacklist. However, the DL-based instantiation needs O(N) proof size for the ring size N. In the research line of the DL-based ring signatures, an efficient scheme with O(log N) signature size, called DualRing, is proposed. In this paper, we propose a DL-based blacklistable ring signature scheme extended from DualRing, where in addition to the short O(log N) signature size for N, the blacklisting mechanism is realized to exclude misbehaving users. Since the blacklisting mechanism causes additional costs in our scheme, the signature size is O(log N + ℓ), where ℓ is the blacklist size.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134889620","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A high-performance antenna array signal processing method in deep space communication 一种深空通信中高性能天线阵列信号处理方法
4区 计算机科学
Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023eal2066
Yi WEN JIAO, Ze FU GAO, Wen GE YANG
{"title":"A high-performance antenna array signal processing method in deep space communication","authors":"Yi WEN JIAO, Ze FU GAO, Wen GE YANG","doi":"10.1587/transfun.2023eal2066","DOIUrl":"https://doi.org/10.1587/transfun.2023eal2066","url":null,"abstract":"In future deep space communication missions, VLBI(Very Long Baseline Interferometry) based on antenna array technology remains a critical detection method, which urgently requires the improvement of synthesis performance for antenna array signals. Considering this, focusing on optimizing the traditional antenna grouping method applied in the phase estimation algorithm, this letter proposes a \"L/2 to L/2\" antenna grouping method based on the maximum correlation signal-to-noise ratio(SNR). Following this idea, a phase difference estimation algorithm named “Couple” is presented. Theoretical analysis and simulation verification illustrate that: when ρ < -10dB, the proposed \"Couple\" has the highest performance; increasing the number of antennas can significantly improve its synthetic loss performance and robustness. The research of this letter indicates a promising potential in supporting the rising deep space exploration and communication missions.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135653544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
More Efficient Two-Round Multi-Signature Scheme with Provably Secure Parameters for Standardized Elliptic Curves 具有可证明安全参数的标准化椭圆曲线更有效的两轮多重签名方案
4区 计算机科学
Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023eap1045
Kaoru TAKEMURE, Yusuke SAKAI, Bagus SANTOSO, Goichiro HANAOKA, Kazuo OHTA
{"title":"More Efficient Two-Round Multi-Signature Scheme with Provably Secure Parameters for Standardized Elliptic Curves","authors":"Kaoru TAKEMURE, Yusuke SAKAI, Bagus SANTOSO, Goichiro HANAOKA, Kazuo OHTA","doi":"10.1587/transfun.2023eap1045","DOIUrl":"https://doi.org/10.1587/transfun.2023eap1045","url":null,"abstract":"The existing discrete-logarithm-based two-round multi-signature schemes without using the idealized model, i.e., the Algebraic Group Model (AGM), have quite large reduction loss. This means that an implementation of these schemes requires an elliptic curve (EC) with a very large order for the standard 128-bit security when we consider concrete security. Indeed, the existing standardized ECs have orders too small to ensure 128-bit security of such schemes. Recently, Pan and Wagner proposed two two-round schemes based on the Decisional Diffie-Hellman (DDH) assumption (EUROCRYPT 2023). For 128-bit security in concrete security, the first scheme can use the NIST-standardized EC P-256 and the second can use P-384. However, with these parameter choices, they do not improve the signature size and the communication complexity over the existing non-tight schemes. Therefore, there is no two-round scheme that (i) can use a standardized EC for 128-bit security and (ii) has high efficiency.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135954456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Dynamic Limited Variable Step-Size Algorithm Based on the MSD Variation Cost Function 基于MSD变化代价函数的动态有限变步长算法
4区 计算机科学
Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023eal2069
Yufei Han, Jiaye Xie, Yibo Li
{"title":"Dynamic Limited Variable Step-Size Algorithm Based on the MSD Variation Cost Function","authors":"Yufei Han, Jiaye Xie, Yibo Li","doi":"10.1587/transfun.2023eal2069","DOIUrl":"https://doi.org/10.1587/transfun.2023eal2069","url":null,"abstract":"The steady-state and convergence performances are important indicators to evaluate adaptive algorithms. The step-size affects these two important indicators directly. Many relevant scholars have also proposed some variable step-size adaptive algorithms for improving performance. However, there are still some problems in these existing variable step-size adaptive algorithms, such as the insufficient theoretical analysis, the imbalanced performance and the unachievable parameter. These problems influence the actual performance of some algorithms greatly. Therefore, we intend to further explore an inherent relationship between the key performance and the step-size in this paper. The variation of mean square deviation (MSD) is adopted as the cost function. Based on some theoretical analyses and derivations, a novel variable step-size algorithm with a dynamic limited function (DLF) was proposed. At the same time, the sufficient theoretical analysis is conducted on the weight deviation and the convergence stability. The proposed algorithm is also tested with some typical algorithms in many different environments. Both the theoretical analysis and the experimental result all have verified that the proposed algorithm equips a superior performance.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135357303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A new Transformation for Costas Arrays 一个新的Costas数组变换
4区 计算机科学
Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023sdp0005
Ali ARDALANI, Alexander POTT
{"title":"A new Transformation for Costas Arrays","authors":"Ali ARDALANI, Alexander POTT","doi":"10.1587/transfun.2023sdp0005","DOIUrl":"https://doi.org/10.1587/transfun.2023sdp0005","url":null,"abstract":"A Costas array of size n is an n × n binary matrix such that no two of the $binom{n}{2}$ line segments connecting 1s have the same length and slope. Costas arrays are found by finite-field-based construction methods and their manipulations (systematically constructed) and exhaustive search methods. The arrays found exhaustively, which are of completely unknown origin, are called sporadic. Most studies in Costas arrays have tended to focus on systematically constructed Costas arrays rather than sporadic ones, which reveals the hardness of examining a link between systematically constructed Costas arrays and sporadic ones. This paper introduces a new transformation that preserves the Costas property for some Costas arrays, but not all. We observed that this transformation could transform some systematically constructed Costas arrays to sporadic ones and vice versa. Moreover, we introduce a family of arrays with the property that the autocorrelation of each array and the cross-correlation between any two arrays in this family is bounded above by two.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136257246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信