.png){kind=icon}
.png){kind=icon}
Return
Low Latency Coding: Convolutional Codes vs. LDPC Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2012.042712.110189.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper compares the performance of convolutional codes to that of LDPC block codes with identical decoding latencies. The decoding algorithms considered are the Viterbi algorithm and stack sequential decoding for convolutional codes and iterative message passing for LDPC codes. It is shown that, at very low latencies, convolutional codes with Viterbi decoding offer the best performance, whereas for high latencies LDPC codes dominate - and sequential decoding of convolutional codes offers the best performance over a range of intermediate latency values. The crossover latencies - i.e., the latency values at which the best code/decoding selection changes - are identified for a variety of code rates (1/2, 2/3, 3/4, and 5/6) and target bit/frame error rates. For sequential decoding, both blockwise and continuous resynchronization procedures are used to allow the decoder to recover the correct path. The results indicate that sequential decoding substantially extends (beyond what is possible with Viterbi decoding) the range of latency values over which convolutional codes prove advantageous compared to LDPC block codes.
Keywords:
Channel coding
block codes
convolutional codes
parity check codes
iterative decoding
delay effects
added delay
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W