Bounds for finite block-length codes

Tomlinson, M.; Wade, Graham; Eetvelt, P. Van; Ambroze, Marcel

doi:10.1049/ip-com:20020315

Search citation statements

Order By: Relevance

Paper Sections

Select...

Simulation Results1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2006

2007

Publication Types

Select...

Other2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…L and σ p , the FERs of the decoder are monitored in a SNR region from 1dB to 4.5dB. The best overall FER performance is found by LDPC(192, figure 3, in which comparisons are made for the corresponding results in IEEE 802.16e and the sphere-packing bound, which is calculated according to [16] . In the simulation, the maximum iteration number of LDPC It can be observed in figure 4 that the average iterations decrease as the SNR increases.…”

Section: Simulation Resultsmentioning

confidence: 99%

A Perturbation Method for Decoding LDPC Concatenated with CRC

Xiao

Lu²,

Lin³

et al. 2007

2007 IEEE Wireless Communications and Networking Conference

View full text Add to dashboard Cite

In this paper, a novel decoding algorithm using perturbation techniques for LDPC concatenated with CRC (LDPC-CRC) is proposed. The CRC is used to check the residual error of the BP algorithm, while a new parameter is introduced to LDPC decoding to describe the reliability of each bit in the iterative decoding algorithm. Upon an error is detected, redecoding process with perturbation method will be aroused. Simulation results show that this method lowers the error floor for codeword length of several hundred bits effectively. Index Terms− LDPC, BP, reliability, Chaos, error floor

show abstract

Section: Simulation Resultsmentioning

confidence: 99%