A Low Complexity Sequential Decoding Algorithm for Rateless Spinal Codes

A forward stack decoding (FSD) algorithm for rateless spinal codes is proposed in this letter. This decoding algorithm divides the decoding tree of the spinal code into several layers, and then searches the decoding paths in each single layer. Compared with the bubble decoder, which was initially de...

Full description

Saved in:
Bibliographic Details
Published inIEEE communications letters Vol. 19; no. 7; pp. 1105 - 1108
Main Authors Yang, Weiqiang, Li, Ying, Yu, Xiaopu, Li, Juan
Format Journal Article
LanguageEnglish
Published IEEE 01.07.2015
Subjects
Algorithm design and analysis
Complexity theory
Encoding
forward stack decoding algorithm
Maximum likelihood decoding
Measurement
Rateless spinal codes
sequential decoding
Signal to noise ratio
forward stack decoding algorithm
sequential decoding
Rateless spinal codes
Online AccessGet full text

Cover

Abstract A forward stack decoding (FSD) algorithm for rateless spinal codes is proposed in this letter. This decoding algorithm divides the decoding tree of the spinal code into several layers, and then searches the decoding paths in each single layer. Compared with the bubble decoder, which was initially designed for spinal codes, the proposed FSD algorithm can decrease the complexity significantly without sacrificing the rate performance. We also illustrate that the complexity of the FSD algorithm decreases with the increase of the signal-to-noise ratio (SNR). Simulation shows that the complexity of the FSD algorithm is only 15.37% of that of the bubble decoder when SNR is 20 dB.
AbstractList A forward stack decoding (FSD) algorithm for rateless spinal codes is proposed in this letter. This decoding algorithm divides the decoding tree of the spinal code into several layers, and then searches the decoding paths in each single layer. Compared with the bubble decoder, which was initially designed for spinal codes, the proposed FSD algorithm can decrease the complexity significantly without sacrificing the rate performance. We also illustrate that the complexity of the FSD algorithm decreases with the increase of the signal-to-noise ratio (SNR). Simulation shows that the complexity of the FSD algorithm is only 15.37% of that of the bubble decoder when SNR is 20 dB.
Author Ying Li
Juan Li
Weiqiang Yang
Xiaopu Yu
Author_xml – sequence: 1
  givenname: Weiqiang
  surname: Yang
  fullname: Yang, Weiqiang
– sequence: 2
  givenname: Ying
  surname: Li
  fullname: Li, Ying
– sequence: 3
  givenname: Xiaopu
  surname: Yu
  fullname: Yu, Xiaopu
– sequence: 4
  givenname: Juan
  surname: Li
  fullname: Li, Juan
BookMark eNo9kNFOgzAUhhszE7fpC-hNXwBsC6XtJUHdTFiWOL0mLRxmDVCkGN3by9xicvKfc3G-_-JboFnnOkDolpKQUqLu82y72YSMUB6yOJIkYRdoTjmXAZtiNt1EqkAIJa_QwvsPQohknM7ROsW5-8aZa_sGfux4wDv4_IJutLrBD1C6ynZ7nDZ7N9jxvcW1G_CLHqEB7_Gut930lrkK_DW6rHXj4ea8l-jt6fE1Wwf5dvWcpXlQskSMQZ3EghswTGhVSi4MxDGhhMtpuI4rWVMjVWIixVRsZFUqIEmlFWdQGtAsWiJ26i0H5_0AddEPttXDoaCkOLoo_lwURxfF2cUE3Z0gCwD_gKA0moxEv1CzXMg
CODEN ICLEF6
CitedBy_id crossref_primary_10_1109_ACCESS_2019_2946167
crossref_primary_10_1109_TVT_2019_2947028
crossref_primary_10_1109_OJCOMS_2024_3390000
crossref_primary_10_1109_ACCESS_2018_2879827
crossref_primary_10_1109_TWC_2021_3091719
crossref_primary_10_1049_iet_com_2016_1401
crossref_primary_10_1109_TVT_2019_2901495
crossref_primary_10_23919_JSEE_2022_000084
crossref_primary_10_1049_iet_com_2019_0907
Cites_doi 10.1145/2070562.2070568
10.1109/TIT.1963.1057827
10.1145/2342356.2342363
10.1109/TIT.2006.874390
10.1109/SFCS.2002.1181950
10.1109/TIT.1967.1054010
10.1109/TIT.1972.1054750
10.1017/CBO9780511813603
10.1147/rd.136.0675
ContentType Journal Article
DBID 97E
RIA
RIE
AAYXX
CITATION
DOI 10.1109/LCOMM.2015.2438062
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005-present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library Online
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library Online
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2558
EndPage 1108
ExternalDocumentID 10_1109_LCOMM_2015_2438062
7113798
Genre orig-research
GrantInformation_xml – fundername: 973 Program
  grantid: 2012CB316100
