A New Reduced-Complexity Decoding Algorithm for LDPC Codes(Fundamental Theories for Communications)
スポンサーリンク
概要
- 論文の詳細を見る
This letter proposes a new algorithm for the check node update in the decoding of low-density parity-check (LDPC) codes. The proposed algorithm is based on a new approximation formula of standard sum-product algorithm (SPA) which can reduce the approximation error of min-sum algorithm (MSA) and has almost the same performance as sum-product algorithm (SPA) under both floating precision operation and fixed-point operation. Besides, the new approximation formula can be implemented in simple structures competitive with MSA.
- 一般社団法人電子情報通信学会の論文
- 2007-07-01
著者
-
Jin Jing
Univ. Electronic Sci. And Technol. Of China Chengdu Chn
-
Yang Hongwen
Wireless Communication Center Beijing University
-
Yang Hongwen
Wireless Theories And Technologies Lab Beijing University Of Posts And Telecommunications
-
SUN Guohui
Wireless Theories and Technologies Lab, Beijing University of Posts and Telecommunications
-
JIN Jing
Wireless Theories and Technologies Lab, Beijing University of Posts and Telecommunications
-
YAO Wenbin
Wireless Theories and Technologies Lab, Beijing University of Posts and Telecommunications
-
Sun Guohui
Wireless Theories And Technologies Lab Beijing University Of Posts And Telecommunications
-
Yao Wenbin
Wireless Theories And Technologies Lab Beijing University Of Posts And Telecommunications
関連論文
- Capacity of Fading Channels with Quantized Channel Side Information(Fundamental Theories for Communications)
- A New Reduced-Complexity Decoding Algorithm for LDPC Codes(Fundamental Theories for Communications)
- Multi-Antenna Spatial Multiplexing in Overlaid Wireless Networks: Transmission Capacity Analysis