Abstract
A low-complexity low density parity check (LDPC) coded bit-interleaved coded modulation with iterative decoding (BICM-ID) scheme with orthogonal modulations is proposed. With a novel mapping strategy of coded bits to symbols, the proposed scheme is equivalent to a generalised LDPC code with Hadamard constraints and thus orthogonal demodulation can be merged into the iterative LDPC decoding process, resulting in a simpler implementation and a lower computational complexity. © 2009 The Institution of Engineering and Technology.
| Original language | English |
|---|---|
| Pages (from-to) | 845-846 |
| Journal | Electronics Letters |
| Volume | 45 |
| Issue number | 16 |
| DOIs | |
| Publication status | Published - 2009 |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Funding
This work was fully supported by a grant from the Research Grant Council of the Hong Kong SAR, China [Project No. CityU 117508].
RGC Funding Information
- RGC-funded
Fingerprint
Dive into the research topics of 'Low-complexity LDPC coded BICM-ID with orthogonal modulations'. Together they form a unique fingerprint.Projects
- 1 Finished
-
GRF: Maximum Eigenmode Beamforming with Unbalanced MIMO Configurations
LI, P. (Principal Investigator / Project Coordinator)
1/01/09 → 11/03/13
Project: Research
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver