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.展开更多
The concatenated codes are widely used in current communication systems,such as satellite communication systems and WiMAX system.The objective of this study was to present a low complexity iterative soft decoding algo...The concatenated codes are widely used in current communication systems,such as satellite communication systems and WiMAX system.The objective of this study was to present a low complexity iterative soft decoding algorithm for concatenated codes.The concatenation was between a Reed-Solomon(RS)code and recursive systematic convolutional(RSC)code.The reduction in computational complexity was achieved by simplifying the Chase-2 decoder for RS codes with limited usage of test patterns.The processing of soft information between inner and outer decoders was also discussed.Simulation results showed that the proposed algorithm could achieve a good trade-off between complexity and performance.展开更多
基金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 High-Tech Research and Development Program of China(2006AA01Z263)the Research Fund of National Mobile Communications Research Laboratory,Southeast University(2008A10)
摘要The concatenated codes are widely used in current communication systems,such as satellite communication systems and WiMAX system.The objective of this study was to present a low complexity iterative soft decoding algorithm for concatenated codes.The concatenation was between a Reed-Solomon(RS)code and recursive systematic convolutional(RSC)code.The reduction in computational complexity was achieved by simplifying the Chase-2 decoder for RS codes with limited usage of test patterns.The processing of soft information between inner and outer decoders was also discussed.Simulation results showed that the proposed algorithm could achieve a good trade-off between complexity and performance.