Low-complexity LDPC coded BICM-ID with orthogonal modulations

A low-complexity low density parity check (LDPC) coded bit-interleaved coded modulation with iterative decoding (BICM-ID) scheme with orthogonal modulations is proposed. With a novel mapping strategy of coded bits to symbols, the proposed scheme is equivalent to a generalised LDPC code with Hadamard constraints and thus orthogonal demodulation can be merged into the iterative LDPC decoding process, resulting in a simpler implementation and a lower computational complexity.     

Channel estimation for space-time orthogonal block codes

Channel estimation is one of the key components of space-time systems design. The transmission of pilot symbols, referred to as training, is often used to aid channel acquisition. In this paper, a class of generalized training schemes that allow the superposition of training and data symbols is considered. First, the Cramer-Rao lower bound (CRLB) is derived as a function of the power allocation matrices that characterize different training schemes. Then, equivalent training schemes are obtained, and the behavior of the CRLB is analyzed under different power constraints. It is shown that for certain training schemes, superimposing data with training symbols increases CRLB, and concentrating training power reduces CRLB. On the other hand, once the channel is acquired, uniformly superimposed power allocation maximizes the mutual information and, hence, the capacity.     

Differential spatial modulation scheme based on orthogonal space-time block coded

Focusing on the problem that differential spatial modulation (DSM) couldn’t obtain transmit diversity and has high decoding complexity,a new differential spatial modulation scheme based on the orthogonal space-time block code was proposed and the proposed scheme is called OSTBC-DSM.There were two matrices in this scheme:the spatial modulation matrix and the symbol matrix.The former was aimed to activate different transmit antennas by setting the position of nonzero elements,and the latter structured symbolic matrix by using orthogonal space-time block codes (OSTBC) as the basic code block.The proposed scheme could obtain full transmit diversity and higher spectral efficiency compared with the conventional DSM schemes.Moreover,the OSTBC-DSM supported linear maximum likelihood (ML) decoding.The simulation results show that under different spectral efficiencies,the proposed OSTBC-DSM scheme has better bit error rate (BER) performance than other schemes.     

Detection of multiuser orthogonal space-time block coded signals via ordered successive interference cancellation

This paper investigates multiuser orthogonal space-time block coded signal detection within the ordered successive interference cancellation (OSIC) framework. Both the zero-forcing and minimum-mean-square-error ordering criteria are considered. When each user terminal is equipped with no more than four transmit antennas, it is shown that orthogonal transmit redundancy leads to an appealing signal ordering property: in each processing layer the transmitted symbols of an arbitrary user are associated with an identical ordering metric. This guarantees the feasibility of (user based) group-wise symbol recovery through the OSIC mechanism. Analytic bit-error-rate performance is given. Computer simulations and flop count evaluations are also provided for comparing the OSIC based solution with existing multiuser detection schemes reported for the considered system     

An orthogonal space-time coded CPM system with fast decoding for two transmit antennas

Trellis-coded space-time (TC-ST) coding for continuous-phase modulation (TC-ST-CPM) was recently proposed by Zhang and Fitz. In this paper, we propose an orthogonal space-time coding for CPM (OST-CPM) systems and two transmit antennas. In the proposed OST-CPM, signals from two transmit antennas at any time t are orthogonal while both of them have continuous phases. Similar to Alamouti's OST coding for phase-shift keying (PSK) and quadrature amplitude modulation (QAM) systems, the newly proposed OST-CPM has a fast decoding algorithm.     

Improved decoding of LDPC coded modulations

A coded modulation belief propagation (CMBP) decoder is proposed for decoding LDPC codes with multilevel modulations. The decoder takes into account statistical dependencies among bits originating in the same symbol, providing better performance than the marginal BP (MBP) decoder. Asymptotically it converges to MAP decoding. The CMBP decoder is based on a single-level coding (SLC) scheme and does not suffer from practical disadvantages of multi-level coding (MLC) schemes. Furthermore, the CMBP decoder can close the capacity gap of the bit interleaved coded modulation (BICM) SLC scheme. The BICM capacity gap increases when the modulation size increases and in scenarios where gray mapping is not possible.     

Further results on differential space-time modulations

