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

Simple stopping criterion for min-sum iterative decoding algorithm

ELECTRONICS LETTERS 2001年第25期37卷 1530-1531页

作者： Heo, J Chung, K Chugg, KM Univ So Calif Dept Elect Engn Syst Commun Sci Inst Los Angeles CA 90089 USA

A simple stopping criterion for iterative decoding based on min-sum processing is presented. While most stopping criteria suggested in the literature are based on cross entropy (CE) and its simplification, the proposed stopping criterion is to check whether a decoded sequence is a valid codeword along the encoder trellis structure. This new stopping criterion requires less computational complexity and saves memory.

关键词： min-sum processing iterative decoding algorithm stopping criterion Codes iterative decoding valid codeword encoder trellis structure cross entropy computational complexity

来源：评论

学校读者我要写书评

暂无评论

iterative decoding algorithm for VDES Signals

Iterative Decoding Algorithm for VDES Signals

引用

作者： Haosu Zhou Bin Yue Liu Liu Huiwen Zuo Jiapeng Huang Jin Wang Shanghai Aerospace Electronic Technology Institute Beijing Aeronautical Technology Research Center

VHF data exchange system(VDES) introduces forward error correction technology, and adopts QPSK, 8PSK, 16QAM, 16APSK modulations. In this paper, an iterative decoding algorithm based on Bahl-Cocke-Jelinek-Raviv(BCJR) algorithm and factor graph is proposed for VDES signals. Performances of the proposed iterative decoding algorithm for different modulation coding schemes are presented.

关键词： VHF data exchange system(VDES) iterative decoding algorithm Soft decision Forward error correction

来源：评论

学校读者我要写书评

暂无评论

A new algorithm for "hard" iterative decoding of concatenated codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2003年第8期51卷 1229-1232页

作者： Bosco, G Montorsi, G Benedetto, S Politecn Torino Dipartimento Elettron I-10129 Turin Italy

A new hard iterative decoding algorithm to decode the serial concatenation of two block codes separated by an inter-leaver is presented. The new scheme is based on the use of erasures as a sort of extrinsic information to be exchanged between the two decoders. Extensive simulations highlight the coding gain of the new algorithm with respect to standard hard iterative decoding.

关键词： concatenated codes iterative decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

An Improvement on the Soft Reliability-Based iterative Majority-Logic decoding algorithm for LDPC Codes

An Improvement on the Soft Reliability-Based Iterative Major...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Ngatched, T. M. N. Alfa, Attahiru S. Cai, Jun Univ Manitoba Dept Elect & Comp Engn Winnipeg MB R3T 5V6 Canada

ISBN: (纸本)9781424456383

This paper presents an improvement of the reliability-based iterative majority-logic decoding algorithms for regular low-density parity-check (LDPC) codes proposed by Huang et al. We improve the computation of the extrinsic information that is used to update the reliability measure of each received bit in each iteration with some kind of reliability measures of the check-sums that are orthogonal on the considered bit. The improved algorithm achieves a significant gain over the standard one with only a modest increase in computational complexity.

关键词： LDPC codes check-sums iterative decoding iterative decoding algorithm low density parity-check codes parity check codes reliability soft reliability

来源：评论

学校读者我要写书评

暂无评论

Joint detection/decoding algorithms for non-binary low-density parity-check codes over inter-symbol interference channels

引用

IET COMMUNICATIONS 2013年第14期7卷 1522-1531页

作者： Zhao, Shancheng Lu, Zhifei Ma, Xiao Bai, Baoming Sun Yat Sen Univ Dept Elect & Commun Engn Guangzhou 510275 Guangdong Peoples R China ISN Xidian Univ State Key Lab Xian 710071 Peoples R China

