Soft decoding method for systematic raptor codes

Raptor codes are a class of rateless codes that were originally designed for binary erasure channels. To enhance their performance, multiple soft iterative loops can be employed in the decoder. In this study, the authors propose a method to construct modified Tanner graphs for systematic raptor code...

Full description

Saved in:
Bibliographic Details
Published in:IET communications Vol. 9; no. 16; pp. 1933 - 1940
Main Authors: Zhang, Meixiang, Kim, Sooyoung, Chang, Jin Yeong, Kim, Won-Yong
Format: Journal Article
Language:English
Published: The Institution of Engineering and Technology 05.11.2015
Subjects:
ISSN:1751-8628, 1751-8636
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Raptor codes are a class of rateless codes that were originally designed for binary erasure channels. To enhance their performance, multiple soft iterative loops can be employed in the decoder. In this study, the authors propose a method to construct modified Tanner graphs for systematic raptor codes in order to increase the efficiency of soft decoding. A modified Tanner graph is drawn in terms of bit and check nodes for each component code, instead of encoding and information nodes, as in conventional Tanner graphs, for its component Luby transform codes. This modified Tanner graph enables the use of a more simplified soft iterative decoding algorithm and provides improved decoding performance compared with the conventional method. In addition, they propose an efficient joint iterative soft decoding method with a parallel process to speed up the iterative decoding. The simulation results in this study reveal that the modified Tanner graph works better than the conventional Tanner graph for joint iterative decoding, and that the proposed parallel decoding method can contribute to further enhance the performance as well as the decoding speed by reducing the average number of iterations.
AbstractList Raptor codes are a class of rateless codes that were originally designed for binary erasure channels. To enhance their performance, multiple soft iterative loops can be employed in the decoder. In this study, the authors propose a method to construct modified Tanner graphs for systematic raptor codes in order to increase the efficiency of soft decoding. A modified Tanner graph is drawn in terms of bit and check nodes for each component code, instead of encoding and information nodes, as in conventional Tanner graphs, for its component Luby transform codes. This modified Tanner graph enables the use of a more simplified soft iterative decoding algorithm and provides improved decoding performance compared with the conventional method. In addition, they propose an efficient joint iterative soft decoding method with a parallel process to speed up the iterative decoding. The simulation results in this study reveal that the modified Tanner graph works better than the conventional Tanner graph for joint iterative decoding, and that the proposed parallel decoding method can contribute to further enhance the performance as well as the decoding speed by reducing the average number of iterations.
Author Kim, Sooyoung
Zhang, Meixiang
Kim, Won-Yong
Chang, Jin Yeong
Author_xml – sequence: 1
  givenname: Meixiang
  surname: Zhang
  fullname: Zhang, Meixiang
  organization: 1Div. of Electronics Engineering, IT Convergence Research Center, Chonbuk National University, Jeonju, Republic of Korea
– sequence: 2
  givenname: Sooyoung
  surname: Kim
  fullname: Kim, Sooyoung
  email: sookim@jbnu.ac.kr
  organization: 1Div. of Electronics Engineering, IT Convergence Research Center, Chonbuk National University, Jeonju, Republic of Korea
– sequence: 3
  givenname: Jin Yeong
  surname: Chang
  fullname: Chang, Jin Yeong
  organization: 2Comesta, Inc., Daejon, Republic of Korea
– sequence: 4
  givenname: Won-Yong
  surname: Kim
  fullname: Kim, Won-Yong
  organization: 2Comesta, Inc., Daejon, Republic of Korea
