dc.contributor.author |
Zhang Peng W |
|
dc.contributor.author |
Lau Francis CM |
|
dc.contributor.author |
Sham Chiu-W |
|
dc.date.accessioned |
2020-11-06T00:35:31Z |
|
dc.date.available |
2020-11-06T00:35:31Z |
|
dc.identifier.citation |
16 Oct 2020. Arxiv. 43 pages |
|
dc.identifier.uri |
http://hdl.handle.net/2292/53467 |
|
dc.description.abstract |
In this paper, we propose a new method to design low-density parity-check
Hadamard (LDPC-Hadamard) codes, a type of ultimate-Shannon-limit approaching
channel codes. The technique is based on applying Hadamard constraints to the
check nodes in a generalized protograph-based LDPC code, followed by lifting
the generalized protograph. We name the codes formed protograph-based LDPC
Hadamard (PLDPC-Hadamard) codes. We also propose a modified Protograph
Extrinsic Information Transfer (PEXIT) algorithm for analyzing and optimizing
PLDPC-Hadamard code designs. The proposed algorithm further allows the analysis
of PLDPC-Hadamard codes with degree-1 and/or punctured nodes. We find codes
with decoding thresholds ranging from -1.53 dB to -1.42 dB. At a BER of 1e-5,
the gaps of our codes to the ultimate-Shannon-limit range from 0.40 dB (for
rate = 0.0494) to 0.16 dB (for rate = 0.003). Moreover, the error performance
of our codes is comparable to that of the traditional LDPC-Hadamard codes.
Finally, the BER performances of our codes after puncturing are simulated and
compared. |
|
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. |
|
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
|
dc.rights.uri |
https://arxiv.org/licenses/nonexclusive-distrib/1.0/license.html |
|
dc.subject |
cs.IT |
|
dc.subject |
cs.IT |
|
dc.subject |
math.IT |
|
dc.title |
Protograph-Based Low-Density Parity-Check Hadamard Codes |
|
dc.type |
Journal Article |
|
dc.date.updated |
2020-10-23T11:36:34Z |
|
dc.rights.holder |
Copyright: The authors |
en |
pubs.author-url |
http://arxiv.org/abs/2010.08285v1 |
|
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |
pubs.elements-id |
820284 |
|