By Topic

Optimization of finite interval CMA implementation for FPGA

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
A. Hermanek ; Inst. of Inf. Theory & Autom., Acad. of Sci. of the Czech Republic, Czech Republic ; J. Schier ; P. Sucha ; Z. Hanzalek

The paper deals with optimization of an FPGA implementation of iterative algorithms with nested loops, using integer linear programming. The scheduling is demonstrated on an example of the FI-CMA blind equalization algorithm, with implementation using limited (and small) number of arithmetic units with non-zero latency. The optimization is based on cyclic scheduling with precedence delays for distinct dedicated processors. The approach is based on construction of an optimally scheduled abstract model, modeling imperfectly nested loops.

Published in:

IEEE Workshop on Signal Processing Systems Design and Implementation, 2005.

Date of Conference:

2-4 Nov. 2005