SVD-Based Techniques for Zero-Padded Block Transmission Over Fading Channels

In this paper, the performance of filter bank transceivers in the presence of a dispersive time-variant channel is investigated. It is well known that filter bank transceivers can be adapted to the channel transfer function to yield intersymbol interference (ISI) cancellation. When the channel is time variant, several problems arise, since the transceiver should be changed whenever the channel evolves. In this paper, we will allow both the transmitter and the receiver to change and satisfy the interference-free condition, under the assumption of a zero-padded block transmission. In this case, the optimum transmitter-receiver pair can be computed by using a singular value decomposition (SVD) of the channel matrix. A fast receiver adaptation based on SVD tracking is presented. Simulation results show that minimum performance loss with respect to the optimum receiver can be achieved for our reduced complexity receiver     

Fast adaptive equalization/diversity combining for time-varyingdispersive channels

We examine adaptive equalization and diversity combining methods for fast Rayleigh-fading frequency selective channels. We assume a block adaptive receiver in which the receiver coefficients are obtained from feedforward channel estimation. For the feedforward channel estimation, we propose a novel reduced dimension channel estimation procedure, where the number of unknown parameters are reduced using a priori information of the transmit shaping filter's impulse response. Fewer unknown parameters require a shorter training sequence. We obtain least-squares, maximum-likelihood, and maximum a posteriori (MAP) estimators for the reduced dimension channel estimation problem. For symbol detection, we propose the use of a matched filtered diversity combining decision feedback equalizer (DFE) instead of a straightforward diversity combining DFE. The matched filter form has lower computational complexity and provides a well-conditioned matrix inversion. To cope with fast time-varying channels, we introduce a new DFE coefficient computation algorithm which is obtained by incorporating the channel variation during the decision delay into the minimum mean square error (MMSE) criterion. We refer to this as the non-Toeplitz DFE (NT-DFE). We also show the feasibility of a suboptimal receiver which has a lower complexity than a recursive least squares adaptation, with performance close to the optimal NT-DFE     

Joint Design of Groupwise STBC and SIC Based Receiver

In this letter, we propose a simple groupwise space-time block code (GSTBC) which can be easily applied to a large number of transmit antennas and be effectively decoded by a low complexity successive interference cancellation (SIC) based receiver. The proposed GSTBC and SIC based receiver are jointly designed and the diversity repetition in GSTBC is used to induce the dimension expansion that can be exploited by the SIC based receiver to suppress interfering signals as well as to obtain diversity gain. Our proposed scheme provides a near maximum likelihood (ML) performance while keeping a reasonably low complexity at the receiver.     

大规模MU-MIMO系统下的预编码技术研究

在大规模MU-MIMO系统中提出一种预编码技术,即特征波束形成结合空时分组编码.在发射端,利用大规模MI-MO形成正交波束,将空时分组码分布在这些波束上进行传输.而在接收端,空时分组码根据传统的译码算法解码.此技术能够同时获得分集增益和波束形成增益,还可以大大降低接收端的复杂度.在多用户系统中,它的性能都优于其他传统的编码方式.仿真结果也验证了该方法的有效性.     

Gain-Adaptive Vector Quantization with Application to Speech Coding

The generalization of gain adaptation to vector quantization (VQ) is explored in this paper and a comprehensive examination of alternative techniques is presented. We introduce a class of adaptive vector quantizers that can dynamically adjust the "gain" or amplitude scale of code vectors according to the input signal level. The encoder uses a gain estimator to determine a suitable normalization of each input vector prior to VQ encoding. The normalized vectors have reduced dynamic range and can then be more efficiently coded. At the receiver, the VQ decoder output is multiplied by the estimated gain. Both forward and backward adaptation are considered and several different gain estimators are compared and evaluated. Gain-adaptive VQ can be used alone for "vector PCM" coding (i.e., direct waveform VQ) or as a building block in other vector coding schemes. The design algorithm for generating the appropriate gain-normalized VQ codebook is introduced. When applied to speech coding, gain-adaptive VQ achieves significant performance improvement over fixed VQ with a negligible increase in complexity.     

一种基于准正交空时码的低复杂度 MIMO差分检测方法

针对可实现全速率传输的准正交空时码,提出了一种低复杂度的准正交MIMO差分检测方法.该方法在发射端对数据比特进行联合星座映射,构造准正交空时码进行差分编码;接收端采用最大似然准则对两组星座符号对(symbol pair)并行差分检测.本文提出的星座集合及联合星座映射方法简化了接收端检测算法,降低了检测计算复杂度.     

