IEICE Trans. Fundam. Electron. Commun. Comput. Sci.最新文献_第10页

Transient Fault Tolerant State Assignment for Stochastic Computing Based on Linear Finite State Machines 基于线性有限状态机的随机计算暂态容错状态分配

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2020-12-01 DOI: 10.1587/transfun.2020vlp0013

H. Ichihara, Motoi Fukuda, T. Iwagaki, Tomoo Inoue

引用次数: 0

Coded Caching in Multi-Rate Wireless Networks 多速率无线网络中的编码缓存

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2020-12-01 DOI: 10.1587/transfun.2020tap0013

Makoto Takita, M. Hirotomo, M. Morii

{"title":"Coded Caching in Multi-Rate Wireless Networks","authors":"Makoto Takita, M. Hirotomo, M. Morii","doi":"10.1587/transfun.2020tap0013","DOIUrl":"https://doi.org/10.1587/transfun.2020tap0013","url":null,"abstract":"SUMMARY The network load is increasing due to the spread of con- tent distribution services. Caching is recognized as a technique to reduce the peak network load by storing popular content into memories of users. Coded caching is a new caching approach based on a carefully designed content placement to create coded multicasting opportunities. Coded caching schemes in single-rate networks are evaluated by the tradeo ﬀ between the size of memory and that of delivered data. For considering the network with multiple transmission rates, it is crucial how to operate multicast. In multicast delivery, a sender must communicate to intended receivers at a rate that is available to all receivers. Multicast scheduling method of determining rates to deliver are evaluated by throughput and de- lay in multi-rate wireless networks. In this paper, we discuss coded caching in the multi-rate wireless networks. We newly deﬁne a measure for eval- uating the coded caching scheme as coded caching delay and propose a new coded caching scheme. Also, we compare the proposed coded caching scheme with conventional coded caching schemes and show that the proposed scheme is suitable for multi-rate wireless networks.","PeriodicalId":348826,"journal":{"name":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci.","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121874135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Quantum Frequency Arrangements, Quantum Mixed Orthogonal Arrays and Entangled States 量子频率排列、量子混合正交阵列与纠缠态

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2020-12-01 DOI: 10.1587/transfun.2020eal2007

S. Pang, Ruining Zhang, Xiao Zhang

引用次数: 2

Inpainting via Sparse Representation Based on a Phaseless Quality Metric 基于无相位质量度量的稀疏表示绘画

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2020-12-01 DOI: 10.1587/transfun.2020smp0020

Takahiro Ogawa, Keisuke Maeda, M. Haseyama

{"title":"Inpainting via Sparse Representation Based on a Phaseless Quality Metric","authors":"Takahiro Ogawa, Keisuke Maeda, M. Haseyama","doi":"10.1587/transfun.2020smp0020","DOIUrl":"https://doi.org/10.1587/transfun.2020smp0020","url":null,"abstract":"SUMMARY An inpainting method via sparse representation based on a new phaseless quality metric is presented in this paper. Since power spectra, phaseless features, of local regions within images enable more successful representation of their texture characteristics compared to their pixel values, a new quality metric based on these phaseless features is newly derived for image representation. Speciﬁcally, the proposed method enables spare representation of target signals, i.e., target patches, including missing intensities by monitoring errors converged by phase retrieval as the novel phaseless quality metric. This is the main contribution of our study. In this approach, the phase retrieval algorithm used in our method has the following two important roles: (1) derivation of the new quality metric that can be derived even for images including missing intensities and (2) conversion of phaseless features, i.e., power spectra, to pixel values, i.e., intensities. Therefore, the above novel approach solves the existing problem of not being able to use better features or better quality metrics for inpainting. Results of experiments showed that the proposed method using sparse representation based on the new phaseless quality metric outperforms previously reported methods that directly use pixel values for inpainting.","PeriodicalId":348826,"journal":{"name":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133555400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Robust Adaptive Beamforming Based on the Effective Steering Vector Estimation and Covariance Matrix Reconstruction against Sensor Gain-Phase Errors 基于有效导向矢量估计和抗传感器增益相位误差协方差矩阵重构的鲁棒自适应波束形成

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2020-12-01 DOI: 10.1587/transfun.2020eal2041

Di Yao, Xin Zhang, Bin Hu, Xiaochuan Wu

引用次数: 0

Analysis of Decoding Error Probability of Spatially "Mt. Fuji" Coupled LDPC Codes in Waterfall Region of the BEC BEC瀑布区空间“富士山”耦合LDPC码译码错误概率分析

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2020-12-01 DOI: 10.1587/transfun.2020tap0010

Yuta Nakahara, T. Matsushima

引用次数: 0

A Fault Detection and Diagnosis Method for Via-Switch Crossbar in Non-Volatile FPGA 非易失性FPGA中过通开关交叉条故障检测与诊断方法

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2020-12-01 DOI: 10.1587/transfun.2020vlp0005

Ryutaro Doi, X. Bai, T. Sakamoto, M. Hashimoto

引用次数: 1

Heterogeneous-Graph-Based Video Search Reranking Using Topic Relevance 基于主题相关性的异构图视频搜索重排序

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2020-12-01 DOI: 10.1587/transfun.2020smp0023

Soh Yoshida, M. Muneyasu, Takahiro Ogawa, M. Haseyama

引用次数: 0

Pilot Decontamination in Massive MIMO Uplink via Approximate Message-Passing 基于近似消息传递的大规模MIMO上行链路导频去污

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2020-12-01 DOI: 10.1587/transfun.2020tap0007

Takumi Fujitsuka, K. Takeuchi

引用次数: 0

An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations 带否定的CNF公式的常大小属性证明匿名凭证系统

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2020-12-01 DOI: 10.1587/TRANSFUN.2020TAP0003

Ryo Okishima, T. Nakanishi

{"title":"An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations","authors":"Ryo Okishima, T. Nakanishi","doi":"10.1587/TRANSFUN.2020TAP0003","DOIUrl":"https://doi.org/10.1587/TRANSFUN.2020TAP0003","url":null,"abstract":"To enhance the user’s privacy in electronic ID, anonymous credential systems have been researched. In the anonymous credential system, a trusted issuing organization first issues a certificate certifying the user’s attributes to a user. Then, in addition to the possession of the certificate, the user can anonymously prove only the necessary attributes. Previously, an anonymous credential system was proposed, where CNF (Conjunctive Normal Form) formulas on attributes can be proved. The advantage is that the attribute proof in the authentication has the constant size for the number of attributes that the user owns and the size of the proved formula. Thus, various expressive logical relations on attributes can be efficiently verified. However, the previous system has a limitation: the proved CNF formulas cannot include any negation. Therefore, in this paper, we propose an anonymous credential system with constant-size attribute proofs such that the user can prove CNF formulas with negations. For the proposed system, we extend the previous accumulator for the limited CNF formulas to verify CNF formulas with negations.","PeriodicalId":348826,"journal":{"name":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132455302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6