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

joint iterative decoding for pragmatic irregular LDPC-coded multi-relay cooperations

INTERNATIONAL JOURNAL OF ELECTRONICS 2011年第10期98卷 1383-1397页

作者： Yang, Fengfan Chen, Jingwen Zong, Peng Zhang, Shunwai Zhang, Qiuxia Nanjing Univ Aeronaut & Astronaut Coll Informat Sci & Technol Nanjing 210016 Jiangsu Provinc Peoples R China Nanjing Univ Aeronaut & Astronaut Coll Astronaut Nanjing 210016 Jiangsu Provinc Peoples R China

In this article, a new kind of pragmatic simple-encoding irregular systematic low-density parity-check (LDPC) code for multi-relay coded cooperation is designed, where the introduced joint iterative decoding is performed in the destination based on a proposed joint Tanner graph for all the constituent LDPC codes used by the source and relays in multi-relay cooperation. The theoretical analysis and numerical results show that the coded cooperations outperform the coded noncooperation under the same code rate, and also achieve a good trade-off between the performance and the decoding complexity associated with the number of relays. This performance gain can be credited to the additional exchange of extrinsic information from the LDPC codes used by the source and the relays in both ideal and non-ideal cooperations.

关键词： coded multi-relay cooperation low-density parity-check code joint Tanner graph joint iterative decoding

来源：评论

学校读者我要写书评

暂无评论

joint iterative decoding of LDPC codes for channels with memory and erasure noise

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2008年第2期26卷 320-337页

作者： Pfister, Henry D. Siegel, Paul H. Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

This paper investigates the joint iterative decoding of low-density parity-check (LDPC) codes and channels with memory. Sequences of irregular LDPC codes are presented that achieve, under joint iterative decoding, the symmetric information rate of a class of channels with memory and erasure noise. This gives proof, for the first time, that joint iterative decoding can be information rate lossless with respect to maximum-likelihood decoding. These results build on previous capacity-achieving code constructions for the binary erasure channel. A two state intersymbol-interference channel with erasure noise, known as the dicode erasure channel, is used as a concrete example throughout the paper.

关键词： joint iterative decoding intersymbol interference low-density parity-check codes dicode erasure channel symmetric information rate capacity-achieving codes

来源：评论

学校读者我要写书评

暂无评论

joint iterative decoding for LDPC-coded multi-relay cooperation with receive multi-antenna in the destination

引用

IET COMMUNICATIONS 2013年第1期7卷 1-12页

作者： Tang, Lei Yang, Fengfan Zhang, Shunwai Xu, Hongjun Nanjing Univ Aeronaut & Astronaut Coll Elect & Informat Engn Nanjing 210016 Peoples R China Univ KwaZulu Natal Dept Elect Elect & Comp Engn Durban South Africa

This study proposes an low density party check (LDPC)-coded multi-relay cooperation with receive multi-antenna in the destination over a Rayleigh-fading channel, where maximal ratio combining and belief propagation algorithm (BP)-based joint iterative decoding based on the introduced multi-layer Tanner graph are effectively designed to detect and decode the corrupted received sequence at the destination. The overall code rate from the destination is derived mathematically in relation to all the constituent LDPC codes employed by source and multiple relays. Theoretical analysis and numerical simulation show that the proposed approach can well combine diversity and coding gains, which consequently result in significant advantage over the conventional cooperations under the same conditions.

关键词： iterative decoding numerical analysis parity check codes Rayleigh channels receiving antennas joint iterative decoding LDPC-coded multirelay cooperation receive multiantenna Rayleigh-fading channel BP-based joint iterative decoding multilayer Tanner graph multiple relays numerical simulation

来源：评论

学校读者我要写书评

暂无评论

joint iterative decoding for Network-Coding-Based Multisource LDPC-Coded Cooperative MIMO

引用

Transactions of Nanjing University of Aeronautics and Astronautics 2014年第4期31卷 420-430页

作者：张顺外仰枫帆唐蕾 College of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics College of Telecommunication and Information Engineering Nanjing University of Posts and Telecommunications

