An edge-finding algorithm on blind source separation for digital wireless applications

Authors:
Jie Zhou;Keyou Yao;Ying Zhao;Yiyue Gao;Hisukazu Kicuchi
Affiliations:
College of Electronic and Information Engineering of Nanjing University of Information Science and Technology, P.R. China;College of Electronic and Information Engineering of Nanjing University of Information Science and Technology, P.R. China;College of Electronic and Information Engineering of Nanjing University of Information Science and Technology, P.R. China;College of Electronic and Information Engineering of Nanjing University of Information Science and Technology, P.R. China;Department of Electrical and Electronic Engineering Faculty of Engineering Niigata University, Japan
Venue:
LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
Year:
2007

Citing 4
Cited 0

A geometric approach to blind source separation for digital wireless applications

Signal Processing - Special issue on blind source separation and multichannel deconvolution
Blind multiuser separation of instantaneous mixture algorithm based on geometrical concepts

Signal Processing
Geometric properties of the blind digital co-channel communications problem

ICASSP '96 Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02
A hyperplane-based algorithm for the digital co-channel communications problem

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss the problem of blind estimating multiple digital co-channel communication signals using an antenna array. A new approach is proposed to the problem, which is to find all the independent edges of X base on analysis of the projections of X onto coordinates. Through the simulation results of separating two blind audio signals, we can find out that blind signals could be separated with the algorithm quickly and rightly.