Adaptive control of surviving symbol replica candidates in QRM-MLD for OFDM MIMO multiplexing

This paper proposes adaptive control of the number of surviving symbol replica candidates, S/sub m/ (m denotes the stage index), based on the minimum accumulated branch metric of each stage in maximum-likelihood detection employing QR decomposition and the M-algorithm (QRM-MLD) in orthogonal frequency-division multiplexing with multiple-input-multiple-output (MIMO) multiplexing. In the proposed algorithm, S/sub m/ at the mth stage (1/spl les/m/spl les/N/sub t/, N/sub t/ is the number of transmission antenna branches) is independently controlled using the threshold value calculated from the minimum accumulated branch metric at that stage and the estimated noise power. We compared the computational complexity of QRM-MLD employing the proposed algorithm with that of conventional methods at the same average packet error rate assuming the information bit rate of 1.048 Gb/s in a 100-MHz channel bandwidth (i.e., frequency efficiency of approximately 10 bit/s/Hz) using 16QAM modulation and turbo coding with the coding rate of 8/9 in 4-by-4 MIMO multiplexing. Computer simulation results show that the average computational complexity of the branch metrics, i.e., squared Euclidian distances, of the proposed adaptive independent S/sub m/ control method is decreased to approximately 38% that of the conventional adaptive common S/sub m/ control and to approximately 30% that of the fixed S/sub m/ method (S/sub m/=M=16), assuming fair conditions such that the maximum number of surviving symbol replicas at each stage is set to M/spl circ/=16.     

Independent Turbo Coding and Common Interleaving Method among Transmitter Branches Achieving Peak Throughput of 1 Gbps in OFCDM MIMO Multiplexing

This paper proposes a common interleaving method associated with independent channel‐encoding among transmitter antenna branches in orthogonal frequency and code division multiplexing based on multiple‐input multiple‐output (MIMO) multiplexing to achieve an extremely high throughput such as 1 Gbps using a 100 MHz bandwidth. This paper also investigates the average packet error rate performance as a function of the average received signal energy per bit‐to‐background noise power spectrum density ratio (Eb/N0). We found that the loss in the required average received Eb/N0 of the proposed method is only within approximately 0.3 dB in up to a 12‐path Rayleigh fading channel, using 16QAM and Turbo coding with a coding rate of 5/6. We also clarify that even for a large fading correlation among antenna branches, 1 Gbps is still possible by increasing the transmission power. Therefore, the proposed method reduces the processing rate to 1/4 in the turbo decoder with only a slight loss in the required average received Eb/N0.     

Power- and bandwidth-efficient communications using LDPC codes

We apply low-density parity-check (LDPC) codes to a bandwidth-efficient modulation scheme using multilevel coding, multistage decoding, and trellis-based signal shaping. Performance results based on density evolution and simulations are presented. Using irregular LDPC component codes of block length 10/sup 5/ and a 64-quadrature amplitude modulation signal constellation operating at 2 bits/dimension, a bit-error rate of 10/sup -5/ is achieved at an E/sub b//N/sub 0/ of 6.55 dB. At this value of E/sub b//N/sub 0/, the Shannon channel capacity, computed assuming equally likely signaling, is below 2 bits/dimension.     

Tight BER bounds for iteratively decoded bit-interleaved space-time coded modulation

Iteratively decoded bit-interleaved space-time coded modulation (BI-STCM) greatly lowers bit error rate (BER) over fast Rayleigh fading multiple-input multiple-output (MIMO) channels. We develop a general, tight and efficient theoretical error-free feedback bound (EF bound) to analyze the asymptotic BER. The convergence to the EF bound and the accuracy of the prediction are verified by simulation. With the best rate 1/2 4-state convolutional code and the 16-QAM modified set partitioning labeling, the BER of 10/sup -6/ can be achieved at E/sub b//N/sub 0/=1.6 dB with 2 transmit and 2 receive antennas.     

SVD iterative detection of turbo-coded multiantenna unitary differential modulation