Some novel results on the space-time differential modulation schemes described by B.M. Hochwald and W. Sweldens (see ibid., vol.48, p.2041-52, 2000) and V. Tarokh and H. Jafarkhani (IEEE J. Select. Areas Commun., vol.18, p.1169-74, 2000), are derived under the assumption of a quasi-static multiple-antenna channel. First, the optimality (in the maximum-likelihood sense) of the one-shot detection algorithms of Hochwald and Sweldens and of Tarokh and Jafarkhani is proved. Then, the expression of the pairwise error probability for these detectors is derived, and, as a particular case, the bit-error rate is computed for the binary phase-shift keyed scheme of Tarokh and Jafarkhani. Finally, a per-survivor processing (PSP) detection algorithm for this class of modulations is illustrated. Numerical results evidence both the superiority of the PSP strategy over the one-shot space-time differential detectors and the accuracy of the above-mentioned bit-error rate formula.     

Bit-interleaved coded differential space-time modulation

Bit-interleaved coded differential space-time modulation for transmission over spatially correlated Ricean flat fading channels is discussed. For improved noncoherent detection without channel state information at the receiver, iterative decoding employing hard-decision feedback and prediction-based metric computation is applied. The performance is assessed based on the associated cutoff rate, analytical expressions for the bit error rate and the outage probability, respectively and simulations. It is shown that the proposed scheme offers high power efficiency exploiting both space and time diversity, while the computational complexity is kept at a relatively low level.     

频率选择性信道下单载波空时分组编码传输系统中的信道估计技术

在频率选择性信道下给出了单载波频域均衡系统结合空时分组编码传输基于训练序列的最优信道估计算法。由于选取具有恒幅特性的Chu序列作为训练序列,因此这一算法能够实现信道估计的最小均方误差,并作了理论证明。最后,对本方案的性能进行了仿真比较,仿真的结果证实了本方案的优点。     

Multilevel trellis coded modulations for the Rayleigh fadingchannel

The authors present coded 8-phase-shift-keyed (8-PSK) modulations for the Rayleigh fading channel. The schemes are based on multilevel trellis-coded-modulation constructions and utilize maximum free Hamming distance binary convolutional codes as building blocks. A suboptimal multistage decoder that utilizes interstage interleaving and iterative decoding is proposed and evaluated. Examples are constructed to show that the proposed schemes outperform the best modified codes of the Ungerboeck type due to significantly higher implicit time diversity, yielding seven branches of built-in time diversity, whereas the Ungerboeck code yields four branches of time diversity for a 64-state system. The transmission delay is higher, however. The new schemes can provide three levels of unequal error protection when 8-PSK or 8-differential-phase-shift-keying (8-DPSK) modulations are used. They provide 10-14-dB channel signal-to-noise ratio gain over uncoded 4-DPSK at a bit error rate of 10^-3 for a modest decoding complexity     

Noncoherent iterative decoding of spectrally efficient coded modulations

In this paper, we consider possible solutions for noncoherent decoding of concatenated codes with spectrally efficient modulations. Two main classes of schemes are considered. A first class is obtained by concatenating parallel coding schemes with differential encoding. A second class considers serially concatenated coding structures and possible schemes derived from turbo trellis coded modulation (t-tcm), which do not employ differential encoding. In the first case, at the receiver side we consider separate detection and decoding, while in the second case we consider joint detection and decoding. The major problem connected with such an iterative decoding procedure is that taking into account an augmented channel memory leads to an intolerable trellis size, and hence to an impractical decoding complexity. Reduced-complexity techniques suited to iterative decoding become fundamental, and we consider a recently proposed state-reduction technique. This way, the performance of a coherent receiver is approached, by keeping the number of receiver states fixed.     

Ordered array processing for space-time coded systems

The zero-forcing interference suppression and cancellation scheme proposed by Tarokh et al., in 1999, for grouped space time coded system suffers performance loss due to limited diversity gains for the first detected antenna groups, and power allocation was suggested to overcome this problem. In this letter, we propose an ordered detection algorithm which compensates the diversity loss by always detecting the group with the strongest post-ing signal-to-noise ratio. Compared with the power allocation scheme, our proposed scheme is more robust to varying channel conditions and when used with iterative interference cancellation, a performance gain of 2.4 dB can be obtained at a frame-error rate rate of 10/sup -2/.     

Performance of cross-layer design for orthogonal space-time block coded MIMO systems with imperfect CSI in Ricean fading channels