BookMark eNqFkEFLwzAYQINMcJv-AG896qEzaZq08aZj08HGDm7nkLVftaNtapIh-_emVERE5ikhvJfv443QoNENIHRN8ITgWNyV4MJM15MIEzbBBOMzNCQJI2HKKR9836P0Ao2s3WPMGI_jIcIvunBBDpnOy-Y1qMG96TwotAns0TqolSuzwKjW-RfPgL1E54WqLFx9nWO0nc820-dwuX5aTB-WYRZjwsNdAowlOeccA2UppdEuTyEqhMiLmKWQEsVjEmOVM8EhLyjPKBcgVOQBQYGO0U3_b2v0-wGsk3VpM6gq1YA-WElSnGLBGSMeTXo0M9paA4XMSucX140zqqwkwbJrJH0j6RvJrpHsGnmT_DJbU9bKHE86973zUVZw_F-Q09U2epxjEjPu5bCXO2yvD6bxDU8Ou_2DX8w2crpe_ZjR-oKfsoibJg
CitedBy_id crossref_primary_10_1007_s11276_018_1674_7
crossref_primary_10_1049_iet_com_2018_0064
crossref_primary_10_1007_s11042_016_3529_5
crossref_primary_10_1007_s00779_016_0964_2
crossref_primary_10_3390_a12080151
Cites_doi 10.1109/SIPS.2007.4387519
10.1109/LCOMM.2013.011113.122283
10.1109/ITW2.2006.323758
10.1109/ISIT.2004.1365075
10.1109/ISCE.2014.6884279
10.1109/TIT.2006.874390
10.1109/ISCE.2013.6570211
10.1109/26.957394
10.1109/LCOM.2007.348295
10.1109/AFRCON.2011.6072000
10.1002/sat.787
10.1109/APCC.2012.6388260
10.1109/ISIT.2007.4557262
10.1109/Swe-CTW.2012.6376281
10.1109/WCNC.2013.6555334
10.1109/CCECE.2012.6335051
10.1109/VETECF.2007.248
ContentType Journal Article
Copyright The Institution of Engineering and Technology
2021 The Institution of Engineering and Technology
Copyright_xml – notice: The Institution of Engineering and Technology
– notice: 2021 The Institution of Engineering and Technology
DBID AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1049/iet-com.2015.0100
DatabaseName CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Technology Research Database

CrossRef

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1751-8636
EndPage 1940
ExternalDocumentID 10_1049_iet_com_2015_0100
CMU2BF01456
Genre article
GrantInformation_xml – fundername: National Research Foundation of Korea
  grantid: NRF-2014R1A1A2055489
– fundername: Ministry of Science, ICT and Future Planning
  grantid: NIPA-2013-H0502-13-1090
– fundername: Basic Science Research Program
– fundername: National IT Industry Promotion Agency
  funderid: NIPA‐2013‐H0502‐13‐1090
– fundername: National Research Foundation of Korea
  funderid: NRF‐2014R1A1A2055489
