Joint detection/decoding algorithms for non-binary low-density parity-check codes over inter-symbol interference channels

This study is concerned with the application of non-binary low-density parity-check (NB-LDPC) codes to binary input inter-symbol interference channels. Two low-complexity joint detection/decoding algorithms are proposed. One is referred to as max-log-MAP/X-EMS algorithm, which is implemented by exch...

Full description

Saved in:
Bibliographic Details
Published in:IET communications Vol. 7; no. 14; pp. 1522 - 1531
Main Authors: Zhao, Shancheng, Lu, Zhifei, Ma, Xiao, Bai, Baoming
Format: Journal Article
Language:English
Published: Stevenage The Institution of Engineering and Technology 01.09.2013
John Wiley & Sons, Inc
Subjects:
ISSN:1751-8628, 1751-8636
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract This study is concerned with the application of non-binary low-density parity-check (NB-LDPC) codes to binary input inter-symbol interference channels. Two low-complexity joint detection/decoding algorithms are proposed. One is referred to as max-log-MAP/X-EMS algorithm, which is implemented by exchanging soft messages between the max-log-MAP detector and the extended min-sum (EMS) decoder. The max-log-MAP/X-EMS algorithm is applicable to general NB-LDPC codes. The other one, referred to as Viterbi/GMLGD algorithm, is designed in particular for majority-logic decodable NB-LDPC codes. The Viterbi/GMLGD algorithm works in an iterative manner by exchanging hard-decisions between the Viterbi detector and the generalised majority-logic decoder (GMLGD). As a by-product, a variant of the original EMS algorithm is proposed, which is referred to as µ-EMS algorithm. In the µ-EMS algorithm, the messages are truncated according to an adaptive threshold, resulting in a more efficient algorithm. Simulations results show that the max-log-MAP/X-EMS algorithm performs as well as the traditional iterative detection/decoding algorithm based on the BCJR algorithm and theQ-ary sum–product algorithm, but with lower complexity. The complexity can be further reduced for majority-logic decodable NB-LDPC codes by executing the Viterbi/GMLGD algorithm with a performance degradation within one dB. These algorithms provide good candidates for trade-offs between performance and complexity.
AbstractList This study is concerned with the application of non-binary low-density parity-check (NB-LDPC) codes to binary input inter-symbol interference channels. Two low-complexity joint detection/decoding algorithms are proposed. One is referred to as max-log-MAP/X-EMS algorithm, which is implemented by exchanging soft messages between the max-log-MAP detector and the extended min-sum (EMS) decoder. The other one, referred to as Viterbi/GMLGD algorithm, is designed in particular for majority-logic decodable NB-LDPC codes. As a by-product, a variant of the original EMS algorithm is proposed, which is referred to as mu -EMS algorithm. In the mu -EMS algorithm, the messages are truncated according to an adaptive threshold, resulting in a more efficient algorithm. Simulations results show that the max-log-MAP/X-EMS algorithm performs as well as the traditional iterative detection/decoding algorithm based on the BCJR algorithm and the Q-ary sum-product algorithm, but with lower complexity. The complexity can be further reduced for majority-logic decodable NB-LDPC codes by executing the Viterbi/GMLGD algorithm with performance degradation within one dB.
This study is concerned with the application of non-binary low-density parity-check (NB-LDPC) codes to binary input inter-symbol interference channels. Two low-complexity joint detection/decoding algorithms are proposed. One is referred to as max-log-MAP/X-EMS algorithm, which is implemented by exchanging soft messages between the max-log-MAP detector and the extended min-sum (EMS) decoder. The other one, referred to as Viterbi/GMLGD algorithm, is designed in particular for majority-logic decodable NB-LDPC codes. As a by-product, a variant of the original EMS algorithm is proposed, which is referred to as μ-EMS algorithm. In the μ-EMS algorithm, the messages are truncated according to an adaptive threshold, resulting in a more efficient algorithm. Simulations results show that the max-log-MAP/X-EMS algorithm performs as well as the traditional iterative detection/decoding algorithm based on the BCJR algorithm and the Q-ary sum-product algorithm, but with lower complexity. The complexity can be further reduced for majority-logic decodable NB-LDPC codes by executing the Viterbi/GMLGD algorithm with performance degradation within one dB.
This study is concerned with the application of non‐binary low‐density parity‐check (NB‐LDPC) codes to binary input inter‐symbol interference channels. Two low‐complexity joint detection/decoding algorithms are proposed. One is referred to as max‐log‐MAP/X‐EMS algorithm, which is implemented by exchanging soft messages between the max‐log‐MAP detector and the extended min‐sum (EMS) decoder. The max‐log‐MAP/ X ‐EMS algorithm is applicable to general NB‐LDPC codes. The other one, referred to as Viterbi/GMLGD algorithm, is designed in particular for majority‐logic decodable NB‐LDPC codes. The Viterbi/GMLGD algorithm works in an iterative manner by exchanging hard‐decisions between the Viterbi detector and the generalised majority‐logic decoder (GMLGD). As a by‐product, a variant of the original EMS algorithm is proposed, which is referred to as µ ‐EMS algorithm. In the µ ‐EMS algorithm, the messages are truncated according to an adaptive threshold, resulting in a more efficient algorithm. Simulations results show that the max‐log‐MAP/ X ‐EMS algorithm performs as well as the traditional iterative detection/decoding algorithm based on the BCJR algorithm and theQ‐ary sum–product algorithm, but with lower complexity. The complexity can be further reduced for majority‐logic decodable NB‐LDPC codes by executing the Viterbi/GMLGD algorithm with a performance degradation within one dB. These algorithms provide good candidates for trade‐offs between performance and complexity.
Author Zhao, Shancheng
Lu, Zhifei
Bai, Baoming
Ma, Xiao
Author_xml – sequence: 1
  givenname: Shancheng
  surname: Zhao
  fullname: Zhao, Shancheng
  email: maxiao@mail.sysu.edu.cn
  organization: 1Department of Electronics and Communication Engineering, Sun Yat-sen University, Guangzhou 510275, People's Republic of China
