Trellis-coded complementary code keying for high-rate wireless LANsystems

In high-rate wireless LAN, complementary code keying (CCK) is adopted in the IEEE 802.11b standard to support data rates up to 11 Mbps, much higher than the 2-Mbps data rate in the previous wireless LAN standard. Due to less-than-ideal characteristics of the CCK codewords, the CCK performs quite poorly in large-delay-spread multipath channels. In this paper, a new modulation scheme that combines the trellis coding with the CCK modulation is proposed. This scheme is shown, through simulation, to achieve much better error rate performance in medium-to-large channel delay spread environments     

A high-rate orthogonal space-time block code

We present a space-time block code from complex orthogonal designs for 5 transmit antennas, which can send 10 information symbols in a block of 15 channel uses and hence have rate 2/3. Simulation results show that this orthogonal space-time block code with rate 2/3 for five transmit antennas can achieve diversity gain over those orthogonal space-time block codes with higher rates for less number of transmit antennas.     

Antenna selection for multiple-antenna transmission systems: performance analysis and code construction

This correspondence studies antenna selection for wireless communications systems that employ multiple transmit and receive antennas. We assume that (1) the channel is characterized by quasi-static Rayleigh flat fading, and the subchannels fade independently, (2) the channel state information (CSI) is exactly known at the receiver, (3) the selection is available only at the receiver, and it is based on the instantaneous signal-to-noise ratio (SNR) at each receive antenna, and (4) space-time codes are used at the transmitter. We analyze the performance of such systems by deriving explicit upper bounds on the pairwise error probability (PEP). This performance analysis shows that (1) by selecting the set of antennas that observe the largest instantaneous SNR, one can achieve the same diversity gain as the one obtained by using all the receive antennas, provided that the underlying space-time code has full spatial diversity, and (2) in the case of rank-deficient space-time codes, the diversity gain may be dramatically reduced when antenna selection is used. However, we emphasize that in both cases the coding gain is reduced with antenna selection compared to the full complexity system. Based on the upper bounds derived, we describe code design principles suitable for antenna selection. Specifically, for systems with two transmit antennas, we design space-time codes that perform better than the known ones when antenna selection is employed. Finally, we present numerical examples and simulation results that validate our analysis and code design principles.     

频率选择性信道下多天线系统的空间线性预编码设计

研究了频率选择性信道下多天线系统的空间线性发射预编码设计问题.针对有循环前缀的块传输系统,通过理论分析指出,在频率选择性信道下设计空间预编码可以等效成现有的在频域为多个相邻频点设计相同的空间预编码,并可以通过凸优化方法对最优方案进行数值求解.为了降低计算复杂度,提出了一种以信道容量上界最大为目标的次优预编码算法.在进行等功率分配时,这种次优方法退化为现有的特征波束形成(EBF).针对非块传输系统,分析了EBF算法存在的问题,提出了一种基于串行搜索的EBF算法.仿真分析表明,这种方法在高信噪比下的性能明显优于EBF算法.     

Multilevel coding for multiple-antenna transmission

The application of powerful coding for transmission over multiple-input/multiple-output channels is discussed. The authors emphasize that as an immediate consequence of the mutual information chain rule, multilevel coding (MLC) constitutes the optimum coded modulation scheme. On the other hand, simple bit-interleaved coded modulation (BICM) is only a convenient alternative for the case of two transmit and one receive antennas when combined with orthogonal space-time block codes. Starting from MLC, the authors further propose a hybrid coded modulation scheme, which favorably combines the advantages of MLC and BICM.     

Trellis code design for periodic interleavers

A standard technique for correlated fading combines trellis codes designed for independent fading with interleaving that makes correlated fading appear to be independent for symbols within the Viterbi traceback depth. When the fading correlation is persistent and delay constraints preclude deep interleaving, some correlation remains among symbols within the traceback depth. Incorporating this post-interleaver correlation improves the trellis code design. This article presents such a trellis code design technique for periodic interleavers. Bit error rate simulations demonstrate that the new design technique can provide a dramatic performance improvement when fading or interference is severe and persistent     

Orthogonal code design for quasi-synchronous CDMA

A new code design method for quasi-synchronous CDMA is proposed. The proposed scheme, based on the theory of finite projective planes, has the following advantages: orthogonality; low cross-correlation for both the quasi-synchronous mode and asynchronous mode; and low auto-correlation. Numerical autocorrelation and cross-correlation results are provided for both the proposed code design and the Walsh functions     

