Sensor array signal processing : two decades later

Caption title.Includes bibliographical references (p. 55-65).Supported by Army Research Office. DAAL03-92-G-115 Supported by the Air Force Office of Scientific Research. F49620-92-J-2002 Supported by the National Science Foundation. MIP-9015281 Supported by the ONR. N00014-91-J-1967 Supported by the AFOSR. F49620-93-1-0102Hamid Krim, Mats Viberg

Root-MUSIC-based methods for blind network-assisted diversity multiple access

Packet collisions in wireless networks degrade the throughput and impede the system performance. The collided packets are typically corrupted and get discarded. Channelization methods avoid collisions through fixed assignment of communication resources to the system users, but they do not take into account the randomness of packet arrivals. Statistical multiplexing optimally adapts the allocation of resources to the instantaneous traffic demands of the users. However, it is only possible in the downlink wherein the data streams are managed by one station. Random-access methods mimic statistical multiplexing by dynamically assigning resources to users. A slot is wasted if the channel incurs a collision, and the collided packets have to be retransmitted. First, we present a cross-layer design for providing multiple access to a shared wireless link. While retransmissions are controlled by the medium access control (MAC) layer, this creates sufficient diversity to recover the collided packets in the physical (PHY) layer. Both the number and identities of the involved transmitters in a collision are unknown to the receiver. The signal separation is done blindly using root-MUSIC-like algorithms. We solve the collision resolution problem in four network-operation modes: synchronous blocking mode, synchronous non-blocking mode, asynchronous blocking mode and asynchronous non-blocking mode. Second, we evaluate the decoding performance of the algorithms in block-fading channels with additive white Gaussian noise. We analytically demonstrate the effect of signal-to-noise ratio and the number of retransmissions on the signal separation capability of the proposed methods for a given number of collided packets. Third, we evaluate the network throughput and mean packet queueing delay for the proposed collision resolution algorithms analytically and numerically. We derive conditions for stability of the queueing network as function of the mean packet arrival rates.Electrical and Computer Engineerin

Reduced-complexity signal processing techniques for multiple-input multiple-output storage and wireless communication systems

Ph.DNUS-TU/E JOINT PH.D. PROGRAMM

Cyclic Prefix-Free MC-CDMA Arrayed MIMO Communication Systems

The objective of this thesis is to investigate MC-CDMA MIMO systems where the antenna array geometry is taken into consideration. In most MC-CDMA systems, cyclic pre xes, which reduce the spectral e¢ ciency, are used. In order to improve the spectral efficiency, this research study is focused on cyclic pre x- free MC-CDMA MIMO architectures. Initially, space-time wireless channel models are developed by considering the spatio-temporal mechanisms of the radio channel, such as multipath propaga- tion. The spatio-temporal channel models are based on the concept of the array manifold vector, which enables the parametric modelling of the channel. The array manifold vector is extended to the multi-carrier space-time array (MC-STAR) manifold matrix which enables the use of spatio-temporal signal processing techniques. Based on the modelling, a new cyclic pre x-free MC- CDMA arrayed MIMO communication system is proposed and its performance is compared with a representative existing system. Furthermore, a MUSIC-type algorithm is then developed for the estimation of the channel parameters of the received signal. This proposed cyclic pre x-free MC-CDMA arrayed MIMO system is then extended to consider the effects of spatial diffusion in the wireless channel. Spatial diffusion is an important channel impairment which is often ignored and the failure to consider such effects leads to less than satisfactory performance. A subspace-based approach is proposed for the estimation of the channel parameters and spatial spread and reception of the desired signal. Finally, the problem of joint optimization of the transmit and receive beam- forming weights in the downlink of a cyclic pre x-free MC-CDMA arrayed MIMO communication system is investigated. A subcarrier-cooperative approach is used for the transmit beamforming so that there is greater flexibility in the allocation of channel symbols. The resulting optimization problem, with a per-antenna transmit power constraint, is solved by the Lagrange multiplier method and an iterative algorithm is proposed

Localization and cooperative communication methods for cognitive radio

We study localization of nearby nodes and cooperative communication for cognitive radios. Cognitive radios sensing their environment to estimate the channel gain between nodes can cooperate and adapt their transmission power to maximize the capacity of the communication between two nodes. We study the end-to-end capacity of a cooperative relaying scheme using orthogonal frequency-division modulation (OFDM) modulation, under power constraints for both the base station and the relay station. The relay uses amplify-and-forward and decodeand-forward cooperative relaying techniques to retransmit messages on a subset of the available subcarriers. The power used in the base station and the relay station transmitters is allocated to maximize the overall system capacity. The subcarrier selection and power allocation are obtained based on convex optimization formulations and an iterative algorithm. Additionally, decode-and-forward relaying schemes are allowed to pair source and relayed subcarriers to increase further the capacity of the system. The proposed techniques outperforms non-selective relaying schemes over a range of relay power budgets. Cognitive radios can be used for opportunistic access of the radio spectrum by detecting spectrum holes left unused by licensed primary users. We introduce a spectrum holes detection approach, which combines blind modulation classification, angle of arrival estimation and number of sources detection. We perform eigenspace analysis to determine the number of sources, and estimate their angles of arrival (AOA). In addition, we classify detected sources as primary or secondary users with their distinct second-orde one-conjugate cyclostationarity features. Extensive simulations carried out indicate that the proposed system identifies and locates individual sources correctly, even at -4 dB signal-to-noise ratios (SNR). In environments with a high density of scatterers, several wireless channels experience non-line-of-sight (NLOS) condition, increasing the localization error, even when the AOA estimate is accurate. We present a real-time localization solver (RTLS) for time-of-arrival (TOA) estimates using ray-tracing methods on the map of the geometry of walls and compare its performance with classical TOA trilateration localization methods. Extensive simulations and field trials for indoor environments show that our method increases the coverage area from 1.9% of the floor to 82.3 % and the accuracy by a 10-fold factor when compared with trilateration. We implemented our ray tracing model in C++ using the CGAL computational geometry algorithm library. We illustrate the real-time property of our RTLS that performs most ray tracing tasks in a preprocessing phase with time and space complexity analyses and profiling of our software

Blind channel identification/equalization with applications in wireless communications

Ph.DDOCTOR OF PHILOSOPH