– sequence: 2
  givenname: Zhifei
  surname: Lu
  fullname: Lu, Zhifei
  organization: 1Department of Electronics and Communication Engineering, Sun Yat-sen University, Guangzhou 510275, People's Republic of China
– sequence: 3
  givenname: Xiao
  surname: Ma
  fullname: Ma, Xiao
  organization: 1Department of Electronics and Communication Engineering, Sun Yat-sen University, Guangzhou 510275, People's Republic of China
– sequence: 4
  givenname: Baoming
  surname: Bai
  fullname: Bai, Baoming
  organization: 2The State Key Laboratory of ISN Xidian University, Xian 710071, People's Republic of China
BookMark eNqFkctOHDEQRa2ISAHCB2RnKZtk4cGPfmaXjCCAQGxgbbntMmPSbU_sHlD_fdzqCCIUwcYP6dy6VXUP0J4PHhD6xOiK0aI9djASHYYVp4yvaMWqd2if1SUjTSWqvac3bz6gg5TuKS3Lqij20XQRnB-xgRH06II_NqCDcf4Oq_4uRDduhoRtiDj7kc55FSfch0diwCc3TnirMjMRvQH9C2clJBweIOJcFCJJ09CFfvlYiOA1YL1R3kOfPqL3VvUJjv7eh-j29ORmfUYur3-er79fEl3UXBCom4qKtrO6UaUpbCWU4armDLigVUWbouSc5VOYWhjGwXaltW0HjS61YEYcoi9L3W0Mv3eQRjm4pKHvlYewS5KVTBSNEK3I6OcX6H3YRZ-7k6xoeUvbgjaZYgulY0gpgpXb6Ia8GMmonMOQOQyZw5BzGHIOI2vqFxrtRjUvfIzK9a8qvy3KR9fD9LaVXF_d8h-nlNZ0Hogs4hl7nuUVs6__4c9PbuT6-uofj62x4g93s8Mh
CitedBy_id crossref_primary_10_1109_COMST_2018_2797875
crossref_primary_10_1016_j_phycom_2015_08_011
crossref_primary_10_1109_TCOMM_2016_2609906
crossref_primary_10_1049_iet_com_2013_0684
Cites_doi 10.1109/TCOMM.2012.101712.110173
10.1109/4234.681360
10.1109/ICC.1998.685151
10.1109/TIT.2002.806140
10.1109/ICC.2010.5502380
10.1109/ICC.1995.524253
10.1109/TIT.2004.839541
10.1109/ICC.1993.397441
10.1109/ISIT.2010.5513632
10.1109/18.910573
10.1109/TIT.1974.1055186
10.1109/26.864167
10.1109/TCOMM.2011.092011.110082
10.1109/TIT.2002.1003830
10.1109/TCOMM.2010.05.070096
10.1109/PROC.1973.9030
10.1109/18.490504
10.1109/TCOMM.2007.894088
10.1109/TCOMM.2005.847129
10.7551/mitpress/4347.001.0001
10.1109/ISIT.2012.6284127
10.1109/TCOMM.2008.060024
10.1109/4234.673659
10.1109/ISTC.2012.6325227
10.1109/ITW.2003.1216697
10.1109/18.910572
10.1109/LCOMM.2010.100810.101403
10.1109/TSP.2005.855396
10.1109/MSP.2004.1267049
10.1109/TIT.2003.813563
ContentType Journal Article
Copyright The Institution of Engineering and Technology
2021 The Institution of Engineering and Technology
Copyright The Institution of Engineering & Technology Sep 2013
Copyright_xml – notice: The Institution of Engineering and Technology
– notice: 2021 The Institution of Engineering and Technology
– notice: Copyright The Institution of Engineering & Technology Sep 2013
DBID AAYXX
CITATION
8FE
8FG
ABJCF
AFKRA
ARAPS
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
S0W
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1049/iet-com.2012.0616
DatabaseName CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central
ProQuest Technology Collection
ProQuest One Community College
ProQuest Central
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DELNET Engineering & Technology Collection
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
Advanced Technologies & Aerospace Collection
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest One Academic Eastern Edition
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
Advanced Technologies & Aerospace Database
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest DELNET Engineering and Technology Collection
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
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
Advanced Technologies & Aerospace Collection
CrossRef


Database_xml – sequence: 1
  dbid: P5Z
  name: Advanced Technologies & Aerospace Database
  url: https://search.proquest.com/hightechjournals
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1751-8636
EndPage 1531
ExternalDocumentID 3196937261
10_1049_iet_com_2012_0616
CMU2BF00703
Genre article
Feature
GrantInformation_xml – fundername: NSF
  funderid: 61172082; 60972048
– fundername: 973 Program
  funderid: 2012CB316100
