Next Article in Journal
Application of Information Technologies and Programming Methods of Embedded Systems for Complex Intellectual Analysis
Next Article in Special Issue
Deep Task-Based Quantization
Previous Article in Journal
Signal Fluctuations and the Information Transmission Rates in Binary Communication Channels
Previous Article in Special Issue
Examining the Causal Structures of Deep Neural Networks Using Information Theory
Article

Deep Ensemble of Weighted Viterbi Decoders for Tail-Biting Convolutional Codes

School of Electrical Engineering, Tel-Aviv University, Tel-Aviv 6997801, Israel
*
Authors to whom correspondence should be addressed.
Entropy 2021, 23(1), 93; https://doi.org/10.3390/e23010093
Received: 27 November 2020 / Revised: 3 January 2021 / Accepted: 7 January 2021 / Published: 10 January 2021
Tail-biting convolutional codes extend the classical zero-termination convolutional codes: Both encoding schemes force the equality of start and end states, but under the tail-biting each state is a valid termination. This paper proposes a machine learning approach to improve the state-of-the-art decoding of tail-biting codes, focusing on the widely employed short length regime as in the LTE standard. This standard also includes a CRC code. First, we parameterize the circular Viterbi algorithm, a baseline decoder that exploits the circular nature of the underlying trellis. An ensemble combines multiple such weighted decoders, and each decoder specializes in decoding words from a specific region of the channel words’ distribution. A region corresponds to a subset of termination states; the ensemble covers the entire states space. A non-learnable gating satisfies two goals: it filters easily decoded words and mitigates the overhead of executing multiple weighted decoders. The CRC criterion is employed to choose only a subset of experts for decoding purpose. Our method achieves FER improvement of up to 0.75 dB over the CVA in the waterfall region for multiple code lengths, adding negligible computational complexity compared to the circular Viterbi algorithm in high signal-to-noise ratios (SNRs). View Full-Text
Keywords: deep learning; error correcting codes; viterbi; machine learning; ensembles; tail-biting convolutional codes deep learning; error correcting codes; viterbi; machine learning; ensembles; tail-biting convolutional codes
Show Figures

Figure 1

MDPI and ACS Style

Raviv, T.; Schwartz, A.; Be’ery, Y. Deep Ensemble of Weighted Viterbi Decoders for Tail-Biting Convolutional Codes. Entropy 2021, 23, 93. https://doi.org/10.3390/e23010093

AMA Style

Raviv T, Schwartz A, Be’ery Y. Deep Ensemble of Weighted Viterbi Decoders for Tail-Biting Convolutional Codes. Entropy. 2021; 23(1):93. https://doi.org/10.3390/e23010093

Chicago/Turabian Style

Raviv, Tomer; Schwartz, Asaf; Be’ery, Yair. 2021. "Deep Ensemble of Weighted Viterbi Decoders for Tail-Biting Convolutional Codes" Entropy 23, no. 1: 93. https://doi.org/10.3390/e23010093

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop