Overcomplete blind source separation of finite alphabet sources

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 156
  • Download : 0
We propose a blind source separation algorithm fur the mixture of finite alphabet sources where sensors are less than sources. The algorithm consists of an update Equation of an estimated mixing matrix and enumeration of the inferred sources. We present the bound Of a steb size for the stability of the algorithm and two methods of assignment of the initial point of the estimated mixing matrix. Simulation results verify the proposed algorithm.
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
2001-01
Language
English
Article Type
Letter
Citation

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E84D, no.1, pp.209 - 212

ISSN
0916-8532
URI
http://hdl.handle.net/10203/83748
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0