A new suboptimal demodulator based on a singular value decomposition for estimation of unitary matrices is introduced. Noncoherent communication over the Rayleigh flat fading channel with multiple transmit and receive antennas, where no channel state information is available at the receiver is investigated. Codes achieving bit-error rate (BER) lower than 10/sup -4/ at bit energy over the noise spectral density ratio (E/sub b//N/sub 0/) of 1.6-1.9 dB from code restricted capacity limit were found. At higher data rates, computation of code restricted capacity is impractical. Therefore, the mutual information upper bound of the capacity attaining isotropically random unitary transmit matrices was used. The codes achieve BER lower than 10/sup -4/ at E/sub b//N/sub 0/ of 3.2-6 dB from this bound, with coding rates of 1.125-5.06 bits per channel use, and different modulation decoding complexities. The codes comprise a serial concatenation of turbo code and a unitary matrix differential modulation code. The receiver employs the high-performance coupled iterative decoding of the turbo code and the modulation code. Information theoretic arguments are harnessed to form guidelines for code design and to evaluate performance of the iterative decoder.     

Optimum erasure threshold in Reed-Solomon coded differential 16 star-QAM modulation

The performance of a Reed-Solomon (RS) coded differential 16 star-QAM modulation scheme with a decision-directed estimation (DDE) technique as the channel-fading parameter in a frequency hopping (FH) system is simulated. The optimum erasure threshold for an RS decoder is obtained. It is shown that with the optimum erasure threshold a bit-error probability of 10/sup -5/ can be achieved at E/sub n//N/sub 0/=21.2 dB for using RS(63,31) and E/sub b//N/sub 0/=21.5 dB for RS(31,15).<>     

Approaching the capacity of multiple access channels using interleaved low-rate codes

We show that the capacity of a Gaussian multiple access channel can be approached by interleaved low-rate codes together with a simple chip-by-chip iterative decoding strategy. Based on a rate /spl ap/ 1/69 code and with a total of 35 simultaneous users (the aggregate rate /spl ap/ 1/2), performance of BER=10/sup -5/ is observed at E/sub b//N/sub 0/ /spl ap/ 1.4 dB, which is close to the corresponding capacity limit (E/sub b//N/sub 0/ /spl ap/ 0 dB).     

Timing-synchronization analysis for IEEE 802.11a wireless LANs in frequency-nonselective Rician fading environments

This paper derives and computes the probability of synchronization failure P/sub fail/ for IEEE 802.11a wireless LANs on frequency-flat Rician fading channels. For a frequency offset within /spl plusmn/232 kHz, it is shown that its effect on the synchronization performance is minor. The E/sub ds//N/sub 0/ ratios required to achieve P/sub fail/=10/sup -3/ and 10/sup -4/ are computed, where E/sub ds/ is the data-symbol energy. We find that E/sub ds//N/sub 0/ ratios over 20 dB are generally required for channels with Rician factors K/spl les/6 dB. In particular, E/sub ds//N/sub 0/ ratios that yield P/sub fail/=10/sup -4/ exceed 30 dB for K/spl les/4 dB.     

Performance analysis of various 16 level modulation schemes under Rayleigh fading

The average bit error rate (BER) performances of 16 square/star QAM and 16 CPSK/DPSK under Rayleigh fading are theoretically analysed and compared. 16 star QAM is inferior to 16 square QAM, which achieves the best performance, by approximately 4 dB in the required average E/sub b//N/sub 0/; however, when compared with differentially encoded square QAM, the performance inferiority is less than 2 dB.<>     

SVD iterative decision feedback demodulation and detection of coded space-time unitary differential modulation

A new suboptimal demodulator based on iterative decision feedback demodulation (DFD), and a singular value decomposition (SVD) for estimation of unitary matrices, is introduced. Noncoherent communication over the Rayleigh flat-fading channel with multiple transmit and receive antennas, where no channel state information (CSI) is available at the receiver is investigated. With four transmit antennas, codes achieving bit-error rate (BER) lower than 10/sup -4/ at bit energy over the noise spectral density ratio (E/sub b//N/sub o/) of -0.25 dB up to 3.5 dB, with coding rates of 1.6875 to 5.06 bits per channel use were found. The performance is compared to the mutual information upper bound of the capacity attaining isotropically random (IR) unitary transmit matrices. The codes achieve BER lower than 10/sup -4/ at E/sub b//N/sub o/ of 3.2 dB to 5.8 dB from this bound. System performance including the iterative DFD algorithm is compared to the one using Euclidean distance, as a reliability measure for demodulation . The DFD system presents a performance gain of up to 1.5 dB. Uncoded systems doing iterative DFD demodulation and idealized pilot sequence assisted modulation (PSAM) detection are compared. Iterative DFD introduces a gain of more than 1.2 dB. The coded system comprises a serial concatenation of turbo code and a unitary matrix differential modulation code. The receiver employs the high-performance coupled iterative decoding of the turbo code and the modulation code. Information-theoretic arguments are harnessed to form guidelines for code design and to evaluate performance of the iterative decoder.     

Approximation of SNR degradation due to carrier frequency offset for OFDM in shadowed multipath channels

We derive an approximate expression for signal-to-noise ratio (SNR) degradation of orthogonal frequency division multiplexing due to carrier frequency offset over a shadowed multipath channel, to explicitly show the effects of system and channel parameters on the degradation of the received SNR. The results show that, for small frequency offset, the SNR degradation is proportional to the square of the frequency offset and the square of the number of subcarriers. It is also shown that, if E/sub s//N/sub 0/ is reasonably large, the SNR degradation becomes insensitive to E/sub s//N/sub 0/, which is contrary to the case of the additive white Gaussian noise channel.     

Iterative decoding of space-time differentially coded unitary matrix modulation

Noncoherent communication over the Rayleigh flat fading channel with multiple transmit and receive antennas is investigated. Codes achieving bit error rate (BER) lower than 10/sup -4/ at bit energy over the noise spectral density ratio (E/sub b//N/sub 0/) of 0.8 to 2.8 dB from the capacity limit were found with coding rates of 0.5 to 2.25 bits per channel use. The codes are serial concatenation of a turbo code and a unitary matrix differential modulation code. The receiver is based on a high-performance joint iterative decoding of the turbo code and the modulation code. Information-theoretic arguments are harnessed to form guidelines for code design and to evaluate performance of the iterative decoder.     

高速相干光正交频分复用系统实现方案研究

相干光正交频分复用系统（Coherent Optical Orthogonal Frequency Division Multiplexing, CO-OFDM）作为未来高速光通信的重要解决方案,是近年来光传输领域的研究热点。高速CO-OFDM系统需要较高带宽的模数/数模转换器（DAC/ADC）,目前技术水平难以达到。文章改进了正交频带复用技术（Orthogonal Band Multiplexing , OBM）的光域实现方案;结合偏振复用技术和偏振分集接收,提出了基于OBM的100Gb/s高速CO-OFDM系统;并对系统传输性能进行数字仿真。结果表明：基于OBM技术的MIMO CO-OFDM系统可有效降低对DAC/ADC的处理速度要求,在不需任何在线色散补偿和偏振控制器件条件下,通过单模光纤传输800km,系统Q值保持在13dB以上。     

Variable-rate coding for slowly fading Gaussian multiple-access channels

We consider a nonergodic multiple-access Gaussian block-fading channel where a fixed number of independent and identically distributed (i.i.d.) fading coefficients affect each codeword. Variable-rate coding with input power constraint enforced on a per-codeword basis is examined. A centralized power and rate allocation policy is determined as a function of the previous and present fading coefficients. The power control policy that optimizes the expected rates is obtained through dynamic programming and the average capacity region and the average capacity region per unit energy are characterized. Moreover, we study the slope of spectral efficiency curve versus E/sub b//N/sub 0/ (dB), and we quantify the penalty incurred by time-division multiple access (TDMA) over superposition coding in the low-power regime.     

The throughput of some wireless multiaccess systems

We compute the throughput of some multiaccess wireless systems for delay-tolerant data communications, characterized by an infinite population of uncoordinated users accessing a common channel. The channel is affected by block fading, and the channel state is perfectly known to the receiver but unknown to the transmitters. To cope with multiaccess interference (MAI) and fading, the users employ retransmission of erroneously received packets. We consider unspread and randomly spread (code-division multiple-access (CDMA)) systems with decentralized (single-user) decoding and a system where the receiver employs joint multiuser decoding. The following conclusions can be drawn from our analysis: (a) unspread systems with packet retransmission outperforms CDMA systems with conventional detection, but are outperformed by CDMA with linear minimum mean-square error (MMSE) detection. (b) For all systems based on single-user decoding (SUD), there exists a threshold value of (E/sub b//N/sub o/) below which the throughput is maximized by an infinite number of users per dimension transmitting at vanishing rate, and above which the throughput is maximized by a finite average number of users per dimension transmitting at nonvanishing rate. Moreover, as (E/sub b//N/sub o/) increases, the optimal average number of users per dimension tends to one. In this sense, we say that the optimized systems "self-orthogonalize." (c) For the system based on joint multiuser decoding, a simple slotted ALOHA strategy is able to recover the throughput penalty due to fading in the limit for high (E/sub b//N/sub o/), while an incremental redundancy (INR) strategy recovers the fading penalty for any (E/sub b//N/sub o/).     

On the limiting performance of turbo-Hadamard codes

In this letter, we employ the extrinsic information transfer (EXIT) chart technique to assess the limiting performance of turbo-Hadamard codes and identify the optimized design parameters for such codes. It is shown that for a sufficiently long code length and a sufficiently large number of iterations, a carefully designed low rate turbo-Hadamard code can potentially achieve successful decoding at E/sub b//N/sub 0//spl ap/-1.3 dB, which is about 0.29 dB from the ultimate Shannon limit.     

Postdetection MRC diversity for pi /4-shift QDPSK mobile radio

Diversity reception using a postdetection maximal-ratio combiner (MRC) was experimentally investigated for pi /4-shift QDPSK signal transmission in Rayleigh fading environments. Two-branch postdetection MRC diversity reception provides a diversity gain, for a required E/sub b//N/sub 0/, of about 1.5 dB over selection diversity. It is also effective in reducing the impact of multipath channel delay spread. The average BER due to delay spread can be further reduced by a factor of about 1.5 times from selection diversity.<>     

Log-likelihood ratio (LLR) conversion schemes in orthogonal code hopping multiplexing

Log-likelihood ratio (LLR) conversion schemes are proposed to reduce the effect of perforations that occur in orthogonal code hopping multiplexing (OCHM), which was previously proposed to accommodate more downlink channels than the number of orthogonal codewords. The proposed LLR conversion schemes greatly reduce the required signal-to-noise ratio (SNR) in channel decoding even when the perforation probability is high. The performance of the proposed schemes is evaluated by simulation in terms of the required E/sub b//N/sub 0/ for a 1% block error rate.     

Iterative decoding of parallel and serial concatenated single parity check product codes

An efficient, iterative soft-in-soft-out decoding scheme is employed for the parallel and serially concatenated single parity check (SPC) product codes, which has very low complexity, requiring only two addition-equivalent-operations per information bit. For a rate 0.8637 of parallel concatenated SPC product code, a performance of BER=10/sup -5/ at E/sub b//N/sub 0/=3.66 dB can be achieved using this decoding scheme, which is within 1 dB from the Shannon limit.     

Impact of local oscillator intensity noise on performance of coherent subcarrier multiplexing system using common local oscillator (CLO)

The impact of local oscillator intensity noise on the performance of a coherent subcarrier multiplexing (CSCM) system using a common local oscillator (CLO) is analysed. For a given LO power, RIN noise, and thermal noise, the CNR can be expressed in terms of x, the ratio of sigma /sub sh//sup 2/+ sigma /sub th//sup 2/ over sigma /sub RIN//sup 2/ and, for x<<1, the CNR decreases as LO power increases; for x>>1, the CNR increases as the LO power increases; as x approaches 1, there exist an optimum value of local oscillator power and a corresponding maximum CNR. For a system with RIN=-150 dB/Hz, P/sub S/=-20 dBm, beta =0.02, N=40, NF=3 dB and B=10 MHz, the (P/sub LO/)/sub opt/ is found to be -4 dBm and (CNR)/sub max/ 22.5 dB.<>