Co-ordinate Rotation Based Low Complexity 2D FastICA Algorithm and Architecture
Acharyya, Amit, Maharatna, Koushik and Al-Hashimi, Bashir (2010) Co-ordinate Rotation Based Low Complexity 2D FastICA Algorithm and Architecture. At International Conference on Green Circuits and Systems (ICGCS) , Shanghai, China, 21 - 23 Jun 2010. (Submitted).
- Accepted Version
Restricted to Registered users only
Download (444Kb) | Request a copy
This paper introduces the concept of co-ordinate rotation into the conventional FastICA algorithm and proposes a low complexity 2D FastICA and presents its corresponding architecture. Conventional FastICA uses a preprocessing step involving classical Eigen Value Decomposition problem which, in hardware, is widely solved using Co-ordinate Rotation Digital Computer (CORDIC) technique. The proposed co-ordinate rotation based 2D FastICA algorithm opens up the opportunity to reuse the same CORDIC unit used for the preprocessing step and thus is capable of reducing the hardware complexity of the conventional FastICA algorithm. Along with the formulation and functionality validation of the proposed algorithm, a detailed hardware complexity analysis is also presented in this paper and compared with the already reported architectures.
|Item Type:||Conference or Workshop Item (Speech)|
|Additional Information:||Event Dates: 21-23 June, 2010|
|Keywords:||Independent Component Analysis (ICA), Blind Source Separation, CORDIC, Low complexity algorithms and architectures|
|Divisions:||Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems
|Date Deposited:||01 Apr 2010 19:16|
|Last Modified:||27 Mar 2014 20:15|
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)