MUI-free receiver for a synchronous DS-CDMA system based on blockspreading in the presence of frequency-selective fading

We discuss a synchronous direct-sequence code division multiple-access (DS-CDMA) system based on block spreading in the presence of frequency-selective fading. Note that block spreading, which is also known as chip interleaving, refers to a spreading of a data block sequence, which is obtained by dividing a data symbol sequence into consecutive blocks. For such a system, we develop a simple new receiver that completely removes the multiuser interference (MUI) without using any channel information. The MUI-free operation is obtained by the use of a shift-orthogonal set of code sequences on which this receiver is based. Within the framework of the MUI-free receiver, we further present a subspace deterministic blind single-user channel estimation algorithm. As a benchmark for the MUI-free receiver and the corresponding subspace deterministic blind single-user channel estimation algorithm, we consider the linear multiuser equalizer and the corresponding subspace deterministic blind multiuser channel estimation algorithm developed by Liu and Xu (1996) for a standard synchronous DS-CDMA system in the presence of frequency-selective fading. We show that the complexity of the MUI-free receiver using the corresponding subspace deterministic blind single-user channel estimation algorithm is much smaller than the complexity of the linear multiuser equalizer using the corresponding subspace deterministic blind multiuser channel estimation algorithm. We further show that the performance of the MUI-free receiver is comparable with the performance of the linear multiuser equalizer. This is for the case in which the channels are known as well as for the case in which the channels are estimated with the corresponding subspace deterministic blind channel estimation algorithm     

Leveraging coherent space-time codes for noncoherent communication via training

Training codes are introduced for the multiple-antenna, noncoherent, multiple block-Rayleigh-fading channel in which the fading coefficients, which are constant over a fixed number of dimensions (coherence interval) for each block and then change independently to a new realization, are known neither at the transmitter nor at the receiver. Each codeword of a training code consists of a part known to the receiver-used to form a minimum mean-squared error (MMSE) estimate of the channel-and a part that contains codeword(s) of a space-time block or trellis code designed for the coherent channel (in which the receiver has perfect knowledge of the channel). The channel estimate is used as if it were error-free for decoding the information-bearing part of the training codeword. Training codes are hence easily designed to have high rate and low decoding complexity by choosing the underlying coherent code to have high rate and to be efficiently decodable. Conditions for which the estimator-detector (E-D) receiver is equivalent to the optimal noncoherent receiver are established. A key performance analysis result of this paper is that the training codes when decoded with the E-D receiver achieve a diversity order of the error probability that is equal to the diversity order of the underlying coherent code. In some cases, the performance of training codes can be measured relative to coherent reception via "training efficiency," which is then optimized over the energy allocation between the training and data phases. In the limit of increasing block lengths, training codes always achieve the performance of coherent reception. The examples of training codes provided in this work have polynomial complexity in rate but an error rate comparable to the best performing unitary designs available, even though the latter require exponential decoding complexity.     

Robust Iterative Noncoherent Reception of Coded FSK over Block Fading Channels

An iterative noncoherent receiver is developed for bit-interleaved coded orthogonal multiple frequency-shift keying (FSK) over block fading channels. The receiver uses the Expectation Maximization (EM) algorithm to jointly estimate the received amplitude and noise spectral density of each block. The received symbols and their corresponding channel estimates are passed through a soft-output demapper, deinterleaved, and decoded. Soft-outputs from the decoder are passed back to the channel estimator and demapper to refine estimates of the channel and bit likelihoods, respectively. Several techniques for reducing the estimator's complexity are discussed, and the performance is assessed through simulation.     

CRC-AIDED TURBO EQUALIZATION FOR MIMO FREQUENCY SELECTIVE FADING CHANNELS

This paper presents a CRC （Cyclic Redundancy Check）-aided turbo equalization approach to reduce the computational complexity. In this approach, CRC code bits are padded to the end of each transmit block, and a cyclic redundancy check is performed after decoding each block at the receiver en.d. If the check sum is zero, which means the receive block is correct, the corresponding LLRs （Log Likelihood Ratios） of this block are set high reliable values, and all the computations corresponding to this block can be cancelled for the subsequent outer iterations. With a lower computational complexity the proposed approach can achieve the same as or even better performance than the conventional non-CRC method.     

On the design of space-time and space-frequency codes for MIMO frequency-selective fading channels

