Bandwidth efficient multi-station wireless streaming based on complete complementary sequences

Data streaming from multiple base stations to a client is recognized as a robust technique for multimedia streaming. However the resulting transmission in parallel over wireless channels poses serious challenges, especially multiple access interference, multipath fading, noise effects and synchronization. Spread spectrum techniques seem the obvious choice to mitigate these effects, but at the cost of increased bandwidth requirements. This paper proposes a solution that exploits complete complementary spectrum spreading and data compression techniques jointly to resolve the communication challenges whilst ensuring efficient use of spectrum and acceptable bit error rate. Our proposed spreading scheme reduces the required transmission bandwidth by exploiting correlation among information present at multiple base stations. Results obtained show 1.75 Mchip/sec (or 25%) reduction in transmission rate, with only up to 6 dB loss in frequency-selective channel compared to a straightforward solution based solely on complete complementary spectrum spreading

Code-timing synchronization in DS-CDMA systems using space-time diversity

The synchronization of a desired user transmitting a known training sequence in a direct-sequence (DS) asynchronous code-division multiple-access (CDMA) sys-tem is addressed. It is assumed that the receiver consists of an arbitrary antenna array and works in a near-far, frequency-nonselective, slowly fading channel. The estimator that we propose is derived by applying the maximum likelihood (ML) principle to a signal model in which the contribution of all the interfering compo-nents (e.g., multiple-access interference, external interference and noise) is modeled as a Gaussian term with an unknown and arbitrary space-time correlation matrix. The main contribution of this paper is the fact that the estimator makes eÆcient use of the structure of the signals in both the space and time domains. Its perfor-mance is compared with the Cramer-Rao Bound, and with the performance of other methods proposed recently that also employ an antenna array but only exploit the structure of the signals in one of the two domains, while using the other simply as a means of path diversity. It is shown that the use of the temporal and spatial structures is necessary to achieve synchronization in heavily loaded systems or in the presence of directional external interference.Peer ReviewedPostprint (published version

Gossip Algorithms for Distributed Signal Processing

Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions. Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees. This article presents an overview of recent work in the area. We describe convergence rate results, which are related to the number of transmitted messages and thus the amount of energy consumed in the network for gossiping. We discuss issues related to gossiping over wireless links, including the effects of quantization and noise, and we illustrate the use of gossip algorithms for canonical signal processing tasks including distributed estimation, source localization, and compression.Comment: Submitted to Proceedings of the IEEE, 29 page

Blind multiuser adaptive combining for asynchronous cdma systems

This paper presents a novel technique to globally estimate and track the direction of arrival (DOA) of different users in an asynchronous CDMA system. The estimates are obtained exploiting the temporal structure of CDMA signals. No training signal nor a priori spatial information is required. The necessary information is extracted directly from the received signals. The proper combining of the overall information present at the receiver after the despreading, jointly with an Eigenvalue Decomposition (EVD), let as estimate the generalized steering vector for each user. Furthermore, a direct iteration method is introduced in our scheme in order to make the array robust to channel variations and to reduce the computational load of the EVD required for each user.Peer ReviewedPostprint (published version