James S. Lehnert
Purdue University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by James S. Lehnert.
IEEE Transactions on Communications | 1989
Robert K. Morrow; James S. Lehnert
A technique is developed to find an accurate approximation to the probability of data bit error and the probability of packet success in a direct-sequence spread-spectrum multiple-access (DS/SSMA) packet radio system with random signature sequences. An improved Gaussian approximation to the probability of data bit error is performed. Packet performance is analyzed by using the theory of moment spaces to gain insight into the effect of bit-to-bit error dependence caused by interfering signal relative delays and phases which are assumed constant over the duration of a desired packet. Numerical results show that if no error control exists in the desired packet or if block error control is used when multiple-access interference is high, the error dependence increases the average probability of packet success beyond that predicted by models which use independent bit errors. However, when block error control is used and the multiple-access interference is low, the bit error dependencies cause a reduction in packet error performance. >
IEEE Transactions on Communications | 1987
James S. Lehnert; Michael B. Pursley
Binary direct-sequence spread-spectrum multiple-access communications, an additive white Gaussian noise channel, and a coherent correlation receiver are considered. An expression for the output of the receiver is obtained for the case of random signature sequences, and the corresponding characteristic function is determined. The expression is used to study the density function of the multiple-access interference and to determine arbitrarily tight upper and lower bounds on the average probability of error. The bounds, which are obtained without making a Gaussian approximation, are compared to results obtained using a Gaussian approximation. The effects of transmitter power, the length of the signature sequences, and the number of interfering transmitters are illustrated. Each transmitter is assumed to have the same power, although the general approach can accommodate the case of transmitters with unequal powers.
IEEE Transactions on Communications | 1992
Robert K. Morrow; James S. Lehnert
Packet throughput figures are obtained for direct sequence spread spectrum multiple access (DS/SSMA) slotted ALOHA radio systems where all users employ random signature sequences from bit-to-bit within all transmitted packets. These calculations use an improved Gaussian approximation technique which gives accurate bit error probabilities and also incorporates the effect of bit-to-bit error dependence within each packet in the multiaccess interference environment. Numerical results are given for packets which employ varying amounts of block error control, and a comparison is made with results obtained by other methods which ignore the effects of bit-to-bit error dependence within each packet in the multiaccess interference environment. Numerical results are given for packets which employ varying amount of block error control, and a comparison is made with results obtained by other methods which ignore the effects of bit-to-bit error and/or employ less-accurate Gaussian approximations to the probability of data bit error. Maximum throughput per unit bandwidth figures are calculated which compare favorably to similar figures for narrowband signaling techniques. >
IEEE Transactions on Information Theory | 1998
Tan F. Wong; Tat M. Lok; James S. Lehnert; Michael D. Zoltowski
A linear receiver for direct-sequence spread-spectrum multiple-access communication systems under the aperiodic random sequence model is considered. The receiver consists of the conventional matched filter followed by a tapped delay line with the provision of incorporating the use of antenna arrays. It has the ability of suppressing multiple-access interference (MAI) and narrowband interference in some weighted proportions, as well as combining multipath components without explicit estimation of any channel conditions. Under some specific simplified channel models, the receiver reduces to the minimum variance distortionless response beamformer, the RAKE receiver, a notch filter, or an MAI suppressor. The interference rejection capability is made possible through a suitable choice of weights in the tapped delay line. The optimal weights can be obtained by straightforward but computationally complex eigenanalysis. In order to reduce the computational complexity, a simple blind adaptive algorithm is also developed.
IEEE Transactions on Communications | 1987
James S. Lehnert; Michael B. Pursley
The analysis of a multipath-combining receiver for directsequence spread-spectrum communications through a specular multipath channel is developed. The analysis applies to systems that use quadriphase-shift-keyed, offset quadriphase-shift-keyed, minimum-shiftkeyed, or binary phase-shift-keyed modulation. The measures of performance are the signal-to-noise ratio and approximations to the error probability involving the signal-to-noise ratio. The performance of a multipath-combining receiver is determined not only for the case of a single transmitter, but also for the case of multiple interfering transmit, ters. Furthermore, the performance of the system is determined in terms of parameters of the signature sequences. These parameters can be used as guides in selecting signature sequences for the system. Results are also given for the case of randomly generated signature sequences.
IEEE Transactions on Communications | 1998
Tsao-Tsen Chen; James S. Lehnert
An expression in matrix form for the multiple-access interference (MAI) in an asynchronous direct-sequence spread-spectrum multiple-access (DS/SSMA) communication system with cascaded sequences (CVs), arbitrary chip waveforms, and trellis-coded modulation (TCM) with a pulse amplitude modulation (PAM) or quadrature amplitude modulation (QAM) signal set is obtained. TCM provides significant coding gain while the CVs decrease the correlation between the MAI of adjacent data intervals. The expression is used to calculate arbitrarily accurate probability density functions (PDFs) of the MAI in the TCM system and to derive an accurate approximation of the MAI variance. It also helps illustrate some properties of the MAI by separating contributing parameters into different matrices. We derive an approximation of the upper union bound on the bit-error probability and investigate its applicability. The results show that CV schemes can greatly reduce the pairwise error probabilities (PEPs) until the length of the CV becomes greater than that of the error weight sequence (EWS) under consideration.
IEEE Transactions on Communications | 1999
Tan F. Wong; Tat M. Lok; James S. Lehnert
A linear decentralized receiver capable of suppressing multiple-access interference (MAI) for asynchronous direct-sequence code-division multiple-access (DS-CDMA) systems with aperiodic random signature sequences is proposed. Performance bounds on this receiver are also obtained. Using them as performance measures, the problem of chip waveform selection in DS-CDMA systems with the proposed receiver under the near-far scenario is investigated. In particular, the performance of several practical chip waveforms is compared. An LMS-type adaptive algorithm is developed to obtain the parameters needed in the receiver, which only requires the signature sequence and coarse timing information of the desired user.
IEEE Transactions on Communications | 1989
James S. Lehnert
A technique is presented for obtaining bounds on the average probability of error for direct-sequence spread-spectrum multiple-access (DS/SSMA) communications. The technique is of interest because it yields arbitrarily right bounds, involves a small amount of computation, avoids numerical integrations, and applies to many types of detection. As an illustration, the technique is applied to binary DS/SSMA communications, an additive white Gaussian noise channel, and a coherent correlation receiver. It is assumed that all the signature sequences are deterministic. Each transmitter is assumed to have the same power, although the approach can accommodate the case of transmitters with unequal powers. Expressions are given for the density functions of the random variables that model the multiple-access interference. These expressions are used to obtain arbitrarily tight upper and lower bounds on the average probability of error without making a Gaussian approximation or performing numerical integrations to incorporate the effects of multiple-access interference. >
IEEE Transactions on Communications | 2000
June Namgoong; Tan F. Wong; James S. Lehnert
A subspace-based linear minimum mean-squared error (MMSE) multiuser detection scheme is proposed for a multicarrier direct-sequence code-division multiple-access (MC-DS-CDMA) system. Typically, a MC-DS-CDMA system employs a band-limited chip waveform. The band-limited nature of the chip waveform causes problem in applying standard subspace techniques because no nonnull noise subspace can be formed. It is shown that channel and timing information needed for the construction of the linear MMSE detector can be identified by a multiple-signal-classification-like algorithm based on a finite-length truncation approximation of the chip waveform. In practice, since perturbed versions of the subspaces assumed in the finite-length truncation approximation are actually observed, and because of the band-limited property of the chip waveform, the accuracy of the channel estimation and, hence, the performance of the MMSE detector are degraded. This effect is investigated in this paper.
IEEE Transactions on Information Theory | 2002
Joon Ho Cho; James S. Lehnert
An optimal signal design for band-limited, asynchronous, direct-sequence code-division multiple-access (DS-CDMA) communications with aperiodic random spreading sequences and a conventional matched filter receiver is considered in an additive white Gaussian noise (AWGN) channel. With bandwidth defined in the strict sense, two optimization problems are solved under finite bandwidth and zero interchip interference constraints. First, a chip waveform optimization is performed given the system bandwidth, the data symbol transmission rate, and the processing gain. A technique to characterize a band-limited chip waveform with a finite number of parameters is developed, and it is used to derive optimum chip waveforms which minimize the effect of multiple-access interference (MAI) for any energy and delay profile of users. Next, a joint optimization of the processing gain and the chip waveform is performed, given the system bandwidth and the data symbol transmission rate. A sufficient condition for a system to have lower average probability of bit error for any energy profile is found, and it is used to derive some design strategies. It is shown that the flat spectrum pulse with the processing gain leading to zero excess bandwidth results in the minimum average probability of bit error. Design examples and numerical results are also provided.