111,124 research outputs found
Differential Acquisition of m-Sequences using Recursive Soft Sequential Estimation
No full textIn this contribution a novel sequential estimation method is proposed for the acquisition of -sequences. This sequential estimation method exploits the principle of iterative soft-in-soft-out (SISO) decoding for enhancing the acquisition performance, and that of differential pre-processing for the sake of achieving an enhanced acquisition performance, when communicating over various communication environments. Hence the advocated acquisition arrangement is referred to as the Differential Recursive Soft Sequential Estimation (DRSSE) acquisition scheme. The DRSSE acquisition scheme exhibits a low complexity, which is similar to that of an -sequence generator, while achieving an acquisition time that is linearly dependent on the number of stages in the -sequence generator. A low acquisition time is achieved with the advent of the property that the proposed DRSSE scheme is capable of determining the real-time reliabilities associated with the decision concerning a set of, say , consecutive chips. This set of consecutive chips constitutes the sufficient initial condition for enabling the local -sequence generator to produce a synchronized local despreading -sequence replica. Owing to these attractive characteristics, the DRSSE acquisition scheme constitutes a promising initial synchronization scheme for acquisition of long -sequences, when communicating over various propagation environments
Downlink Space–Time Spreading Using Interference Rejection Codes
No full textIn this paper, the authors will investigate the performance of a loosely synchronized (LS) code-based space–time spreading (STS) scheme in comparison to that of classic Walsh code and pseudonoise code-based STS when communicating over dispersive Nakagami-m multipath channels. Closed-form formulas are derived for characterizing the bit-error-rate performance as a function of the number of resolvable paths L and the number of users K. Our numerical results suggest that the employment of LS code-based STS scheme is beneficial in a low-user-load and low-dispersion channel scenario, where a near-single-user performance can be achieved without a multiuser detector. Index Terms—Code-division multiple access (CDMA), Gaussian approximation, interference-free window (IFW), large area synchronized (LAS) codes, loosely synchronized (LS) codes, Nakagami-m fading
Adaptive Space-Time-Spreading-Assisted Wideband CDMA Systems Communicating over Dispersive Nakagami-m Fading Channels
No full textIn this contribution, the performance of wideband code-division multiple-access (W-CDMA) systems using space-timespreading-(STS-) based transmit diversity is investigated, when frequency-selective Nakagami-m fading channels, multiuser interference, and background noise are considered. The analysis and numerical results suggest that the achievable diversity order is the product of the frequency-selective diversity order and the transmit diversity order. Furthermore, both the transmit diversity and the frequency-selective diversity have the same order of importance. Since W-CDMA signals are subjected to frequency-selective fading, the number of resolvable paths at the receiver may vary over a wide range depending on the transmission environment encountered. It can be shown that, for wireless channels where the frequency selectivity is sufficiently high, transmit diversity may be not necessitated. Under this case, multiple transmission antennas can be leveraged into an increased bitrate. Therefore, an adaptive STS-based transmission scheme is then proposed for improving the throughput ofW-CDMA systems. Our numerical results demonstrate that this adaptive STS-based transmission scheme is capable of significantly improving the effective throughput of W-CDMA systems. Specifically, the studied W-CDMA system’s bitrate can be increased by a factor of three at the modest cost of requiring an extra 0.4 dB or 1.2 dB transmitted power in the context of the investigated urban or suburban areas, respectively
Performance Analysis of Coded -ary Orthogonal Signaling Using Errors-and Erasures Decoding Over Frequency-Selective Fading Channels
No full textThe performance of -ary orthogonal signaling schemes employing Reed–Solomon (RS) codes and redundant residue number system (RRNS) codes is investigated over frequency-selective Rayleigh fading channels. “Errors-and-erasures” decoding is considered, where erasures are judged based on two low-complexity, low-delay erasure insertion schemes—Viterbi’s ratio threshold test (RTT) and the proposed output threshold test (OTT). The probability density functions (PDF) of the ratio associated with the RTT and that of the demodulation output in the OTT conditioned on both the correct detection and erroneous detection of -ary signals are derived, and the characteristics of the RTT and OTT are investigated. Furthermore, expressions are derived for computing the codeword decoding error probability of RS codes or RRNS codes based on the above PDFs. The OTT technique is compared to Viterbi’s RTT, and both of these are compared to receivers using “error-correction only” decoding over frequency-selective Rayleigh-fading channels. The numerical results show that by using “errors-and-erasures” decoding, RS or RRNS codes of a given code rate can achieve higher coding gain than that without erasure information, and that the OTT technique outperforms the RTT, provided that both schemes are operated at the optimum decision thresholds. Index Terms—“Errors-and-erasures” decoding, -ary orthogonal signaling, Rayleigh fading, redundant residue number system codes, Reed–Solomon codes
Performance of Fractionally Spread Multicarrier CDMA in AWGN as Well as Slow and Fast Nakagami-m Fading Channels
No full textAbstract—In multicarrier code-division multiple-access (MCCDMA), the total system bandwidth is divided into a number of subbands, where each subband may use direct-sequence (DS) spreading and each subband signal is transmitted using a subcarrier frequency. In this paper, we divide the symbol duration into a number of fractional subsymbol durations also referred to here as fractions, in a manner analogous to subbands in MC-CDMA systems. In the proposed MC-CDMA scheme, the data streams are spread at both the symbol-fraction level and at the chip level by the transmitter, and hence the proposed scheme is referred to as the fractionally spread MC-CDMA arrangement, or FS MCCDMA. Furthermore, the FS MC-CDMA signal is additionally spread in the frequency (F)-domain using a spreading code with the aid of a number of subcarriers. In comparison to conventional MC-CDMA schemes, which are suitable for communications over frequency-selective fading channels, our study demonstrates that the proposed FS MC-CDMA is capable of efficiently exploiting both the frequency-selective and the time-selective characteristics of wireless channels. Index Terms—Broadband communications, code-division multiple access (CDMA), fractionally spreading, frequency-domain spreading, multicarrier modulation, Nakagami fading, timedomain spreading
Diversity Combining for Fast Frequency Hopping Multiple Access Systems Subjected to Nakagami-m Fading
No full textThe achievable performance of various diversity combining schemes used in fast frequency hopping (FFH) aided M-ary frequency shift keying (MFSK) systems operating in a multiple access scenario subjected to Nakagami-m fading is investigated. Specifically, linear, self-normalization, hard limiting majority vote, soft limiting, product combining and order statistics-normalized envelope detection based diversity combining schemes are considered. The comparison of various diversity combining schemes is based on the achievable bit error rate versus the number of simultaneous users supported. It is shown using simulation results that although some of the combining schemes considered result in an inferior performance compared to the optimum soft limiting combiner, they offer the advantage of achieving an acceptable interference suppression performance without requiring side information
A Reed-Solomon Coded DS-CDMA System Using Noncoherent M-ary Orthogonal Modulation over Multipath Fading Channels
No full textThe performance of Reed–Solomon (RS) coded direct-sequence code division multiple-access (DS-CDMA) systems using noncoherent M-ary orthogonal modulation is investigated over multipath Rayleigh fading channels. Diversity reception techniques with equal gain combining (EGC) or selection combining (SC) are invoked and the related performance is evaluated for both uncoded and coded DS-CDMA systems. "Errors-and-erasures" decoding is considered, where the erasures are based on Viterbi’s so-called ratio threshold test (RTT). The probability density functions (PDF) of the ratio associated with the RTT conditioned on both the correct detection and erroneous detection of the M-ary signals are derived. These PDFs are then used for computing the codeword decoding error probability of the RS coded DS-CDMA system using "errors-and-erasures" decoding. Furthermore, the performance of the "errors-and-erasures" decoding technique employing the RTT is compared to that of "error-correction-only" decoding refraining from using side-information over multipath Rayleigh fading channels. As expected, the numerical results show that when using "errors-and-erasures" decoding, RS codes of a given code rate can achieve a higher coding gain than without erasure information. Index Terms—Direct sequence code division multiple-access, error-correction-only decoding, errors-and-erasures decoding, noncoherent -ary orthogonal signaling, ratio threshold test, Reed–Solomon codes
A Recursive Algorithm for the Error Probability Evaluation of -QAM
No full textA general recursive algorithm for the efficient and accurate computation of the bit error rate (BER) of square-shaped -QAM constellations over additive white Gaussian noise (AWGN) channels is derived. We take advantage of the relationship amongst different square-shaped -QAM constellations using Gray coded bit mapping. Index Terms—AWGN, BER computation, -QAM, square constellation
Non-Coherent Cooperative Communications Dispensing with Channel Estimation Relying on Erasure Insertion Aided Reed-Solomon Coded SFH M-ary FSK Subjected to Partial-Band Interference and Rayleigh Fading
No full textThe rationale of our design is that although much of the literature of cooperative systems assumes perfect coherent detection, the assumption of having any channel estimates at the relays imposes an unreasonable burden on the relay station. Hence, non-coherently detected Reed-Solomon (ReS) coded Slow Frequency Hopping (SFH) assisted M -ary Frequency Shift Keying (FSK) is proposed for cooperative wireless networks, subjected to both partial-band interference and Rayleigh fading. Erasure insertion (EI) assisted ReS decoding based on the joint maximum output-ratio threshold test (MO-RTT) is investigated in order to evaluate the attainable system performance. Compared to the conventional error-correction-only decoder, the EI scheme may achieve an Eb/N0 gain of approximately 3dB at the Codeword Error Probability, Pw , of 10-4 , when employing the ReS (31, 20) code combined with 32-FSK modulation. Additionally, we evaluated the system’s performance, when either equal gain combining (EGC) or selection combining (SC) techniques are employed at the destination’s receiver. The results demonstrated that in the presence of one and two assisting relays, the EGC scheme achieves gains of 1.5 dB and 1.0 dB at the Pw of 10-6 , respectively, compared to the SC arrangement. Furthermore, we demonstrated that for the same coding rate and packet size, the ReS (31, 20) code using EI decoding is capable of outperforming convolutional coding, when 32-FSK modulation is considered, whilst LDPC coding had an edge over the above two schemes
On the Performance of Band-Limited Asynchronous DS-CDMA over Nakagami-m Channels
No full textIn this paper we investigated the BER performance of DS-CDMA using various chip-waveforms, which include three time-limited chip-waveforms and two band-limited chipwaveforms. Closed-form formulae were derived for evaluating the achievable bit-error rate performance with the aid of the standard Gaussian approximation, when communicating over a Nakagami-m channel. The time-limited waveforms impose a low implementational complexity, since they maybe oversampled and read from a look-up table. However, they are outperformed by the frequency-domain raised-cosine waveform as well as the optimum waveform specifically designed by Cho and Lehnert for achieving the lowest possible bit error rate. Index Terms—Code-division multiple-access, chip waveform, Gaussian approximation, Nakagami, band-limited, normalized bandwidth
- …
