SLM and PTS peak-power reduction of OFDM signals without side information

Selected mapping (SLM) and partial transmit sequence (PTS) are well-known techniques for peak-power reduction in orthogonal frequency-division multiplexing (OFDM). We derive a simplified maximum likelihood (ML) decoder for SLM and PTS that operates without side information. This decoder exploits the fact that the modulation symbols belong to a given constellation and that the multiple signals generated by the PTS or SLM processes are widely different in a Hamming distance sense. Pairwise error probability (PEP) analysis suggests how SLM and PTS vectors should be chosen. The decoder performs well over additive white Gaussian noise (AWGN) channels, fading channels, and amplifier nonlinearities.     

Decode-to-cooperate: a sequential alamouti-coded cooperation strategy in dual-hop wireless relay networks

An optimal cooperation strategy, decode-to-cooperate, is proposed and investigated for performance improvements in dual-hop wireless relay networks. Based on decode-and-forward (DF) strategy with multiple relay selection, we design a novel scheme such that the source node keeps transmitting sequentially and the selected relays cooperate by transmitting the decoded signal using distributed Alamouti coding. We exploit the multipath propagation effect of the wireless channel to achieve lower probability of error and introduce optimum power allocation and relay positioning. We analyze the scenario when the source to destination direct link is not available and derive a closed form expression for symbol error rate (SER), its upper bound and an asymptotically tight approximation to exploit the performance gain by selecting the optimum relays in a multiple-relay cooperation scheme. Moreover, asymptotic optimum power allocation (based on the SER approximation) and optimal relay positioning are also considered to further improve the SER. The proposed relay selection scheme outperforms cooperative (DF) and non-cooperative schemes by more than 2 dB.     

Time variance and defect prediction in software projects

It is crucial for a software manager to know whether or not one can rely on a bug prediction model. A wrong prediction of the number or the location of future bugs can lead to problems in the achievement of a project’s goals. In this paper we first verify the existence of variability in a bug prediction model’s accuracy over time both visually and statistically. Furthermore, we explore the reasons for such a high variability over time, which includes periods of stability and variability of prediction quality, and formulate a decision procedure for evaluating prediction models before applying them. To exemplify our findings we use data from four open source projects and empirically identify various project features that influence the defect prediction quality. Specifically, we observed that a change in the number of authors editing a file and the number of defects fixed by them influence the prediction quality. Finally, we introduce an approach to estimate the accuracy of prediction models that helps a project manager decide when to rely on a prediction model. Our findings suggest that one should be aware of the periods of stability and variability of prediction quality and should use approaches such as ours to assess their models’ accuracy in advance.     

Estimation and compensation of clipping noise in OFDMA systems

We propose an efficient and low-complexity scheme for estimating and compensating clipping noise in OFDMA systems. Conventional clipping noise estimation schemes, which need all demodulated data symbols, may become infeasible in OFDMA systems where a specific user may only know his own modulation scheme. The proposed scheme first uses equalized output to identify a limited number of candidate clips, and then exploits the information on known subcarriers to reconstruct clipped signal. Simulation results show that the proposed scheme can significantly improve the system performance.     

Use of data permutation to reduce the peak‐to‐average power ratio of an OFDM signal

A set of fixed permutations is used in this paper to reduce the peak‐to‐average power ratio (PAR) of an orthogonal frequency division multiplexing (OFDM) signal. For this technique, K − 1 interleavers are used to produce K − 1 permuted sequences from the same information sequence. The peak powers of the permuted sequences and the original information sequence are computed using K inverse discrete Fourier transforms; the sequence with the lowest PAR is chosen for transmission. Before the optimization process begins the identity of each interleaver is embedded into the data frame as side information (SI). SI which is critical to the receiver operation, is coded using a simple forward error correction code in order to increase its reliability. An adaptive approach is proposed for the reduction of this technique's complexity. Furthermore, theoretical expressions are derived for the complementary cumulative distribution function of the PAR and for the average number of permutations required by the adaptive approach. Computer simulations are performed for finding the PAR reduction capability of several types of interleavers. It is subsequently found that random interleavers and odd–even symmetric interleavers are performing equally well in reducing the PAR. Results are also presented for the out of band radiation and the bit error rate performance of interleaved OFDM (IOFDM) and conventional OFDM in an additive white Gaussian noise channel. IOFDM also has less adjacent channel interference than that of conventional OFDM. Copyright © 2002 John Wiley & Sons, Ltd.     

Compensation Decoding of Space Time Frequency Block Codes

A novel compensation decoding scheme for a given space time frequency linear block code is presented, exploiting the simplicity of zero forcing equalization, and special characteristics of the preceding matrix. The proposed decoding procedure is relatively simple and straightforward in comparison to maximum likelihood decoding (MLD) and sphere decoding (SD). The bit-error-rate performance of the proposed scheme is better than zero forcing decoding and close to MLD and SD for low to medium signal-to-noise ratio range.     

Enhanced MMSE channel estimation using timing error statistics for wireless OFDM systems

Estimation and tracking of the frequency-selective time-varying channel response is a challenging task for wireless communication systems incorporating coherent OFDM. In pilot-symbol-assisted (PSA) OFDM systems, the minimum mean-square-error (MMSE) estimator provides the optimum performance based on the channel statistics (channel correlation function and SNR). In OFDM systems, FFT-block timing error introduces a linear phase rotation to data modulated on individual subcarriers. An MMSE channel estimator designed only using the wireless channel statistics performs only sub-optimally when subcarrier phase rotations due to block timing errors are present. In this paper, we show that by using the block timing error statistics of the OFDM time-synchronizer the performance of the MMSE channel estimation can be significantly improved. Numerical results show that the bit-error-probability (BEP) performance degradation due to timing errors can be almost completely recovered by the proposed technique.     

On the PAR reduction of OFDM signals using multiple signal representation

Multiple signal representation (MSR) techniques have been used to reduce the high peak-to-average power ratios (PAR) of orthogonal frequency division multiplexing (OFDM) signals. These includes partial transmit sequences (PTS), selected mapping (SLM), selective scrambling and interleaving. All MSR techniques often improve the PAR statistics and are iterative in nature. The PAR reduction obtainable depends on the number of iterations performed, which also increases the complexity of the OFDM transmitter. However, a means to estimate the achievable PAR reduction for a given number of iterations has not been reported in the literature so far. This paper derives a lower bound on the achievable PAR when a MSR technique with a given complexity is used. Our analytical results show a clear asymptotic behavior of the PAR as the number of iterations is increased. Simulation results justify the significance and accuracy of the PAR bound derived.     

Generation of bivariate Rayleigh and Nakagami-m fading envelopes

The paper presents an algorithm for generating bi-variate Nakagami-m distributed fading envelopes with any desired power cross correlation. For this algorithm, the fading index m should be a positive integer (m=1 for Rayleigh fading). Its applications include dual-branch selection combining diversity, dual-branch switch diversity systems, and wireless channel modeling