By Topic

Blind array channel division multiple access (AChDMA) for mobile communications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
V. A. N. Barroso ; Inst. de Siistemas e Robotica, Inst. Superior Tecnico, Lisbon, Portugal ; J. M. F. Moura ; J. Xavier

The paper introduces array channel division multiple access (AChDMA), which is a new blind algorithm for advanced SDMA in mobile communications systems. As an SDMA technique, AChDMA increases the system capacity by improving its time and frequency reuse. Being a blind algorithm, it requires no training sequences, previously known directions of arrival, or user codes, AChDMA separates the moving sources by tracking their multipath configuration and resolving their distinct generalized steering vectors. It maximizes a finite mixture log-likelihood function, combining an efficient initialization procedure with an EM-based algorithm that provides fast convergence to the global maximum. AChDMA reconstructs the mobile data sequences using only internal variables of the EM algorithm. These characteristics and its parallel structure make AChDMA suitable for real-time mobile communications. We test AChDMA with synthetic data in a number of different scenarios, illustrating the ability of the blind algorithm to separate and track in time the moving sources, and showing its good performance in a variety of practical situations

Published in:

IEEE Transactions on Signal Processing  (Volume:46 ,  Issue: 3 )