American Journal of Engineering and Applied Sciences | |
Efficient Detection Algorithm for a Multiple-Input and Multiple-Output Multiuser Multi-Carrier Code Division Multiple Access in Time-Varying Channels | Science Publications | |
Kasmiran Jumari1  Fares Sayadi1  Mahamod Ismail1  Norbahiah Misran1  Mardina Abdullah1  | |
关键词: Sphere decoding method; orthogonal projection; low complexity receiver; receiver; time variant channel; Multiple-Input Multiple-Output (MIMO); Multi-Carrier Code Division Multiple Access (MC-CDMA); | |
DOI : 10.3844/ajeassp.2009.635.642 | |
学科分类:工程和技术(综合) | |
来源: Science Publications | |
【 摘 要 】
Problem statement: Maximum Likelihood (ML) decoding has been applied for the uplink ofappr a Multi-Carrier Code Division Multiple Access (MC-CDMA) system based on Orthogonal Frequency Division Multiplexing (OFDM). Multiple-Input Multiple-Output (MIMO) channel from k users, which moves at vehicular speed, to the Base-Station (BS) is time-varying. For time-varying channels, Sphere Decoding (SD) was introduced to perform ML decoding. Whereas, computational complexity of SD (due to a QR-factorization for each symbol), is nevertheless high. Modified SD had been proposed to achieve near optimum solutions that called Subspace-Sphere Decoder (SPSD). Approach: Proposed algorithm was based on subspace and orthogonal projection with very small dimensionality as robustness scheme in an iterative Multi-User Detection (MUD) and Parallel Interference Cancelation (PIC) method. Results: This approach had been achieved intense reduction of computational complexity for time-varying channel via one and more than one order of magnitude at channel estimation and multiuser detection respectively. Furthermore, SPSD was robustness to channel estimation error (about 3.8 dB) as compared to the representative counterparts in literature. Conclusion: Effectiveness of proposed method was demonstrated by simulations.
【 授权许可】
Unknown
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO201911300764094ZK.pdf | 152KB | download |