.png){kind=icon}
.png){kind=icon}
Return
Sequential Decoding of Multiple Sequences for Synchronization Errors
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2024.3405322.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sequential decoding, commonly applied to substitution channels, is a sub-optimal alternative to Viterbi decoding with significantly reduced memory costs. This work describes and analyzes a sequential decoder for convolutional codes over channels prone to insertion, deletion, and substitution errors. Our decoder expands the code trellis by a new channel-state variable, called drift state, as proposed by Davey and MacKay. A suitable decoding metric on that trellis for sequential decoding is derived, generalizing the original Fano metric. The decoder is also extended to facilitate the simultaneous decoding of multiple received sequences that arise from a single transmitted sequence. Under low-noise environments, our decoding approach reduces the decoding complexity by multiple orders of magnitude compared to Viterbi's algorithm, albeit at slightly higher bit error rates. An analytical method to determine the computational cutoff rate is also suggested. This analysis is supported by numerical evaluations of bit error rates and computational complexity, compared to optimal Viterbi decoding.
Keywords:
Decoding
Measurement
Convolutional codes
Hidden Markov models
Viterbi algorithm
Vectors
Symbols
DNA storage
insertion
deletion
substitution (IDS) channel
sequential decoding
convolutional codes
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W