Low-Complexity Hybrid Algorithm for Decoding Convolutional Codes

The Viterbi algorithm is one of the most commonly used methods for decoding convolutional codes, which outputs a maximum-likelihood codeword for the input sequence. However, the complexity of the Viterbi algorithm is high when the constraint length is large. To address this issue, we propose a hybri...

Full description

Saved in:
Bibliographic Details
Published in:2022 IEEE 8th International Conference on Computer and Communications (ICCC) pp. 2477 - 2482
Main Authors: Fu, Ziyun, Liu, Haiyang
Format: Conference Proceeding
Language:English
Published: IEEE 09.12.2022
Subjects:
Complexity theory
Convolution
Convolutional codes
Degradation
hybrid algorithm
Iterative decoding
normalized min-sum algorithm
Simulation
SST Viterbi algorithm
Viterbi algorithm
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The Viterbi algorithm is one of the most commonly used methods for decoding convolutional codes, which outputs a maximum-likelihood codeword for the input sequence. However, the complexity of the Viterbi algorithm is high when the constraint length is large. To address this issue, we propose a hybrid algorithm that contains at most two stages for decoding convolutional codes in this paper. In the first stage, the normalized min-sum algorithm (NMSA) with a small number of iterations is applied. If the output of the NMSA is not a codeword, the scarce-state-transition (SST) Viterbi algorithm is invoked for the second stage of decoding. We provide a method for constructing the input vector of the SST Viterbi algorithm, from which a truncating method is further presented for complexity reduction. Simulation results on two rate-l/2 convolutional codes show that the proposed hybrid algorithm has little performance degradation compared with the Viterbi algorithm. Meanwhile, the complexity of the proposed hybrid algorithm is reduced, especially in the high signal-to-noise ratio region.
AbstractList The Viterbi algorithm is one of the most commonly used methods for decoding convolutional codes, which outputs a maximum-likelihood codeword for the input sequence. However, the complexity of the Viterbi algorithm is high when the constraint length is large. To address this issue, we propose a hybrid algorithm that contains at most two stages for decoding convolutional codes in this paper. In the first stage, the normalized min-sum algorithm (NMSA) with a small number of iterations is applied. If the output of the NMSA is not a codeword, the scarce-state-transition (SST) Viterbi algorithm is invoked for the second stage of decoding. We provide a method for constructing the input vector of the SST Viterbi algorithm, from which a truncating method is further presented for complexity reduction. Simulation results on two rate-l/2 convolutional codes show that the proposed hybrid algorithm has little performance degradation compared with the Viterbi algorithm. Meanwhile, the complexity of the proposed hybrid algorithm is reduced, especially in the high signal-to-noise ratio region.
Author Fu, Ziyun
Liu, Haiyang
Author_xml – sequence: 1
  givenname: Ziyun
  surname: Fu
  fullname: Fu, Ziyun
  email: 1120190701@bit.edu.cn
  organization: XUTELI School, Beijing Institute of Technology,Beijing,China
– sequence: 2
  givenname: Haiyang
  surname: Liu
  fullname: Liu, Haiyang
  email: liuhaiyang@ime.ac.cn
  organization: Institute of Microelectronics, Chinese Academy of Sciences,Beijing,China
BookMark eNo1j8tKw0AYRkfQha2-gWBeIHHuk9lZxksLATftuszlnzqQZMo0XvL2FtTNdzibA98CXY55BITuCW4IwfphY4wRklHeUExpQzCWQtH2Ai2IlIILLIi6Ro9d_qpNHo49fKdprtazKylUq_6QS5rehyrmUj2BzyGNh8rk8TP3H1PKo-3PFuB0g66i7U9w-8cl2r08b8267t5eN2bV1YkQPdWcRKsxCPDc6eiUC9RZ7eG8TKhApaKBBeWj1MoHLoJ1gopW2Za1AXPFlujut5sAYH8sabBl3v-_Yj_-3kgV
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICCC56324.2022.10065728
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1665450517
9781665450515
EndPage 2482
ExternalDocumentID 10065728
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i119t-41fa90e5ec4b9fb7bd2ba9ce2ba357d2672d3d7cf697cd45dab52587a838d0473
IEDL.DBID RIE
IngestDate Thu Jan 18 11:14:58 EST 2024
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i119t-41fa90e5ec4b9fb7bd2ba9ce2ba357d2672d3d7cf697cd45dab52587a838d0473
PageCount 6
ParticipantIDs ieee_primary_10065728
PublicationCentury 2000
PublicationDate 2022-Dec.-9
PublicationDateYYYYMMDD 2022-12-09
PublicationDate_xml – month: 12
  year: 2022
  text: 2022-Dec.-9
  day: 09
