Open Access System for Information Sharing

Login Library

 

Article
Cited 9 time in webofscience Cited 13 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorYang, KC-
dc.date.accessioned2016-03-31T12:32:49Z-
dc.date.available2016-03-31T12:32:49Z-
dc.date.created2009-08-19-
dc.date.issued2004-03-
dc.identifier.issn0018-9448-
dc.identifier.other2004-OAK-0000004119-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/18024-
dc.description.abstractRepeat-accumulate (RA) codes are random-like codes having remarkably good performance over an additive white Gaussian noise (AWGN) channel, like turbo and low-density parity-check (LDPC) codes. In this correspondence, we introduce an ensemble of random codes called "weighted nonbinary repeat-accumulate (WNRA) codes" whose encoder consists of a nonbinary repeater, a weighter, a pseudorandom symbol interleaver, and an accumulator over a finite field GF (q). They can be decoded in a simple way by applying the sum-product algorithm to their factor graphs over GF (q). Simulation results show that WNRA codes with proper weighting values over GF (4) or GF (8) are superior to binary RA codes on AWGN channels.-
dc.description.statementofresponsibilityX-
dc.languageEnglish-
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGI-
dc.relation.isPartOfIEEE TRANSACTIONS ON INFORMATION THEORY-
dc.subjectfactor graph-
dc.subjectiterative decoding-
dc.subjectrepeat-accumulate (RA) codes-
dc.subjectsum-product algorithm-
dc.subjectPARITY-CHECK CODES-
dc.titleWeighted nonbinary repeat-accumulate codes-
dc.typeArticle-
dc.contributor.college전자전기공학과-
dc.identifier.doi10.1109/TIT.2004.825255-
dc.author.googleYang, KC-
dc.relation.volume50-
dc.relation.issue3-
dc.relation.startpage527-
dc.relation.lastpage531-
dc.contributor.id10055166-
dc.relation.journalIEEE TRANSACTIONS ON INFORMATION THEORY-
dc.relation.indexSCI급, SCOPUS 등재논문-
dc.relation.sciSCI-
dc.collections.nameJournal Papers-
dc.type.rimsART-
dc.identifier.bibliographicCitationIEEE TRANSACTIONS ON INFORMATION THEORY, v.50, no.3, pp.527 - 531-
dc.identifier.wosid000220242200010-
dc.date.tcdate2019-01-01-
dc.citation.endPage531-
dc.citation.number3-
dc.citation.startPage527-
dc.citation.titleIEEE TRANSACTIONS ON INFORMATION THEORY-
dc.citation.volume50-
dc.contributor.affiliatedAuthorYang, KC-
dc.identifier.scopusid2-s2.0-1842481634-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.wostc7-
dc.type.docTypeArticle-
dc.subject.keywordAuthorfactor graph-
dc.subject.keywordAuthoriterative decoding-
dc.subject.keywordAuthorrepeat-accumulate (RA) codes-
dc.subject.keywordAuthorsum-product algorithm-
dc.relation.journalWebOfScienceCategoryComputer Science, Information Systems-
dc.relation.journalWebOfScienceCategoryEngineering, Electrical & Electronic-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaComputer Science-
dc.relation.journalResearchAreaEngineering-

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

양경철YANG, KYEONG CHEOL
Dept of Electrical Enginrg
Read more

Views & Downloads

Browse