– fundername: Ministry of Science, ICT & Future Planning, Korea
GroupedDBID 0R
24P
29I
4IJ
5GY
6IK
8VB
AAJGR
ABPTK
ACGFS
ACIWK
AENEX
ALMA_UNASSIGNED_HOLDINGS
BFFAM
CS3
DU5
ESX
HZ
IFIPE
IPLJI
JAVBF
LAI
LOTEE
LXI
M43
MS
NADUK
NXXTH
O9-
OCL
QWB
RIE
RNS
RUI
U5U
UNMZH
UNR
ZL0
ZZ
.DC
0R~
0ZK
1OC
2QL
4.4
6OB
8FE
8FG
96U
AAHHS
AAHJG
ABJCF
ABQXS
ACCFJ
ACCMX
ACESK
ACGFO
ACXQS
ADEYR
AEEZP
AEGXH
AEQDE
AFAZI
AFKRA
AIAGR
AIWBW
AJBDE
ALUQN
ARAPS
AVUZU
BENPR
BGLVJ
CCPQU
EBS
EJD
F8P
GOZPB
GROUPED_DOAJ
GRPMH
HCIFZ
HZ~
IAO
ITC
K1G
L6V
M7S
MCNEO
MS~
OK1
P62
PTHSS
ROL
S0W
~ZZ
AAMMB
AAYXX
AEFGJ
AFFHD
AGXDD
AIDQK
AIDYY
CITATION
IDLOA
PHGZM
PHGZT
PQGLB
WIN
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c4016-b7e557d6660e358332bd8e2f99df458e81a64140ad596edf36c369e9a29df93e3
IEDL.DBID 24P
ISICitedReferencesCount 12
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000364208600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1751-8628
IngestDate Fri Sep 05 10:53:59 EDT 2025
Wed Oct 29 21:23:30 EDT 2025
Tue Nov 18 22:33:50 EST 2025
Wed Jan 22 16:30:39 EST 2025
Thu May 09 18:34:31 EDT 2019
Tue Jan 05 21:46:06 EST 2021
IsPeerReviewed true
IsScholarly true
Issue 16
Keywords channel coding
binary erasure channels
rateless codes
decoder
decoding performance
decoding
iterative decoding
soft decoding method
iterative soft decoding method
systematic Raptor codes
modified Tanner graph
transform coding
soft iterative decoding algorithm
Luby transform codes
parallel decoding method
Language English
License http://onlinelibrary.wiley.com/termsAndConditions#vor
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c4016-b7e557d6660e358332bd8e2f99df458e81a64140ad596edf36c369e9a29df93e3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
PQID 1808096551
PQPubID 23500
PageCount 8
ParticipantIDs iet_journals_10_1049_iet_com_2015_0100
proquest_miscellaneous_1808096551
crossref_citationtrail_10_1049_iet_com_2015_0100
wiley_primary_10_1049_iet_com_2015_0100_CMU2BF01456
crossref_primary_10_1049_iet_com_2015_0100
ProviderPackageCode RUI
PublicationCentury 2000
PublicationDate 2015-11-05
PublicationDateYYYYMMDD 2015-11-05
PublicationDate_xml – month: 11
  year: 2015
  text: 2015-11-05
  day: 05
PublicationDecade 2010
PublicationTitle IET communications
PublicationYear 2015
Publisher The Institution of Engineering and Technology
Publisher_xml – name: The Institution of Engineering and Technology
References Kwon, O.C.; Go, Y.; Park, Y.; Song, H. (C15) 2014; PP
Ten Brink, S. (C23) 2001; 49
Hussian, I.; Xiao, M.; Rasmussen, L. (C17) 2013; 17
Shokrollahi, A. (C2) 2006; 52
Eroz, M.; Sun, F.; Lee, L. (C19) 2004; 22
Hu, K.; Castura, J.; Mao, Y. (C20) 2007; 11
2004; 22
2006; 52
2013; 17
2012
2011
2010
2007
2006
2005
2015
2004
2001; 49
2014
2002
2013
2007; 11
2014; PP
e_1_2_7_6_1
e_1_2_7_5_1
e_1_2_7_4_1
e_1_2_7_3_1
Kwon O.C. (e_1_2_7_16_1) 2014
e_1_2_7_9_1
e_1_2_7_8_1
e_1_2_7_7_1
e_1_2_7_19_1
e_1_2_7_18_1
e_1_2_7_17_1
e_1_2_7_2_1
e_1_2_7_15_1
e_1_2_7_14_1
e_1_2_7_25_1
e_1_2_7_13_1
e_1_2_7_24_1
e_1_2_7_12_1
e_1_2_7_23_1
e_1_2_7_11_1
e_1_2_7_22_1
e_1_2_7_10_1
e_1_2_7_21_1
e_1_2_7_20_1
References_xml – volume: 52
  start-page: 2551
  issue: 6
  year: 2006
  end-page: 2567
  ident: C2
  article-title: Raptor codes
  publication-title: IEEE Trans. Inf. Theory
– volume: 22
  start-page: 269
  issue: 3
  year: 2004
  end-page: 279
  ident: C19
  article-title: DVB-S2 low density parity check codes with near shannon limit performance
  publication-title: Int. J. Satell. Commun. Netw.
– volume: 11
  start-page: 343
  issue: 4
  year: 2007
  end-page: 345
  ident: C20
  article-title: Performance complexity tradeoffs of raptor codes over Gaussian channels
  publication-title: IEEE Commun. Lett.
