Code design and analysis for multiple access communications

This thesis explores various coding aspects of multiple access communications, mainly for spread spectrum multiaccess(SSMA) communications and collaborative coding multiaccess(CCMA) communications. Both the SSMA and CCMA techniques permit efficient simultaneous transmission by several users sharing a common channel, without subdivision in time or frequency. The general principle behind these two multiaccess schemes is that one can find sets of signals (codes) which can be combined together to form a composite signal; on reception, the individual signals in the set can each be recovered from the composite signal. For the CCMA scheme, the isolation between users is based on the code structure; for the SSMA scheme, on the other hand, the isolation between users is based on the autocorrelation functions(ACFs) and crosscorrelation functions (CCFs) of the code sequences. It is clear that, in either case, the code design is the key to the system design.For the CCMA system with a multiaccess binary adder channel, a class of superimposed codes is analyzed. It is proved that every constant weight code of weight w and maximal correlation λ corresponds to a subclass of disjunctive codes of order T 3, the out-of-phase ACFs and CCFs of the codes are constant and equal to √L. In addition, all codes of the same length are mutually orthogonal.2. Maximal length sequences (m-sequences) over Gaussian integers, suitable for use with QAM modulation, are considered. Two sub-classes of m-sequences with quasi-perfect periodic autocorrelations are obtained. The CCFs between the decimated m-sequences are studied. By applying a simple operation, it is shown that some m-sequences over rational and Gaussian integers can be transformed into perfect sequences with impulsive ACFs.3. Frank codes and Chu codes have perfect periodic ACFs and optimum periodic CCFs. In addition, it is shown that they also have very favourable nonperiodic ACFs; some new results concerning the behaviour of the nonperiodic ACFs are derived. Further, it is proved that the sets of combinedFrank/Chu codes, which contain a larger number of codes than either of the two constituent sets, also have very good periodic CCFs. Based on Frank codes and Chu codes, two interesting classes of real-valued codes with good correlation properties are defined. It is shown that these codes have periodic complementary properties and good periodic and nonperiodic ACF/CCFs.Finally, a hybrid CCMA/SSMA coding scheme is proposed. This new hybrid coding scheme provides a very flexible and powerful multiple accessing capability and allows simple and efficient decoding. Given an SSMA system with K users and a CCMA system with N users, where at most T users are active at any time, then the hybrid system will have K . N users with at most T.K users active at any time. The hybrid CCMA/SSMA coding scheme is superior to the individual CCMA system or SSMA system in terms of information rate, number of users, decoding complexity and external interference rejection capability

Code design and analysis for multiple access communications

This thesis explores various coding aspects of multiple access communications, mainly for spread spectrum multiaccess(SSMA) communications and collaborative coding multiaccess(CCMA) communications. Both the SSMA and CCMA techniques permit efficient simultaneous transmission by several users sharing a common channel, without subdivision in time or frequency. The general principle behind these two multiaccess schemes is that one can find sets of signals (codes) which can be combined together to form a composite signal; on reception, the individual signals in the set can each be recovered from the composite signal. For the CCMA scheme, the isolation between users is based on the code structure; for the SSMA scheme, on the other hand, the isolation between users is based on the autocorrelation functions(ACFs) and crosscorrelation functions (CCFs) of the code sequences. It is clear that, in either case, the code design is the key to the system design.For the CCMA system with a multiaccess binary adder channel, a class of superimposed codes is analyzed. It is proved that every constant weight code of weight w and maximal correlation λ corresponds to a subclass of disjunctive codes of order T 3, the out-of-phase ACFs and CCFs of the codes are constant and equal to √L. In addition, all codes of the same length are mutually orthogonal.2. Maximal length sequences (m-sequences) over Gaussian integers, suitable for use with QAM modulation, are considered. Two sub-classes of m-sequences with quasi-perfect periodic autocorrelations are obtained. The CCFs between the decimated m-sequences are studied. By applying a simple operation, it is shown that some m-sequences over rational and Gaussian integers can be transformed into perfect sequences with impulsive ACFs.3. Frank codes and Chu codes have perfect periodic ACFs and optimum periodic CCFs. In addition, it is shown that they also have very favourable nonperiodic ACFs; some new results concerning the behaviour of the nonperiodic ACFs are derived. Further, it is proved that the sets of combinedFrank/Chu codes, which contain a larger number of codes than either of the two constituent sets, also have very good periodic CCFs. Based on Frank codes and Chu codes, two interesting classes of real-valued codes with good correlation properties are defined. It is shown that these codes have periodic complementary properties and good periodic and nonperiodic ACF/CCFs.Finally, a hybrid CCMA/SSMA coding scheme is proposed. This new hybrid coding scheme provides a very flexible and powerful multiple accessing capability and allows simple and efficient decoding. Given an SSMA system with K users and a CCMA system with N users, where at most T users are active at any time, then the hybrid system will have K . N users with at most T.K users active at any time. The hybrid CCMA/SSMA coding scheme is superior to the individual CCMA system or SSMA system in terms of information rate, number of users, decoding complexity and external interference rejection capability

