The University of Southampton
University of Southampton Institutional Repository

Co-ordinate Rotation based Low Complexity N-D FastICA Algorithm and Architecture

Co-ordinate Rotation based Low Complexity N-D FastICA Algorithm and Architecture
Co-ordinate Rotation based Low Complexity N-D FastICA Algorithm and Architecture
This paper proposes a low complexity n-dimensional (nD) FastICA algorithm and architecture by introducing the concept of coordinate rotation where. The proposed algorithm can merge the two key steps of conventional FastICA—preprocessing and update and is therefore capable of reducing the hardware complexity of the conventional FastICA significantly as demonstrated in this paper. Hardware implementation can further be simplified due to the recursive nature of the proposed algorithm where the same hardware module can be used as the fundamental core to implement architecture. Together with the algorithm formulation, its functionality is also validated and hardware complexity is analyzed and compared with the conventional FastICA.
blind source separation, CORDIC, FastICA, independent component analysis, low complexity algorithm and architecture
1053-587X
3997-4011
Acharyya, Amit
1f8a0620-1c00-4306-a64c-5185ede71f38
Maharatna, Koushik
93bef0a2-e011-4622-8c56-5447da4cd5dd
Al-Hashimi, Bashir
0b29c671-a6d2-459c-af68-c4614dce3b5d
Reeve, Jeff
dd909010-7d44-44ea-83fe-a09e4d492618
Acharyya, Amit
1f8a0620-1c00-4306-a64c-5185ede71f38
Maharatna, Koushik
93bef0a2-e011-4622-8c56-5447da4cd5dd
Al-Hashimi, Bashir
0b29c671-a6d2-459c-af68-c4614dce3b5d
Reeve, Jeff
dd909010-7d44-44ea-83fe-a09e4d492618

Acharyya, Amit, Maharatna, Koushik, Al-Hashimi, Bashir and Reeve, Jeff (2011) Co-ordinate Rotation based Low Complexity N-D FastICA Algorithm and Architecture. IEEE Transactions on Signal Processing, 59 (8), 3997-4011. (doi:10.1109/TSP.2011.2150219).

Record type: Article

Abstract

This paper proposes a low complexity n-dimensional (nD) FastICA algorithm and architecture by introducing the concept of coordinate rotation where. The proposed algorithm can merge the two key steps of conventional FastICA—preprocessing and update and is therefore capable of reducing the hardware complexity of the conventional FastICA significantly as demonstrated in this paper. Hardware implementation can further be simplified due to the recursive nature of the proposed algorithm where the same hardware module can be used as the fundamental core to implement architecture. Together with the algorithm formulation, its functionality is also validated and hardware complexity is analyzed and compared with the conventional FastICA.

Text
tsp_cordic-fica-accepted-eprints.pdf - Accepted Manuscript
Download (1MB)
Text
tsp_cordic-fica-accepted-eprints - Accepted Manuscript
Download (1MB)
Text
tsp_cordic.pdf - Version of Record
Restricted to Repository staff only
Request a copy

More information

Submitted date: 20 April 2011
e-pub ahead of print date: 5 May 2011
Published date: August 2011
Keywords: blind source separation, CORDIC, FastICA, independent component analysis, low complexity algorithm and architecture
Organisations: Electronic & Software Systems, EEE

Identifiers

Local EPrints ID: 272221
URI: http://eprints.soton.ac.uk/id/eprint/272221
ISSN: 1053-587X
PURE UUID: 4721ff20-55e9-4e4e-a036-caa43d5518a7

Catalogue record

Date deposited: 21 Apr 2011 10:29
Last modified: 14 Mar 2024 09:50

Export record

Altmetrics

Contributors

Author: Amit Acharyya
Author: Koushik Maharatna
Author: Bashir Al-Hashimi
Author: Jeff Reeve

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×