This study is concerned with the application of non-binary low-density parity-check (NB-LDPC) codes to binary input inter-symbol interference channels. Two low-complexity joint detection/decoding algorithms are proposed. One is referred to as max-log-MAP/X-EMS algorithm, which is implemented by exchanging soft messages between the max-log-MAP detector and the extended min-sum (EMS) decoder. The max-log-MAP/X-EMS algorithm is applicable to general NB-LDPC codes. The other one, referred to as Viterbi/GMLGD algorithm, is designed in particular for majority-logic decodable NB-LDPC codes. The Viterbi/GMLGD algorithm works in an iterative manner by exchanging hard-decisions between the Viterbi detector and the generalised majority-logic decoder (GMLGD). As a by-product, a variant of the original EMS algorithm is proposed, which is referred to as mu-EMS algorithm. In the mu-EMS algorithm, the messages are truncated according to an adaptive threshold, resulting in a more efficient algorithm. Simulations results show that the max-log-MAP/X-EMS algorithm performs as well as the traditional iterative detection/decoding algorithm based on the BCJR algorithm and theQ-ary sum-product algorithm, but with lower complexity. The complexity can be further reduced for majority-logic decodable NB-LDPC codes by executing the Viterbi/GMLGD algorithm with a performance degradation within one dB. These algorithms provide good candidates for trade-offs between performance and complexity.

关键词： intersymbol interference iterative decoding parity check codes Viterbi decoding joint detection-decoding algorithm nonbinary low-density parity-check code intersymbol interference channel NB-LDPC code binary input intersymbol interference channel max-log-MAP X-EMS algorithm soft message max-log-MAP detector extended min-sum decoder EMS decoder Viterbi GMLGD algorithm majority-logic decoding Viterbi detector generalised majority-logic decoder i1 4-EMS algorithm adaptive threshold iterative detection algorithm iterative decoding algorithm BCJR algorithm Q-ary sumaEuro"product algorithm performance degradation

来源：评论

学校读者我要写书评

暂无评论

A Class of Generalized LDPC Codes with Fast Parallel decoding algorithms

引用

IEEE COMMUNICATIONS LETTERS 2009年第7期13卷 531-533页

作者： Wang, Xiuni Ma, Xiao Sun Yat Sen Univ Dept Elect & Commun Engn Guangzhou 510275 Peoples R China

Given the Tanner graph of a generalized low-density parity-check (GLDPC) code, the decoding complexity is mainly dominated by the decoding algorithm of subcodes. In this paper, we propose a class of GLDPC codes with fast parallel decoding algorithm. The parity-check matrices of the newly constructed subcodes are composed of several square matrices, which can be viewed as elements of a finite field. Therefore the FFT-based a posteriori probability (APP) algorithm for nonbinary codes can be applied to decode the subcodes. When compared with the trellis-based APP algorithm, the FFT based APP algorithm can be implemented in parallel and has lower complexity. Simulation results show that the proposed GLDPC codes perform well on AWGN channels.

关键词： FFT-based APP algorithm generalized low-density parity-check codes iterative decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Modified APP-Based decoding algorithm for Low-Density Parity Check Codes

Modified APP-Based Decoding Algorithm for Low-Density Parity...

引用

7th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM)

作者： Wang, Xinran Zhang, Yan Chen, Jinlei Shenzhen Grad Sch Harbin Inst Technol Dept Elect & Informat Engn Shenzhen Guangdong Peoples R China

ISBN: (纸本)9781424462520

In this paper, a modified a posteriori probability (APP) based algorithm for the decoding of low-density parity-check (LDPC) codes is proposed. The modified APP-based algorithm utilizes an additional processing in the bit nodes to improve the accuracy instead of the check nodes normalization performed in normalized APP-based algorithm. The modified APP-based algorithm yields desirable trade-off between performance and decoding complexity.

关键词： Low-density parity-check (LDPC) codes APP-based decoding iterative decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Reduced-complexity iterative decoding using a variable-size trellis structure

Reduced-complexity iterative decoding using a variable-size ...

引用

IEEE International Symposium on Information Theory

作者： Bokolamulla, D Aulin, T Chalmers Univ Technol Dept Comp Engn SE-41296 Gothenburg Sweden

ISBN: (纸本)0780382803

We propose a new reduced-complexity iterative decoding algorithm. The main concept is to approximate the a posteriori probabilities (APP) by a set of few sequences, and to reduce the size of this set with iterations. According to the numerical results on the bit error rate (BER) performance and the convergence behavior by extrinsic information transfer (EXIT) chart analysis, the algorithm could obtain a good balance between performance and complexity.

