Performance analysis of multicarrier frequency-hopping (MC-FH) code-division multiple-access systems: uncoded and coded schemes

In this paper, we provide multiuser performance analysis of a multicarrier frequency-hopping (MC-FH) code-division multiple-access system as first introduced in the work of Lance and Kaleh. We propose to use a practical low-rate convolutional error-correcting code in this system, which does not require any additional bandwidth than what is needed by the frequency-hopping spread-spectrum modulation. We provide multiuser exact performance analysis of the system for both uncoded and coded schemes in additive white Gaussian noise and fading channels for a single-user correlator receiver. We also derive the performance analysis of the system based on a Gaussian distribution assumption for multiuser interference at the receiver output. Our numerical results first indicate that the coded scheme significantly increases the number of users supported by the system at a fixed bit error rate, in comparison with the uncoded MC-FH scheme. Moreover, it shows that the Gaussian analysis in some cases does not accurately predict the number of users supported by the system.     

Ultra-wide bandwidth time-hopping spread-spectrum impulse radio forwireless multiple-access communications

Attractive features of time-hopping spread-spectrum multiple-access systems employing impulse signal technology are outlined, and emerging design issues are described. Performance of such communications systems in terms of achievable transmission rate and multiple-access capability are estimated for both analog and digital data modulation formats under ideal multiple-access channel conditions     

Multi-user selection diversity for spread-spectrum multi-carrier multiple-access systems

Recently, Multi-User Selection Diversity (MUSDiv) for single-carrier systems has been under extensive study on account of the enhancement it provides to system performance with minimum feedback requirements. However, its application to multichannel systems is considered straightforward and thus, it has not been thoroughly examined. In this paper, the performance of MUSDiv is investigated when applied to the spread-spectrum multi-carrier multiple-access system, where the scheduling has to be performed for all the available channels and self interference must also be considered. Specifically, based on the absolute and normalized Signal-to-Noise-Ratio (SNR) scheduling algorithms, two algorithms are presented, modified and optimized, so that they can be applied on a subband instead of a single-channel basis. Moreover, we propose a new scheduling scheme which constitutes a trade-off between the previous schemes, concerning fairness and capacity performance. The new algorithms are related to the symbol Signal-to-Noise-plus-Interference-Ratio (SNIR) instead of SNR and two interference models were devised to this end. Closed-form expressions for the system capacity are extracted for each case, which are compared with simulation results. The research is also extended to the case of non-identical user power profiles among the available subcarriers. The channel state information required to utilize multi-user selection diversity is already necessary for the most common combining schemes, so no more feedback is actually needed.     

Performance of the limiter-discriminator-integrator detector infrequency-hop spread-spectrum multiple-access networks

This paper evaluates the performance of the limiter-discriminator-integrator detector (LDID) in asynchronous frequency-hop spread-spectrum multiple-access (AFHSS-MA) networks using binary frequency shift-keying (BFSK) modulation via Monte Carlo simulations. Both additive white Gaussian noise (AWGN) and Rayleigh-fading channels are considered and we find that the LDID offers a performance that is slightly worse than or comparable to that of the matched filter detector for the nonfading and Rayleigh-fading cases respectively. Also, hard limiting of the integrator input is proposed which significantly improves the performance of the LDID in AFHSS-MA networks resulting in a higher throughput than that achievable with a matched filter detector     

Conditions for synchronisation and corresponding user capacities for spread-spectrum multiple-access systems

User capacities for direct-sequence spread-spectrum multiple-access communication systems are obtained, for the situation where a receiver has to synchronise to its wanted signal in the presence of other users' transmissions, under all relative phase conditions. The use of both conventional and rapid-acquisition codes is considered.     

Performance analysis of coded multicarrier spread-spectrum systemsin the presence of multipath fading and nonlinearities

In this paper, we analyze the effects of a nonlinear amplifier on the performance of convolutionally coded multicarrier spread-spectrum systems in the presence of multipath fading. Two performance measures, bit-error rate (BER) and adjacent channel power ratio (ACPR) are considered to assess the effects of in-band interference and out-of-band interference (spectral regrowth) from the nonlinear amplifier, respectively. A memoryless polynomial model is used to represent the bandpass amplifier amplitude nonlinearities (AM/AM) and a slow frequency-nonselective Rayleigh fading channel is assumed for each modulated carrier. Analytical results for the BER for uncoded systems and upper bounds on the BER for coded systems are presented. The optimum amplifier output power backoffs for both systems, which yield the smallest system power consumption, are also determined. The obtained ACPR shows its slow (inverse linear) falloff with the amplifier output backoff     