PublicationDecade 2020
PublicationTitle 2022 IEEE 8th International Conference on Computer and Communications (ICCC)
PublicationTitleAbbrev ICCC
PublicationYear 2022
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.8231223
Snippet The Viterbi algorithm is one of the most commonly used methods for decoding convolutional codes, which outputs a maximum-likelihood codeword for the input...
SourceID ieee
SourceType Publisher
StartPage 2477
SubjectTerms Complexity theory
Convolution
Convolutional codes
Degradation
hybrid algorithm
Iterative decoding
normalized min-sum algorithm
Simulation
SST Viterbi algorithm
Viterbi algorithm
Title Low-Complexity Hybrid Algorithm for Decoding Convolutional Codes
URI https://ieeexplore.ieee.org/document/10065728
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELZoxcAEiCDeysDqEjuJL95AgapIVdUBULfKjwtUKg1q06L-e-w0BTEwsFi25Yds3-nu7PvOhFyDMqC5lbTARNBEOHNHZ1JTRwpMZ1xpqK8GXvowGGSjkRw2YPUaC4OItfMZdny2fsu3pVn6qzLH4U5gAs9apAUgNmCtxmeLRfLmMc_z1Icfd2Yf551t61__ptRio7v_zwkPSPADwAuH36LlkOzg7Ijc9stP6vnXx7Cs1mFv7dFW4d30tXQW_tt76PTP8N6Zk75P6EZaNWSlpq5kcRGQ5-7DU96jzQcIdMKYrGjCCiUjTNEkWhYatOVaSYMujVOwXAC3sQVTCAnGJqlVOuVpBiqLMxslEB-T9qyc4QkJuTTaYFQ4hUkmsbVSoLZOOylYLFAwe0oCv_zxxybGxXi78rM_6s_Jnt_k2rFDXpB2NV_iJdk1q2qymF_VJ_MFkV-RYA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagIMEEiCLeZGB1SRwnjjdQoGpFqDoU1K3y4wKVSoLatKj_HttNQQwMLJZt-SHbd7o7-74zQtdMKCaJ5jgHGmMaG3NHJlxiQwqBTIiQzF0NvGSs10uGQ96vweoOCwMAzvkMWjbr3vJ1qeb2qsxwuBGYjCSbaCuilPgruFbttRX4_KabpmlkA5Abw4-Q1rr9r59TnOBo7_1zyn3U_IHgef1v4XKANqA4RLdZ-YktB9soltXS6ywt3sq7m7yWxsZ_e_eMBurdG4PS9vHMSIuasMTElDTMmui5_TBIO7j-AgGPg4BXmAa54D5EoKjkuWRSEym4ApOGEdMkZkSHmqk85kxpGmkhIxIlTCRhon3KwiPUKMoCjpFHuJIK_NyoTJyGWvMYpDb6SR6EMcSBPkFNu_zRxyrKxWi98tM_6q_QTmfwlI2ybu_xDO3aDXduHvwcNarpHC7QtlpU49n00p3SF1FXlKc
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2022+IEEE+8th+International+Conference+on+Computer+and+Communications+%28ICCC%29&rft.atitle=Low-Complexity+Hybrid+Algorithm+for+Decoding+Convolutional+Codes&rft.au=Fu%2C+Ziyun&rft.au=Liu%2C+Haiyang&rft.date=2022-12-09&rft.pub=IEEE&rft.spage=2477&rft.epage=2482&rft_id=info:doi/10.1109%2FICCC56324.2022.10065728&rft.externalDocID=10065728