Synthesis of Coefficient Bit Reordering Module for Folded Bit-Plane Arrays

Milentijevic, I. and Ciric, V. (2003) Synthesis of Coefficient Bit Reordering Module for Folded Bit-Plane Arrays. In: Proceedings of the Fourth Conference on Informatics and Information Technology. Institute of Informatics, Faculty of Natural Sciences and Mathematics, Ss. Cyril and Methodius University in Skopje, Macedonia, Skopje, Macedonia, pp. 332-342. ISBN 9989-668-45-0

[img]
Preview
Text
9989-668-45-0_pp332-342.pdf

Download (1MB) | Preview
Official URL: http://ciit.finki.ukim.mk

Abstract

The goal of this paper is synthesis of Coefficient Bit Reordering Module (CBRM) for folded bit-plane FIR filter. Basic functional requirements for CBRM are: bit-serial entering of coefficient bits (initialization mode), reordering in accordance with required mathematical modulo description (initialization mode) and cyclic-parallel feeding of architecture (run mode). Mathematical description of the problem along with the folding set assignment, as well as the solution for mapping of coefficient bits onto the hardware architecture by rigorous mathematical procedure are presented in this paper. Synthesis of efficient programmable hardware for CBRM and principle of operation are described in detail. Programmability of hardware assumes changing of both number of coefficients and coefficient length with aim to provide flexibility and wider application area for folded bit-plane arrays.

Item Type: Book Section
Uncontrolled Keywords: Mobile devices, adaptive FIR filtering, folded bit-plane, coefficient entering
Subjects: International Conference on Informatics and Information Technologies > Computer architectures
Depositing User: Vangel Ajanovski
Date Deposited: 28 Oct 2016 00:15
Last Modified: 28 Oct 2016 00:15
URI: http://eprints.finki.ukim.mk/id/eprint/11123

Actions (login required)

View Item View Item