Show simple item record

dc.contributor.authorYahya, A.
dc.contributor.authorSidek, O.
dc.contributor.authorSalleh, M. F. M.
dc.contributor.authorFarid, Ghani, Prof.
dc.date.accessioned2010-08-13T06:32:05Z
dc.date.available2010-08-13T06:32:05Z
dc.date.issued2009-05-24
dc.identifier.citationp.183-187en_US
dc.identifier.isbn978-0-7695-3611-8
dc.identifier.urihttp://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5072428
dc.identifier.urihttp://dspace.unimap.edu.my/123456789/8657
dc.descriptionLink to publisher's homepage at http://ieeexplore.ieee.org/en_US
dc.description.abstractTo cut down the hardware implementation cost this paper presents an efficient method to construct large girth Quasi-Cyclic low density parity check (QCLDPC) codes. The row groups are paired two times the row weight, which has the complexity as compared to the connection of individual columns and rows. The complexity of directing within groups estimates on the transposition employed to connect rows and columns between groups. The newly obtained codes are incorporated with diversity techniques and are employed as a forward error correction codes to cater for some anti-jamming (AJ) competences in the presence of partial band noise jamming (PBNJ). The robustness of two girth-twelve QC-LDPC codes is evidenced by comparing it with randomly constructed LDPC codes and QC-LDPC codes proposed in [14].en_US
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Elctronics Engineering (IEEE)en_US
dc.relation.ispartofseriesProceedings of the 5th Advanced International Conference on Telecommunications (AICT) 2009en_US
dc.subjectAnti-jammingen_US
dc.subjectDiversity techniquesen_US
dc.subjectEfficient methoden_US
dc.subjectForward error correction codesen_US
dc.subjectHardware implementationsen_US
dc.subjectAdvanced International Conference on Telecommunications (AICT)en_US
dc.subjectQuasi-Cyclic low density parity check (QC-LDPC)en_US
dc.titleRow division method to generate QC-LDPC codesen_US
dc.typeWorking Paperen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record