Journal of Telecommunications and Information Technology, 2018, nr 3

kwartalni

Signal Subspace Processing in the Beam Space of a True Time Delay Beamformer Bank

A number of techniques for Radio Frequency (RF) source location for wide bandwidth signals have been described that utilize coherent signal subspace processing, but often suffer from limitations such as the requirement for preliminary source location estimation, the need to apply the technique iteratively, computational expense or others. This dissertation examines a method that performs subspace processing of the data from a bank of true time delay beamformers. The spatial diversity of the beamformer bank alleviates the need for a preliminary estimate while simultaneously reducing the dimensionality of subsequent signal subspace processing resulting in computational efficiency. The pointing direction of the true time delay beams is independent of frequency, which results in a mapping from element space to beam space that is wide bandwidth in nature. This dissertation reviews previous methods, introduces the present method, presents simulation results that demonstrate the assertions, discusses an analysis of performance in relation to the Cramer-Rao Lower Bound (CRLB) with various levels of noise in the system, and discusses computational efficiency. One limitation of the method is that in practice it may be appropriate for systems that can tolerate a limited field of view. The application of Electronic Intelligence is one such application. This application is discussed as one that is appropriate for a method exhibiting high resolution of very wide bandwidth closely spaced sources and often does not require a wide field of view. In relation to system applications, this dissertation also discusses practical employment of the novel method in terms of antenna elements, arrays, platforms, engagement geometries, and other parameters. The true time delay beam space method is shown through modeling and simulation to be capable of resolving closely spaced very wideband sources over a relevant field of view in a single algorithmic pass, requiring no course preliminary estimation, and exhibiting low computational expense superior to many previous wideband coherent integration techniques

Signal Subspace Processing in the Beam Space of a True Time Delay Beamformer Bank

A number of techniques for Radio Frequency (RF) source location for wide bandwidth signals have been described that utilize coherent signal subspace processing, but often suffer from limitations such as the requirement for preliminary source location estimation, the need to apply the technique iteratively, computational expense or others. This dissertation examines a method that performs subspace processing of the data from a bank of true time delay beamformers. The spatial diversity of the beamformer bank alleviates the need for a preliminary estimate while simultaneously reducing the dimensionality of subsequent signal subspace processing resulting in computational efficiency. The pointing direction of the true time delay beams is independent of frequency, which results in a mapping from element space to beam space that is wide bandwidth in nature. This dissertation reviews previous methods, introduces the present method, presents simulation results that demonstrate the assertions, discusses an analysis of performance in relation to the Cramer-Rao Lower Bound (CRLB) with various levels of noise in the system, and discusses computational efficiency. One limitation of the method is that in practice it may be appropriate for systems that can tolerate a limited field of view. The application of Electronic Intelligence is one such application. This application is discussed as one that is appropriate for a method exhibiting high resolution of very wide bandwidth closely spaced sources and often does not require a wide field of view. In relation to system applications, this dissertation also discusses practical employment of the novel method in terms of antenna elements, arrays, platforms, engagement geometries, and other parameters. The true time delay beam space method is shown through modeling and simulation to be capable of resolving closely spaced very wideband sources over a relevant field of view in a single algorithmic pass, requiring no course preliminary estimation, and exhibiting low computational expense superior to many previous wideband coherent integration techniques

