A Low-Complexity Decoder With Non-Uniform Quantization for Recursive BMST Codes

Recursive block Markov superposition transmission (rBMST) can be used to construct high-performance spatially coupled codes. When used in power-limited scenarios, low-complexity quantized decoders are required for the rBMST codes. In this letter, we introduce an efficient decoder for rBMST codes by...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 25; no. 8; pp. 2463 - 2467
Main Authors: Ai, Shengbo, Zhao, Shancheng
Format: Journal Article
Language:English
Published: New York IEEE 01.08.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:1089-7798, 1558-2558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Recursive block Markov superposition transmission (rBMST) can be used to construct high-performance spatially coupled codes. When used in power-limited scenarios, low-complexity quantized decoders are required for the rBMST codes. In this letter, we introduce an efficient decoder for rBMST codes by incorporating non-uniform quantization (NUQ) into the threshold attenuated min-sum algorithm (TAMSA). The resulting decoder is referred to as the NUQ-TAMSA. We use the hierarchical dynamic quantization algorithm to design the non-uniform quantizer. To show the effectiveness of the NUQ-TAMSA, we carry out comprehensive comparisons. Our results show that, for low-resolution quantization, performance gains as large as 0.3 dB can be obtained with the NUQ-TAMSA. Numerical results also show that, for a wide range of coding rates, 5-bits non-uniform quantization is sufficient for NUQ-TAMSA to approach the performances of the floating-point based TAMSA.
AbstractList Recursive block Markov superposition transmission (rBMST) can be used to construct high-performance spatially coupled codes. When used in power-limited scenarios, low-complexity quantized decoders are required for the rBMST codes. In this letter, we introduce an efficient decoder for rBMST codes by incorporating non-uniform quantization (NUQ) into the threshold attenuated min-sum algorithm (TAMSA). The resulting decoder is referred to as the NUQ-TAMSA. We use the hierarchical dynamic quantization algorithm to design the non-uniform quantizer. To show the effectiveness of the NUQ-TAMSA, we carry out comprehensive comparisons. Our results show that, for low-resolution quantization, performance gains as large as 0.3 dB can be obtained with the NUQ-TAMSA. Numerical results also show that, for a wide range of coding rates, 5-bits non-uniform quantization is sufficient for NUQ-TAMSA to approach the performances of the floating-point based TAMSA.
Author Zhao, Shancheng
Ai, Shengbo
Author_xml – sequence: 1
  givenname: Shengbo
  orcidid: 0000-0002-3634-3465
  surname: Ai
  fullname: Ai, Shengbo
  organization: College of Information Science and Technology, Jinan University, Guangzhou, China
– sequence: 2
  givenname: Shancheng
  orcidid: 0000-0002-0544-8416
  surname: Zhao
  fullname: Zhao, Shancheng
  email: shanchengzhao@jnu.edu.cn
  organization: College of Information Science and Technology, Jinan University, Guangzhou, China
BookMark eNp9kEtPwzAMgCMEEtvgD8AlEucOJ2nW5DjKU9qYgE0cozRNRaatGWkLjF9P9xAHDlxsy_Jny18XHZa-tAidEegTAvJylE7G4z4FSvoMEpHIwQHqEM5FRNtw2NYgZJQkUhyjblXNAUBQTjpoMsQj_xmlfrla2C9Xr_G1NT63Ab-6-g0_-jKala7wYYmfGl3W7lvXzpe47eBna5pQuQ-Lr8YvU5y2WHWCjgq9qOzpPvfQ7PZmmt5Ho8ndQzocRYZKXkcFLwowJBMs57nkmsbMaApGGAOMyIwIaWIdJ4KBMDIhWWZIIWKW24xlhOashy52e1fBvze2qtXcN6FsTyrKB0BYLADaKbGbMsFXVbCFMq7ePlAH7RaKgNroU1t9aqNP7fW1KP2DroJb6rD-HzrfQc5a-wvImCYEBuwHk1J86Q
CODEN ICLEF6
CitedBy_id crossref_primary_10_1016_j_jiixd_2023_05_001
Cites_doi 10.1109/TCOMM.2020.3005454
10.1109/TIT.2015.2422296
10.1109/TCOMM.2005.852852
10.1109/TCOMM.2009.12.080493
10.1109/TCOMM.2020.2969902
10.1109/ISIT.2019.8849308
10.1109/ICCW.2017.7962783
10.1109/ICEIEC.2016.7589702
10.1109/TCOMM.2019.2944159
10.1109/VETECF.2004.1400446
10.1109/TCOMM.2014.2356458
10.1109/JSAC.2016.2603708
10.1109/ACCESS.2018.2797694
10.1109/JSAC.2015.2504277
10.1109/TCOMM.2018.2796607
10.1109/26.768759
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
DOI 10.1109/LCOMM.2021.3078796
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Xplore
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
DatabaseTitleList Technology Research Database

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2558
EndPage 2467
ExternalDocumentID 10_1109_LCOMM_2021_3078796
9427106
Genre orig-research
GrantInformation_xml – fundername: NSF of China
  grantid: 61871201
  funderid: 10.13039/501100001809
