Scholarworks Repository

A turbo-decoding message-passing algorithm for sparse parity-check matrix codes

Show simple item record

dc.contributor.author Mansour M.M.
dc.contributor.editor
dc.date 2006
dc.date.accessioned 2017-10-04T11:07:34Z
dc.date.available 2017-10-04T11:07:34Z
dc.date.issued 2006
dc.identifier 10.1109/TSP.2006.880240
dc.identifier.isbn
dc.identifier.issn
dc.identifier.uri http://hdl.handle.net/10938/14702
dc.description.abstract A turbo-decoding message-passing (TDMP) algorithm for sparse parity-check matrix (SPCM) codes such as low-density parity-check, repeat-accumulate, and turbo-like codes is presented. The main advantages of the proposed algorithm over the standard decoding algorithm are 1) its faster convergence speed by a factor of two in terms of decoding iterations, 2) improvement in coding gain by an order of magnitude at high signal-to-noise ratio (SNR), 3) reduced memory requirements, and 4) reduced decoder complexity. In addition, an efficient algorithm for message computation using simple max operations is also presented. Analysis using EXIT charts shows that the TDMP algorithm offers a better performance-complexity tradeoff when the number of decoding iterations is small, which is attractive for high-speed applications. A parallel version of the TDMP algorithm in conjunction with architecture-aware (AA) SPCM codes, which have embedded structure that enables efficient high-throughput decoder implementation, are presented. Design examples of AA-SPCM codes based on graphs with large girth demonstrate that AA-SPCM codes have very good error-correcting capability using the TDMP algorithm. © 2006 IEEE.
dc.format.extent
dc.format.extent Pages: (4376-4392)
dc.language English
dc.publisher PISCATAWAY
dc.relation.ispartof Publication Name: IEEE Transactions on Signal Processing; Publication Year: 2006; Volume: 54; no. 11; Pages: (4376-4392);
dc.relation.ispartofseries
dc.relation.uri
dc.source Scopus
dc.subject.other
dc.title A turbo-decoding message-passing algorithm for sparse parity-check matrix codes
dc.type Article
dc.contributor.affiliation Mansour, M.M., Department of Electrical and Computer Engineering, American University of Beirut, Beirut 1107 2020, Lebanon
dc.contributor.authorAddress Mansour, M.M.; Department of Electrical and Computer Engineering, American University of Beirut, Beirut 1107 2020, Lebanon; email: mmansour@aub.edu.lb
dc.contributor.authorCorporate University: American University of Beirut; Faculty: Faculty of Engineering and Architecture; Department: Electrical and Computer Engineering;
dc.contributor.authorDepartment Electrical and Computer Engineering
dc.contributor.authorDivision
dc.contributor.authorEmail mmansour@aub.edu.lb
dc.contributor.authorFaculty Faculty of Engineering and Architecture
dc.contributor.authorInitials Mansour, MA
dc.contributor.authorOrcidID
dc.contributor.authorReprintAddress Mansour, MA (reprint author), Amer Univ Beirut, Dept Elect and Comp Engn, Beirut 11072020, Lebanon.
dc.contributor.authorResearcherID
dc.contributor.authorUniversity American University of Beirut
dc.description.cited BAHL LR, 1974, IEEE T INFORM THEORY, V20, P284, DOI 10.1109-TIT.1974.1055186; Bangerter B., 2003, INTEL TECHNOL J, V7; BENES VE, 1964, ATandT TECH J, V43, P1641; BERROU C, 1993, IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS 93 : TECHNICAL PROGRAM, CONFERENCE RECORD, VOLS 1-3, P1064, DOI 10.1109-ICC.1993.397441; Blanksby AJ, 2002, IEEE J SOLID-ST CIRC, V37, P404, DOI 10.1109-4.987093; Brink S. T., 2001, IEEE T COMMUN, V49, P1727; Divsalar D., 1998, Proceedings. Thiry-Sixth Annual Allerton Conference on Communication, Control, and Computing; FAN J, LDPC EFFICIENT ALTER; Gallager R., 1963, LOW DENSITY PARITY C; Gross WJ, 2001, IEEE T CIRCUITS-II, V48, P904, DOI 10.1109-82.974777; GUILLOUD F, 2004, THESIS ENST PARIS; Hocevar D. E., 2003, P IEEE INT C COMM, P2708; HU XY, 2001, P IEEE GLOB TEL C IE, pE1036; Jin H., 2001, THESIS CALTECH PASAD; Jin H., 2000, P 2 INT S TURB COD R, P1; Kschischang FR, 1998, IEEE J SEL AREA COMM, V16, P219, DOI 10.1109-49.661110; Lan CF, 2004, IEEE T COMMUN, V52, P1092, DOI 10.1109-TCOMM.2004.831406; Lin S., 2004, ERROR CONTROL CODING; LUBOTZKY A, 1988, COMBINATORICA, V8, P261, DOI 10.1007-BF02126799; Mansour M. M., 2002, P INT S LOW POW EL D, P284; MANSOUR MM, 2002, P IEEE GLOB TEL C 20, P1383; Mansor M, 2003, PASOH: ECOLOGY OF A LOWLAND RAIN FOREST IN SOUTHEAST ASIA, P215; MANSOUR MM, 2005, 39 ANN C INF SCI SYS; Mansour MM, 2003, IEEE T VLSI SYST, V11, P976, DOI 10.1109-TVLSI.2003.817545; MANSOUR MM, 2003, P IEEE INT S CIRC SY, V2, P57; MANSOUR MM, 2002, ANN C INF SCI SYST C; MARGULIS GA, 1982, COMBINATORICA, V2, P71, DOI 10.1007-BF02579283; MCLIECE RJ, 1998, IEEE J SEL AREA COMM, V16, P140; Pearl J., 1988, PROBABILISTIC REASON; RASHI Y, EFFICIENT ALTERNATIV; Richardson TJ, 2001, IEEE T INFORM THEORY, V47, P619, DOI 10.1109-18.910578; Rosenthal J., 2000, P 38 ALL C COMM CONT, P248; Roumy A, 2004, IEEE T INFORM THEORY, V50, P1711, DOI 10.1109-TIT.2004.831778; Royle G., CUBIC CAGES; SONG H, 2002, JPN J APPL PHYS, P1749; TANNER RM, 1981, IEEE T INFORM THEORY, V27, P533, DOI 10.1109-TIT.1981.1056404; Tanner R. M., 1999, P 37 ALL C COMM CONT; TANNER RM, 2001, P INT S COMM THEOR A, P1; Tanner RM, 2004, IEEE T INFORM THEORY, V50, P2966, DOI 10.1109-TIT.2004.838370; TUCHLER M, 2002, C INF SCI SYST PRINC; Vasic B, 2003, J LIGHTWAVE TECHNOL, V21, P438, DOI 10.1109-JLT.2003.808769; Yang M, 2004, IEEE T COMMUN, V52, P564, DOI 10.1109-TCOMM.2004.826367; YEO E, 2001, P IEEE GLOBECOM, P3019; Zhang JT, 2005, IEEE T COMMUN, V53, P209, DOI 10.1109-TCOMM.2004.841982
dc.description.citedCount 52
dc.description.citedTotWOSCount 45
dc.description.citedWOSCount 37
dc.format.extentCount 17
dc.identifier.articleNo
dc.identifier.coden ITPRE
dc.identifier.pubmedID
dc.identifier.scopusID 33750387049
dc.identifier.url
dc.publisher.address 445 HOES LANE, PISCATAWAY, NJ 08855 USA
dc.relation.ispartofConference
dc.relation.ispartofConferenceCode
dc.relation.ispartofConferenceDate
dc.relation.ispartofConferenceHosting
dc.relation.ispartofConferenceLoc
dc.relation.ispartofConferenceSponsor
dc.relation.ispartofConferenceTitle
dc.relation.ispartofFundingAgency
dc.relation.ispartOfISOAbbr IEEE Trans. Signal Process.
dc.relation.ispartOfIssue 11
dc.relation.ispartOfPart
dc.relation.ispartofPubTitle IEEE Transactions on Signal Processing
dc.relation.ispartofPubTitleAbbr IEEE Trans Signal Process
dc.relation.ispartOfSpecialIssue
dc.relation.ispartOfSuppl
dc.relation.ispartOfVolume 54
dc.source.ID WOS:000241537700027
dc.type.publication Journal
dc.subject.otherAuthKeyword Iterative decoding
dc.subject.otherAuthKeyword Low-density parity-check (LDPC) codes
dc.subject.otherAuthKeyword Ramanujan graphs
dc.subject.otherAuthKeyword Repeat-accumulate (RA) codes
dc.subject.otherAuthKeyword Turbo decoding algorithm
dc.subject.otherAuthKeyword Very large scale integration (VLSI) decoder architectures
dc.subject.otherChemCAS
dc.subject.otherIndex Algorithms
dc.subject.otherIndex Error correction
dc.subject.otherIndex Graph theory
dc.subject.otherIndex Iterative methods
dc.subject.otherIndex Signal to noise ratio
dc.subject.otherIndex Turbo codes
dc.subject.otherIndex VLSI circuits
dc.subject.otherIndex Iterative decoding
dc.subject.otherIndex Low-density parity-check (LDPC) codes
dc.subject.otherIndex Ramanujan graphs
dc.subject.otherIndex Repeat-accumulate (RA) codes
dc.subject.otherIndex Sparse parity-check matrix (SPCM) codes
dc.subject.otherIndex Turbo-decoding message-passing (TDMP) algorithm
dc.subject.otherIndex Decoding
dc.subject.otherKeywordPlus REPEAT-ACCUMULATE CODES
dc.subject.otherKeywordPlus DESIGN
dc.subject.otherKeywordPlus GRAPHS
dc.subject.otherWOS Engineering, Electrical and Electronic


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Scholarworks


Browse

My Account