Close category search window
 

Blind source separation based on multi-user kurtosis criteria

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
$31 $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

1 Author(s)
Papadias, C.B. ; Wireless Commun. Res., Lucent Technol. Bell Labs., Holmdel, NJ, USA

A novel technique for the blind source separation (BSS) of mutually independent and identically distributed i.i.d. discrete-time sequences is presented. The observed signals are assumed mixed through a narrow-band (memoryless) multiple-input-multiple-output (MIMO) noisy channel and are then processed by a linear MIMO receiver, whose outputs should ideally match the transmitted signals. In the proposed approach (called the multi-user kurtosis (MUK) algorithm), the linear receiver's matrix setting is computed adaptively based on the optimization of a constrained statistical criterion that involves only second and fourth order statistics of the receiver's output. At each iteration, the algorithm combines a stochastic gradient adaptation with a Gram-Shmidt orthogonalization that enforces its criterion's constraints. The analysis of its stationary points, reveals that it is globally convergent to a zero forcing -ZF (or decorrelating) solution, both in the absence of noise and in the presence of spatio-temporally white additive Gaussian noise

Published in:
Information Theory, 2000. Proceedings. IEEE International Symposium on

Date of Conference: 2000

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.