[Paper Review] A Greedy Algorithm of Data-Dependent User Selection for Fast Fading Gaussian Vector Broadcast Channels

Keigo Takeuchi, Tsutomu Kawabata|arXiv (Cornell University)|Jan 31, 2012

Advanced MIMO Systems Optimization20 references3 citations

TL;DR

This paper proposes a data-dependent user selection (US) scheme for fast fading Gaussian vector broadcast channels using zero-forcing beamforming, where user selection depends on both channel state information and data symbols. A greedy algorithm approximates the optimal selection, and iterative decoding enables user detection without feedback overhead, achieving improved energy efficiency, bit error rate, and sum rate compared to conventional data-independent US.

ABSTRACT

User selection (US) with Zero-forcing beamforming is considered in fast fading Gaussian vector broadcast channels with perfect channel state information (CSI) at the transmitter. A novel criterion for US is proposed, which depends on both CSI and the data symbols, while conventional criteria only depend on CSI. Since the optimization of US based on the proposed criterion is infeasible, a greedy algorithm of data-dependent US is proposed to perform the optimization approximately. An overhead issue arises in fast fading channels: On every update of US, the transmitter might inform each user whether he/she has been selected, using a certain fraction of resources. This overhead results in a significant rate loss for fast fading channels. In order to circumvent this overhead issue, iterative detection and decoding schemes are proposed on the basis of belief propagation. The proposed iterative schemes require no information about whether each user has been selected. The proposed US scheme is compared to a data-independent US scheme. The complexity of the two schemes is comparable to each other for fast fading channels. Numerical simulations show that the proposed scheme can outperform the data-independent scheme for fast fading channels in terms of energy efficiency, bit error rate, and achievable sum rate.

Motivation & Objective

• Address the high feedback overhead in fast fading channels where frequent user selection updates are required.
• Overcome the inefficiency of data-independent user selection in fast fading environments by incorporating data symbol information.
• Develop a low-complexity, practical precoding scheme that balances performance and complexity for fast fading vector broadcast channels.
• Enable user detection without explicit feedback by designing iterative receivers based on belief propagation.

Proposed method

• Propose a data-dependent user selection criterion that combines channel state information and data symbol knowledge to minimize effective interference.
• Design a greedy algorithm to approximately solve the intractable optimization problem of data-dependent US, selecting users with high orthogonality and pre-canceling multi-user interference.
• Introduce iterative detection and decoding schemes using belief propagation to allow users to infer their selection status without explicit feedback signaling.
• Derive recursive formulas for the selection metric and beamforming weights to enable efficient online computation during each block.
• Use a block-fading model with small block sizes to reduce the number of interfering signals, enhancing the effectiveness of pre-cancellation.
• Formulate a lower bound on achievable sum rate based on equivalent Gaussian channels to evaluate performance.

Experimental results

Research questions

• RQ1 Can data-dependent user selection improve performance in fast fading vector broadcast channels compared to conventional data-independent schemes?
• RQ2 How can feedback overhead from frequent user selection updates be minimized in fast fading environments?
• RQ3 What is the achievable rate gain of incorporating data symbol information into user selection under zero-forcing beamforming?
• RQ4 Can iterative detection schemes allow users to determine their selection status without explicit feedback?
• RQ5 How does the performance of the proposed scheme scale with block size and number of users in fast fading conditions?

Key findings

• The proposed data-dependent user selection scheme outperforms data-independent schemes in terms of energy efficiency, bit error rate, and achievable sum rate in fast fading channels.
• Numerical simulations confirm that the greedy algorithm achieves near-optimal performance with low complexity, comparable to conventional data-independent US.
• The iterative decoding scheme successfully enables user detection without feedback, eliminating the overhead associated with signaling selection status.
• The sum rate gain is most significant in fast fading regimes due to the reduced number of interfering signals per block and effective pre-cancellation.
• The performance gain arises from combining user selection with data symbol knowledge, allowing better interference pre-cancellation than conventional ZF beamforming.
• The scheme achieves a favorable trade-off between complexity and performance, making it suitable for practical fast fading systems.