The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
이 편지에서는 코딩된 이중 시공간 전송 다양성-직교 주파수 분할 다중화(DSTTD-OFDM) 시스템을 위한 효율적인 거의 최대 우도(ML) 검출기를 소개합니다. 제안된 Near-ML 검출기는 완화된 최소화 방법을 통해 후보 벡터 집합을 구성합니다. 계산 부하를 줄여줍니다. O(2|A|2)에 O(|A|2), 여기서 |A| 변조 차수입니다. 수치 결과는 제안된 거의 ML에 가까운 검출기가 거의 ML에 가까운 성능과 상당한 복잡성 감소를 모두 제공한다는 것을 나타냅니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Hyounkuk KIM, Hyuncheol PARK, "Reduced-Complexity Near-ML Detector for a Coded DSTTD-OFDM System" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 11, pp. 3749-3752, November 2008, doi: 10.1093/ietcom/e91-b.11.3749.
Abstract: This letter introduces an efficient near-maximum likelihood (ML) detector for a coded double space-time transmit diversity-orthogonal frequency division multiplexing (DSTTD-OFDM) system. The proposed near-ML detector constructs a candidate vector set through a relaxed minimization method. It reduces computational loads from O(2|A|2) to O(|A|2), where |A| is the modulation order. Numerical results indicate that the proposed near-ML detector provides both almost ML performance and considerable complexity savings.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.11.3749/_p
부
@ARTICLE{e91-b_11_3749,
author={Hyounkuk KIM, Hyuncheol PARK, },
journal={IEICE TRANSACTIONS on Communications},
title={Reduced-Complexity Near-ML Detector for a Coded DSTTD-OFDM System},
year={2008},
volume={E91-B},
number={11},
pages={3749-3752},
abstract={This letter introduces an efficient near-maximum likelihood (ML) detector for a coded double space-time transmit diversity-orthogonal frequency division multiplexing (DSTTD-OFDM) system. The proposed near-ML detector constructs a candidate vector set through a relaxed minimization method. It reduces computational loads from O(2|A|2) to O(|A|2), where |A| is the modulation order. Numerical results indicate that the proposed near-ML detector provides both almost ML performance and considerable complexity savings.},
keywords={},
doi={10.1093/ietcom/e91-b.11.3749},
ISSN={1745-1345},
month={November},}
부
TY - JOUR
TI - Reduced-Complexity Near-ML Detector for a Coded DSTTD-OFDM System
T2 - IEICE TRANSACTIONS on Communications
SP - 3749
EP - 3752
AU - Hyounkuk KIM
AU - Hyuncheol PARK
PY - 2008
DO - 10.1093/ietcom/e91-b.11.3749
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2008
AB - This letter introduces an efficient near-maximum likelihood (ML) detector for a coded double space-time transmit diversity-orthogonal frequency division multiplexing (DSTTD-OFDM) system. The proposed near-ML detector constructs a candidate vector set through a relaxed minimization method. It reduces computational loads from O(2|A|2) to O(|A|2), where |A| is the modulation order. Numerical results indicate that the proposed near-ML detector provides both almost ML performance and considerable complexity savings.
ER -