Performance analysis of direct-sequence spread-spectrum multiple-access communication in an indoor Rician-fading channel with DPSK modulation

The bit error probability for direct-sequence spread-spectrum multiple-access (DS/SS-MA) in indoor radio channels is evaluated, assuming differential phase-shift-keying (DPSK) modulation, both for selection diversity and for maximal-ratio combining. The indoor radio environment is modelled as a Rician fading channel.<>     

Performance analysis for coded CDMA systems

This correspondence analyzes the bit-error rate (BER) performance of coded synchronous code-division multiple-access (CDMA) systems assuming perfect channel state information (CSI) and optimal joint multiuser detection/decoding (OJMUDD). Our analysis is conducted in the same framework as that of uncoded systems. First, we derive the precise probability of an error event, then we provide an upper bound on the BER based on the sum of pairwise error probabilities, and, finally, we tighten the upper bound by considering decomposable error events. Many new concepts unique to coded systems are introduced. We propose to use quasi parity checks for identifying permissible error events, introduce the concept of compatible probability of error matrices, extend the list of conditions for identifying decomposable error events, and introduce the concept of conjugate sets to explore the symmetry among indecomposable error events. Simulation results are given along with theoretical predictions.     

A comparison of trellis coded versus convolutionally codedspread-spectrum multiple-access systems

A system model is proposed that allows one to apply both trellis coding and PN spreading sequence to the data symbols to be transmitted. Rate n/n+1, trellis codes using 2ⁿ⁺¹-point MPSK signal constellations are investigated when Gold sequences are used for PN spreading. Performance in an additive white Gaussian noise (AWGN) channel is investigated, with 5-20 users transmitting simultaneously. Using the criteria of equal complexity and throughput, the performance of the trellis codes in a SSMA (spread spectrum multiple access) environment is compared to that of medium-rate to low-rate convolutional codes through the use of a generalized transfer function bound. The average degradation due to the interuser interference is determined by the method of moments. The validity of approximating the interuser interference as a Gaussian random variable is also investigated. The numerical results illustrate that for a given complexity, chip rate and throughput, low-rate convolutional codes provide the best performance in an SSMA system. As lower-rate convolutional codes are used, there is an increase in the effective interuser interference due to the greater cross-correlation effects from using shorter PN sequences, or alternatively from the effects of partial cross-correlation. However, this increased degradation is more than overcome by the increased distance properties of the low-rate codes     

Performance of a coded band-limited spread-spectrum multiple-accessscheme using channel sensing

The authors introduce and study the message delay and channel throughput behavior of a channel-sense multiple access/spread-spectrum (CSMA/SS) scheme. It is assumed that each net station can gain information as to whether the total number of ongoing transmissions exceeds a given threshold, M, or not. This entails, for example, the availability of an ancillary low-rate out-of-band or in-band signaling channel. A transmitting station will abort its transmission upon the reception of a signaling message indicating that the current number of transmissions exceeds the prescribed threshold. A random-access scheme is used to control the access of messages to the channel. Using derived performance equations, numerical results are presented illustrating the delay-throughout performance of such a CSMA/SS scheme. Key parameters involved in this performance analysis include: channel bandwidth, error-correction code capability, and propagation delay. Given an average message length, an activity threshold level M can be selected to yield the best delay-throughput performance characteristics     

Direct-sequence spread-spectrum multiple-access communications with random signature sequences: a large deviations analysis

A direct-sequence spread-spectrum multiple-access bit-error probability analysis is developed using large-deviations theory. Let m denote the number of interfering spread-spectrum signals and let n denote the signature sequence length. Then the large deviations limit is as n to infinity with m fixed. A tight asymptotic expression for the bit-error probability is proven, and in addition, recent large-deviations results with the importance sampling Monte Carlo estimation technique are applied to obtain accurate and computationally efficient estimates of the bit-error probability for finite values of m and n. The large-deviations point of view is compared also to the conventional asymptotics of central limit theory and the associated Gaussian approximation. The Gaussian approximation is accurate and the ratio m/n is moderately large and all signals have roughly equal power. In the near/far situation, however, the Gaussian approximation is quite poor. In contrast, large-deviations techniques are more accurate in the near/far situation, and it is here that these methods provide some important practical insight.<>     

跳时超宽带无线电的性能分析

超宽带脉冲无线电是无线通信领域的一种全新技术,有着广阔的应用前景.它是一种基带无载波短脉冲,不同于使用正弦载波的传统通信系统.本文用满足FCC频谱规划的脉冲--高斯脉冲的五阶导数推导了TH-BPSK方式下的跳时超宽带扩频系统的误码与多址性能,并研究了多径对其性能的影响,比较了TH-BPSK 与TH-PPM系统性能,分析结果表明TH-BPSK的性能(未考虑多径)明显优于TH-PPM,但是TH-PPM抗多径性能优于TH-BPSK.     