A network-coding-based multisource LDPC-coded cooperative MIMO scheme is proposed,where multiple sources transmit their messages to the destination with the assistance from a single *** relay cooperates with multiple sources simultaneously via *** avoids the issues of imperfect frequency/timing synchronization and large transmission delay which may be introduced by frequency-division multiple access(FDMA)/code-division multiple access(CDMA)and time-division multiple access(TDMA)*** proposed joint″Min-Sum″iterative decoding is effectively carried out in the *** a decoding algorithm agrees with the introduced equivalent joint Tanner graph which can be used to fully characterize LDPC codes employed by the sources and *** analysis and numerical simulation show that the proposed scheme with joint iterative decoding can achieve significant cooperation diversity ***,for the relay,compared with the cascade scheme,the proposed scheme has much lower complexity of LDPC-encoding and is easier to be implemented in the hardware with similar bit error rate(BER)performance.

关键词： cooperative MIMO network coding LDPC codes equivalent joint Tanner graph joint iterative decoding

来源：评论

学校读者我要写书评

暂无评论

joint iterative decoding FOR SIMPLE-ENCODING SYSTEMATIC IRREGULAR-LDPC-BASED CODED COOPERATION IN NON-IDEAL RELAY CHANNEL

引用

Journal of Electronics(China) 2010年第3期27卷 305-315页

作者： Chen Jingwen Yang Fengfan Luo Lin Tho Le-Ngoc College of Information Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing 210016 China College of Information Science and Engineering Southeast University Nanjing 210096 China Department of Electrical and Computer Engineering McGill University Montreal H3A2A7 Quebec Canada

In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destination which is in accordance with the corresponding joint Tanner graph characterizing two different component LDPC codes used by the source and relay in ideal and non-ideal relay cooperations. The theoretical analysis and simulations show that the coded cooperation scheme obviously outperforms the coded non-cooperation one under the same code rate and decoding complex. The significant performance improvement can be virtually credited to the additional mutual exchange of the extrinsic information resulted by the LDPC code employed by the source and its counterpart used by the relay in both ideal and non-ideal cooperations.

关键词： Cooperative communication Low-density parity-check code Relay channel joint Tanner graph joint iterative decoding

来源：评论

学校读者我要写书评

暂无评论

Low-Density Lattice Coded Relaying With joint iterative decoding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2015年第12期63卷 4824-4837页

作者： Chen, Bin Jayakody, Dushantha N. K. Flanagan, Mark F. Univ Coll Dublin Sch Elect Elect & Commun Engn Dublin Ireland Univ Tartu Inst Comp Sci EE-51409 Tartu Estonia

Low-density lattice codes (LDLCs) are known for their high decoding efficiency and near-capacity performance on point-to-point Gaussian channels. In this paper, we present a distributed LDLC-based cooperative relaying scheme for the multiple-access relay channel (MARC). The relay node decodes LDLC-coded packets from two sources and forwards a network-coded combination to the destination. At the destination, a joint iterative decoding structure is designed to exploit the diversity gain as well as coding gain. For the LDLC-based network coding operation at the relay, we consider two alternative methods which offer a tradeoff between implementation complexity and performance, called superposition LDLC (S-LDLC) and modulo-addition LDLC (MA-LDLC). Soft symbol relaying is considered as an alternative to hard decision relaying which is capable of reducing the effect of error propagation at the relay. Simulation results show that the proposed scheme can provide greater diversity gain and up to 6.2 dB coding gain when compared with noncooperative LDLC coding and uncoded network-coded transmission. The proposed scheme also achieves 2.5 dB gain over network-turbo-coded cooperation, for the same code rate and overall transmitted power. Also, soft symbol relaying is shown to provide approximately 2 dB gain over hard decision relaying when the source-relay link suffers from deep fading.

关键词： Low-density lattice codes (LDLCs) joint iterative decoding coded cooperation

来源：评论

学校读者我要写书评

暂无评论

Bayesian and non-Bayesian methods for iterative joint decoding and detection in the presence of phase noise

Bayesian and non-Bayesian methods for iterative joint decodi...

引用

IEEE International Symposium on Information Theory

作者： Colavolpe, G Barbieri, A Caire, G Bonneau, N Univ Parma Dipartimento Ingn Informaz I-43100 Parma Italy

ISBN: (纸本)0780382803

This paper proposes new algorithms for joint iterative decoding and parameter estimation in Bayesian and nonBayesian method. The low-density parity-check (LDPC) codes in the presence of phase noise is focused in this paper. The nonBayesian algorithm for an unknown phase channel is based on the application of the expectation-maximization (EM) algorithm. The proposed Bayesian algorithms are obtained as an application of the sum-product algorithm to the factor graph. Comparing the performance of the considered algorithms in the case of LDPC code, the EM-KL (EM-Karhunen-Loeve) algorithm performs better than EM-SW (sliding window) algorithm.