GroupedDBID 0R
24P
29I
4IJ
5GY
6IK
8FE
8FG
8VB
AAJGR
ABJCF
ABPTK
ACGFS
ACIWK
AENEX
AFKRA
ALMA_UNASSIGNED_HOLDINGS
ARAPS
BENPR
BFFAM
BGLVJ
CS3
DU5
ESX
HCIFZ
HZ
IFIPE
IPLJI
JAVBF
L6V
LAI
LOTEE
LXI
M43
M7S
MS
NADUK
NXXTH
O9-
OCL
P62
PTHSS
QWB
RIE
RNS
RUI
S0W
U5U
UNMZH
UNR
ZL0
ZZ
.DC
0R~
0ZK
1OC
2QL
4.4
6OB
96U
AAHHS
AAHJG
ABQXS
ACCFJ
ACCMX
ACESK
ACGFO
ACXQS
ADEYR
AEEZP
AEGXH
AEQDE
AFAZI
AIAGR
AIWBW
AJBDE
ALUQN
AVUZU
CCPQU
EBS
EJD
F8P
GOZPB
GROUPED_DOAJ
GRPMH
HZ~
IAO
ITC
K1G
MCNEO
MS~
OK1
ROL
~ZZ
AAMMB
AAYXX
AEFGJ
AFFHD
AGXDD
AIDQK
AIDYY
CITATION
IDLOA
PHGZM
PHGZT
PQGLB
WIN
DWQXO
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
PUEGO
ID FETCH-LOGICAL-c4723-e786039bfc8a5d4f63ad2a721e2306608452218453d73d12efb5ff9be8c5c31d3
IEDL.DBID BENPR
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000326404200010&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 13:24:11 EDT 2025
Wed Aug 13 10:31:52 EDT 2025
Wed Oct 29 21:30:52 EDT 2025
Tue Nov 18 21:32:48 EST 2025
Wed Jan 22 16:32:45 EST 2025
Thu May 09 18:13:38 EDT 2019
Tue Jan 05 21:44:04 EST 2021
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 14
Keywords max-log-MAP/X-EMS algorithm
intersymbol interference
parity check codes
Viterbi/GMLGD algorithm
EMS decoder
adaptive threshold
joint detection-decoding algorithm
Viterbi detector
iterative detection algorithm
μ-EMS algorithm
generalised majority-logic decoder
soft message
iterative decoding algorithm
binary input intersymbol interference channel
nonbinary low-density parity-check code
BCJR algorithm
performance degradation
NB-LDPC code
iterative decoding
intersymbol interference channel
extended min-sum decoder
Q-ary sum–product algorithm
majority-logic decoding
Viterbi decoding
max-log-MAP detector
Language English
License http://onlinelibrary.wiley.com/termsAndConditions#vor
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c4723-e786039bfc8a5d4f63ad2a721e2306608452218453d73d12efb5ff9be8c5c31d3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
OpenAccessLink https://onlinelibrary.wiley.com/doi/pdfdirect/10.1049/iet-com.2012.0616
PQID 1492909408
PQPubID 1936360
PageCount 10
ParticipantIDs proquest_journals_1492909408
crossref_citationtrail_10_1049_iet_com_2012_0616
iet_journals_10_1049_iet_com_2012_0616
crossref_primary_10_1049_iet_com_2012_0616
wiley_primary_10_1049_iet_com_2012_0616_CMU2BF00703
proquest_miscellaneous_1513483393
ProviderPackageCode RUI
PublicationCentury 2000
PublicationDate September 2013
PublicationDateYYYYMMDD 2013-09-01
PublicationDate_xml – month: 09
  year: 2013
  text: September 2013
PublicationDecade 2010
PublicationPlace Stevenage
PublicationPlace_xml – name: Stevenage
PublicationTitle IET communications
PublicationYear 2013
Publisher The Institution of Engineering and Technology
John Wiley & Sons, Inc
Publisher_xml – name: The Institution of Engineering and Technology
– name: John Wiley & Sons, Inc
References Lafourcade, A.; Vardy, A. (C33) 1996; 5
Kschischang, R.F.; Frey, J.B.; Loeliger, A.H. (C24) 2001; 2
Forney, D.G. (C32); 3
Hu, Y.X.; Eleftheriou, E.; Arnold, D. (C36) 2005; 1
Fossorier, M.; Burkert, F.; Lin, S.; Hagenauer, J. (C30) 1998; 5
Souviginer, V.T.; Öberg, M.; Siegel, H.P.; Swanson, E.R.; Wolf, K.J. (C18) 2000; 8
Declercq, D.; Fossorier, M. (C5) 2007; 4
Tüchler, M.; Kötter, R.; Singer, A. (C13) 2002; 5
Forney, D.G. (C25) 2001; 2
Zhao, S.; Ma, X.; Zhang, X.; Bai, B. (C38) 2013; 1
Kavčić, A.; Ma, X.; Mitzenmacher, M. (C20) 2003; 7
Yang, H.; Ryan, E.W. (C16) 2010; 2
Zeng, L.; Lan, L.; Tai, Y.; Song, S.; Lin, S.; Abdel-Ghaffar, K. (C37) 2008; 4
Kurkoski, M.B.; Siegel, H.P.; Wolf, K.J. (C15) 2002; 6
Davey, M.; MacKay, D. (C2) 1998; 2
Zhao, D.; Ma, X.; Chen, C.; Bai, B. (C9) 2010; 11
Colavolpe, G.; Germi, G. (C21) 2005; 5
Douillard, J.; Jezequel, M.; Berrou, C.; Picart, A.; Didier, P.; Glavieux, A. (C12) 1995; 9
Forney, D.G. (C26) 1973; 3
Ma, X.; Zhang, K.; Chen, H.; Bai, B. (C7) 2012; 1
Bahl, R.L.; Cocke, J.; Jelinek, F.; Raviv, J. (C27) 1974; 3
Voicila, A.; Declercq, D.; Verdier, F.; Fossorier, M.; Urard, P. (C6) 2010; 5
Song, H.; Kumar, V. (C19) 2004; 1
Ma, X.; Kavčić, A. (C28) 2003; 3
Gunther, J.; Ankapura, M.; Moon, T. (C14) 2005; 10
2010; 11
1995; 9
2013; 1
2012
2010
2002; 5
2002; 6
2000; 8
1998
2008
1995
1993
2004
2003
2004; 1
2008; 4
1974; 3
1999
2012; 1
2003; 7
2005; 5
2003; 3
1963
2005; 10
3
2007; 4
2005; 1
1998; 2
2001; 2
2010; 2
1996; 5
2010; 5
1998; 5
1973; 3
e_1_2_8_28_1
e_1_2_8_24_1
e_1_2_8_25_1
e_1_2_8_26_1
e_1_2_8_27_1
Lin S. (e_1_2_8_32_1) 2004
Proakis G.J. (e_1_2_8_11_1) 2008
e_1_2_8_3_1
e_1_2_8_2_1
e_1_2_8_5_1
e_1_2_8_4_1
e_1_2_8_7_1
e_1_2_8_6_1
Douillard J. (e_1_2_8_13_1) 1995; 9
e_1_2_8_9_1
e_1_2_8_8_1
Tüchler M. (e_1_2_8_14_1) 2002; 5
Yang H. (e_1_2_8_17_1) 2010; 2
e_1_2_8_20_1
Forney D.G. (e_1_2_8_33_1); 3
e_1_2_8_21_1
e_1_2_8_22_1
e_1_2_8_23_1
Ma X. (e_1_2_8_29_1) 2003; 3
e_1_2_8_18_1
e_1_2_8_39_1
e_1_2_8_19_1
e_1_2_8_36_1
e_1_2_8_35_1
e_1_2_8_15_1
e_1_2_8_38_1
e_1_2_8_16_1
e_1_2_8_37_1
e_1_2_8_10_1
e_1_2_8_31_1
e_1_2_8_34_1
e_1_2_8_12_1
e_1_2_8_30_1
References_xml – volume: 3
  start-page: 38
  issue: 49
  year: 2003
  end-page: 52
  ident: C28
  article-title: Path partitions and forward-only trellis algorithms
  publication-title: IEEE Trans. Inf. Theory
