Optimization of polynomial datapaths using finite ring algebra

ACM Transactions on Design Automation of Electronic Systems

Volumn 12, Issue 4, 2007, Pages

  Gopalakrishnan, Sivaram ^a,b   Kalla, Priyank ^a,b  

^a UNIVERSITY OF UTAH   (United States)

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

Arithmetic datapaths; Finite ring algebra; High level synthesis; Modulo arithmetic; Polynomial datapaths

Indexed keywords

ARITHMETIC DATAPATHS; FINITE RING ALGEBRA; M-BIT VECTORS; POLYNOMIAL DATAPATHS;

COST EFFECTIVENESS; DIGITAL ARITHMETIC; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; VECTORS;

DATA STRUCTURES;

EID: 35148853783     PISSN: 10844309     EISSN: 15577309     Source Type: Journal    
DOI: 10.1145/1278349.1278362     Document Type: Article

References (39)

1. ALLENBY, R. J. B. T. 1983. Rings, Fields, and Groups: An Introduction to Abstract Algebra. E. J. Arnold.
2. ARVIND AND SHEN, X. 1998. Using term rewriting systems to design and verify processors. IEEE Micro. 19, 2, 36-46.
3. CHEN, C. AND HUANG, C. 2001. On the architecture and performance of a hybrid image rejection receiver. IEEE J. Select. Areas Commun. 19, 6, (Jun.) 1029-1040.
4. m. Discrete Math. 162, 1-3, 67-76.
5. m. Discrete Math. 137, 1-3, 137-145.
6. CONSTANTINIDES, G., CHEUNG, P., AND LUK, W 2001. Heuristic datapath allocation for multiple wordlength systems. In Proceedings of the Design Automation and Test in Europe (DATE) (Munich).
7. DEMICHELI, G. 1994. Synthesis and Optimization of Digital Circuits. McGraw-Hill, New York.
8. GROUTE, I. A. AND KEANE, K. 2000. M(VH)DL: A Matlab to VHDL conversion toolbox for digital control. In IFAC Symposiun on Computer-Aided Control System Design (Salford, UK).
9. GUTHAUS, M. R. 2001. Mibench: A free, commercially representative embedded benchmark suite. In IEEE 4th Annual Workshop on Workload Characterization (Austin, TX).
10. HOSANGADI, A., FALLAH, F., AND KASTNER, R. 2005. Energy efficient hardware synthesis of polynomial expressions. In Proceedings of the International Conference on VLSI Design (Kolkata, India) 653-658.
11. HOSANGADI, A., FALLAH, F., AND KASTNER, R. 2004. Factoring and eliminating common subexpressions in polynomial expressions. In Proceedings of the Internatoinal Conference on Computer Aided Design (ICCAD) (San Jose, CA), 169-174.
12. HUANG, C.-Y. AND CHENG, K.-T. 2001. Using word-level atpg and modular arithmetic constraint solving techniques for assertion property checking. IEEE Trans. Comput. Aided. Des. 20, 381-391.
13. HUNGERBUHLER, N. AND SPECKER, E. 2006. A generalization of the smarandache function to several variables. Integers: Electron. J. Combin. Num. Theory 6, A23, 1-11.
14. JERAJ, J. 2005. Adaptive estimation and equalization of non-linear systems. Ph.D. thesis, University of Utah, Salt Lake City, Utah.
15. KELLER, G. AND OLSON, F. 1968. Counting polynomial functions (mod p"). Duke Math. J. 35, 835-838.
16. KEMPNER, A. J. 1921. Polynomials and their residual systems. Amer. Math. Soc. Trans. 22, 240-288.
17. KEMPNER, A. J. 1918. Miscellanea. Amer. Math. Month. 25, 201-210.
18. KOREN, I. 2002. Computer Arithmetic Algorithms. A. K. Peters.
19. KUM, K. AND SUNG, W. 1998. Word-Length optimization for high-level synthesis of DSP systems. In International Workshop Signal Processing Systems (SIPS). Piscataway, NJ.
20. LUCAS, E. 1883. Question nr. 288. Mathesis 3, 232.
21. MAPLE. 2007. Maple, http://www.maplesoft.com.
22. MATHEWS, V. J. AND SICURANZA, G. L. 2000. Polynomial Signal Processing. Wiley-Interscience, New York.
23. MENARD, D., CHILLET, D., CHAROT, F., AND SENTIEYS, O. 2002. Automatic floating-point to fixed-point conversion for DSP code generation. In International Conference on Compiler, Architecture, and Synthesis Embedded Systems (CASES) (Grenoble, France).
24. PEYMANDOUST, A. AND DEMICHELI, G. 2003. Application of symbolic computer algebra in high-level data-flow synthesis. IEEE Trans. Comput. Aided. Des. 22, 9, 1154-11656.
25. POWER, D., TABIRCA, S., AND TABIRCA, T. 2002. Java concurrent program for the smarandache function. Smarandache Notions J. 13, 1-2-3, 72-84.
26. PRADHAN, D. 1978. A theory of galois switching functions. IEEE Trans. Comput. C-27, 3, 239-248.
27. PRADHAN, D., ASKAR, S., AND CIESIESKI, M. 2003. Mathematical framework for representing discrete functions as word-level polynomials. In Proceedings of the IEEE International High Level Design Validation and Test Workshop (HLDVT) (San Francisco, CA), 135-139.
28. RAJAPRABHU, T., SINGH, A., JABIR, A., AND PRADHAN, D. 2004. Modd for CF: A compact representation for multiple output function. In IEEE International High Level Design Validation and Test Workshop (Sonoma Valley, CA).
29. SHEKHAR, N., KALLA, P., AND ENESCU, F 2006. Equivalence verification of arithmetic datapaths with multiple word-length operands. In Proceedings of the Design Automation and Test in Europe (DATE) (Munich).
30. SHEKHAR, N., KALLA, P., ENESCU, F., AND GOPALAKRISHNAN, S. 2005. Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra. In Proceedings of the International Conference on Computer Aided Design (ICCAD) (San Jose, CA).
31. SINGMASTER, D. 1974. On polynomial functions (mod m). J. Num. Theory 6, 345-352.
32. SMARANDACHE, F. 1980. A function in number theory. Analele Univ. Timisoara, Fascicle 1, 17, 79-88.
33. SMITH, J. AND DEMICHELI, G. 2001. Polynomial circuit models for component matching in high-level synthesis. IEEE Trans. VLSI 9, 6, 783-800.
34. SMITH, J. AND DEMICHELI, G. 1999. Polynomial methods for allocating complex components. In Proceedings of the Design Automation and Test in Europe (DATE) (Munich).
35. SMITH, J. AND DEMICHELI, G. 1998. Polynomial methods for component maching and verification. In Proceedings of the International Conference on Computer Aided Design (ICCAD) (San Jose, CA).
36. SYNOPSYS. 2007. Synopsys module compiler and designware library. htpp://www.synopsys.com.
37. THORNTON, M., DRECHSLER, R., AND MILLER, D. M. 2001. Spectral Techniques in VLSI CAD. Kluwer Academic, Hingham, MA.
38. VERMA, A. K. AND IENNE, R 2006. Towards the automatic exploration of arithmetic circuit architectures. In Proceedings of the Design Automation Conference (DAC) (San Francisco, CA).
39. VERMA, A. K. AND IENNE, R 2004. Improved use of the carry-save representation for the synthesis of complex arithmetic circuits. In Proceedings of the International Conference on Computer Aided Design (ICCAD) (San Jose, CA).