Digital Signal Processing Reference
In-Depth Information
with
x 0
Q3.5
x 1
Q1.7
x 2
Q4.8
x 3
Q2.7
x 4
Q3.8
x 5
Q2.7
Use dot notation to represent the bits of each number, and assume all numbers are signed. Also
compute the correction vector to eliminate sign-extension logic.
Exercise 5.16
Multiply the following two signed numbers using a modified Booth recoding technique:
a ¼ 10011101
b ¼
10110011
References
1. Xilinx.Virtex-4 multi-platform FPGAs: www.xilinx.com/products/virtex4/index.htm
2. Xilinx.User guide: Virtex-5 FPGA XtremeDSP Design Considerations.
3. H. T. Kung and R. P. Brent, “A regular layout for parallel adders,” IEEE Transactions on Computers, 1982, vol. 31,
pp. 260-264.
4. T. Han and D. A. Carlson, “Fast area-efficient VLSI adders,” in Proceedings of 8th IEEE Symposium on Computer
Arithmetic, 1987, pp. 49-56.
5. O. J. Bedriji, “Carry select adder,” IRE Transactions on Electronic Computers, 1962, vol. 11, pp. 340-346.
6. J. Sklansky, “Conditional-sum addition logic,” IRE Transactions on Electronic Computers, 1960, vol. 9,
pp. 226-231.
7. W. Schardein, B. Weghaus, O. Maas, B. J. Hosticka and G. TriSster, “A technology-independent module
generator for CLA adders,” in Proceedings of 18th European Solid State Circuits Conference, 1992, pp.
275-278, Copenhagen, Denmark.
8. V. Kantabutra, “A recursive carry look-ahead carry-select hybrid adder,” IEEE Transactions on Computers, 1993,
vol. 42, pp. 1495-1499.
9. M. Lehman and N. Burla, “Skip techniques for high-speed carry propagation in binary arithmetic circuits,” IRE
Transactions on Electronic Computers, 1961, vol. 10, pp. 691-698.
10. C. Nagendra, M. J. Irwin and R. M. Owens, “Area-time tradeoffs in parallel adders,” IEEE Transactions on
Circuits and Systems-11, 1996, vol. 43, pp. 689-702.
11. J.-G. Lee, J.-A. Lee andD.-Y. Lee, “Better area-time tradeoffs in an expanded design space of adder architecture by
parameterizing bit-width of various carry propagated sub-adder-blocks,” Proceedings of 6th IEEE International
Workshop on System-on-Chip for Real-Time Applications, 2006, pp. 10-14.
12. Xilinx. DSP: Designing for Optimal Results - High-performance DSP using Virtex-4 FPGAs, 10th edn, 2005.
13. A. K. Verma, P. Brisk and P. Ienne, “Data-flow transformations to maximize the use of carry-save representation in
arithmetic circuits,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2008, vol.
27, pp. 1761-1774.
14. J. Poldre and K. Tammemae, “Reconfigurable multiplier for Virtex FPGA family,” in Proceedings of International
Workshop on Field-programmable Logic and Applications, Glasgow, 1999, pp. 359-364, Springer-Verlag,
London, UK.
Search WWH ::




Custom Search