– volume: 2
  start-page: 252
  issue: 28
  year: 2010
  end-page: 260
  ident: C16
  article-title: Low-floor detection/decoding of LDPC-coded partial response channels
  publication-title: IEEE J. Sel. Areas Commun.
– volume: 1
  start-page: 1
  issue: 61
  year: 2013
  end-page: 6
  ident: C38
  article-title: A class of nonbinary LDPC codes with fast encoding and decoding algorithms
  publication-title: IEEE Trans. Commun.
– volume: 1
  start-page: 56
  issue: 21
  year: 2004
  end-page: 66
  ident: C19
  article-title: Low-density parity check codes for partial response channels
  publication-title: IEEE Signal Process. Mag.
– volume: 1
  start-page: 9
  issue: 60
  year: 2012
  end-page: 13
  ident: C7
  article-title: Low complexity X-EMS algorithms for nonbinary LDPC codes
  publication-title: IEEE Trans. Commun.
– volume: 7
  start-page: 1636
  issue: 49
  year: 2003
  end-page: 1652
  ident: C20
  article-title: Binary intersymbol interference channels: Gallager codes, density evolution and code performance bounds
  publication-title: IEEE Trans. Inf. Theory
– volume: 2
  start-page: 165
  year: 1998
  end-page: 167
  ident: C2
  article-title: Low-density parity check codes over GF(q)
  publication-title: IEEE Commun. Lett.
– volume: 5
  start-page: 1365
  issue: 58
  year: 2010
  end-page: 1375
  ident: C6
  article-title: Low-complexity decoding for non-binary LDPC codes in high order fields
  publication-title: IEEE Trans. Commun.
– volume: 9
  start-page: 507
  issue: 6
  year: 1995
  end-page: 511
  ident: C12
  article-title: Iterative correction of intersymbol interference: Turbo-equalization
  publication-title: Europ. Trans. Commun.
– volume: 8
  start-page: 1297
  issue: 48
  year: 2000
  end-page: 1308
  ident: C18
  article-title: Turbo decoding for partial response channels
  publication-title: IEEE Trans. Commun.
– volume: 4
  start-page: 633
  issue: 55
  year: 2007
  end-page: 643
  ident: C5
  article-title: Decoding algorithms for nonbinary LDPC codes over GF(q)
  publication-title: IEEE Trans. Commun.
– volume: 5
  start-page: 754
  issue: 48
  year: 2002
  end-page: 767
  ident: C13
  article-title: Turbo equalization: principles and new results
  publication-title: IEEE Trans. Inf. Theory
– volume: 6
  start-page: 1410
  issue: 48
  year: 2002
  end-page: 1422
  ident: C15
  article-title: Joint message-passing decoding of LDPC codes and partial-response channels
  publication-title: IEEE Trans. Inf. Theory
– volume: 5
  start-page: 689
  issue: 42
  year: 1996
  end-page: 703
  ident: C33
  article-title: Optimal sectionalization of a trellis
  publication-title: IEEE Trans. Inf. Theory
– volume: 2
  start-page: 520
  issue: 47
  year: 2001
  end-page: 548
  ident: C25
  article-title: Codes on graphs: normal realizations
  publication-title: IEEE Trans. Inf. Theory
– volume: 3
  start-page: 284
  issue: 20
  year: 1974
  end-page: 287
  ident: C27
  article-title: Optimal decoding of linear codes for minimizing symbol error rate
  publication-title: IEEE Trans. Inf. Theory
