15 October 2014 in IEEE Transactions on Wireless Communications
In this paper, we investigate the design of linear precoders for the multiple-input-multiple-output (MIMO) multiple access channel (MAC). We assume that statistical channel state information (CSI) is available at the transmitters and consider the problem under the practical finite alphabet input assumption. First, we derive an asymptotic (in the large system limit) expression for the weighted sum rate (WSR) of the MIMO MAC with finite alphabet inputs and Weichselberger's MIMO channel model. Subsequently, we obtain the optimal structures of the linear precoders of the users maximizing the asymptotic WSR and an iterative algorithm for determining the precoders. We show that the complexity of the proposed precoder design is significantly lower than that of MIMO MAC precoders designed for finite alphabet inputs and instantaneous CSI. Simulation results for finite alphabet signaling indicate that the proposed precoder achieves significant performance gains over existing precoder designs.
11 May 2017 in IEEE Transactions on Communications
In this paper, we investigate secure transmission over the large-scale multiple-antenna wiretap channel with finite alphabet inputs. First, we investigate the case where instantaneous channel state information (CSI) of the eavesdropper is known at the transmitter. We show analytically that a generalized singular value decomposition (GSVD)-based design, which is optimal for Gaussian inputs, may exhibit a severe performance loss for finite alphabet inputs in the high signal-to-noise ratio regime. In light of this, we propose a novel Per-Group-GSVD (PG-GSVD) design, which can effectively compensate the performance loss caused by the GSVD design. More importantly, the computational complexity of the PG-GSVD design is by orders of magnitude lower than that of the existing design for finite alphabet inputs while the resulting performance loss is minimal. Then, we extend the PG-GSVD design to the case where only statistical CSI of the eavesdropper is available at the transmitter. Numerical results indicate that the proposed PG-GSVD design can be efficiently implemented in large-scale multiple-antenna systems and achieves significant performance gains compared with the GSVD design.
8 July 2014 in IEEE Transactions on Signal Processing
We investigate the multiple-input multiple-output broadcast channel with statistical channel state information available at the transmitter. The so-called linear assignment operation is employed, and necessary conditions are derived for the optimal transmit design under general fading conditions. Based on this, we introduce an iterative algorithm to maximize the linear assignment weighted sum-rate by applying a gradient descent method. To reduce complexity, we derive an upper bound of the linear assignment achievable rate of each receiver, from which a simplified closed-form expression for a near-optimal linear assignment matrix is derived. This reveals an interesting construction analogous to that of dirty-paper coding. In light of this, a low-complexity transmission scheme is provided. Numerical examples illustrate the significant performance of the proposed low complexity scheme.
20 February 2009 in IEEE Transactions on Wireless Communications
In this paper, a new algorithm is proposed to estimate mobile speed for broadband wireless communications, which often encounter large number of fading channel taps causing severe intersymbol interference. Different from existing algorithms, which commonly assume that the fading channel coefficients are available for the speed estimators, the proposed algorithm is based on the received signals which contain unknown transmitted data, unknown frequency selective fading channel coefficients possibly including line-of-sight (LOS) components, and random receiver noise. Theoretical analysis is first carried out from the received signals, and a practical algorithm is proposed based on the analytical results. The algorithm employs a modified normalized auto-covariance of received signal power to estimate the speed of mobiles. The algorithm works well for frequency selective Rayleigh and Rician channels. The algorithm is very resistant to noise, it provides accurate speed estimation even if the signal-to-noise ratio (SNR) is as low as 0 dB. Simulation results indicate that the new algorithm is very reliable and effective to estimate mobile speed corresponding to a maximum Doppler up to 500 Hz. The algorithm has high computational efficiency and low estimation latency, with results being available within one second after communication is established.
16 October 2012 in IEEE Journal on Selected Areas in Communications
This paper investigates the linear precoder design for spectrum sharing in multi-antenna cognitive radio networks with finite-alphabet inputs. It formulates the precoding problem by maximizing the constellation-constrained mutual information between the secondary-user transmitter and secondary-user receiver while controlling the interference power to primary-user receivers. This formulation leads to a nonlinear and nonconvex problem, presenting a major barrier to obtain optimal solutions. This work proposes a global optimization algorithm, namely Branch-and-bound Aided Mutual Information Optimization (BAMIO), that solves the precoding problem with arbitrary prescribed tolerance. The BAMIO algorithm is designed based on two key observations: First, the precoding problem for spectrum sharing can be reformulated to a problem minimizing a function with bilinear terms over the intersection of multiple co-centered ellipsoids. Second, these bilinear terms can be relaxed by its convex and concave envelopes. In this way, a sequence of relaxed problems is solved over a shrinking feasible region until the tolerance is achieved. The BAMIO algorithm calculates the optimal precoder and the theoretical limit of the transmission rate for spectrum sharing scenarios. By tuning the prescribed tolerance of the solution, it provides a trade-off between desirable performance and computational complexity. Numerical examples show that the BAMIO algorithm offers near global optimal solution with only several iterations. They also verify that the large performance gain in mutual information achieved by the BAMIO algorithm also represents the large gain in the coded bit-error rate.
15 June 2010 in EURASIP Journal on Advances in Signal Processing
Multiple-input multiple-output (MIMO) underwater acoustic (UWA) channels introduce both space-time interference (STI) and time-varying phase distortion for transmitted signals. In such cases, the equalized symbols produced by conventional equalizer aiming for STI cancelation suffer phase rotation and thus cannot be reliably detected. In this paper, we propose a new equalization scheme for high data rate single carrier MIMO UWA channels. Different from existing methods employing joint equalization and symbolwise phase tracking technology, the proposed scheme decouples the interference cancelation (IC) operation and the phase compensation operation, leading to a generalized equalizer structure combining an IC equalizer with a phase compensator. The decoupling of the two functionalities leads to robust signal detection, which is most desirable in practical UWA applications. MIMO linear equalizer (LE) is adopted to remove space-time interference, and a groupwise phase estimation and correction method is used to compensate the phase rotation. In addition, the layered space-time processing technology is adopted to enhance the equalization performance. The proposed equalization scheme is tested to be very robust with extensive experimental data collected at Kauai, Hawaii, in September 2005, and Saint Margaret's Bay, Nova Scotia, Canada, in May 2006.