DocumentCode :
1657850
Title :
On importance sampling for iteratively decoded linear block codes
Author :
Wang, Nuo ; Srinivasan, Rajan
Author_Institution :
Dept. of Electr. Eng. & Inf. Sci., Univ. of Sci. & Technol. of China, Anhui, China
Volume :
1
fYear :
2005
Firstpage :
18
Abstract :
We introduce an importance sampling (IS) scheme for fast performance evaluation of the linear block codes with message-passing decoding. This novel scheme overcomes the existing difficulties in IS to some extent when code length is large and requires codebook information. Experiments show very high IS gains for iteratively decoded linear block codes such as single parity-check (SPC) codes and block product codes, as well as low density parity-check (LDPC) codes. We also provide a scheme based on our IS method to find the minimum Hamming distance and pick up those codewords which are very useful when calculating asymptotic performance.
Keywords :
Hamming codes; block codes; importance sampling; iterative decoding; linear codes; message passing; parity check codes; product codes; LDPC codes; SPC codes; asymptotic performance; block product codes; importance sampling; iterative decoding; linear block codes; low density parity-check codes; message-passing decoding; minimum Hamming distance; performance evaluation; single parity-check codes; Bit error rate; Block codes; Computational modeling; Error analysis; Hamming distance; Information science; Iterative decoding; Monte Carlo methods; Parity check codes; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, Circuits and Systems, 2005. Proceedings. 2005 International Conference on
Print_ISBN :
0-7803-9015-6
Type :
conf
DOI :
10.1109/ICCCAS.2005.1493353
Filename :
1493353
Link To Document :
بازگشت