– volume: 10
  start-page: 3847
  issue: 53
  year: 2005
  end-page: 3856
  ident: C14
  article-title: A generalized LDPC decoder for blind turbo equalization
  publication-title: IEEE Trans. Signal Process.
– volume: 1
  start-page: 386
  issue: 51
  year: 2005
  end-page: 398
  ident: C36
  article-title: Regular and irregular progressive edge-growth Tanner graphs
  publication-title: IEEE Trans. Inf. Theory
– volume: 3
  start-page: 268
  issue: 61
  year: 1973
  end-page: 278
  ident: C26
  article-title: The Viterbi algorithm
  publication-title: Proc. IEEE
– volume: 11
  start-page: 1062
  issue: 14
  year: 2010
  end-page: 1064
  ident: C9
  article-title: A low complexity decoding algorithm for majority-logic decodable nonbinary LDPC codes
  publication-title: IEEE Commun. Lett.
– volume: 5
  start-page: 137
  issue: 2
  year: 1998
  end-page: 139
  ident: C30
  article-title: On the equivalence between SOVA and max-log-MAP decodings
  publication-title: IEEE Commun. Lett.
– volume: 4
  start-page: 545
  issue: 56
  year: 2008
  end-page: 554
  ident: C37
  article-title: Constructions of nonbinary quasi-cyclic ldpc codes: a finite field approach
  publication-title: IEEE Trans. Commun.
– volume: 3
  start-page: 363
  issue: 18
  end-page: 378
  ident: C32
  article-title: Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference
  publication-title: IEEE Trans. Inf. Theory
– volume: 2
  start-page: 498
  issue: 47
  year: 2001
  end-page: 519
  ident: C24
  article-title: Factor graphs and the sum-product algorithm
  publication-title: IEEE Trans. Inf. Theory
– volume: 5
  start-page: 818
  issue: 53
  year: 2005
  end-page: 825
  ident: C21
  article-title: On the application of factor graphs and the sum–product algorithm to ISI channels
  publication-title: IEEE Trans. Commun.
– start-page: 794
  year: 2010
  end-page: 798
– volume: 2
  start-page: 252
  issue: 28
  year: 2010
  end-page: 260
  article-title: Low‐floor detection/decoding of LDPC‐coded partial response channels
  publication-title: IEEE J. Sel. Areas Commun.
– volume: 5
  start-page: 689
  issue: 42
  year: 1996
  end-page: 703
  article-title: Optimal sectionalization of a trellis
  publication-title: IEEE Trans. Inf. Theory
– volume: 4
  start-page: 545
  issue: 56
  year: 2008
  end-page: 554
  article-title: Constructions of nonbinary quasi‐cyclic ldpc codes: a finite field approach
  publication-title: IEEE Trans. Commun.
– volume: 1
  start-page: 56
  issue: 21
  year: 2004
  end-page: 66
  article-title: Low‐density parity check codes for partial response channels
  publication-title: IEEE Signal Process. Mag.
– volume: 10
  start-page: 3847
  issue: 53
  year: 2005
  end-page: 3856
  article-title: A generalized LDPC decoder for blind turbo equalization
  publication-title: IEEE Trans. Signal Process.
– volume: 3
  start-page: 284
  issue: 20
  year: 1974
  end-page: 287
  article-title: Optimal decoding of linear codes for minimizing symbol error rate
  publication-title: IEEE Trans. Inf. Theory
– volume: 6
  start-page: 1410
  issue: 48
  year: 2002
  end-page: 1422
  article-title: Joint message‐passing decoding of LDPC codes and partial‐response channels
  publication-title: IEEE Trans. Inf. Theory
– volume: 5
  start-page: 818
  issue: 53
  year: 2005
  end-page: 825
  article-title: On the application of factor graphs and the sum–product algorithm to ISI channels
  publication-title: IEEE Trans. Commun.
– volume: 3
  start-page: 363
  issue: 18
  end-page: 378
  article-title: Maximum‐likelihood sequence estimation of digital sequences in the presence of intersymbol interference
  publication-title: IEEE Trans. Inf. Theory
– volume: 1
  start-page: 9
  issue: 60
  year: 2012
  end-page: 13
  article-title: Low complexity X‐EMS algorithms for nonbinary LDPC codes
  publication-title: IEEE Trans. Commun.
– volume: 5
  start-page: 754
  issue: 48
  year: 2002
  end-page: 767
  article-title: Turbo equalization: principles and new results
  publication-title: IEEE Trans. Inf. Theory
– start-page: 200
  year: 2012
  end-page: 204
– volume: 8
  start-page: 1297
  issue: 48
  year: 2000
  end-page: 1308
  article-title: Turbo decoding for partial response channels
  publication-title: IEEE Trans. Commun.
– volume: 5
  start-page: 137
  issue: 2
  year: 1998
  end-page: 139
  article-title: On the equivalence between SOVA and max‐log‐MAP decodings
  publication-title: IEEE Commun. Lett.
– year: 1963
– volume: 9
  start-page: 507
  issue: 6
  year: 1995
  end-page: 511
  article-title: Iterative correction of intersymbol interference: Turbo‐equalization
  publication-title: Europ. Trans. Commun.
– volume: 2
  start-page: 498
  issue: 47
  year: 2001
  end-page: 519
  article-title: Factor graphs and the sum‐product algorithm
  publication-title: IEEE Trans. Inf. Theory
– start-page: 1
  year: 2010
  end-page: 6
