检索结果-内蒙古大学图书馆

Algebraic Distributed Differential Space-Time Codes with low decoding complexity

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2008年第10期7卷 3962-3971页

作者： Rajan, G. Susinder Rajan, B. Sundar Indian Inst Sci Dept Elect Commun Engn Bangalore 560012 Karnataka India

The differential encoding/decoding setup introduced by Kiran et al, Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use codebooks consisting of unitary matrices is extended to allow codebooks consisting of scaled unitary matrices. For such codebooks to be usable in the Jing-Hassibi protocol for cooperative diversity, the conditions involving the relay matrices and the codebook that need to be satisfied are identified. Using the algebraic framework of extended Clifford algebras, a new class of Distributed Differential Space-Time Codes satisfying these conditions for power of two number of relays and also achieving full cooperative diversity with a low complexity sub-optimal receiver is proposed. Simulation results indicate that the proposed codes outperform both the cyclic codes as well as the circulant codes. Furthermore, these codes can also be applied as Differential Space-Time codes for non-coherent communication in classical point to point multiple antenna systems.

关键词： Algebra cooperative diversity low decoding complexity space-time coding

来源：评论

学校读者我要写书评

暂无评论

Robust private information retrieval for low encoding/decoding complexity distributed storage

引用

IET INFORMATION SECURITY 2023年第2期17卷 255-268页

作者： Dai, Mingjun Deng, Haiyan Li, Xiaofeng Su, Gongchao Zhang, Zhonghao Shenzhen Univ Coll Elect & Informat Engn Shenzhen Peoples R China Chengdu Univ Informat Technol Chengdu Peoples R China

Private information retrieval (PIR) means a user retrieves a file while revealing no information on which file is being retrieved. In classic PIR, the user needs to wait for the responses of all the storage nodes. However, in general, there may be some nodes that are unresponsive, in which case it is formulated as v-robust PIR in the network coding (NC) structured distributed storage system (DSS), where v denotes the number of unresponsive nodes. We consider PIR with unresponsive nodes under the framework of NC structured DSS. In particular, the storage nodes adopt combination property with zigzag decodable (CP-ZD) storage code since it has the advantage of extremely low decoding complexity, which is promised by zigzag decoding (ZD) within a binary field. We design a v-robust PIR scheme with its download communication cost slightly larger than existing studies, but its decoding complexity is significantly reduced when compared with existing studies.

关键词： distributed storage system combination property unresponsive nodes low encoding complexity decoding download communication cost storage system zigzag decoding CP-ZD zigzag decodable storage code robust private information retrieval information retrieval storage management v-robust PIR Information retrieval techniques distributed processing storage nodes File organisation Distributed systems software network coding NC structured DSS binary field low decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Design and Analysis of a low-complexity decoding Algorithm for Spinal Codes

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2019年第5期68卷 4667-4679页

作者： Hu, Yingmeng Liu, Rongke Bian, Hongxiu Lyu, Daiyi Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China Beihang Univ Multimedia & Commun Lab Beijing 100191 Peoples R China Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA

In order to facilitate reliable and efficient data transmission in time-varying environments, a block dynamic decoding algorithm for spinal codes is proposed in this paper. First, the code tree is divided into several decoding units to scatter the decoding complexity. According to the results of the last decoding, the decoder will modify the scope of nodes accessed with dynamic parameters, which improves the execution efficiency of the algorithm. Furthermore, the complexity and related parameters of the algorithm are analyzed and verified by some simulations. The results show that the proposed algorithm has the ability to enhance the bandwidth efficiency (or rate) performance, and to reduce both complexity and frame error rate.

关键词： Time-varying channels rateless coding spinal codes capacity-achieving low decoding complexity

来源：评论

学校读者我要写书评

暂无评论

A low-complexity decoding Algorithm for Coded Hierarchical Modulation in Single Frequency Networks

引用

IEEE TRANSACTIONS ON BROADCASTING 2014年第2期60卷 302-312页

作者： Hu, Zixia Jiang, Hong Li, Hongxiang Chen, Zhiyong Liu, Hui Qualcomm Inc San Jose CA 94086 USA Alcatel Lucent Bell Labs Murray Hill NJ 07974 USA Univ Louisville Dept Elect & Comp Engn Louisville KY 40292 USA Shanghai Jiao Tong Univ Inst Commun Technol Dept Elect Engn Shanghai 200240 Peoples R China

