19 August 2010 in IEEE Transactions on Signal Processing
A new method for multiple-input multiple-output (MIMO) detection with soft-output, the partial marginalization (PM) algorithm, was recently proposed. Advantages of the method are that it is straightforward to parallelize, and that it offers a fully predictable runtime. PM trades performance for computational complexity via a user-defined parameter. In the limit of high computational complexity, the algorithm becomes the MAP demodulator. The PM algorithm also works with soft-input, but until now it has been unclear how to apply it for other modulation formats than binary phase-shift keying (BPSK) per real dimension. In this correspondence, we explain how to extend PM with soft-input to general signaling constellations, while maintaining the low complexity advantage of the original algorithm.
12 December 2011 in IEEE Transactions on Wireless Communications
We compute the random coding error exponent for linear multihop amplify-and-forward (AF) relay channels. Instead of considering only the achievable rate or the error probability as a performance measure separately, the error exponent results can give us insight into the fundamental tradeoff between the information rate and communication reliability in these channels. This measure enables us to determine what codeword length that is required to achieve a given level of communication reliability at a rate below the channel capacity. We first derive a general formula for the random coding exponent of general multihop AF relay channels. Then we present a closed-form expression of a tight upper bound on the random coding error exponent for the case of Rayleigh fading. From the exponent expression, the capacity of these channels is also deduced. The effect of the number of hops on the performance of linear multihop AF relay channels from the error exponent point of view is studied. As an application of the random coding error exponent analysis, we then find the optimal number of hops which maximizes the communication reliability (i.e., the random coding error exponent) for a given data rate. Numerical results verify our analysis, and show the tightness of the proposed bound.
21 December 2011 in IEEE Transactions on Signal Processing
We investigate the problem of broadcasting analog sources to several users using short codes, employing several antennas at both the transmitter and the receiver, and channel-optimized quantization. Our main objective is to minimize the sum mean-square error distortion. A joint multi-user encoder, as well as a structured encoder with separate encoders for the different users, are proposed. The first encoder outperforms the latter, which, in turn, offers large improvements compared to state-of-the-art, over a wide range of channel signal-to-noise ratios. Our proposed methods handle bandwidth expansion, i.e., usage of more channel than source dimensions, automatically. We also derive a lower bound on the distortion.
12 August 2010 in IEEE Transactions on Vehicular Technology
This paper considers the transmission of scheduling information in orthogonal frequency-division multiple-access (OFDMA)-based cellular communication systems such as the Third-Generation Partnership Project (3GPP) long-term evolution (LTE). These systems provide efficient usage of radio resources by allowing users to be dynamically scheduled in both frequency and time. This requires considerable amounts of scheduling information to be sent to the users. This paper compares two basic transmission strategies: transmitting a separate scheduling message to each user versus broadcasting a joint scheduling message to all users. Different scheduling granularities are considered, as are different scheduling algorithms. The schemes are evaluated in the context of the LTE downlink using multiuser system simulations, assuming a full-buffer situation. The results show that separate transmission of the scheduling information requires a slightly lower overhead than joint broadcasting when proportional fair scheduling is employed and the users are spread out over the cell area. The results also indicate that the scheduling granularity standardized for LTE provides a good tradeoff between scheduling granularity and overhead.
7 September 2012 in IEEE Transactions on Signal Processing
We present approximations of the LLR distribution for a class of fixed-complexity soft-output MIMO detectors, such as the optimal soft detector and the soft-output via partial marginalization detector. More specifically, in a MIMO AWGN setting, we approximate the LLR distribution conditioned on the transmitted signal and the channel matrix with a Gaussian mixture model (GMM). Our main results consist of an analytical expression of the GMM model (including the number of modes and their corresponding parameters) and a proof that, in the limit of high SNR, this LLR distribution converges in probability towards a unique Gaussian distribution.