Computer Science – Information Theory
Scientific paper
2011-01-12
Computer Science
Information Theory
7 pages, 7 figures. Accepted by Journal of Communications and Networks
Scientific paper
In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user MIMO (MU-MIMO) systems. The proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous reduction in the precoding latency. The complexity of the proposed encoder is also analyzed, and we propose two techniques that reduce it. Simulation and analytical results demonstrate that in a 4 by 4 MU-MIMO system, the proposed FSE requires only 11.5% of the computational complexity needed by the conventional QRD-M encoder (QRDM-E). Also, the encoding throughput of the proposed encoder is 7.5 times that of the QRDM-E with tolerable degradation in the BER performance, while achieving the optimum diversity order.
Chang KyungHi
Mohaisen Manar
No associations
LandOfFree
Fixed-complexity Sphere Encoder for Multi-user MIMO Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fixed-complexity Sphere Encoder for Multi-user MIMO Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixed-complexity Sphere Encoder for Multi-user MIMO Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-264176