In this paper, the hierarchical modulation (HM) technique is adopted in a single frequency network (SFN) to provide both global and local information. In order to mitigate the interlayer interference and intercell interference, we develop a low-complexity successive interference cancellation (SIC) algorithm for the coded HM signals in the SFN. The proposed decoding algorithm can be applied to different soft-decision channel coding schemes (e. g., Turbo codes, LDPC codes) under various channel profiles. We analyzed the decoding complexity of the proposed algorithm, and evaluated the bit error rate performance. The simulations show that the new decoding algorithm can offer up to 0.7 dB carrier to noise ratio (C/N) gain compared with the traditional SIC approach under different channel models, while providing the comparable performance (up to 95% decoding complexity savings) with the multilayer iterative decoding approach. The performance evaluation and decoding complexity comparisons indicate that the proposed structured SIC approach offers a good performance-complexity trade-off, especially for the HM-based SFN scenarios.

关键词： Hierarchical modulation single frequency network structured SIC low decoding complexity

来源：评论

学校读者我要写书评

暂无评论

A low-complexity decoding Algorithm for Hierarchically Modulated Signals in SFN

A Low-Complexity Decoding Algorithm for Hierarchically Modul...

引用

47th Annual Conference on Information Sciences and Systems (CISS)

作者： Hu, Zixia Li, Hongxiang Chen, Zhiyong Marvell Semicond Santa Clara CA 95054 USA Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200030 Peoples R China Univ Louisville Dept Elect & Comp Engn Louisville KY 40292 USA

ISBN: (纸本)9781467352390;9781467352376

In this paper, the hierarchical modulation (HM) technique is adopted in a single frequency network (SFN) to provide both global and local information. In order to mitigate the inter-layer interference (ILI) and inter-cell interference (ICI), we develop a low-complexity successive interference cancellation (SIC) algorithm for the coded HM signals in the SFN. The proposed decoding algorithm can be applied to different soft-decision channel coding schemes (e. g., Turbo codes, LDPC codes) under various channel profiles. We analyzed the decoding complexity of the proposed algorithm, and evaluated the bit error rate (BER) performance. The simulations show that the new decoding algorithm can offer up to 0.7 dB carrier to noise ratio (C/N) gain compared with the traditional SIC approach under different channel models, while providing the comparable performance (up to 95% decoding complexity savings) with the multi-layer iterative decoding approach. The performance evaluation and decoding complexity comparisons indicate that the proposed structured SIC approach offers a good performance-complexity trade-off, especially for the HM-based SFN scenarios.

关键词： Hierarchical modulation single frequency network structured SIC low decoding complexity

来源：评论

学校读者我要写书评

暂无评论

A low complexity decoding Algorithm for Spinal Codes with Efficiently Distributed Symbols

A Low Complexity Decoding Algorithm for Spinal Codes with Ef...

引用

NASA/ESA Conference on Adaptive Hardware and Systems (AHS)

作者： Hu, Yingmeng Liu, Rongke Kaushik, Aryan Shi, Xiaoyan Thompson, John Beihang Univ Sch Elect & Informat Engn Beijing Peoples R China Univ Edinburgh Inst Digital Commun Edinburgh Midlothian Scotland

ISBN: (纸本)9781538677537

A fast decoding algorithm with an efficient distribution of symbols (EDS) for spinal codes is proposed in this paper. Firstly, the EDS decoder takes a grouping method to improve the efficiency of the distributed symbols through getting rid of the interference from the other groups. Then by taking the method of enhanced sequence decoding algorithm, the decoder has the ability to achieve dynamic search scope of nodes where it visits the flexible number of nodes in each decoding unit according to the real-time channel conditions. When compared with the Bubble algorithm, the unequal error protection (UEP) decoding algorithm, and the forward sequence decoding (FSD) algorithm, the proposed EDS algorithm obtains a better coding gain, significantly reduces the number of nodes visited, and achieves a rate (the bandwidth efficiency) closer to the capacity of the channel. Simulation results show that the rate of the proposed algorithm has a gain of 6% similar to 15% and the complexity decreases by more than 70% when compared with the Bubble algorithm for the signal-to-noise ratio (SNR) range of 0 similar to 30 dB.

关键词： wireless communications time-varying channel spinal codes low decoding complexity

来源：评论

学校读者我要写书评

暂无评论

A Simple Distributed Space-Time Coded Strategy for Two-Way Relay Channels

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2012年第4期11卷 1260-1265页

作者： Alabed, Samer J. Paredes, Javier M. Gershman, Alex B. Tech Univ Darmstadt Commun Syst Grp D-64283 Darmstadt Germany Commun Syst Grp Darmstadt Germany

For two-way wireless relay networks (TWRNs), the simultaneous bidirectional transmission has been shown to outperform other strategies using decode-and-forward (DF) distributed space-time coding (DSTC), thanks to its high spectral efficiency. However, it has a rather high relay decoding complexity and cannot use the direct link between the communicating terminals. In this letter, we propose a simple DSTC transmission scheme for TWRNs that avoids the latter disadvantages at the same symbol rate and with a performance advantage at high powers. Our strategy allows the communicating terminals to use the direct link between them to achieve a higher diversity gain. An extension of the proposed strategy to the differential case is also discussed.

