Search

In this paper, two new decoding algorithms to decode Reed–Solomon codes during transmission over burst Rayleigh fading channels with additive white Gaussian noise (AWGN) are proposed. They only conduct error correction for coded symbols located in the pure AWGN region and conduct error and erasure correction for those symbols located in the burst fading region by treating those coded symbols that are very likely erroneous as erasures. The first algorithm does not need to know the fading locations in advance, while the second algorithm assumes that the fading locations are known. In addition, the performance of such two algorithms is studied when a pre-computed threshold is used to determine the erasures of the code. Simulation results show that our proposed algorithms not only significantly perform better than the classic Berlekamp–Messay algorithm with a comparable computational complexity but also achieve a better tradeoff between the performance and the computational complexity when compared with other existing algorithms. In particular, our algorithms exhibit excellent robustness for tested various code parameters and fading configurations. Furthermore, a more detailed mathematical analysis is also developed in this paper in order to estimate the performance of the new algorithms in the burst Rayleigh fading channels. We observe that the performance of the first algorithm can only be estimated relatively accurately when encountering burst deep-fading, whereas the performance prediction for the second algorithm is always in agreement with the simulation results for various fading cases. [ABSTRACT FROM AUTHOR]

Root raised cosine roll-off (RRC) filter is one of the most fundamental elements in modern digital communications. This paper proposes a new method to efficiently realize the RRC filter. The method employs cubic Hermite interpolation to obtain a piecewise-polynomial approximation for the impulse response of the RRC filter. Then, the approximated impulse response is efficiently realized by using a transversal filter with a very small number of taps followed by integrators with a simple recursive structure, named cascaded recursive finite impulse response (CR-FIR) filter. As an example, an RRC filter with roll-off factor 0.5 is constructed by using the CR-FIR filter with only nine multipliers. Performance of the RRC filter in matched filtering is examined by computer simulations. Then, it is shown that the constructed RRC matched filter has nearly the same performance as the ideal filter. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of initial synchronization of pseudo-noise code. A new code acquisition technique for spread-spectrum communication systems using band-limited chip waveforms is presented. Unlike conventional power detector based on testing the estimated maximum of the ambiguity function, the devised detector exploits a fast parabolic interpolation, running on three estimated ambiguity samples in the neighborhood of the coarse estimate. Performance analysis is carried out in comparison with conventional detector. Mathematical expressions for the probability of false alarm and detection are derived. They are numerically evaluated, under operating settings, by a reduced Taylor's expansion up to the second order. The theoretical results, substantiated by computer simulations, have evidenced that the devised method is well suited for asynchronous spread-spectrum communications. In particular, the acquisition performance depends on the actual offset between the received and the reference code waveforms, which are randomly distributed (in chip-asynchronous systems) within one sampling period. In fact, the parabolic interpolation technique outperforms the conventional detector for a wide range of code offsets because it is able to self-synchronize the testing variable around the true offset. [ABSTRACT FROM AUTHOR]