FIR Filter Implementation Based on the RNS with Diminished-1 Encoded Channel

Dragana Uros Zivaljevic, Negovan Stamenković, Vidosav Stojanović

Abstract


A technique, based on the residue number system (RNS) with diminished-1 encoded channel, has being used for implementing a finite impulse response (FIR) digital filter. The proposed RNS architecture of the filter consists of three main blocks: forward and reverse converter and arithmetic processor for each channel. Architecture for residue to binary (reverse) convertor with diminished-1 encoded channel has been proposed. Besides, for all RNS channels, the systolic design is used for the efficient  realization of FIR filter. A numerical example illustrates the principles of diminished-1 residue arithmetic, signal processing, and decoding for FIR filters.

Full Text:

PDF

References


W. K. Jenkins and B. Leon, “The use of residue number systems in the design of finite impulse response digital filters,” IEEE Trans. on Circuits and Systems, vol. CAS-24, no. 4, pp. 191–201, Apr. 1977.

M. A. Soderstrand and B. Sinha, “A pipelined recursive residue number system digital filter,” IEEE Trans. on Circuits and Systems, vol. CAS-31, no. 4, pp. 415–417, Apr. 1984.

P. A. Regalia, S. K. Mitra, P. Vaidyanathan, M. K. Renfors, and Y. Neuvo, “Three-structured complementary filter bank using all-pass sections,” IEEE Trans. on Circuits and System, vol. CAS-34, no. 12, pp. 1470– 484, Dec. 1987.

T. K. Shahana, R. James, B. Jose, K. Jacob, and S. Sasi, “Performance analysis of FIR digital filter design: RNS versus traditional,” in International Symposium on Communications and Information Technologies. ISCIT’07, Kochi, Kerala, India, Oct. 17–19, 2007, pp. 1–5.

R. Conway and J. Nelson, “Improved RNS FIR filter architectures,” IEEE Trans. on Circuits and Systems-II: Express Briefs, vol. 51, no. 1, pp. 26– 28, Jan. 2004.

L. M. Leibowitz, “A simplified binary arithmetic for the Fermat number transform,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. ASSP-24, no. 5, pp. 356–359, Oct. 1976.

R. Zimmermann, “Efficient VLSI implementation of modulo (2n ± 1) addition and multiplication,” in Proceedings of the 14th IEEE Symposium on Computer Arithmetic, Adelaide, Australia, Apr. 1999, p. 158167.

Z. Wang, G. A. Jullien, and W. C. Miller, “An efficient tree architecture for modulo 2n+1 multiplication,” VLSI Signal Processing, vol. 14, no. 3, pp. 241–243, Mar. 1996.

H. T. Vergos, C. Efstathiou, and D. Nikolos, “High speed parallel-prefix modulo 2n + 1 adders for diminished-one operands,” in Proceedings of 15th IEEE Symposium on Computer Arithmetic, Vail, CO, USA, June 11–13, 2001, pp. 211–217.

H. Vergos and C. Efstathiou, “A unifying approach for weighted and diminished-1 modulo 2n + 1 addition,” IEEE Trans. on Circuits and Systems-II: Express Briefs, vol. 55, no. 10, pp. 1041–1045, Oct. 2008.

R. Chaves and L. Sousa, {2n + 1, 2n+k, 2n − 1}: a new RNS moduli set extension. IEEE, 2004, pp. 210–217. [Online]. Available: http:// ieeexplore.ieee.org/lpdocs/epic03 wrapper.htm?arnumber=1333279

C. Efstathiou, H. T. Vergos, and D. Nikolos, “Handling zero in diminished-one modulo 2n+1 adders,” Int. J. Electronics, vol. 90, no. 2, pp. 133–144, Feb. 2003.

C. Efstathiou, I. Voyiatzis, and N. Sklavos, “On the modulo 2n + 1 multiplication for diminished-1 operands,” in Proc. of the 2nd Int. Conf. on Signals Circuits and Systems (SCS 2008).

J. W. Chen, R. H. Yao, and W. J. Wu, “Efficient modulo 2n + 1 multipliers,” IEEE Transactions on Circuits and Systems, vol. 19, no. 12, pp. 2149–2157, Dec. 2011.

A. H¨am¨al¨ainen, M. Tommiska, and J. Skytt¨a, “6.78 gigabits per second implementation of the IDEA cryptographic algorithm,” in Proceedings of the 12th Conference on Field-Programmable Logic and Applications (FPL 2002), M. Glesner, P. Zipf, and M. Renovell, Eds. Montpellier, France: Springer-Verlag, Sept. 2–4, 2002, pp. 760–759.

J.-L. Beuchat, “Some modular adders and multipliers for field programmable gate arrays,” in Proceedings of 17th International Symposium on Parallel and Distributed Processing, IPDPS’03. Los Alamitos, CA, USA: IEEE Computer Society, Apr. 22–26, 2003, pp. 190–197.

C. Efstathiou, H. T. Vergos, G. Dimitrakopoulos, and D. Nikolos, “Efficient diminished-1 modulo 2n + 1 multipliers,” IEEE Transactions on Computers, vol. 54, no. 4, pp. 491–496, Apr. 2005.

Z. Wang, G. Jullien, and W. Miller, “An improved residue-to-binary converter,” IEEE Transactions on Circuits and Systems I, vol. 47, no. 9, pp. 1473–1440, Sept. 2000.

A. Antoniou, Digital Signal Processing: Signals, Systems, and Filters. New York: McGraw-Hill, 2006.

W. K. Jenkins and B. Leon, “The use of residue number systems in the design of finite impulse response digital filters,” IEEE Trans. on Circuits and Systems, vol. CAS-24, no. 4, pp. 191–201, Apr. 1977.




DOI: http://dx.doi.org/10.11601/ijates.v2i2.32

Refbacks

  • There are currently no refbacks.