| Presentation | 2004/2/25 Comparison of Complexity-reduced Maximum Likelihood Detection Based on Symbol Replica-Candidate Selection with QR Decomposition on Throughput and Computational Complexity in OFCDM MIMO Multiplexing Takumi Itoh, Yoshikazu Kakura, Noriyuki Maeda, Hiroyuki Kawai, Kenichi Higuchi, Hiroyuki Seki, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | This paper investigates block error rate (BLER) and throughput performance of complexity-reduced maximum likelihood detection (MLD) based on symbol replica-candidate selection with QR decomposition employing pilot channel-assisted channel estimation and ranking, comparing with conventional minimum mean squared error (MMSE), MLD (i.e., full MLD) and complexity-reduced MLD with MMSE for Orthogonal Frequency and Code Division Multiplexing (OFCDM) MIMO multiplexing. Simulation results show that pilot channel-assisted MLD with QR decomposition could achieve almost identical throughout to that with full MLD for 1 Gbps associated with 16QAM modulation and turbo coding with coding rate of 8/9 under 6-path Rayleigh fading. Furthermore, it could reduce computation complexity to approximately 1/300 that offull MLD in OFCDM access with 8-code multiplexing for the spreading factor of 8 assuming a 100-MHz bandwidth. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | VSF-OFCDM / MIMO / Maximum likelihood detection / BLAST / QR decomposition / M-algorithm |
| Paper # | WBS2003-97,A・P2003-290,RCS2003-313,MoMuC2003-103,MW2003-259 |
| Date of Issue |
| Conference Information | |
| Committee | MoMuC |
|---|---|
| Conference Date | 2004/2/25(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Mobile Multimedia Communications(MoMuC) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Comparison of Complexity-reduced Maximum Likelihood Detection Based on Symbol Replica-Candidate Selection with QR Decomposition on Throughput and Computational Complexity in OFCDM MIMO Multiplexing |
| Sub Title (in English) | |
| Keyword(1) | VSF-OFCDM |
| Keyword(2) | MIMO |
| Keyword(3) | Maximum likelihood detection |
| Keyword(4) | BLAST |
| Keyword(5) | QR decomposition |
| Keyword(6) | M-algorithm |
| 1st Author's Name | Takumi Itoh |
| 1st Author's Affiliation | NEC Corporation() |
| 2nd Author's Name | Yoshikazu Kakura |
| 2nd Author's Affiliation | NEC Corporation |
| 3rd Author's Name | Noriyuki Maeda |
| 3rd Author's Affiliation | NTT DoCoMo, Inc. |
| 4th Author's Name | Hiroyuki Kawai |
| 4th Author's Affiliation | NTT DoCoMo, Inc. |
| 5th Author's Name | Kenichi Higuchi |
| 5th Author's Affiliation | NTT DoCoMo, Inc. |
| 6th Author's Name | Hiroyuki Seki |
| 6th Author's Affiliation | Fujitsu Laboratories Ltd. |
| Date | 2004/2/25 |
| Paper # | WBS2003-97,A・P2003-290,RCS2003-313,MoMuC2003-103,MW2003-259 |
| Volume (vol) | vol.103 |
| Number (no) | 683 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |