Dilip V. Sarwate

Bio: Dilip V. Sarwate is an academic researcher from University of Illinois at Urbana–Champaign. The author has contributed to research in topics: Spread spectrum & Extended Euclidean algorithm. The author has an hindex of 28, co-authored 65 publications receiving 5266 citations.

Crosscorrelation properties of pseudorandom and related sequences

Abstract: Binary maximal-length linear feedback shift register sequences (m-sequences) have been successfully employed in communications, navigation, and related systems over the past several years. For the early applications, m-sequences were used primarily because of their excellent periodic autocorrelation properties. For many of the recent systems applications, however, the crosscorrelation properties of such sequences are at least as important as the autocorrelation properties, and the system performance depends upon the aperiodic correlation in addition to the periodic correlation. This paper presents a survey of recent results and provides several new results on the periodic and aperiodic crosscorrelation functions for pairs of m-sequences and for pairs of related (but not maximal-length) binary shift register sequences. Also included are several recent results on correlation for complex-valued sequences as well as identities relating the crosscorrelation functions to autocorrelation functions. Examples of problems in spread-spectrum communications are employed to motivate the choice of correlation parameters that are considered in the paper.

On sharing secrets and Reed-Solomon codes

Abstract: Shamir's scheme for sharing secrets is closely related to Reed-Solomon coding schemes. Decoding algorithms for Reed-Solomon codes provide extensions and generalizations of Shamir's method.

High-speed architectures for Reed-Solomon decoders

Abstract: New high-speed VLSI architectures for decoding Reed-Solomon codes with the Berlekamp-Massey algorithm are presented in this paper. The speed bottleneck in the Berlekamp-Massey algorithm is in the iterative computation of discrepancies followed by the updating of the error-locator polynomial. This bottleneck is eliminated via a series of algorithmic transformations that result in a fully systolic architecture in which a single array of processors computes both the error-locator and the error-evaluator polynomials. In contrast to conventional Berlekamp-Massey architectures in which the critical path passes through two multipliers and 1+[log/sub 2/,(t+1)] adders, the critical path in the proposed architecture passes through only one multiplier and one adder, which is comparable to the critical path in architectures based on the extended Euclidean algorithm. More interestingly, the proposed architecture requires approximately 25% fewer multipliers and a simpler control structure than the architectures based on the popular extended Euclidean algorithm. For block-interleaved Reed-Solomon codes, embedding the interleaver memory into the decoder results in a further reduction of the critical path delay to just one XOR gate and one multiplexer, leading to speed-ups of as much as an order of magnitude over conventional architectures.

Performance Evaluation for Phase-Coded Spread-Spectrum Multiple-Access Communication--Part II: Code Sequence Analysis

Abstract: An analysis of the code sequence parameters that are most important to the communication performance of an asynchronous phase-coded spread-spectrum multiple-access communication system is presented. Previously known bounds and computational techniques for such parameters are surveyed. Some new results on mean-square correlation are included.

I and i

Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

Minimum probability of error for asynchronous Gaussian multiple-access channels

Abstract: Consider a Gaussian multiple-access channel shared by K users who transmit asynchronously independent data streams by modulating a set of assigned signal waveforms. The uncoded probability of error achievable by optimum multiuser detectors is investigated. It is shown that the K -user maximum-likelihood sequence detector consists of a bank of single-user matched filters followed by a Viterbi algorithm whose complexity per binary decision is O(2^{K}) . The upper bound analysis of this detector follows an approach based on the decomposition of error sequences. The issues of convergence and tightness of the bounds are examined, and it is shown that the minimum multiuser error probability is equivalent in the Iow-noise region to that of a single-user system with reduced power. These results show that the proposed multiuser detectors afford important performance gains over conventional single-user systems, in which the signal constellation carries the entire burden of complexity required to achieve a given performance level.

Global Positioning System: Signals, Measurements, and Performance

Abstract: The Global Positioning System (GPS) is a satellite-based navigation and time transfer system developed by the U.S. Department of Defense. It serves marine, airborne, and terrestrial users, both military and civilian. Specifically, GPS includes the Standard Positioning Service (SPS) which provides civilian users with 100 meter accuracy, and it serves military users with the Precise Positioning Service (PPS) which provides 20-m accuracy. Both of these services are available worldwide with no requirement for a local reference station. In contrast, differential operation of GPS provides 2- to 10-m accuracy to users within 1000 km of a fixed GPS reference receiver. Finally, carrier phase comparisons can be used to provide centimeter accuracy to users within 10 km and potentially within 100 km of a reference receiver. This advanced tutorial will describe the GPS signals, the various measurements made by the GPS receivers, and estimate the achievable accuracies. It will not dwell on those aspects of GPS which are well known to those skilled in the radio communications art, such as spread-spectrum or code division multiple access. Rather, it will focus on topics which are more unique to radio navigation or GPS. These include code-carrier divergence, codeless tracking, carrier aiding, and narrow correlator spacing.

Crosscorrelation properties of pseudorandom and related sequences

Abstract: Binary maximal-length linear feedback shift register sequences (m-sequences) have been successfully employed in communications, navigation, and related systems over the past several years. For the early applications, m-sequences were used primarily because of their excellent periodic autocorrelation properties. For many of the recent systems applications, however, the crosscorrelation properties of such sequences are at least as important as the autocorrelation properties, and the system performance depends upon the aperiodic correlation in addition to the periodic correlation. This paper presents a survey of recent results and provides several new results on the periodic and aperiodic crosscorrelation functions for pairs of m-sequences and for pairs of related (but not maximal-length) binary shift register sequences. Also included are several recent results on correlation for complex-valued sequences as well as identities relating the crosscorrelation functions to autocorrelation functions. Examples of problems in spread-spectrum communications are employed to motivate the choice of correlation parameters that are considered in the paper.

Multiparty unconditionally secure protocols

Abstract: Under the assumption that each pair of participants can communicate secretly, we show that any reasonable multiparty protocol can be achieved if at least 2n/3 of the participants are honest. The secrecy achieved is unconditional. It does not rely on any assumption about computational intractability.