Maximal Minimum Hamming Distance Codes for Embedding SI in a Data based BSLM Scheme for PAPR Reduction in OFDM
| Autor: | Aeizaal Azman Abd. Wahab, Hisham Haider Yusef Sa'ad, Adnan Haider Yusef Sa’d |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
Scheme (programming language)
Technology Orthogonal frequency-division multiplexing Strategy and Management General Engineering Hamming distance slm ofdm Reduction (complexity) Management of Technology and Innovation side information Embedding T1-995 blind slm papr Algorithm computer Technology (General) Mathematics computer.programming_language |
| Zdroj: | International Journal of Technology, Vol 12, Iss 2, Pp 412-421 (2021) |
| ISSN: | 2087-2100 2086-9614 |
| Popis: | The bi-orthogonal codes for embedding Side-Information (SI) in data-based blind SLM (BSLM) proposed in Joo et al. (2012) produce better bit error rate (BER) and SI error rate (SIER) performance compared to binary codes. However, the authors do not provide details for code generation; instead, they list some codes with a length of and aminimum Hamming distance of . The suggested bi-orthogonal code does not work for any value of the maximum iteration number other than . Therefore, this paper proposes two algorithms for generating codes for any value of . The proposed methods maintain the normalized minimum Hamming distance between generated codes to . However, the second proposed algorithm, which works in the case of , is also able to only consider codes with a maximum Hamming distance, allowing it to improve SIER performance. Thus, the second proposed algorithm improves SIER performance by up to 1 dB at Eb/No=3dB. Furthermore, the proposed algorithms are able to generate a multiple set of codes that deliver same performance. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|