– volume: 3
  start-page: 268
  issue: 61
  year: 1973
  end-page: 278
  article-title: The Viterbi algorithm
  publication-title: Proc. IEEE
– volume: 4
  start-page: 633
  issue: 55
  year: 2007
  end-page: 643
  article-title: Decoding algorithms for nonbinary LDPC codes over GF(q)
  publication-title: IEEE Trans. Commun.
– volume: 11
  start-page: 1062
  issue: 14
  year: 2010
  end-page: 1064
  article-title: A low complexity decoding algorithm for majority‐logic decodable nonbinary LDPC codes
  publication-title: IEEE Commun. Lett.
– start-page: 3073
  year: 2012
  end-page: 3077
  article-title: Low‐density arrays of circulant matrices: rank and row‐redundancy, and QC‐LDPC codes
– volume: 2
  start-page: 165
  year: 1998
  end-page: 167
  article-title: Low‐density parity check codes over GF(q)
  publication-title: IEEE Commun. Lett.
– year: 2008
– start-page: 1009
  year: 1995
  end-page: 1013
– volume: 1
  start-page: 1
  issue: 61
  year: 2013
  end-page: 6
  article-title: A class of nonbinary LDPC codes with fast encoding and decoding algorithms
  publication-title: IEEE Trans. Commun.
– volume: 5
  start-page: 1365
  issue: 58
  year: 2010
  end-page: 1375
  article-title: Low‐complexity decoding for non‐binary LDPC codes in high order fields
  publication-title: IEEE Trans. Commun.
– year: 2004
– volume: 7
  start-page: 1636
  issue: 49
  year: 2003
  end-page: 1652
  article-title: Binary intersymbol interference channels: Gallager codes, density evolution and code performance bounds
  publication-title: IEEE Trans. Inf. Theory
– volume: 1
  start-page: 386
  issue: 51
  year: 2005
  end-page: 398
  article-title: Regular and irregular progressive edge‐growth Tanner graphs
  publication-title: IEEE Trans. Inf. Theory
– start-page: 70
  year: 2003
  end-page: 73
– volume: 2
  start-page: 520
  issue: 47
  year: 2001
  end-page: 548
  article-title: Codes on graphs: normal realizations
  publication-title: IEEE Trans. Inf. Theory
– volume: 3
  start-page: 38
  issue: 49
  year: 2003
  end-page: 52
  article-title: Path partitions and forward‐only trellis algorithms
  publication-title: IEEE Trans. Inf. Theory
– start-page: 947
  year: 1998
  end-page: 951
– start-page: 1064
  year: 1993
  end-page: 1070
– year: 1999
– ident: e_1_2_8_39_1
  doi: 10.1109/TCOMM.2012.101712.110173
– ident: e_1_2_8_3_1
  doi: 10.1109/4234.681360
– volume: 2
  start-page: 252
  issue: 28
  year: 2010
  ident: e_1_2_8_17_1
  article-title: Low‐floor detection/decoding of LDPC‐coded partial response channels
  publication-title: IEEE J. Sel. Areas Commun.
– ident: e_1_2_8_18_1
  doi: 10.1109/ICC.1998.685151
– volume: 3
  start-page: 38
  issue: 49
  year: 2003
  ident: e_1_2_8_29_1
  article-title: Path partitions and forward‐only trellis algorithms
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2002.806140
– ident: e_1_2_8_23_1
  doi: 10.1109/ICC.2010.5502380
– ident: e_1_2_8_30_1
  doi: 10.1109/ICC.1995.524253
– ident: e_1_2_8_37_1
  doi: 10.1109/TIT.2004.839541
– ident: e_1_2_8_12_1
  doi: 10.1109/ICC.1993.397441
– ident: e_1_2_8_9_1
  doi: 10.1109/ISIT.2010.5513632
– ident: e_1_2_8_26_1
  doi: 10.1109/18.910573
– ident: e_1_2_8_28_1
  doi: 10.1109/TIT.1974.1055186
– volume: 9
  start-page: 507
  issue: 6
  year: 1995
  ident: e_1_2_8_13_1
  article-title: Iterative correction of intersymbol interference: Turbo‐equalization
  publication-title: Europ. Trans. Commun.
– ident: e_1_2_8_19_1
  doi: 10.1109/26.864167
– volume: 3
  start-page: 363
  issue: 18
  ident: e_1_2_8_33_1
  article-title: Maximum‐likelihood sequence estimation of digital sequences in the presence of intersymbol interference
  publication-title: IEEE Trans. Inf. Theory
– ident: e_1_2_8_36_1
– ident: e_1_2_8_8_1
  doi: 10.1109/TCOMM.2011.092011.110082
– ident: e_1_2_8_16_1
  doi: 10.1109/TIT.2002.1003830
– ident: e_1_2_8_4_1
– ident: e_1_2_8_7_1
  doi: 10.1109/TCOMM.2010.05.070096
– ident: e_1_2_8_27_1
  doi: 10.1109/PROC.1973.9030
– ident: e_1_2_8_34_1
  doi: 10.1109/18.490504
– ident: e_1_2_8_6_1
  doi: 10.1109/TCOMM.2007.894088
– ident: e_1_2_8_22_1
  doi: 10.1109/TCOMM.2005.847129
– ident: e_1_2_8_2_1
  doi: 10.7551/mitpress/4347.001.0001
– ident: e_1_2_8_35_1
  doi: 10.1109/ISIT.2012.6284127
– ident: e_1_2_8_38_1
  doi: 10.1109/TCOMM.2008.060024