The authors introduced an algebraic design framework for space-time coding in flat-fading channels . We extend this framework to design algebraic codes for multiple-input multiple-output (MIMO) frequency-selective fading channels. The proposed codes strive to optimally exploit both the spatial and frequency diversity available in the channel. We consider two design approaches: The first uses space-time coding and maximum likelihood decoding to exploit the multi-path nature of the channel at the expense of increased receiver complexity. Within this time domain framework, we also propose a serially concatenated coding construction which is shown to offer a performance gain with a reasonable complexity iterative receiver in some scenarios. The second approach utilizes the orthogonal frequency division multiplexing technique to transform the MIMO multipath channel into a MIMO flat block fading channel. The algebraic framework is then used to construct space-frequency codes (SFC) that optimally exploit the diversity available in the resulting flat block fading channel. Finally, the two approaches are compared in terms of decoder complexity, maximum achievable diversity advantage, and simulated frame error rate performance in certain representative scenarios.     

基于MIMO系统的差分解码算法及性能分析

针对两用户MIMO系统,首先提出了一种基于正交空时分组码的部分差分解码算法,接收端获得一个用户的信道状态信息即可实现对两个用户的解码;然后给出了一种针对两用户MIMO系统的完全差分解码算法,可以在没有任何一个用户的信道状态信息情况下进行解码;最后针对该算法进行了复杂度分析和旋转预编码优化,并通过仿真给出了最优旋转角度。计算机仿真证明该完全差分解码算法有效地降低了解码复杂度。     

Receiver Design for Single-Carrier Block Transmission Over Doubly Selective Channels

Single-carrier block transmission is an alternative scheme to orthogonal frequency-division multiplexing (OFDM) for wireless broadband communications. In this paper, a receiver is designed for single-carrier block transmission with cyclic prefix for mobile broadband communications. As the wireless transmission is over doubly selective channels, a basis expansion model is used to capture both the time- and frequency-selectivity of the channel and is parameterized for the receiver design. The receiver estimates the channel model coefficients in the time domain and uses these coefficients for equalization in the frequency domain. The channel estimation is assisted by time-domain pilot insertion. The structure of the frequency-domain channel matrix is exploited and a linear minimum mean-square error equalizer is used for the equalization. When the basis expansion model well matches the physical channel, simulation results show superior receiving performance of the proposed system compared with the OFDM system with a similar complexity.     

An efficient implementation of a maximum-likelihood detector for space-time block coded systems

We investigate maximum-likelihood (ML) sequence estimation for space-time block coded systems without assuming channel knowledge. The quadratic form of the ML receiver in this case does not readily lend itself to efficient implementation. However, under quasi-static channel conditions, the likelihood function reduces to a simple form similar to the classical correlation receiver in matrix notation. It also allows the development of a recursive expression that can be easily implemented by a Viterbi-type algorithm with a reasonable complexity. Although the receiver is suboptimum for the nonstatic case, its performance is close to the optimum for a range of signal-to-noise ratios.     

A novel low‐complexity transmission power adaptation in MC‐CDMA systems with a‐MRC receiver over Nakagami‐m fading channels

In this paper, we propose a novel low‐complexity transmission power adaptation with good bit error rate (BER) performance for multicarrier code‐division multiple‐access (MC‐CDMA) systems over Nakagami‐m fading channels. We first propose a new receiver called ath‐order‐maximal‐ratio‐combining (a‐MRC) receiver with which the receiver power gain for the nth subcarrier is the ath (a?1) power of the corresponding channel gain. Incorporating the a‐MRC receiver, we then propose a new transmission power adaptation scheme where the transmission power is allocated over all the N subcarriers according to the subchannel gains and the transmitter adapts its power to maintain a constant signal‐to‐interference‐plus‐noise (SINR) at the receiver. The proposed scheme has a significant performance gain over the nonadaptive transmission scheme over both independent and correlated fading channels. Moreover, the proposed scheme keeps good BER performance while it is much simpler than the previous power control/adaptation schemes. Copyright © 2008 John Wiley & Sons, Ltd.     

Adaptive Channel‐Matched Extended Alamouti Space‐Time Code Exploiting Partial Feedback

Since the publication of Alamouti's famous space‐time block code, various quasi‐orthogonal space‐time block codes (QSTBC) for multi‐input multi‐output (MIMO) fading channels for more than two transmit antennas have been proposed. It has been shown that these codes cannot achieve full diversity at full rate. In this paper, we present a simple feedback scheme for rich scattering (flat Rayleigh fading) MIMO channels that improves the coding gain and diversity of a QSTBC for 2ⁿ (n = 3, 4,…) transmit antennas. The relevant channel state information is sent back from the receiver to the transmitter quantized to one or two bits per code block. In this way, signal transmission with an improved coding gain and diversity near to the maximum diversity order is achieved. Such high diversity can be exploited with either a maximum‐likelihood receiver or low‐complexity zero‐forcing receiver.     