Ultra Low Power Communication Protocols for UWB Impulse Radio Wireless Sensor Networks

This thesis evaluates the potential of Ultra Wideband Impulse Radio for wireless sensor network applications. Wireless sensor networks are collections of small electronic devices composed of one or more sensors to acquire information on their environment, an energy source (typically a battery), a microcontroller to control the measurements, process the information and communicate with its peers, and a radio transceiver to enable these communications. They are used to regularly collect information within their deployment area, often for very long periods of time (up to several years). The large number of devices often considered, as well as the long deployment durations, makes any manual intervention complex and costly. Therefore, these networks must self-configure, and automatically adapt to changes in their electromagnetic environment (channel variations, interferers) and network topology modifications: some nodes may run out of energy, or suffer from a hardware failure. Ultra Wideband Impulse Radio is a novel wireless technology that, thanks to its extremely large bandwidth, is more robust to frequency dependent propagation effects. Its impulsional nature makes it robust to multipath fading, as the short duration of the pulses leads most multipath components to arrive isolated. This technology should also enable high precision ranging through time of flight measurements, and operate at ultra low power levels. The main challenge is to design a system that reaches the same or higher degree of energy savings as existing narrowband systems considering all the protocol layers. As these radios are not yet widely available, the first part of this thesis presents Maximum Pulse Amplitude Estimation, a novel approach to symbol-level modeling of UWB-IR systems that enabled us to implement the first network simulator of devices compatible with the UWB physical layer of the IEEE 802.15.4A standard for wireless sensor networks. In the second part of this thesis, WideMac, a novel ultra low power MAC protocol specifically designed for UWB-IR devices is presented. It uses asynchronous duty cycling of the radio transceiver to minimize the power consumption, combined with periodic beacon emissions so that devices can learn each other's wake-up patterns and exchange packets. After an analytical study of the protocol, the network simulation tool presented in the first part of the thesis is used to evaluate the performance of WideMac in a medical body area network application. It is compared to two narrowband and an FM-UWB solutions. The protocol stack parameters are optimized for each solution, and it is observed that WideMac combined to UWB-IR is a credible technology for such applications. Similar simulations, considering this time a static multi-hop network are performed. It is found that WideMac and UWB-IR perform as well as a mature and highly optimized narrowband solution (based on the WiseMAC ULP MAC protocol), despite the lack of clear channel assessment functionality on the UWB radio. The last part of this thesis studies analytically a dual mode MAC protocol named WideMac-High Availability. It combines the Ultra Low PowerWideMac with the higher performance Aloha protocol, so that ultra low power consumption and hence long deployment times can be combined with high performance low latency communications when required by the application. The potential of this scheme is quantified, and it is proposed to adapt it to narrowband radio transceivers by combining WiseMAC and CSMA under the name WiseMAC-HA

Solid State Circuits Technologies

The evolution of solid-state circuit technology has a long history within a relatively short period of time. This technology has lead to the modern information society that connects us and tools, a large market, and many types of products and applications. The solid-state circuit technology continuously evolves via breakthroughs and improvements every year. This book is devoted to review and present novel approaches for some of the main issues involved in this exciting and vigorous technology. The book is composed of 22 chapters, written by authors coming from 30 different institutions located in 12 different countries throughout the Americas, Asia and Europe. Thus, reflecting the wide international contribution to the book. The broad range of subjects presented in the book offers a general overview of the main issues in modern solid-state circuit technology. Furthermore, the book offers an in depth analysis on specific subjects for specialists. We believe the book is of great scientific and educational value for many readers. I am profoundly indebted to the support provided by all of those involved in the work. First and foremost I would like to acknowledge and thank the authors who worked hard and generously agreed to share their results and knowledge. Second I would like to express my gratitude to the Intech team that invited me to edit the book and give me their full support and a fruitful experience while working together to combine this book

Bibliography of Lewis Research Center technical publications announced in 1992

This compilation of abstracts describes and indexes the technical reporting that resulted from the scientific and engineering work performed and managed by the Lewis Research Center in 1992. All the publications were announced in the 1992 issues of STAR (Scientific and Technical Aerospace Reports) and/or IAA (International Aerospace Abstracts). Included are research reports, journal articles, conference presentations, patents and patent applications, and theses