By Topic

A hyperplane-based algorithm for the digital co-channel communications problem

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

2 Author(s)
Hansen, L.K. ; Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA ; Guanghan Xu

The relationship between the blind digital co-channel communications problem and the problem of finding a separating hyperplane in IRd is explored. A simple model for the blind digital co-channel communications problem is X=AS, where X is a known IR d×N matrix. A is an unknown full-rank IRd×d matrix, and S is an unknown full-rank d×N matrix with elements drawn from a multiple-amplitude-shift-keying (M-ASK) alphabet S. An algorithm with proof is given that solves for A and S up to a simple matrix factor. The algorithm is extended to the complex quadrature-amplitude modulation (QAM) alphabet. The key step in this algorithm involves finding a separating hyperplane parallel to one of the hyperplanes defining the received signal vectors. The geometric interpretation of this relationship is discussed. Examples with noisy data are presented and refinements to the algorithm are discussed

Published in:

Information Theory, IEEE Transactions on  (Volume:43 ,  Issue: 5 )