DSpace@nitr >
National Institue of Technology- Rourkela >
Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/744

Full metadata record

DC FieldValueLanguage
contributor.authorAcharya, D P-
contributor.authorPanda, G-
contributor.authorLakshmi, Y V S-
identifier.citationInternational Conference on Signal Processing, Communications and Networking, 2008. ICSCN '08.4-6 Jan. 2008 Chennai, P 244 - 249en
descriptionCopyright for the paper belongs to IEEEen
description.abstractIndependent Component Analysis (ICA) technique separates mixed signals blindly without any information of the mixing system. bacterial foraging optimization based ICA (BFOICA) and constrained genetic algorithm based ICA (CGAICA) are two recently developed derivative free evolutionary computational ICA techniques. In BFOICA the foraging behavior of E.coli bacteria present in our intestine is mimicked for evaluation of independent components (IC) where as in CGAICA Genetic Algorithm is used for IC estimation in a constrained manner. The present work evaluates the error performance of BFOICA and CGAICA algorithm for its fixed-point implementation. Simulation study is carried on both fixed and floating point ICA algorithms. It is observed that the word length greatly influences the separation performance. A comparison of fixed-point error performance of both the algorithms is also carried out in this work.en
format.extent3167640 bytes-
subjectblind source separationen
subjecterror statisticsen
subjectfixed point arithmeticen
subjectgenetic algorithmsen
subjectindependent component analysisen
titleEffect of Finite Register Length on Bacterial Foraging Optimization based ICA and Constrained Genetic Algorithm based ICA Algorithmen
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
dpa5.pdf3093KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.


Powered by DSpace Feedback