关键词： iterative decoding phase noise parameter estimation parity check codes optimisation graph theory Karhunen-Loeve transforms Bayesian algorithm nonBayesian algorithm joint iterative decoding low-density parity-check code LDPC phase channel expectation-maximization Karhunen-Loeve algorithm EM algorithm sum-product algorithm factor graph

来源：评论

学校读者我要写书评

暂无评论

iterative decoding of space-time differentially coded unitary matrix modulation

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2002年第10期50卷 2385-2395页

作者： Steiner, A Peleg, M Shamai, S Technion Israel Inst Technol Dept Elect Engn Haifa Israel

Noncoherent communication over the Rayleigh flat fading channel with multiple transmit and receive antennas is investigated. Codes achieving bit error rate (BER) lower than 10(-4) at bit energy over the noise spectral density ratio (E-b/N-O) of 0.8 to 2.8 dB from the capacity limit were found with coding rates of 0.5 to 2.25 bits per channel use. The codes are serial concatenation of a turbo code and a unitary matrix differential modulation code. The receiver is based on a high-performance joint iterative decoding of the turbo code and the modulation code. Information-theoretic arguments are harnessed to form guidelines for code design and to evaluate performance of the iterative decoder.

关键词： capacity limit differential modulation joint iterative decoding multiantenna space-time turbo-code unitary matrix

来源：评论

学校读者我要写书评

暂无评论

An APP demodulator for iterative decoding of turbo coded differential space-time modulation with unitary group codes

An APP demodulator for iterative decoding of turbo coded dif...

引用

IEEE Region 10 Conference on Analog and Digital Techniques in Electrical Engineering

作者： Sangwongngam, P Vanichchanunt, P Segkhoonthod, S Nakpeerayuth, S Wuttisittikulkij, L Chulalongkorn Univ Dept Elect Engn Bangkok Thailand

ISBN: (纸本)0780385608

A modified technique for joint iterative decoding of serial concatenation of turbo code and unitary space-time group code is proposed and evaluated under temporally correlated fading channels. This approach further takes advantage of the system by exploiting the unitary space-time group code which possesses trellis structure of differential modulation. The extrinsic information of modulation symbols is calculated from this trellis structure by using a detector called an a posteriori probability (APP) demodulator. The simulation results show that our modified method is superior to the conventional one at the expense of more complexity.

关键词： iterative decoding concatenated codes turbo codes space-time codes group codes correlation methods fading channels modulation coding probability demodulation joint iterative decoding serial concatenation turbo code unitary space-time group code fading channel correlation differential modulation a posteriori probability APP demodulator

来源：评论

学校读者我要写书评

暂无评论

High Performance Short Polar Codes: A Concatenation Scheme Using Spinal Codes as the Outer Code

引用

IEEE ACCESS 2018年 6卷 70644-70654页

作者： Xu, Xiao Wu, Shaohua Dong, Dan Jiao, Jian Zhang, Qinyu Harbin Inst Technol Shenzhen Commun Engn Res Ctr Shenzhen 518055 Guangdong Peoples R China

An innovative scheme for concatenating the polar codes with the recently proposed spinal codes is presented in this paper. The primary objective is to improve the performance of the polar codes in the finite-length regime. One effective used way is to concatenate the polar codes with short outer codes. Essentially, the short outer codes that have as high performance as possible is required for concatenation. To this end, the newly invented spinal codes are used as the outer codes, which are characterized by its great error correcting capability even when the message length is short. First, the proposed codes, named spinal-polar, is implemented through an interleaved concatenation scheme. A joint iterative decoding algorithm is proposed accordingly, and the decoding complexity of the algorithm is also analyzed. Second, in order to reduce the decoding complexity of the full concatenation while maintaining the BER performance, the partial concatenation scheme is presented. Finally, we propose a rate allocation algorithm to further improve the BER performance of the designed concatenated codes. Extensive simulations results indicate that the proposed spinal-polar codes have significant performance improvement over the stand-alone polar codes, and the other improvement strategies mentioned earlier have also been proved to be effective.

关键词： Polar codes interleaved concatenation spinal codes joint iterative decoding rate allocation partial concatenation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：