用于ONRS的正交多相码设计

为了提高正交组网雷达系统（Orthogonal Netted Radar Systems,ONRS）中的雷达性能,可以将信号设定为一组特殊设计的正交信号。笔者在阐述正交组网雷达发射信号的设计原理后介绍了一种混合算法,基于以上混合算法获得了相应的多相码序列。结合仿真分析证明,该混合算法是可行有效的。     

Bandwidth-efficient linear Modulations for multiple-antenna transmission

Some M/spl times/T modulation matrices for M transmit antennas and T symbol periods, with M=2,3,4 and T=2, and M=T=4 are studied. A transmission rate of M symbols per channel use and a transmit diversity order of min(M,T) are achieved over a quasi-static fading channel when using rotated versions of a multidimensional quadratic amplitude modulation with spectral efficiency 2 bits/symbol. Extension to input constellations with higher spectral efficiencies is then considered. The modulations are then generalized to any number of transmit antennas M and any number of symbol periods T, such that a transmission rate of M symbols per channel use, and a transmit diversity of T are achieved under fast fading (ergodic scenario). By means of signal space diversity, the proposed modulations exploit the degrees of freedom of multiantenna channels and have moderate detection complexity at moderate and large signal-to-noise ratios (SNRs).     

A study of opportunism for multiple-antenna systems

Recently proposed opportunistic beamforming exploits the multiuser diversity to reduce the feedback by not requiring the precoding information used for closed-loop schemes to be known at the transmitter. Opportunism could also be beneficially employed for other multiple-antenna transmission techniques like cophasing and antenna selection. For opportunistic beamforming and antenna selection, we give closed-form expressions for throughput that closely approximate the performance of these schemes with a Proportionally Fair scheduler (PFS) at low signal-to-noise ratios (SNRs). For large number of transmit antennas, opportunistic cophasing has similar performance as opportunistic beamforming. Asymptotic dependence of the required number of users to achieve the gains of opportunism on the number of transmit antennas is exponential for opportunistic beamforming (and cophasing for large numbers of transmit antennas), and at best linear for opportunistic antenna selection. For multiple-antenna receivers, we additionally examine an opportunistic multiple-input multiple-output (MIMO) scheme that transmits multiple data streams simultaneously to the same user.     

Soft quasi-maximum-likelihood detection for multiple-antenna wireless channels

The paper addresses soft maximum-likelihood (ML) detection for multiple-antenna wireless communication channels. We propose a soft quasi-ML detector that maximizes the log-likelihood function by deploying a semi-definite relaxation (SDR). Given perfect channel state information at the receiver, the quasi-ML SDR detector closely approximates the performance of the optimal ML detector in both coded and uncoded multiple-input, multiple-output (MIMO) channels with quadrature phase-shift keying (QPSK) modulation and frequency-flat Rayleigh fading. The complexity of the quasi-ML SDR detector is much less than that of the optimal ML detector, thus offering more favorable performance/complexity characteristics. In contrast to the existing sphere decoder, the new quasi-ML detector enjoys guaranteed polynomial worst-case complexity. The two detectors exhibit quite comparable performance in a variety of ergodic QPSK MIMO channels, but the complexity of the quasi-ML detector scales better with increasing number of transmit and receive antennas, especially in the region of low signal-to-noise ratio (SNR).     

Concatenated code system design for storage channels

A number of papers have been published on the concatenation of an outer code with a partial response (PR) channel, where the outer code is a turbo code, a convolutional code, or a low-density parity-check code. This paper deals with the second case, assuming EPR4 and modified extended EPR4 (MEEPR4) partial response (PR) targets. The goals in this work include (1) the joint optimization of interleaver and precoder for a fixed outer convolutional code and PR target, (2) the choice of optimal code rate for both PR targets assuming a Lorentzian model, and (3) an assessment of the performance of these codes in the presence of thermal asperities. We introduce mathematical and algorithmic tools for accomplishing these goals and present simulation results that support our approach. Among the positive results is the ability to lower the well-known error rate floor of these concatenated schemes for arbitrary PR channels     

Interference-free code design for MC-CDMA uplink transmissions