– fundername: Basic Research Program of Guangzhou Municipal Science and Technology Bureau
  grantid: 202102020872
– fundername: Guangdong Provincial NSF
  grantid: 2021A1515011906; 2017A030313371
GroupedDBID -~X
0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
AZLTO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
H~9
IES
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
RIA
RIE
RNS
TN5
VH1
AAYXX
CITATION
7SP
8FD
L7M
ID FETCH-LOGICAL-c295t-f5ff0c1b83d5d95a243ca20c8cc0319b189c4a478308c971bbc1f843deb3b12d3
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000683993100005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1089-7798
IngestDate Mon Jun 30 10:23:24 EDT 2025
Sat Nov 29 03:56:06 EST 2025
Tue Nov 18 21:59:18 EST 2025
Wed Aug 27 02:39:25 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 8
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c295t-f5ff0c1b83d5d95a243ca20c8cc0319b189c4a478308c971bbc1f843deb3b12d3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-0544-8416
0000-0002-3634-3465
PQID 2560134800
PQPubID 85419
PageCount 5
ParticipantIDs proquest_journals_2560134800
crossref_citationtrail_10_1109_LCOMM_2021_3078796
ieee_primary_9427106
crossref_primary_10_1109_LCOMM_2021_3078796
PublicationCentury 2000
PublicationDate 2021-08-01
PublicationDateYYYYMMDD 2021-08-01
PublicationDate_xml – month: 08
  year: 2021
  text: 2021-08-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE communications letters
PublicationTitleAbbrev LCOMM
PublicationYear 2021
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref12
wang (ref13) 2020
ref15
ref14
ref11
ref10
ref2
ref1
ref17
ref16
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref1
  doi: 10.1109/TCOMM.2020.3005454
– ident: ref8
  doi: 10.1109/TIT.2015.2422296
– ident: ref2
  doi: 10.1109/TCOMM.2005.852852
– ident: ref4
  doi: 10.1109/TCOMM.2009.12.080493
– ident: ref7
  doi: 10.1109/TCOMM.2020.2969902
– ident: ref6
  doi: 10.1109/ISIT.2019.8849308
– ident: ref5
  doi: 10.1109/ICCW.2017.7962783
– ident: ref12
  doi: 10.1109/ICEIEC.2016.7589702
– year: 2020
  ident: ref13
  article-title: A reconstruction-computation-quantization (RCQ) approach to node operations in LDPC decoding
  publication-title: arXiv 2005 07259
– ident: ref17
  doi: 10.1109/TCOMM.2019.2944159
– ident: ref11
  doi: 10.1109/VETECF.2004.1400446
– ident: ref3
  doi: 10.1109/TCOMM.2014.2356458
– ident: ref15
  doi: 10.1109/JSAC.2016.2603708
– ident: ref16
  doi: 10.1109/ACCESS.2018.2797694
– ident: ref10
  doi: 10.1109/JSAC.2015.2504277
– ident: ref9
  doi: 10.1109/TCOMM.2018.2796607
– ident: ref14
  doi: 10.1109/26.768759