A cross-layer design (CLD) scheme for orthogonal space-time block coded MIMO systems with imperfect channel state information is presented by combining adaptive modulation and automatic repeat request, and the corresponding system performance is investigated over Ricean fading channel. The fading gain value is partitioned into a number of regions by which the modulation is adapted in terms of the region the fading gain falls in. The fading gain switching thresholds subject to a target packet error rate (PER) constraint are derived. According to these results, and using the generalized Marcum Q-function, we derive the theoretical formulae of average PER and spectrum efficiency (SE) of the system with CLD for both perfect and imperfect estimation in detail. As a result, closed-form expressions for average PER and SE are obtained. These expressions include some existing expressions in Rayleigh channel as special cases. With these expressions, the system performance in Ricean channel with perfect and imperfect estimation information can be evaluated effectively. Computer simulation for average PER and SE show that the theoretical analysis and simulation are consistent. The results show that the system performance will be effectively improved as Ricean factor increases, but it will be degraded as estimation errors increases.     

Bit-interleaved space-time coded modulation with iterative decoding

Bit-interleaved space-time coded modulation (BI-STC), which combines serial concatenation of bit-interleaved coded modulation (BICM) with space-time block codes, can effectively exploit the available diversity in space and time under various fading conditions. In this letter, we propose to use iterative decoding to further improve the performance of BI-STC by exploiting the concatenating structure of the codes. The decoding metric is therefore modified to fit for the iterative process, and the derived error bounds suggest that set-partition labeling instead of gray labeling should be used when considering iterative decoding.     

Joint optimisation of turbo trellis coded modulations andincremental redundancy

The optimisation of turbo trellis coded modulations and partial incremental redundancy, i.e. Hybrid ARQ type 3, is presented for the UMTS system with 16 QAM     

Co-channel interference cancellation for space-time coded OFDM systems

Space-time coded orthogonal frequency division multiplexing (OFDM) is a promising scheme for future wideband multimedia wireless communication systems. The combination of space-time coding (STC) and OFDM modulation promises an enhanced performance in terms of power and spectral efficiency. Such combination benefits from the diversity gain within the multiple-input-multiple-output ST coded system and the matured OFDM modulation for wideband wireless transmission. However, STC transmit diversity impairs the system's interference suppression ability due to the use of multiple transmitters at each mobile. We propose an effective co-channel interference (CCI) cancellation method that employs angle diversity based on -steering beamforming or minimum variance distortion response beamforming. It is shown that the proposed method can effectively mitigate CCI while preserving the space-time structure, thereby, significantly improving the system's interference suppression ability without significant bit-error rate performance degradation. Furthermore, it is demonstrated that the proposed method can significantly combat the delay spread detrimental effects over multipath fading channels without the use of interleaving.     

Multiple block coded modulations and applications to unequal error protection

Multiple block coded modulations (MBCM) are studied. One characteristic of the studied MBCM schemes is that they have both a block and a trellis structure. A general rule for deriving branch variables so as to establish a decoding trellis is presented. Examples of MBCM schemes employing 8‐PSK and 16‐PSK constellations are given. Two different methods using these schemes are proposed for producing unequal error protection. Computer simulations are done to show the UEP ability. This revised version was published online in August 2006 with corrections to the Cover Date.     

Optimal transmissions for space-time coded OFDM UWB systems

1 Introduction Recently, the high rate short range wireless personal area network (WPAN) is considered. When the inverse of the sampling rate is significantly shorter than the total delay spread, as is the case for most UWB communication systems, OFDM systems are more attractive than a single-carrier system. The multi-band OFDM physical layer proposal has been adopt by IEEE 802.15.3a Task Group[1]。 Combing STC and OFDM have the properties to achieve high data rate and mitigate int…     

Geometrical properties of orthogonal space-time codes

We discuss the geometrical properties of a transmission scheme with orthogonal space-time codes. In particular, we show that the transmission channel can be interpreted as the rotation of a vector of transmit symbols in an Euclidean space, together with an attenuation and additive noise. We show that the receiver - as intuitively obvious - essentially has to perform a back-rotation. This geometrical interpretation applies to real vector spaces of signals, i.e., the complex transmit and receive symbols have to be split up into their real and imaginary parts.