Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAcharya, D P-
dc.contributor.authorPanda, G-
dc.contributor.authorLakshmi, Y V S-
dc.identifier.citationInternational Conference on Signal Processing, Communications and Networking, 2008. ICSCN '08.4-6 Jan. 2008 Chennai, P 244 - 249en
dc.descriptionCopyright for the paper belongs to IEEEen
dc.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
dc.format.extent3167640 bytes-
dc.subjectblind source separationen
dc.subjecterror statisticsen
dc.subjectfixed point arithmeticen
dc.subjectgenetic algorithmsen
dc.subjectindependent component analysisen
dc.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.pdf3.09 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.