Construction of quasi-cyclic LDPC codes form SFT structure and cyclic shift

Simple item page
dc.contributor.authorTimakul, Sekson
dc.contributor.authorChoomchuay, Somsak
dc.date.accessioned2026-08-06T10:03:21Z
dc.date.available2026-08-06T10:03:21Z
dc.date.issued2011-12-01
dc.description.abstractThis paper presents an alternative a method for designing a parity matrix of low density parity check codes. The proposed method can be viewed as a generalized version of Sridara-Fuja-Tanner (SFT) technique which is ideal for regular quasi cyclic code design. Upon the current investigation, the designed code has delivered a comparable BER-SNR performance when compared with that of more complicate designed matrix. The designed code offers similar performance when compared with Sridara-Fuja-Tanner code and Quadratic Congruences structure. In additions, the resulted matrix also has a desirable structure that it suits well the hardware implementation. © 2011 IEEE.
dc.identifier.citation2011 International Symposium on Intelligent Signal Processing and Communications Systems the Decade of Intelligent and Green Signal Processing and Communications Ispacs 2011, 2011
dc.identifier.doi10.1109/ISPACS.2011.6146084
dc.identifier.other2-s2.0-84857250728
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/3931
dc.source2011 International Symposium on Intelligent Signal Processing and Communications Systems the Decade of Intelligent and Green Signal Processing and Communications Ispacs 2011
dc.subjectLDPC codes
dc.subjectquasi-cyclic (QC) codes
dc.titleConstruction of quasi-cyclic LDPC codes form SFT structure and cyclic shift
dc.typeConference Paper

Files

Collections

Research