– volume: 49
  start-page: 1727
  issue: 10
  year: 2001
  end-page: 1737
  ident: C23
  article-title: Convergency behaviour of iteratively decoded parallel concatenated codes
  publication-title: IEEE Trans. Commun.
– volume: 17
  start-page: 261
  issue: 2
  year: 2013
  end-page: 264
  ident: C17
  article-title: Design of LT codes with equal and unequal erasure protection over binary erasure channels
  publication-title: IEEE Commun. Lett.
– volume: PP
  start-page: 1
  issue: 99
  year: 2014
  end-page: 14
  ident: C15
  article-title: MPMTP: multipath multimedia transport protocol using systematic raptor codes over wireless networks
  publication-title: IEEE Trans. Mob. Comput.
– start-page: 1
  year: 2010
  end-page: 5
– start-page: 421
  year: 2007
  end-page: 425
– start-page: 1541
  year: 2012
  end-page: 1548
– start-page: 1
  year: 2005
  end-page: 5
– start-page: 1
  year: 2012
  end-page: 6
– start-page: 574
  year: 2012
  end-page: 578
– start-page: 271
  year: 2002
  end-page: 280
– volume: 49
  start-page: 1727
  issue: 10
  year: 2001
  end-page: 1737
  article-title: Convergency behaviour of iteratively decoded parallel concatenated codes
  publication-title: IEEE Trans. Commun.
– start-page: 1
  year: 2014
  end-page: 2
– start-page: 1147
  year: 2007
  end-page: 1151
– start-page: 66
  year: 2006
  end-page: 70
– volume: 22
  start-page: 269
  issue: 3
  year: 2004
  end-page: 279
  article-title: DVB‐S2 low density parity check codes with near shannon limit performance
  publication-title: Int. J. Satell. Commun. Netw.
– start-page: 19
  year: 2012
  end-page: 24
– volume: PP
  start-page: 1
  issue: 99
  year: 2014
  end-page: 14
  article-title: MPMTP: multipath multimedia transport protocol using systematic raptor codes over wireless networks
  publication-title: IEEE Trans. Mob. Comput.
– volume: 17
  start-page: 261
  issue: 2
  year: 2013
  end-page: 264
  article-title: Design of LT codes with equal and unequal erasure protection over binary erasure channels
  publication-title: IEEE Commun. Lett.
– start-page: 1
  year: 2011
  end-page: 5
– volume: 52
  start-page: 2551
  issue: 6
  year: 2006
  end-page: 2567
  article-title: Raptor codes
  publication-title: IEEE Trans. Inf. Theory
– start-page: 38
  year: 2004
– start-page: 1
  year: 2014
  end-page: 6
– volume: 11
  start-page: 343
  issue: 4
  year: 2007
  end-page: 345
  article-title: Performance complexity tradeoffs of raptor codes over Gaussian channels
  publication-title: IEEE Commun. Lett.
– year: 2015
– start-page: 67
  year: 2007
  end-page: 72
– start-page: 4689
  year: 2013
  end-page: 4694
– start-page: 25
  year: 2013
  end-page: 26
– ident: e_1_2_7_8_1
– ident: e_1_2_7_13_1
  doi: 10.1109/SIPS.2007.4387519
– ident: e_1_2_7_18_1
  doi: 10.1109/LCOMM.2013.011113.122283
– ident: e_1_2_7_2_1
– start-page: 1
  issue: 99
  year: 2014
  ident: e_1_2_7_16_1
  article-title: MPMTP: multipath multimedia transport protocol using systematic raptor codes over wireless networks
  publication-title: IEEE Trans. Mob. Comput.
– ident: e_1_2_7_7_1
  doi: 10.1109/ITW2.2006.323758
– ident: e_1_2_7_5_1
  doi: 10.1109/ISIT.2004.1365075
– ident: e_1_2_7_11_1
  doi: 10.1109/ISCE.2014.6884279
– ident: e_1_2_7_3_1
  doi: 10.1109/TIT.2006.874390