Performance considerations of code division multiple-access systems

The performance of code division multiple-access (CDMA) systems is determined using direct-sequence spectral spreading. Asynchronous users are assumed so that there is no network control. Under relatively ideal conditions, the degradation in system performance as a function of the number of users is shown to have a threshold effect. This basic limitation in the number of users of the system is further limited if the powers are unequal. For two users, system performance as a function of their power ratios also has a threshold effect. System performance as a function of the amount of spectral spreading is determined. The performance of both coded and uncoded systems is predicted.     

Nonlinear quantization and the design of coded and uncoded signalconstellations

The author analyzes the effects of nonlinear quantizers, used in T1 carrier systems, on the performance of QAM (quadrature amplitude modulation) and TCM (trellis coded modulation) voiceband data communication modems, and introduces a method to counteract the effects of these nonlinearities. The effect of nonlinear quantizers is modeled as a source of multiplicative noise whose variance is proportional to the amplitude of the quantized signal. The relation between variance of the multiplicative noise, characteristics of the nonlinear quantizer, and impulse response of the pulse shaping filters used in the modems is derived. Effects of multiplicative noise on the performance of QAM and TCM modems are analyzed. A method for the design of QAM and TCM signal constellations is introduced which counteracts the harmful effects of nonlinear quantizers. The new constellations provide 2-3 dB performance improvements in multiplicative noise channels while losing less than 0.5 dB in additive noise channels     

LDPC编码的FFH／BFSK系统性能分析

LDPC码是目前发现的性能最好的纠错码.本文深入分析了采用LDPC纠错编码的快速跳频通信系统的实现方法,通过仿真说明了采用LDPC纠错编码的快速跳频通信系统和分集合并进行联合编码时,存在一种最优的组合,LDPC码有最佳的码率.仿真结果也表明采用LDPC纠错编码的快速跳频系统有良好的抗部分频带干扰的性能.     

Performance analysis for an adaptive filter code-tracking techniquein direct-sequence spread-spectrum systems

This paper investigates tracking of direct-sequence spread-spectrum (DS/SS) signals based on an adaptive filtering technique. It is shown that a previously proposed hardware for code acquisition is also capable of code-tracking, and, hence, by performing both acquisition and tracking with the same circuitry, a significant simplification in the overall DS/SS receiver structure is gained. Analytical results show that the proposed scheme has a good tracking performance, as measured by the hold-in time and the false alarm penalty time, and is less sensitive to variations in the signal-to-noise ratio (SNR) compared to conventional delay-locked loops (DLLs). Moreover, simulation results show that the proposed adaptive filter tracking scheme has a smaller residual tracking error than that produced by a conventional maximum-likelihood estimator (MLE)     

Performance analysis of stack decoding on block coded modulation schemes using tree diagram

The channel encoder adds redundancy in a structured way to provide error control capability. Modulator converts the symbol sequences from the channel encoder into waveforms which are then transmitted over the channel. Usually channel coder and modulator are implemented independently one after the other. But in a band limited channel better coding gains without sacrificing signal power are achieved when coding is combined with modulation. Block Coded Modulation (BCM) is such a scheme that results from the combination of linear block codes and modulation. In this paper we are proposing a stack decoding of rate 2/3 and rate 1/2 BCM schemes using tree structure and performance is compared with the Viterbi decoding that uses trellis representation. Simulation result shows that at reasonable bit error rate stack decoder performance is just 0.2 to 0.5 dB inferior to that of Viterbi decoding. Since stack decoding is a near optimum decoding scheme and whose decoding procedure is adaptable to noise level, we can consider this method in place of Viterbi decoding which is optimum and its decoding complexity grows exponentially with large code lengths.     

Performance analysis of convolutionally coded systems over quasi-static fading channels

This paper presents an improved upper bound on the performance of convolutionally coded systems over quasi-static fading channels (QSFC). The bound uses a combination of a classical union bound when the fading channel is in a high signal-to-noise ratio (SNR) state together with a new upper bound for the low SNR state. This new bounding approach is applied to both BPSK convolutional and turbo codes, as well as serially concatenated BPSK convolutional/turbo and space-time block codes. The new analytical technique produces bounds which are usually about 1 dB tighter than existing bounds. Finally, based on the proposed bound, we introduce an improved design criterion for convolutionally coded systems in slow flat fading channels. Simulation results are included to confirm the improved ability of the proposed criterion to search for convolutional codes with good performance over a QSFC.