A Stabilized Multichannel Fast RLS Algorithm for Adaptive Transmultiplexer Receivers

The transmultiplexer (TMUX) system has been studied for its application to multicarrier communications. The channel impairments including noise, interference, and distortion draw the need for adaptive reconstruction at the TMUX receiver. Among possible adaptive methods, the recursive least squares (RLS) algorithm is appealing for its good convergence rate and steady state performance. However, higher computational complexity due to the matrix operation is the drawback of utilizing RLS. A fast RLS algorithm used for adaptive signal reconstruction in the TMUX system is developed in this paper. By using the polyphase decomposition method, the adaptive receiver in the TMUX system can be formulated as a multichannel filtering problem, and the fast algorithm is obtained through the block Toeplitz matrix structure of received signals. In addition to the reduction of complexity, simulation results show that the adaptive TMUX receiver has a convergence rate close to that of the standard RLS algorithm and the performance approaches the minimum mean square error solution.     

Low-complexity FTN receivers based on frequency domain iterative decision feedback equalization

Faster-than-Nyquist (FTN) signaling can improve the system effectiveness without reducing the system reliability,but the fierce inter-symbol interference (ISI) introduced by it may cause that the complexity of the optimal receiver is intolerable.An effective low-complexity FTN receiver is iterative block decision feedback equalizer (IBDFE),which can achieve performance close to the optimal receiver with much lower complexity,but its complexity can be further reduced.Therefore,a reduced-complexity IBDFE (RC-IBDFE) was proposed for FTN communication systems,which was based on IBDFE,but introduced a simplified method to design the feedforward and feedback filters.When packing factor is τ={0.8,0.7},numerical results and analysis indicate that,compared with IBDFE,RC-IBDFE has stronger robustness,its complexity is reduced by {45.7%,25%},and its performance gain is {0.605 4,0.193 6} dB when the bit error rate (BER) is 10^-5.Compared with the existing low-complexity IBDFE (LC-IBDFE),RC-IBDFE has stronger robustness,its complexity is reduced by {13.6%,-25.8%},and its performance gain is {0.289 7,0.531 2} dB when the BER is 10^-5.     

Spatial Modulation

Spatial modulation (SM) is a recently developed transmission technique that uses multiple antennas. The basic idea is to map a block of information bits to two information carrying units: 1) a symbol that was chosen from a constellation diagram and 2) a unique transmit antenna number that was chosen from a set of transmit antennas. The use of the transmit antenna number as an information-bearing unit increases the overall spectral efficiency by the base-two logarithm of the number of transmit antennas. At the receiver, a maximum receive ratio combining algorithm is used to retrieve the transmitted block of information bits. Here, we apply SM to orthogonal frequency division multiplexing (OFDM) transmission. We develop an analytical approach for symbol error ratio (SER) analysis of the SM algorithm in independent identically distributed (i.i.d.) Rayleigh channels. The analytical and simulation results closely match. The performance and the receiver complexity of the SM-OFDM technique are compared to those of the vertical Bell Labs layered space-time (V-BLAST-OFDM) and Alamouti-OFDM algorithms. V-BLAST uses minimum mean square error (MMSE) detection with ordered successive interference cancellation. The combined effect of spatial correlation, mutual antenna coupling, and Rician fading on both coded and uncoded systems are presented. It is shown that, for the same spectral efficiency, SM results in a reduction of around 90% in receiver complexity as compared to V-BLAST and nearly the same receiver complexity as Alamouti. In addition, we show that SM achieves better performance in all studied channel conditions, as compared with other techniques. It is also shown to efficiently work for any configuration of transmit and receive antennas, even for the case of fewer receive antennas than transmit antennas.     

一种新的准正交空时分组码的设计

ABBA码是一种可用于3个以上发射天线系统的准正交空时分组码,该方案虽然可以实现全速率传输,但是其译码复杂度高。针对上述缺点提出了一种基于星座旋转的能够实现满分集增益、全速率传输的准正交空时分组码,给出了接收端最大似然译码的独立译码方案,简化了译码过程,降低了译码复杂度,仿真结果表明其误码性能与ABBA码相比得到了较大的改善。