Title :
Comments on "Decomposition of complex multipliers using polynomial encoding"
Author_Institution :
Dept. of Electr. Eng., North Dakota State Univ., Fargo, ND, USA
fDate :
3/1/1994 12:00:00 AM
Abstract :
Presents a better way of decomposition of complex multipliers using polynomial encoding than the method presented in the paper, "Decomposition of Complex Multipliers Using Polynomial Encoding." ibid., vol. 41, no. 10, p1331-3, 1992. The decomposition described in this paper makes use of smaller multipliers which results in smaller ROMs if ROM table look-ups are used to implement multipliers.<>
Keywords :
multiplying circuits; polynomials; complex multiplication; complex multipliers; computer arithmetic; cyclic convolution; decomposition; multipliers; polynomial encoding; polynomial rings; smaller ROM; smaller multipliers; table look-ups; Adders; Circuit testing; Counting circuits; Delay; Digital arithmetic; Encoding; Hardware; Logic circuits; Performance evaluation; Polynomials;
Journal_Title :
Computers, IEEE Transactions on