– fundername: NSFC
  grantid: 61301177
GroupedDBID -~X
0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AASAJ
AAYOK
ABQJQ
ABVLG
ACGFO
ACIWK
AENEX
AETIX
AI.
AIBXA
AKJIK
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
RIG
RNS
TN5
VH1
XFK
AAYXX
CITATION
ID FETCH-LOGICAL-c267t-f6475beb27a9c857be44010580585a4d8f1b896b39294b8dc9e06da952ecbea23
IEDL.DBID RIE
ISSN 1089-7798
IngestDate Fri Aug 23 00:24:51 EDT 2024
Wed Jun 26 19:29:08 EDT 2024
IsPeerReviewed true
IsScholarly true
Issue 7
Keywords forward stack decoding algorithm
sequential decoding
Rateless spinal codes
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c267t-f6475beb27a9c857be44010580585a4d8f1b896b39294b8dc9e06da952ecbea23
PageCount 4
ParticipantIDs crossref_primary_10_1109_LCOMM_2015_2438062
ieee_primary_7113798
PublicationCentury 2000
PublicationDate 2015-July
2015-7-00
PublicationDateYYYYMMDD 2015-07-01
PublicationDate_xml – month: 07
  year: 2015
  text: 2015-July
PublicationDecade 2010
PublicationTitle IEEE communications letters
PublicationTitleAbbrev COML
PublicationYear 2015
Publisher IEEE
Publisher_xml – name: IEEE
References lin (ref13) 2004
ref12
ref14
balakrishnan (ref2) 2012
ref11
elias (ref6) 0
ref10
ref1
ref7
ref9
ref4
ref3
elias (ref5) 0; 4
zigangirov (ref8) 1966; 2
References_xml – ident: ref1
  doi: 10.1145/2070562.2070568
– ident: ref11
  doi: 10.1109/TIT.1963.1057827
– ident: ref7
  doi: 10.1145/2342356.2342363
– ident: ref4
  doi: 10.1109/TIT.2006.874390
– volume: 2
  start-page: 13
  year: 1966
  ident: ref8
  article-title: Some sequential decoding procedures
  publication-title: Probl Peredachi Inf
  contributor:
    fullname: zigangirov
– ident: ref3
  doi: 10.1109/SFCS.2002.1181950
– volume: 4
  start-page: 37
  year: 0
  ident: ref5
  article-title: Coding for noisy channels
  publication-title: IRE Conv Rec
  contributor:
    fullname: elias
– ident: ref10
  doi: 10.1109/TIT.1967.1054010
– year: 2004
  ident: ref13
  publication-title: Error Control Coding Fundamentals and Applications
  contributor:
    fullname: lin
– ident: ref14
  doi: 10.1109/TIT.1972.1054750
– ident: ref12
  doi: 10.1017/CBO9780511813603
– ident: ref9
  doi: 10.1147/rd.136.0675
– year: 2012
  ident: ref2
  article-title: De-randomizing shannon: The design and analysis of a capacity-achieving rateless code
  contributor:
    fullname: balakrishnan
– start-page: 61
  year: 0
  ident: ref6
  article-title: Coding for two noisy channels
  publication-title: Proc 3rd London Symp Inf Theory
  contributor:
    fullname: elias