SSID ssj0008251
Score 2.3380582
Snippet Recursive block Markov superposition transmission (rBMST) can be used to construct high-performance spatially coupled codes. When used in power-limited...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 2463
SubjectTerms Algorithms
Complexity
Complexity theory
Decoders
Decoding
Encoding
Floating point arithmetic
Heuristic algorithms
Iterative decoding
Low complexity decoding
Measurement
min-sum algorithm
Mutual information
non-uniform quantization
Quantization (signal)
recursive block Markov superposition transmission (BMST) codes
Title A Low-Complexity Decoder With Non-Uniform Quantization for Recursive BMST Codes
URI https://ieeexplore.ieee.org/document/9427106
https://www.proquest.com/docview/2560134800
Volume 25
WOSCitedRecordID wos000683993100005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Xplore
  customDbUrl:
  eissn: 1558-2558
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0008251
  issn: 1089-7798
  databaseCode: RIE
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwEB2VigMc2AqiUJAP3CBtnKWxj6VQcejCUkRvUWI7ohJqUZuC-HtmkrSqBELiFkW2Fc3YnjfxvGeAC49rnLqaWxiqHDpmJMlbbVvSaC5shQgk15ntBv2-GI3kfQmuVlwYY0xWfGbq9Jid5eupWtCvsob0HAyIzQ3YCIJmztVa7bpEwcyL6SUiRimWBBlbNrrtQa-HqaDD6zijRUAC_WtBKLtV5cdWnMWXzu7_vmwPdgocyVq54_ehZCYHsL2mLliBQYt1p58WrXhSvUy_2I0hBvuMvYzTV9afTixEnARa2cMCDVwwMhm-YY_0G54q29l172nI2thtfgjPndth-84q7k-wlCP91Er8JLEVj4WrfS39yPFcFTm2EkoRdynmQiov8gLh2kLJgMex4onwXI0Jdswd7R5BeTKdmGNguEq5wUEppHoIsqSOIyF0pHyEi4HWVeBLg4aqEBenOy7ewizJsGWYOSEkJ4SFE6pwuerznktr_Nm6QmZftSwsXoXa0m9hsfrmYZZmuh5i4ZPfe53CFo2dF_LVoJzOFuYMNtVHOp7PzrOJ9Q1Mx8jP
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFD7MC6gP3sV5zYNv2q1pU5s86lQUu3mb6FtpkwwHssnWKf57z2m7ISiCb6U0bTknyflOcr4vAAeCG-y6hjsYqjzaZiTJW-M6yhouXY0IpNCZjcJWSz4_q9sKHE24MNbavPjM1ugy38s3fT2ipbK6Eh4GxOMpmAmE8NyCrTWZd4mEWZTTK8SMSo4pMq6qR42bZhOTQY_XsE_LkCT6v4Wh_FyVH5NxHmEulv73b8uwWCJJdlK4fgUqtrcKC9_0Bdfg5oRF_Q-HxjzpXmaf7MwSh33AnrrZC2v1ew5iToKt7G6EJi45mQzvsHtaiKfadnbafGizBjYbrsPjxXm7cemUJyg42lNB5nSCTsfVPJW-CYwKEk_4OvFcLbUm9lLKpdIiEaH0XalVyNNU844UvsEUO-We8Tdgutfv2U1gOE65xZdSUBUIs5RJEylNogMEjKExVeBjg8a6lBenUy5e4zzNcFWcOyEmJ8SlE6pwOGnzVohr_Pn0Gpl98mRp8SrsjP0Wl-NvGOeJpi8QDW_93mof5i7bzSiOrlrX2zBP3ynK-nZgOhuM7C7M6vesOxzs5Z3sC-lizBY
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%3Ajournal&rft.genre=article&rft.atitle=A+Low-Complexity+Decoder+With+Non-Uniform+Quantization+for+Recursive+BMST+Codes&rft.jtitle=IEEE+communications+letters&rft.au=Ai%2C+Shengbo&rft.au=Zhao%2C+Shancheng&rft.date=2021-08-01&rft.pub=IEEE&rft.issn=1089-7798&rft.volume=25&rft.issue=8&rft.spage=2463&rft.epage=2467&rft_id=info:doi/10.1109%2FLCOMM.2021.3078796&rft.externalDocID=9427106
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1089-7798&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1089-7798&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1089-7798&client=summon