– ident: e_1_2_7_10_1
  doi: 10.1109/ISCE.2013.6570211
– ident: e_1_2_7_19_1
– ident: e_1_2_7_24_1
  doi: 10.1109/26.957394
– ident: e_1_2_7_21_1
  doi: 10.1109/LCOM.2007.348295
– ident: e_1_2_7_25_1
– ident: e_1_2_7_12_1
  doi: 10.1109/AFRCON.2011.6072000
– ident: e_1_2_7_6_1
– ident: e_1_2_7_20_1
  doi: 10.1002/sat.787
– ident: e_1_2_7_22_1
  doi: 10.1109/APCC.2012.6388260
– ident: e_1_2_7_4_1
– ident: e_1_2_7_9_1
  doi: 10.1109/ISIT.2007.4557262
– ident: e_1_2_7_17_1
  doi: 10.1109/Swe-CTW.2012.6376281
– ident: e_1_2_7_14_1
  doi: 10.1109/WCNC.2013.6555334
– ident: e_1_2_7_15_1
  doi: 10.1109/CCECE.2012.6335051
– ident: e_1_2_7_23_1
  doi: 10.1109/VETECF.2007.248
SSID ssj0055644
Score 2.1342854
Snippet Raptor codes are a class of rateless codes that were originally designed for binary erasure channels. To enhance their performance, multiple soft iterative...
SourceID proquest
crossref
wiley
iet
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1933
SubjectTerms Algorithms
binary erasure channels
channel coding
Channels
Computer simulation
decoder
Decoders
Decoding
decoding performance
Graphs
iterative decoding
iterative soft decoding method
Luby transform codes
modified Tanner graph
parallel decoding method
Performance enhancement
rateless codes
soft decoding method
soft iterative decoding algorithm
systematic Raptor codes
transform coding
Transforms
Title Soft decoding method for systematic raptor codes
URI http://digital-library.theiet.org/content/journals/10.1049/iet-com.2015.0100
https://onlinelibrary.wiley.com/doi/abs/10.1049%2Fiet-com.2015.0100
https://www.proquest.com/docview/1808096551
Volume 9
WOSCitedRecordID wos000364208600001&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: PRVWIB
  databaseName: Wiley Online Library Open Access
  customDbUrl:
  eissn: 1751-8636
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0055644
  issn: 1751-8628
  databaseCode: WIN
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://onlinelibrary.wiley.com
  providerName: Wiley-Blackwell