– volume: 5
  start-page: 754
  issue: 48
  year: 2002
  ident: e_1_2_8_14_1
  article-title: Turbo equalization: principles and new results
  publication-title: IEEE Trans. Inf. Theory
– ident: e_1_2_8_31_1
  doi: 10.1109/4234.673659
– ident: e_1_2_8_24_1
  doi: 10.1109/ISTC.2012.6325227
– ident: e_1_2_8_5_1
  doi: 10.1109/ITW.2003.1216697
– ident: e_1_2_8_25_1
  doi: 10.1109/18.910572
– ident: e_1_2_8_10_1
  doi: 10.1109/LCOMM.2010.100810.101403
– ident: e_1_2_8_15_1
  doi: 10.1109/TSP.2005.855396
– ident: e_1_2_8_20_1
  doi: 10.1109/MSP.2004.1267049
– volume-title: Digital communications
  year: 2008
  ident: e_1_2_8_11_1
– ident: e_1_2_8_21_1
  doi: 10.1109/TIT.2003.813563
– volume-title: Error control coding: fundamentals and applications
  year: 2004
  ident: e_1_2_8_32_1
SSID ssj0055644
Score 1.9975502
Snippet This study is concerned with the application of non-binary low-density parity-check (NB-LDPC) codes to binary input inter-symbol interference channels. Two...
This study is concerned with the application of non‐binary low‐density parity‐check (NB‐LDPC) codes to binary input inter‐symbol interference channels. Two...
SourceID proquest
crossref
wiley
iet
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1522
SubjectTerms adaptive threshold
Algorithms
BCJR algorithm
binary input intersymbol interference channel
Byproducts
Channels
Decoding
EMS
EMS decoder
extended min‐sum decoder
generalised majority‐logic decoder
Interference
intersymbol interference
intersymbol interference channel
iterative decoding
iterative decoding algorithm
iterative detection algorithm
joint detection‐decoding algorithm
majority‐logic decoding
max‐log‐MAP detector
max‐log‐MAP/X‐EMS algorithm
Messages
NB‐LDPC code
Niobium
nonbinary low‐density parity‐check code
parity check codes
performance degradation
Q‐ary sum–product algorithm
soft message
Viterbi decoding
Viterbi detector
Viterbi/GMLGD algorithm
μ‐EMS algorithm
SummonAdditionalLinks – databaseName: Wiley Online Library Open Access
  dbid: 24P
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NbtQwELbawoEe-EcNFGQQ4oAUmsR2Yh9h1RUgWnpoUW-R4x9YsU2qTQraG7wBz8iTMONkl10hFQlxtD2JHMeTmYlnvo-Qp7xQmQbHOxY2z2NeCRtXJjGx8lZza5zygSXiw7vi8FCenqqjDTJa1ML0-BDLH26oGeF7jQquq56FBJxaeIkT18WY8AEWLHsBVinfJFfSlEnkb8j40eJzLEQeGF3BTKYxuO9yebSp9v64xZpx2oThNb9z1XsN5md8479M_Ca5Pnif9GW_XW6RDVffJtsrmIR3yPe3zaTuqHVdSNKq9ywEqGjgqJ5-bGaT7tNZS8HTpXVT__z2owr1vHTafIWGxWz4bk6R2bCbQwfsCPOZYtl8SzFXlCI6xQwG2vlZ1Uz75lBxSLEGGZ6tvUtOxvvHo9fxwNMQG15kLHaFzBOmKm-kFpb7nGmbaQgtHcY3eSIRtR0iScFswWyaOV8J71XlpBGGpZbdI1swZ7dDaKq0lBoh4JGfXBU64cylxiN8qa8yHpFk8YJKM4CYI5fGtAyH6VyVsLolrG6Jq1vi6kbk-fKS8x7B4zLhZ9g36HF7meCTNcE3-8fl6P3Bb4Hy3PqI7C52z8otOXikiFooI_J4OQxKjSc1unbNBciIlHHJmGIRYWEv_X3q5ejgJHs1Rvwmdv-frnpArmWB7AMz6HbJVje7cA_JVfOlm7SzR0GrfgGNUilb
  priority: 102
  providerName: Wiley-Blackwell
