A new Chien search method for shortened Reed-Solomon （RS） code is proposed, based on this, a versatile RS decoder for correcting both errors and erasures is designed. Compared with the traditional RS decoder, the we...A new Chien search method for shortened Reed-Solomon （RS） code is proposed, based on this, a versatile RS decoder for correcting both errors and erasures is designed. Compared with the traditional RS decoder, the weighted coefficient of the Chien search method is calculated sequentially through the three pipelined stages of the decoder. And therefore, the computation of the errata locator polynomial and errata evaluator polynomial needs to be modified. The versatile RS decoder with minimum distance 21 has been synthesized in the Xilinx Virtex-Ⅱ series field programmable gate array （FPGA） xe2v1000-5 and is used by coneatenated coding system for satellite communication. Results show that the maximum data processing rate can be up to 1.3 Gbit/s.展开更多
Low-density parity-check(LDPC)codes are widely used due to their significant errorcorrection capability and linear decoding complexity.However,it is not sufficient for LDPC codes to satisfy the ultra low bit error rat...Low-density parity-check(LDPC)codes are widely used due to their significant errorcorrection capability and linear decoding complexity.However,it is not sufficient for LDPC codes to satisfy the ultra low bit error rate(BER)requirement of next-generation ultra-high-speed communications due to the error floor phenomenon.According to the residual error characteristics of LDPC codes,we consider using the high rate Reed-Solomon(RS)codes as the outer codes to construct LDPC-RS product codes to eliminate the error floor and propose the hybrid error-erasure-correction decoding algorithm for the outer code to exploit erasure-correction capability effectively.Furthermore,the overall performance of product codes is improved using iteration between outer and inner codes.Simulation results validate that BER of the product code with the proposed hybrid algorithm is lower than that of the product code with no erasure correction.Compared with other product codes using LDPC codes,the proposed LDPC-RS product code with the same code rate has much better performance and smaller rate loss attributed to the maximum distance separable(MDS)property and significant erasure-correction capability of RS codes.展开更多
For communication systems with heavy burst noise, an optimal Forward Error Correction(FEC) scheme is expected to have a large burst error correction capability while simultaneously owning moderate random error correct...For communication systems with heavy burst noise, an optimal Forward Error Correction(FEC) scheme is expected to have a large burst error correction capability while simultaneously owning moderate random error correction capability. This letter presents a new FEC scheme based on multiple-symbol interleaved Reed-Solomon codes and an associated two-pass decoding algorithm. It is shown that the proposed multi-symbol interleaved Reed-Solomon scheme can achieve nearly twice as much as the burst error correction capability of conventional single-symbol interleaved Reed-Solomon codes with the same code length and code rate.展开更多
In this paper,a novel dual-metric,the maximum and minimum Squared Euclidean Distance Increment (SEDI) brought by changing the hard decision symbol,is introduced to measure the reli-ability of the received M-ary Phase ...In this paper,a novel dual-metric,the maximum and minimum Squared Euclidean Distance Increment (SEDI) brought by changing the hard decision symbol,is introduced to measure the reli-ability of the received M-ary Phase Shift Keying (MPSK) symbols over a Rayleigh fading channel. Based on the dual-metric,a Chase-type soft decoding algorithm,which is called erased-Chase algorithm,is developed for Reed-Solomon (RS) coded MPSK schemes. The proposed algorithm treats the unre-liable symbols with small maximum SEDI as erasures,and tests the non-erased unreliable symbols with small minimum SEDI as the Chase-2 algorithm does. By introducing optimality test into the decoding procedure,much more reduction in the decoding complexity can be achieved. Simulation results of the RS(63,42,22)-coded 8-PSK scheme over a Rayleigh fading channel show that the proposed algorithm provides a very efficient tradeoff between the decoding complexity and the error performance. Finally,an adaptive scheme for the number of erasures is introduced into the decoding algorithm.展开更多
A novel adaptively iterative list decoding(ILD) approach using for Reed-Solomon(RS) codes was investigated. The proposed scheme is exploited to reduce the complexity of RS Chase algorithm(CA) via an iterative decoding...A novel adaptively iterative list decoding(ILD) approach using for Reed-Solomon(RS) codes was investigated. The proposed scheme is exploited to reduce the complexity of RS Chase algorithm(CA) via an iterative decoding attempt mode. In each decoding attempt process, a test pattern is generated by flipping the bits of the least reliable positions(LRPs) within the received hard-decision(HD) vector. The ILD algorithm continues until a test pattern is successfully decoded by the underlying Berlekamp-Massey algorithm(BMA) of RS codes. Flipping within the same bits, the ILD algorithm provides the same test pattern set as the conventional RS CA, thus there is no degradation in error-rate performance. Without decoding all test patterns, the ILD algorithm can simplify the decoding complexity by its early termination. Simulation results show that the average complexity of the ILD algorithm is much lower than that of the conventional RS CA(and is similar to that of BMA decoding) at high signal-to-noise ratio(SNR) region with no less to the RS CA decoding error-rate performance.展开更多
To improve error-correcting performance, an iterative concatenated soft decoding algorithm for Reed-Solomon （RS） codes is presented in this article. This algorithm brings both complexity as well as advantages in per...To improve error-correcting performance, an iterative concatenated soft decoding algorithm for Reed-Solomon （RS） codes is presented in this article. This algorithm brings both complexity as well as advantages in performance over presently popular sot~ decoding algorithms. The proposed algorithm consists of two powerful soft decoding techniques, adaptive belief propagation （ABP） and box and match algorithm （BMA）, which are serially concatenated by the accumulated log-likelihood ratio （ALLR）. Simulation results show that, compared with ABP and ABP-BMA algorithms, the proposed algorithm can bring more decoding gains and a better tradeoff between the decoding performance and complexity.展开更多
基金Sponsored by the Ministerial Level Advanced Research Foundation (20304)
文摘A new Chien search method for shortened Reed-Solomon （RS） code is proposed, based on this, a versatile RS decoder for correcting both errors and erasures is designed. Compared with the traditional RS decoder, the weighted coefficient of the Chien search method is calculated sequentially through the three pipelined stages of the decoder. And therefore, the computation of the errata locator polynomial and errata evaluator polynomial needs to be modified. The versatile RS decoder with minimum distance 21 has been synthesized in the Xilinx Virtex-Ⅱ series field programmable gate array （FPGA） xe2v1000-5 and is used by coneatenated coding system for satellite communication. Results show that the maximum data processing rate can be up to 1.3 Gbit/s.
基金This work was supported in part by National Natural Science Foundation of China(No.61671324)the Director’s Funding from Pilot National Laboratory for Marine Science and Technology(Qingdao)(QNLM201712).
文摘Low-density parity-check(LDPC)codes are widely used due to their significant errorcorrection capability and linear decoding complexity.However,it is not sufficient for LDPC codes to satisfy the ultra low bit error rate(BER)requirement of next-generation ultra-high-speed communications due to the error floor phenomenon.According to the residual error characteristics of LDPC codes,we consider using the high rate Reed-Solomon(RS)codes as the outer codes to construct LDPC-RS product codes to eliminate the error floor and propose the hybrid error-erasure-correction decoding algorithm for the outer code to exploit erasure-correction capability effectively.Furthermore,the overall performance of product codes is improved using iteration between outer and inner codes.Simulation results validate that BER of the product code with the proposed hybrid algorithm is lower than that of the product code with no erasure correction.Compared with other product codes using LDPC codes,the proposed LDPC-RS product code with the same code rate has much better performance and smaller rate loss attributed to the maximum distance separable(MDS)property and significant erasure-correction capability of RS codes.
文摘For communication systems with heavy burst noise, an optimal Forward Error Correction(FEC) scheme is expected to have a large burst error correction capability while simultaneously owning moderate random error correction capability. This letter presents a new FEC scheme based on multiple-symbol interleaved Reed-Solomon codes and an associated two-pass decoding algorithm. It is shown that the proposed multi-symbol interleaved Reed-Solomon scheme can achieve nearly twice as much as the burst error correction capability of conventional single-symbol interleaved Reed-Solomon codes with the same code length and code rate.
基金the National Natural Science Foundation of China (No.60272057).
文摘In this paper,a novel dual-metric,the maximum and minimum Squared Euclidean Distance Increment (SEDI) brought by changing the hard decision symbol,is introduced to measure the reli-ability of the received M-ary Phase Shift Keying (MPSK) symbols over a Rayleigh fading channel. Based on the dual-metric,a Chase-type soft decoding algorithm,which is called erased-Chase algorithm,is developed for Reed-Solomon (RS) coded MPSK schemes. The proposed algorithm treats the unre-liable symbols with small maximum SEDI as erasures,and tests the non-erased unreliable symbols with small minimum SEDI as the Chase-2 algorithm does. By introducing optimality test into the decoding procedure,much more reduction in the decoding complexity can be achieved. Simulation results of the RS(63,42,22)-coded 8-PSK scheme over a Rayleigh fading channel show that the proposed algorithm provides a very efficient tradeoff between the decoding complexity and the error performance. Finally,an adaptive scheme for the number of erasures is introduced into the decoding algorithm.
基金supported by the National Natural Science Foundation of China (61671080,61601047)
文摘A novel adaptively iterative list decoding(ILD) approach using for Reed-Solomon(RS) codes was investigated. The proposed scheme is exploited to reduce the complexity of RS Chase algorithm(CA) via an iterative decoding attempt mode. In each decoding attempt process, a test pattern is generated by flipping the bits of the least reliable positions(LRPs) within the received hard-decision(HD) vector. The ILD algorithm continues until a test pattern is successfully decoded by the underlying Berlekamp-Massey algorithm(BMA) of RS codes. Flipping within the same bits, the ILD algorithm provides the same test pattern set as the conventional RS CA, thus there is no degradation in error-rate performance. Without decoding all test patterns, the ILD algorithm can simplify the decoding complexity by its early termination. Simulation results show that the average complexity of the ILD algorithm is much lower than that of the conventional RS CA(and is similar to that of BMA decoding) at high signal-to-noise ratio(SNR) region with no less to the RS CA decoding error-rate performance.
基金supported by the National Natural Science Foundation of China(60472104)
文摘To improve error-correcting performance, an iterative concatenated soft decoding algorithm for Reed-Solomon （RS） codes is presented in this article. This algorithm brings both complexity as well as advantages in performance over presently popular sot~ decoding algorithms. The proposed algorithm consists of two powerful soft decoding techniques, adaptive belief propagation （ABP） and box and match algorithm （BMA）, which are serially concatenated by the accumulated log-likelihood ratio （ALLR）. Simulation results show that, compared with ABP and ABP-BMA algorithms, the proposed algorithm can bring more decoding gains and a better tradeoff between the decoding performance and complexity.
