Spread Spectrum (SS) techniques are methods used in communication systems where the spectra of the signal is spread over a much wider bandwidth. The large bandwidth of the resulting signals make SS signals difficult to intercept using conventional methods based on Nyquist sampling. Recently, a novel concept called compressive sensing has emerged. Compressive sensing theory suggests that a signal can be reconstructed from much fewer measurements than suggested by the Shannon Nyquist theorem, provided that the signal can be sparsely represented in a dictionary. In this work, motivated by this concept, we study compressive approaches to detect and decode SS signals. We propose compressive detection and decoding systems based both on random measurements (which have been the main focus of the CS literature) as well as designed measurement kernels that exploit prior knowledge of the SS signal. Compressive sensing methods for both Frequency-Hopping Spread Spectrum (FHSS) and Direct Sequence Spread Spectrum (DSSS) systems are proposed.

No description available.

The ever-increasing demand for higher information-transfer rates in wireless data networks invokes the need to develop more spectrally-efficient communication strategies. Techniques such as MIMO and turbo-coded CDMA are well known and obvious candidates for improving the spectral efficiency of next generation wireless networks, and addressing the limitations of currently implemented technologies. Correspondingly, such methods are finding their way into wireless network standards such as 3GPP and IEEE 802.20. / One measure of the size of a communication system is the number of independent data streams being transmitted simultaneously through a channel, assuming tight constraints on available bandwidth and signal power. Such data streams may originate from different users all wishing to communicate at once. In addition, each user may wish to transmit independent data on more than one antenna simultaneously in order to increase his or her own data rate. Although strategies for such multi-dimensional signalling have seen significant improvements in recent years, most of the techniques proposed in the literature still suffer from either poor performance or prohibitive complexity when the size of the system grows large. / This thesis is concerned primarily with supporting high system spectral-efficiencies in very large systems, while maintaining strong resistance to data errors with manageable complexity. / Iterative decoding, or Bayesian message-passing, is demonstrably able to approach closely the performance of an optical decoder for certain families of single-user error correction codes, with low computational complexity. The topic of this work, iterative list detection, is a technique for jointly decoding many independent data streams from multiple users and/or antennas, using powerful iterative decoding strategies developed for such single-user codes. The receiver strategies presented are based on the premise that iterative Bayesian decoding is capable of achieving performance very close to that of an optimal decoder for a multi-dimensional system, given certain assumptions on the system model. Other than this, iterative list detection makes no assumptions about the statistics of the interfering signals, linearity, or any other simplifying impositions. Rather, the method seeks only to approximate closely the probabilistic quantities dictated by the rules of the iterative decoding paradigm, which is by now well understood. / List detection itself refers to the computationally efficient calculation of signal probabilities conditioned on a noise-and-interference corrupted signal at the receiver, computed for each simultaneously transmitted signal. The calculation is the key step in the implementation of an iterative receiver for such a system. / After introducing the list detection strategy in the context of iterative receivers for multi-user MIMO channels, algorithms for optimal list detection are described. A new optimal list detection algorithm with some superior properties to other implementations in the literature is proposed. While still very computationally complex, performance results for optimal list detection are presented that demonstrate the effectiveness and utility of the paradigm, and provide a performance benchmark for any sub-optimal list detection technique. The performance is also compared with other techniques such as linear filters, providing an appreciation of the benefits of list detection. / An asymptotic large-systems analysis is then undertaken in order to determine the behaviour of a fundamental parameter that determines the complexity of list detection, specifically the number of terms in a certain summation. The minimum number of terms is derived under an accuracy constraint on the signal probabilities. Results demonstrate that the number of terms does not necessarily increase with the size of the system, and the conditions under which this is true are indicated. / The main contribution of the thesis is the development of a number or computationally efficient sub-optimal list detection algorithms. Various strategies are proposed for different system scenarios, resulting in near-optimal performance with complexity that adapts automatically to cope with changing channel conditions and interference. The performance of the new techniques is demonstrated via simulation in channels with various statistics, dimensionality and interference, showing significant improvements in terms of both error resistance and complexity over other proposed methods. / Thesis (PhDTelecommunications)--University of South Australia, 2004.

Thesis (PhD)--University of South Australia, 1999

Bibliography: leaves 181-201. / ix, 201 leaves : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / This thesis investigates non-binary spread-spectrum multiple-access communications. The research considers wide generation techniques, system performance, how performance is influenced by the different properties of the codes, and how those properties relate to the code generation technqiue. The research refines the code design philosophy and investigates this by developing a novel code generation technique. / Thesis (Ph.D.)--University of Adelaide, Dept. of Electrical and Electronic Engineering, 1995?

Bibliography: leaves [205]-213 / viii, 214 leaves : ill ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.)--University of Adelaide, 1991

The ever-increasing demand for higher information-transfer rates in wireless data networks invokes the need to develop more spectrally-efficient communication strategies. Techniques such as MIMO and turbo-coded CDMA are well known and obvious candidates for improving the spectral efficiency of next-generation wireless networks, and addressing the limitations of currently implemented technologies. Correspondingly, such methods are finding their way into wireless network standards such as 3GPP and IEEE 802.20. One measure of the size of a communication system is the number of independent data streams being transmitted simultaneously through a channel, assuming tight constraints on available bandwidth and signal power. Such data streams may originate from different users all wishing to communicate at once. In addition, each user may wish to transmit independent data on more than one antenna simultaneously in order to increase his or her own data rate. Although strategies for such multi-dimensional signalling have seen significant improvements in recent years, most of the techniques proposed in the literature still suffer from either poor performance or prohibitive complexity when the size of the system grows large. This thesis is concerned primarily with supporting high systemspectral-efficiencies in very large systems, while maintaining strong resistance to data errors with manageable complexity. / thesis (PhDTelecommunications)--University of South Australia, 2004.

Thesis (Ph.D.) -- McMaster University, 1998. / Includes bibliographical references (leaves 143-151). Also available via World Wide Web.

Thesis (M.S.)--Ohio University, June, 2004. / Title from PDF t.p. Includes bibliographical references (leaves 96-97).

Thesis (M.S.)--Ohio University, August, 1998. / Title from PDF t.p.