By Topic

Recursive realization of finite impulse filters using finite field arithmetic

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
$31 $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

2 Author(s)

Recursive filter design techniques are described and developed for finite impulse filters using finite field arithmetic. The finite fields considered have the formGF(q^{2}), the Galois field ofq^{2}elements, and are analogous to the field of complex numbers whenqis a prime such that(-1)is not a quadratic residue. These filters can be designed to yield either a desired finite impulse or finite frequency response function. This filtering technique has other possible applications, including the encoding or decoding of information and signal design. Infinite signal trains can be decomposed naturally into orthogonal sequences which may be useful in the encoding and decoding process and may provide another approach to convolutional coding. Since the recursive filters developed here do not have the accumulation of round-off or truncation error that one might expect in recursive computations, such filters are noise-free transducers in the sense of Shannon.

Published in:

Information Theory, IEEE Transactions on  (Volume:23 ,  Issue: 2 )