Title Joint detection/decoding algorithms for non-binary low-density parity-check codes over inter-symbol interference channels
URI http://digital-library.theiet.org/content/journals/10.1049/iet-com.2012.0616
https://onlinelibrary.wiley.com/doi/abs/10.1049%2Fiet-com.2012.0616
https://www.proquest.com/docview/1492909408
https://www.proquest.com/docview/1513483393
Volume 7
WOSCitedRecordID wos000326404200010&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: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1751-8636
  dateEnd: 20141231
  omitProxy: false
  ssIdentifier: ssj0055644
  issn: 1751-8628
  databaseCode: P5Z
  dateStart: 20070201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1751-8636
  dateEnd: 20141231
  omitProxy: false
  ssIdentifier: ssj0055644
  issn: 1751-8628
  databaseCode: M7S
  dateStart: 20070201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1751-8636
  dateEnd: 20141231
  omitProxy: false
  ssIdentifier: ssj0055644
  issn: 1751-8628
  databaseCode: BENPR
  dateStart: 20070201
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVWIB
  databaseName: Wiley Online Library Free Content
  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/eLvHCXMwpV1Lj9MwELZolwMceCMKS2UQ4oBkmtjOwyfEVq1YxJYKdmG1l8ixHajoJqXJgvLvmUnT0l7KgYulxJPEiseeGXv8fYS8kJHiGhxvFtgwZDINLEuNZ5jKrJbWOJU1LBFfPkSTSXx-rqbtglvZplWu58RmoraFwTXyAXjyXCHYW_xm8ZMhaxTurrYUGh1ygEhlsksOjkaT6af1XBwEYUPnCjbSZ-C7x5t9TTWYuYphwghYQP4arFq4Y5k6UL3jdG67ro3tGd_-31bfIbdar5O-XanJXXLN5ffIzS0swvukfl_M8opaVzXJWfnAQmCKho3q-Td4ZfX9sqTg4dK8yDGc1suazovfzGIGfFVTZDOsagY6YH5QPChfUswOpYhHsWRlfZkW89VFe8KQ4pnjHEzzA3I2Hp0O37GWl4EZGXHBXBSHnlBpZmIdWJmFQluuIZR0GM-EXowo7RA5BsJGwvrcZWmQZSp1sQmM8K14SLrQVveIUF_pONYI-Y585CrSnhTONxnClWYplz3irfskMS1oOXJnzJNm81yqBPopgT-eYDcm2I098mrzyGKF2LFP-CXea8dtuU_w-Y7g8eg0GX48-SuQLGzWI4drLdh65UYFeuTZphoGMe7M6NwVVyAT-ELGQijRI6JRtH83PRmenPGjMeI1icf7P_yE3OANiwemxh2SbrW8ck_JdfOrmpXLPulwOe23I6ePya-foZwGF1B-PZ78AQw7Ing
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LbtNAFB21BYmy4F0RKDAgYFFpiD3j1ywQgtCooUlAIkXdmfHMGCJSO8QulX-Kb-ReJw7JJqy6YGn7-n18H5475xDy3AslV5B4M98EAfMS37BEO5rJ1CjPaCvTWiXiSz8cDqPTU_lpi_xu5sJgW2XjE2tHbXKN_8jbkMlziWRv0ZvpT4aqUTi62khozGFxbKsLKNmK17338H5fcN49HHWO2EJVgGkv5ILZMAocIZNUR8o3XhoIZbiCQshiNh44EXKMQ93jCxMK43KbJn6aysRG2tfCNQKOu02ueOj961bBz43n9_2gFo-FiOwyqBSi5SiqbI9tybA9BeItfwUxNFiLg9uweS3FXU2U60jXvfm_PaNb5MYip6Zv5x_BbbJlszvk-grT4l1SfcjHWUmNLevWs6xtoOzGsE3V5BvcQvn9rKCQv9Msz_BngZpVdJJfMIP9_WVFUauxrBggXP-gSANQUOx9pci2MWNFdZbkk_nCYv4kxRnVGSQe98jJpdz7HtmBa7X3CXWliiKFhPaoti5D5XjCujpFMtY04V6LOA0GYr2gZEdlkElctwZ4MgZcxPCGY4RNjLBpkYPlLtM5H8km45e4buGVik2Gz9YMe4ejuPNx8Ncgnpq0RfYb1K0ccgm5Fnm63AwuCsedVGbzc7DxXeFFQkjRIqIG9r8vPe4MTvi7LrJRiQebT_yEXDsaDfpxvzc8fkh2ea1Xgk2A-2SnnJ3bR-Sq_lWOi9nj-mul5OtlQ_8PXTN4nQ
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEF61BSE48EYECiwIOCAtiXf92gNCkDYitA09tKjiYtb7gIjUDrFL5b_Gr2PGsUNyCaceONoe22v7250Z7-z3EfLcjyRXEHizwIQh89PAsFT3NJPOKN9oK12tEvF5PxqN4pMTebhBfrdrYbCssh0T64Ha5Br_kXchkucSyd7irmvKIg53Bm-nPxkqSOFMayunMYfInq3OIX0r3gx34Fu_4Hywe9T_wBqFAab9iAtmozjsCZk6HavA-C4UynAFSZHFyDzsxcg3DjlQIEwkjMetSwPnZGpjHWjhGQHX3SSXIsgxsXcdBl9aLxAEYS0kC97ZY5A1xIsZVdkd25JhqQr4Xv4a_Gm44hM34fBKuLscNNdeb3Djf35fN8n1Jtam7-ad4xbZsNltcm2JgfEOqT7m46ykxpZ1SVrWNZCOozunavINHqH8flpQiOtplmf4E0HNKjrJz5nBuv-yoqjhWFYMkK9_UKQHKCjWxFJk4ZixojpN88l8o1lXSXGldQYByV1yfCHPfo9sQVvtfUI9qeJYIdE9qrDLSPV8YT3tkKTVpdzvkF6Lh0Q3VO2oGDJJ6pIBXyaAkQS-doIQShBCHfJqccp0zlOyzvgl7mtGq2Kd4bMVw-HuUdL_dPDXIJka1yHbLQKXLrmAX4c8XRyGoQvno1Rm8zOwCTzhx0JI0SGiBvm_m570D475-wGyVIkH62_8hFwBxCf7w9HeQ3KV1zImWBu4TbbK2Zl9RC7rX-W4mD2uOy4lXy8a-X8ACd-Bfw
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=Joint+detection%2Fdecoding+algorithms+for+non-binary+low-density+parity-check+codes+over+inter-symbol+interference+channels&rft.jtitle=IET+communications&rft.au=Zhao%2C+Shancheng&rft.au=Lu%2C+Zhifei&rft.au=Ma%2C+Xiao&rft.au=Bai%2C+Baoming&rft.date=2013-09-01&rft.pub=John+Wiley+%26+Sons%2C+Inc&rft.issn=1751-8628&rft.eissn=1751-8636&rft.volume=7&rft.issue=14&rft.spage=1522&rft_id=info:doi/10.1049%2Fiet-com.2012.0616&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=3196937261
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