A systematic bit-wise decomposition of M-ary symbol metric
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
2751 | en_US |
dc.citation.issue |
10 | en_US |
dc.citation.spage |
2742 | en_US |
dc.citation.volume |
5 | en_US |
dc.citation.woscount |
1 | |
dc.contributor.author |
Chang, Chia-Wei | en_US |
dc.contributor.author |
Chen, Po-Ning | en_US |
dc.contributor.author |
Han, Yunghsiang S. | en_US |
dc.contributor.department |
電信工程研究所 | zh_TW |
dc.contributor.department |
Institute of Communications Engineering | en_US |
dc.date.accessioned |
2014-12-08T15:15:40Z | |
dc.date.available |
2014-12-08T15:15:40Z | |
dc.date.issued |
2006-10-01 | en_US |
dc.description.abstract |
In this paper, we present a systematic recursive formula for bit-wise decomposition of M-ary symbol metric. The decomposed bit metrics can be applied to improve the performance of a system where the information sequence is binary-coded and interleaved before M-ary modulated. A traditional receiver designed for certain system is to de-map the received M-ary symbol, into its binary isomorphism so as to facilitate the subsequent bit-based manipulation, such as hard-decision decoding. With a bit-wise decomposition of M-ary symbol metric, a soft-decision decoder can be used to achieve a better system performance. The idea behind the systematic formula is to decompose the symbol-based maximum-likelihood (ML) metric by equating a number of specific equations that are drawn from squared-error criterion. It interestingly yields a systematic recursive formula that can be applied to some previous work derived from different standpoint. Simulation results based on IEEE 802.11a/g standard show that at bit-error-rate of 10(-5), the proposed bit-wise decomposed metric can provide 3.0 dB, 3.9 dB and 5.1 dB improvement over the concatenation of binary-demapper, deinterleaver and hard-decision decoder respectively for 16QAM, 64QAM and 256QAM symbols, in which the in-phase and quadrature components in a complex M-2-QAM symbol are independently treated as two real M-PAM symbols. Further empirical study on system imperfection implies that the proposed bit-wise decomposed metric also improves the system robustness against gain mismatch and phase imperfection. In the end, a realization structure that avails the recursive nature of the proposed bit-decomposed metric formula is addressed. | en_US |
dc.identifier.doi |
10.1109/TWC.2006.04322 | en_US |
dc.identifier.issn |
1536-1276 | en_US |
dc.identifier.journal |
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1109/TWC.2006.04322 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/11704 | |
dc.identifier.wosnumber |
WOS:000241478400018 | |
dc.language.iso |
en_US | en_US |
dc.subject |
maximum-likelihood decoding | en_US |
dc.subject |
QAM modulation | en_US |
dc.subject |
soft-decision decoding | en_US |
dc.subject |
Viterbi decoder | en_US |
dc.title |
A systematic bit-wise decomposition of M-ary symbol metric | en_US |
dc.type |
Article | en_US |
檔案
- 000241478400018.pdf (637.6 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Chang, C.-W., Chen, P.-N., & Han, Y. S. (2006). A systematic bit-wise decomposition of M-ary symbol metric. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 5(10), 2742–2751. https://doi.org/10.1109/TWC.2006.04322
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/11704