– providerCode: PRVWIB
  databaseName: Wiley Online Library Open Access
  customDbUrl:
  eissn: 1751-8636
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0055644
  issn: 1751-8628
  databaseCode: 24P
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://authorservices.wiley.com/open-science/open-access/browse-journals.html
  providerName: Wiley-Blackwell
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3dSxwxEB9O7YM-VFsrnlXZltKHQnCz-bjksT1OPPCuQpXeW8husiDI3XEf_v3O7N6HR0Gh-LIP2UkIM5mZ32x2ZgC-cW1kMLxgaeY9k1qUzGSFYqX1nmuLJyJWdWavW_2-GQzsTQPay1yYuj7E6oMbaUZlr0nBfV53IUFQi0K8jzNGP3ygB6PKmynG7TucC0P9GzJ5szTHSumqoyu6Sc4QvpvV1aa9-GeJDee0ha83cOdz9Fq5n8v9N9n4AbxfoM_kZ31cPkAjDj_C3rOahIeQ_kHDnASMSsmrJXWH6QShbbIu-pxM_Bhj9YTy4aef4O6yc9u-You2CqzAYEqzvBWVagWMW9IoKOkqy4OJWWltKKUy0XCvJcZdPiirYyiFLoS20foMCVB24gi2h6NhPIYE4WFJi3m0VbLgmY-qyIOMRoq8FDlvQrrkpysWNcep9cWDq-6-pXXIDIfMcMQMR8xowo_VlHFdcOMl4u80tlC76UuEXzcIu51b1_7dWxO4cSib8GUpbIdKRjcnfhhHc1yXqm9ajeiyCaKS7et7c-3eXfaL8iuUPvmvWZ9hl8arzEd1CtuzyTyewbvicXY_nZxXpxyff7v9Jypl_R8
linkProvider Wiley-Blackwell
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3da9swED-ydrDtod26laVf80bpQ0HMH5IiPbZpQ8KStLCU5k3IlgyF4oYk3d_fOzufFFoYfbVPQpx0d7-zfL8DOI6k4k5FGQtjaxmXSc5UnAmWa2sjqfFE-JJnttvo99VwqK9rcDGvhan4IRYf3MgySn9NBk4fpKuEkxNJ5p2fMvrjA0MYUW-GmLhvcgQc1MDhttOf-2MhZNnSFeNkxBC_q8Xdpv79bIq16PQOX68Bz1X4Wsaf1vbbrPwzbM3wZ3BWHZgvUPPFDnxaYSX8CuFfdM2Bw7yU4lpQ9ZgOENwGS9rnYGxHmK0HVBE_-QY3rctBs81mjRVYhumUZGnDC9FwmLmEPqGyqzh1yse51i7nQnkVWckx87JOaOldnsgskdprG6MA7l6yCxvFQ-G_Q4AAMafJLHornkWx9SJLHfeKJ2mepFEdwrlCTTZjHafmF_emvP3m2qAyDCrDkDIMKaMOp4sho4py4yXhE3o2M7zJS4K_1gQ7lwPTvOotBczI5XX4Od9tg2ZGdye28A-POC_xb2qJ-LIOSbm5r6_NNHs38TlVWAi591-jfsCH9qDXNd1O_88-fCSZsg5SHMDGdPzoD-F99m96NxkflUf-CfPbAHc
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1ZSwMxEB60iuiDt1jPVcQHIbhHkiaPWi2KWgsq-BaymywIUksPf78zu221CAri6-4khLlns_MNwFEkFXcqylgYW8u4THKm4kywXFsbSY0a4Quc2dtas6men3VrCi5GvTAlPsT4gxtZRuGvycB9x-VlwckJJPPF9xn98YEhjKA3QyzcZ7ioRaTbMW-N_LEQshjpinEyYpi_q_Hdpj79tsVEdJrG1xOJ59f0tYg_jaX_OfkyLA7zz-CsVJgVmPLtVVj4gkq4BuEDuubAYV1KcS0oZ0wHmNwGn7DPQdd2sFoPqCO-tw5PjcvH-hUbDlZgGZZTkqU1L0TNYeUS-oTaruLUKR_nWrucC-VVZCXHyss6oaV3eSKzRGqvbYwEKL1kAyrtt7bfhAATxJw2s-iteBbF1ossddwrnqR5kkZVCEcMNdkQdZyGX7ya4vaba4PMMMgMQ8wwxIwqnIyXdErIjZ-Ij-nZ0PB6PxEeThBeXz6a-v3dJ4FBGVXhYCRtg2ZGdye27d8GuC_hb2qJ-WUVkkK4v5_N1O-e4nPqsBBy60-r9mGuddEwt9fNm22YJ5KiDVLsQKXfHfhdmM3e-y-97l6h8R_6l_9_
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=Soft+decoding+method+for+systematic+raptor+codes&rft.jtitle=IET+communications&rft.au=Zhang%2C+Meixiang&rft.au=Kim%2C+Sooyoung&rft.au=Chang%2C+Jin+Yeong&rft.au=Kim%2C+Won%E2%80%90Yong&rft.date=2015-11-05&rft.issn=1751-8628&rft.eissn=1751-8636&rft.volume=9&rft.issue=16&rft.spage=1933&rft.epage=1940&rft_id=info:doi/10.1049%2Fiet-com.2015.0100&rft.externalDBID=n%2Fa&rft.externalDocID=10_1049_iet_com_2015_0100
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1751-8628&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1751-8628&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1751-8628&client=summon