关键词： iterative decoding trellis codes error statistics probability iterative decoding algorithm aposteriori probability APP bit error rate BER extrinsic information transfer chart analysis EXIT variable-size trellis structure

来源：评论

学校读者我要写书评

暂无评论

Competitive decoders for turbo-like chaos-based systems

引用

IET COMMUNICATIONS 2012年第10期6卷 1278-1283页

作者： Wagemakers, A. Escribano, F. J. Lopez, L. Sanjuan, M. A. F. Univ Rey Juan Carlos Dept Phys Mostoles 28933 Spain Univ Alcala Dept Signal Theory & Commun Alcala De Henares 28805 Spain Univ Rey Juan Carlos Dept Telemat Syst & Comp Mostoles 28933 Spain

Recent work has shown that chaos-based communication systems can yield performances as good as their non-chaotic counterparts in additive white Gaussian noise (AWGN), and behave even better in flat-fading channels. However, much of this work relies on computer simulations and there is still a need to study in depth the implementation issues of such systems. The authors address for the first time a fixed-point arithmetic implementation of the iterative decoding algorithm for a recently proposed and successful class of parallel concatenated chaos-based coded modulations. The novel digital signal processor (DSP) results demonstrate that it is possible to implement in standard hardware competitive chaos-based communication systems.

关键词： Communication system theory competitive decoder additive white Gaussian noise turbo like chaos based systems Codes AWGN parallel concatenated chaos based coded modulation modulation coding fading channels fixed point arithmetic Codecs, coders and decoders decoding Digital signal processing chips chaotic communication digital signal processor turbo codes iterative decoding algorithm digital signal processing chips Radio links and equipment chaos based communication systems computer simulations fixed point arithmetic implementation flat fading channel

来源：评论

学校读者我要写书评

暂无评论

iterative receiver for the triple differential PSK modulation in the time-varying underwater acoustic communications

引用

IET COMMUNICATIONS 2020年第16期14卷 2813-2819页

作者： Cui, Hongyu Liu, Changxin Si, Boyu Wu, Jie Sun, Dajun Harbin Engn Univ Acoust Sci & Techol Lab Harbin 150001 Peoples R China Harbin Engn Univ Coll Underwater Acoust Engn Harbin 150001 Peoples R China Shanghai Univ Med & Hlth Sci Coll Med Instrument Shanghai 201318 Peoples R China

Due to the time-varying property of the underwater acoustic (UWA) channel, the significant Doppler spread will severely degrade the performance of direct-sequence spread-spectrum (DSSS) communications. The relative velocity variation between the transmitter and the receiver will cause both the phase rotation and the magnitude loss of correlation peak, during the long transmission of the DSSS packet. To solve this problem, the authors propose a novel transceiver design for the UWA DSSS communications. At the transmitter, the triple differential phase shift keying (D3PSK) modulation is adopted to overcome the phase rotation, whereas the phase noise will be amplified resulting in the signal-to-noise ratio (SNR) loss. At the receiver, the improved bit-interleaved coded modulation with iterative decoding algorithm for D3PSK is used to recover the SNR loss, in which the D3PSK demodulator is treated as the convolutional decoder, and the linear prediction is adopted to track the channel variation. Furthermore, an adaptive selection of local reference signal is also applied to recover the correlation loss. Theoretical simulation shows that the proposed transceiver can effectively mitigate the performance loss caused by the motion acceleration, and the performance gain is significant over the conventional.

关键词： iterative decoding differential phase shift keying transceivers underwater acoustic communication spread spectrum communication interleaved codes modulation coding signal detection demodulation wireless channels time-varying channels phase noise convolutional codes channel coding iterative receiver triple differential PSK modulation time-varying underwater acoustic communications time-varying property underwater acoustic channel Doppler spread direct-sequence spread-spectrum communications relative velocity variation transmitter phase rotation magnitude loss DSSS packet novel transceiver design UWA DSSS communications phase noise signal-to-noise ratio loss iterative decoding algorithm SNR loss channel variation local reference signal performance gain UWA channel receiver triple differential phase shift keying modulation D3PSK modulation improved bit-interleaved coded modulation D3PSK demodulator convolutional decoder linear prediction adaptive selection correlation loss recovery performance loss mitigation motion acceleration

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：