关键词： Two-way wireless relay networks (TWRNs) distributed space-time coding (DSTC) differential DSTC low decoding complexity

来源：评论

学校读者我要写书评

暂无评论

A low complexity Algorithm of Dynamic Resource Allocation for Downlink Multi-Carrier NOMA Systems

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2021年第12期70卷 13418-13423页

作者： Hu, Yingmeng Liu, Rongke Bian, Hongxiu Gao, Xiangqiang Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China

This paper investigates the sub-channels and power allocation issue in the multi-carrier NOMA communication system. To maximize the sum rate of the system, we design a fast dynamic resource allocation (FDRA) algorithm. The algorithm can quickly identify the interference nodes with poor channel conditions, and reduces the search complexity of the algorithm. By jointly optimizing sub-carrier and power resource allocation, the proposed scheme can take full advantage of the channel capacity, and maximize the system performance while ensuring the quality of service (QoS) of each user. Simulation results show that when compared with the joint resource allocation (JRA) algorithm and the genetic algorithm (GA), the FDRA algorithm can achieve the best performance on the complexity and the sum rate of the system. Thus, the proposed algorithm can provide a fast and efficient resource allocation scheme for the downlink multi-carrier NOMA systems.

关键词： Resource management NOMA Heuristic algorithms complexity theory Silicon carbide Dynamic scheduling Quality of service NOMA multi-carrier technology resource allocation low decoding complexity QoS

来源：评论

学校读者我要写书评

暂无评论

Efficient coding schemes for low-rate wireless personal area networks

引用

IET COMMUNICATIONS 2016年第8期10卷 915-921页

作者： Qian, Hua Dai, Shengchen Kang, Kai Wang, Xudong Chinese Acad Sci SIMIT Shanghai Peoples R China Chinese Acad Sci Key Lab Wireless Sensor Network & Commun Shanghai Peoples R China Chinese Acad Sci SARI Shanghai Peoples R China Shanghai Res Ctr Wireless Commun Shanghai Peoples R China Shanghai Jiao Tong Univ Univ Michigan Shanghai Jiao Tong Univ Joint Inst Shanghai 200030 Peoples R China

The emerging market of Internet of things has created great demand for low-cost, low-power wireless technologies. Existing IEEE 802.15.4 standard is designed for low-rate wireless personal area networks (LR-WPANs). However, current standard does not fully utilise the benefit of the code redundancy. In this study, the authors propose new coding schemes for LR-WPANs with improved coding gain. They first propose a block code based on extended Bose-Chaudhuri-Hocquenghem (BCH) code that increases the minimum Hamming distance compared with the existing code used in LR-WPANs. The computational complexity of the encoder and decoder remains about the same. In addition, by applying the extended BCH code directly to LR-WPANs, the data rate of the system can be increased without sacrificing coding performance. They further propose a tail-biting convolutional (TBC) code with optimum generator polynomials for LR-WPANs. The proposed TBC code enjoys significant performance improvement while preserving the effective code rate as well as a low decoding complexity. Simulation results validate the effectiveness of the proposed coding schemes.

关键词： personal area networks BCH codes Internet of Things efficient coding schemes low-rate wireless personal area networks Internet of things LR-WPAN improved coding gain extended Bose-Chaudhuri-Hocquenghem code BCH code minimum Hamming distance computational complexity tail-biting convolutional code low decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Two-group decodable distributed differential space-time code for wireless relay networks based on SAST codes

引用

TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES 2017年第4期25卷 2986-2994页

作者： Abdallah, Obada Abu-Hudrouss, Ammar Minist Telecommun & Informat Technol Gaza Strip Palestine Islamic Univ Gaza Dept Elect Engn Gaza Strip Palestine

Space-time code can be implemented in wireless relay networks when all relays cooperate to generate the code at the receiver. In this case, it is called distributed space-time code. If the channel response changes very quickly, the idea of differential space-time coding is needed to overcome the difficulty of updating the channel state information at the receiver. As a result, the transmitted signal can be demodulated without any knowledge of the channel state information at the relays or the receiver. In this paper, development of new low decoding complexity distributed differential space-time codes is considered. The developed codes are designed using semiorthogonal algebraic space-time codes. They work for networks with an even number of relays and have a two-group decodable maximum likelihood receiver. The performance of the new codes is analyzed via MATLAB simulation which demonstrates that they outperform both cyclic codes and circulant codes.

关键词： Distributed differential space-time codes cyclic codes circulant codes low decoding complexity

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：