Orthogonal Codes for Robust Low-Cost Communication

Orthogonal coding schemes, known to asymptotically achieve the capacity per unit cost (CPUC) for single-user ergodic memoryless channels with a zero-cost input symbol, are investigated for single-user compound memoryless channels, which exhibit uncertainties in their input-output statistical relationships. A minimax formulation is adopted to attain robustness. First, a class of achievable rates per unit cost (ARPUC) is derived, and its utility is demonstrated through several representative case studies. Second, when the uncertainty set of channel transition statistics satisfies a convexity property, optimization is performed over the class of ARPUC through utilizing results of minimax robustness. The resulting CPUC lower bound indicates the ultimate performance of the orthogonal coding scheme, and coincides with the CPUC under certain restrictive conditions. Finally, still under the convexity property, it is shown that the CPUC can generally be achieved, through utilizing a so-called mixed strategy in which an orthogonal code contains an appropriate composition of different nonzero-cost input symbols.Comment: 2nd revision, accepted for publicatio

SGD Frequency-Domain Space-Frequency Semiblind Multiuser Receiver with an Adaptive Optimal Mixing Parameter

A novel stochastic gradient descent frequency-domain (FD) space-frequency (SF) semiblind multiuser receiver with an adaptive optimal mixing parameter is proposed to improve performance of FD semiblind multiuser receivers with a fixed mixing parameters and reduces computational complexity of suboptimal FD semiblind multiuser receivers in SFBC downlink MIMO MC-CDMA systems where various numbers of users exist. The receiver exploits an adaptive mixing parameter to mix information ratio between the training-based mode and the blind-based mode. Analytical results prove that the optimal mixing parameter value relies on power and number of active loaded users existing in the system. Computer simulation results show that when the mixing parameter is adapted closely to the optimal mixing parameter value, the performance of the receiver outperforms existing FD SF adaptive step-size (AS) LMS semiblind based with a fixed mixing parameter and conventional FD SF AS-LMS training-based multiuser receivers in the MSE, SER and signal to interference plus noise ratio in both static and dynamic environments

Coded DS-CDMA Systems with Iterative Channel Estimation and no Pilot Symbols

In this paper, we describe direct-sequence code-division multiple-access (DS-CDMA) systems with quadriphase-shift keying in which channel estimation, coherent demodulation, and decoding are iteratively performed without the use of any training or pilot symbols. An expectation-maximization channel-estimation algorithm for the fading amplitude, phase, and the interference power spectral density (PSD) due to the combined interference and thermal noise is proposed for DS-CDMA systems with irregular repeat-accumulate codes. After initial estimates of the fading amplitude, phase, and interference PSD are obtained from the received symbols, subsequent values of these parameters are iteratively updated by using the soft feedback from the channel decoder. The updated estimates are combined with the received symbols and iteratively passed to the decoder. The elimination of pilot symbols simplifies the system design and allows either an enhanced information throughput, an improved bit error rate, or greater spectral efficiency. The interference-PSD estimation enables DS-CDMA systems to significantly suppress interference.Comment: To appear, IEEE Transactions on Wireless Communication

Joint data detection and channel estimation for OFDM systems

We develop new blind and semi-blind data detectors and channel estimators for orthogonal frequency-division multiplexing (OFDM) systems. Our data detectors require minimizing a complex, integer quadratic form in the data vector. The semi-blind detector uses both channel correlation and noise variance. The quadratic for the blind detector suffers from rank deficiency; for this, we give a low-complexity solution. Avoiding a computationally prohibitive exhaustive search, we solve our data detectors using sphere decoding (SD) and V-BLAST and provide simple adaptations of the SD algorithm. We consider how the blind detector performs under mismatch, generalize the basic data detectors to nonunitary constellations, and extend them to systems with pilots and virtual carriers. Simulations show that our data detectors perform well

A new subspace method for blind estimation of selective MIMO-STBC channels