SSID ssj0008251
Score 2.327353
Snippet A forward stack decoding (FSD) algorithm for rateless spinal codes is proposed in this letter. This decoding algorithm divides the decoding tree of the spinal...
SourceID crossref
ieee
SourceType Aggregation Database
Publisher
StartPage 1105
SubjectTerms Algorithm design and analysis
Complexity theory
Encoding
forward stack decoding algorithm
Maximum likelihood decoding
Measurement
Rateless spinal codes
sequential decoding
Signal to noise ratio
Title A Low Complexity Sequential Decoding Algorithm for Rateless Spinal Codes
URI https://ieeexplore.ieee.org/document/7113798
Volume 19
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LS8NAEF5qT3rwVcX6Yg_eNGmz2ezjWKqlSKtgLfQWsputirUpNUX01zu7SUsVD0IOIWRgmdnMfJP9ZgahCwYYPlGCehrcn0eJUZ7UXHsQqQCdQwQSxrF871h3SG9H0aiCrla1MMYYRz4zvr11Z_lpphf2V1mDB0HIpdhAG1zKolZr5XVtCWZBppeAGKVYFsg0ZaPXvu_3LYsr8oltsM7IjyC0NlXFBZXODuovl1NwSV79Ra58_fWrU-N_17uLtkt0iVvFdthDFTPdR1trPQdrqNvCvewDWz9ge2Hmn3jg2NTwpU_wNSSjNpjh1uQpm7_kz28YQC1-AEA6AZeIBzM7RAuEU_N-gIadm8d21yvHKXiaMJ57Y0Z5pCCT5onUIuLKUGrnYwq4ooSmYhwoIZmyiIkqkWppmixNZESMViYh4SGqTrOpOUI4kgFpMpCngaQ6DRKqxiZMWciVIsKEdXS51G88K7pmxC7baMrYWSO21ohLa9RRzepu9WaptuO_H5-gTStcUGZPUTWfL8wZAINcnbsd8Q3SU7Ow
link.rule.ids 315,783,787,799,27936,27937,55086
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8JAEJ4gHtSDLzTicw_etNjHdrt7JChBLZgIJNya7nZRIwLBEqO_3tkWCBoPJj1smu5mM7Od-ab9ZgbgnCGGjyWnlkLzZ1FXS0uoQFnoqRCdowfiOmP5tlijS-96fq8Al4tcGK11Rj7TFTPM_uUnIzU1n8quAsfxAsFXYBVxNWd5ttbC7pokzJxOLxAzCj5PkbHFVVh7aDYNj8uvuKbEOnN_uKGlviqZW6lvQXO-oZxN8lqZprKivn7Vavzvjrdhc4YvSTU_EDtQ0MNd2FiqOliCRpWEow9iLIGphpl-knbGp8Z3fUCuMRw17oxUB0-jyUv6_EYQ1pJHhKQDNIqkPTZttHByot_3oFu_6dQa1qyhgqVcFqRWn9HAlxhLB7FQ3A-kptR0yOR4-TFNeN-RXDBpMBOVPFFC2yyJhe9qJXXsevtQHI6G-gCILxzXZjifOoKqxImp7GsvYV4gpcu1V4aLuXyjcV43I8riDVtEmTYio41opo0ylIzsFk_OxHb49-0zWGt0mmEU3rbuj2DdLJQTaI-hmE6m-gRhQipPs9PxDWgOtvs
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+Sequential+Decoding+Algorithm+for+Rateless+Spinal+Codes&rft.jtitle=IEEE+communications+letters&rft.au=Yang%2C+Weiqiang&rft.au=Li%2C+Ying&rft.au=Yu%2C+Xiaopu&rft.au=Li%2C+Juan&rft.date=2015-07-01&rft.issn=1089-7798&rft.volume=19&rft.issue=7&rft.spage=1105&rft.epage=1108&rft_id=info:doi/10.1109%2FLCOMM.2015.2438062&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_LCOMM_2015_2438062
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