In a recent study, solutions have been proposed for completely suppressing the multiple access interference (MAI) arising in the uplink of a quasi-synchronous multicarrier codedivision multiple-access network as a consequence of multipath distortions and carrier frequency offsets. This result is achieved by employing exponential orthogonal codes or selecting a particular subset of the Walsh-Hadamard code family without the need for any channel state information at the transmitter side. In the present letter, we revisit this problem and show that MAI suppression can be achieved by following a different line of reasoning which leads to a transmission scheme exhibiting a lower peak-to-average power ratio.     

LDPC code design for asynchronous Slepian-Wolf coding

We consider asynchronous Slepian-Wolf coding where the two encoders may not have completely accurate timing information to synchronize their individual block code boundaries, and propose LDPC code design in this scenario. A new information-theoretic coding scheme based on source splitting is provided, which can achieve the entire asynchronous Slepian-Wolf rate region. Unlike existing methods based on source splitting, the proposed scheme does not require common randomness at the encoder and the decoder, or the construction of super-letter from several individual symbols. We then design LDPC codes based on this new scheme, by applying the recently discovered source-channel code correspondence. Experimental results validate the effectiveness of the proposed method.     

Power-allocation policy and optimized design of multiple-antenna systems with imperfect channel estimation

We here focus on the optimized design and performance of Rayleigh-faded multiple-antenna multiple-input-multiple-output systems when both transmitter and receiver share imperfect (i.e., error impaired) channel estimates computed via training sequences. In particular, according to the emerging principle of the so-called synchronized detection, for this operating scenario we propose a simple water-filling (WF)-like strategy for allocating power over transmit antennas and test its actual performance. Afterward, we introduce and evaluate some related figures of merit summarizing the overall system's performance and use these last for noting effective system's design guidelines. In particular, some optimized solutions for power-versus-bandwidth efficiency tradeoff are presented and their validity limits are debated. All the developed results explicitly take into account the actual reliability of the achievable channel estimates.     

On space-time code design

It is shown that the separation between space-time code matrices can be described in terms of a metric of Euclidean type, which is defined via the singular values of difference code matrices, and arises naturally from a minimization of the pairwise error probability. Essentially, the distance between complex space-time code matrices is the Euclidean distance between the respective - demultiplexed and concatenated - transmit antenna streams, expressed in terms of the structure inherent to the multiple antenna arrangement. It is further shown that the determinant criterion can be strengthened, in a manner that not only suggests an optimum space-time code matrix structure, but also outlines the central role played by the Euclidean distance in quasi-static fading. Theorem 5 - which claims that in order to optimize the product distance one must optimize the Euclidean distance -establishes a close interdependence between product and Euclidean distances; it thereby links the performance determining factors in quasi-static and independent fading, and rigorously establishes the relevance of combining space-time coding and modulation in fading environments. A multidimensional space-time constellation for two transmit antennas, and its coset partitioning-based on traces of differences between constellation matrices-are described. Example codes constitute the first reporting of a space-time coded modulation scheme for fading channels, whereby a space-time constellation is partitioned in cosets.     

Training-based channel estimation for multiple-antenna broadband transmissions

This paper addresses the problem of training sequence design for multiple-antenna transmissions over quasi-static frequency-selective channels. To achieve the channel estimation minimum mean square error, the training sequences transmitted from the multiple antennas must have impulse-like auto correlation and zero cross correlation. We reduce the problem of designing multiple training sequences to the much easier and well-understood problem of designing a single training sequence with impulse-like auto correlation. To this end, we propose to encode the training symbols with a space-time code, that may be the same or different from the space-time code that encodes the information symbols. Optimal sequences do not exist for all training sequence lengths and constellation alphabets. We also propose a method to easily identify training sequences that belong to a standard 2/sup m/-PSK constellation for an arbitrary training sequence length and an arbitrary number of unknown channel taps. Performance bounds derived indicate that these sequences achieve near-optimum performance.     

Turbo coded multiple-antenna systems for near-capacity performance

For a turbo coded BLAST (Bell LAbs Space-Time architecture) system with N_t transmit antennas and N_r receive antennas, there is a significant gap between its detection threshold and the capacity in case N_t > N_r. In this paper, we show that by introducing a convolutional interleaver with block delay between the BLAST mapper and the turbo encoder, the threshold can be improved. Near-capacity thresholds can be achieved for some cases. To take advantage of the low detector complexity in Alamouti STBC (space-time block code), we also investigate a STBC system, which is the concatenation of the Alamouti STBC with a turbo trellis coded modulation. By using a proper labelling and adding a convolutional interleaver with block delay to such a STBC system, we achieve both lower error floors and lower thresholds.