In this paper, a new technique for the blind estimation of frequency and/or time-selective multiple-input multiple-output (MIMO) channels under space-time block coding (STBC) transmissions is presented. The proposed method relies on a basis expansion model (BEM) of the MIMO channel, which reduces the number of parameters to be estimated, and includes many practical STBC-based transmission scenarios, such as STBC-orthogonal frequency division multiplexing (OFDM), space-frequency block coding (SFBC), time-reversal STBC, and time-varying STBC encoded systems. Inspired by the unconstrained blind maximum likelihood (UML) decoder, the proposed criterion is a subspace method that efficiently exploits all the information provided by the STBC structure, as well as by the reduced-rank representation of the MIMO channel. The method, which is independent of the specific signal constellation, is able to blindly recover the MIMO channel within a small number of available blocks at the receiver side. In fact, for some particular cases of interest such as orthogonal STBC-OFDM schemes, the proposed technique blindly identifies the channel using just one data block. The complexity of the proposed approach reduces to the solution of a generalized eigenvalue (GEV) problem and its computational cost is linear in the number of sub-channels. An identifiability analysis and some numerical examples illustrating the performance of the proposed algorithm are also providedThis work was supported by the Spanish Government under projects TEC2007-68020-C04-02/TCM (MultiMIMO) and CONSOLIDER-INGENIO 2010 CSD2008-00010 (COMONSENS)

Multiuser MIMO-OFDM for Next-Generation Wireless Systems

This overview portrays the 40-year evolution of orthogonal frequency division multiplexing (OFDM) research. The amelioration of powerful multicarrier OFDM arrangements with multiple-input multiple-output (MIMO) systems has numerous benefits, which are detailed in this treatise. We continue by highlighting the limitations of conventional detection and channel estimation techniques designed for multiuser MIMO OFDM systems in the so-called rank-deficient scenarios, where the number of users supported or the number of transmit antennas employed exceeds the number of receiver antennas. This is often encountered in practice, unless we limit the number of users granted access in the base station’s or radio port’s coverage area. Following a historical perspective on the associated design problems and their state-of-the-art solutions, the second half of this treatise details a range of classic multiuser detectors (MUDs) designed for MIMO-OFDM systems and characterizes their achievable performance. A further section aims for identifying novel cutting-edge genetic algorithm (GA)-aided detector solutions, which have found numerous applications in wireless communications in recent years. In an effort to stimulate the cross pollination of ideas across the machine learning, optimization, signal processing, and wireless communications research communities, we will review the broadly applicable principles of various GA-assisted optimization techniques, which were recently proposed also for employment inmultiuser MIMO OFDM. In order to stimulate new research, we demonstrate that the family of GA-aided MUDs is capable of achieving a near-optimum performance at the cost of a significantly lower computational complexity than that imposed by their optimum maximum-likelihood (ML) MUD aided counterparts. The paper is concluded by outlining a range of future research options that may find their way into next-generation wireless systems

A Differential Turbo Detection Aided Sphere Packing Modulated Space-Time Coding Scheme

A signal construction method that combines orthogonal design with sphere packing has recently shown useful performance improvements over the conventional orthogonal design. In this contribution, we extend this concept and propose a novel Sphere Packing (SP) modulated differential Space-Time Block Coded (DSTBC) scheme, referred to here as (DSTBC-SP), which shows performance advantages over conventional DSTBC schemes. We also demonstrate that the performance of DSTBC-SP systems can be further improved by concatenating sphere packing aided modulation with channel coding and performing SP-symbol-to bit demapping as well as channel decoding iteratively. We also investigate the convergence behaviour of this concatenated scheme with the aid of Extrinsic Information Transfer (EXIT) Charts. The proposed turbo-detected DSTBC-SP scheme exhibits a ’turbo-cliff’ at Eb/N0 = 6dB and provides Eb/N0 gains of 23.7dB and 1.7dB at a BER of 10?5 over an equivalent-throughput uncoded DSTBC-SP scheme and a turbo-detected QPSK modulated DSTBC scheme, respectively