Timing driven synthesis of sum-of-product functional blocks

Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07739324

ABSTRACT:
In one embodiment of the invention, an integrated circuit (IC) design tool is provided that has a sum-of-products (SOP) synthesizer. The SOP synthesizer receives expected arrival times of signals including partial product terms of each bit-vector of a SOP functional block, a comparison gate delay, and a register-transfer-level (RTL) netlist in order to synthesize a gate-level netlist of the SOP functional block. The SOP synthesizer includes software modules to synthesize a partial products generator, a partial product reduction tree, and an adder. The synthesis of the partial product reduction tree is responsive to a comparison gate delay and the expected arrival times of the partial product terms in each bit vector.

REFERENCES:
patent: 4747157 (1988-05-01), Kurakake et al.
patent: 4916627 (1990-04-01), Hathaway
patent: 5151867 (1992-09-01), Hooper et al.
patent: 5189636 (1993-02-01), Patti et al.
patent: 5231601 (1993-07-01), Stearns
patent: 5241493 (1993-08-01), Chu et al.
patent: 5270955 (1993-12-01), Bosshart et al.
patent: 5424969 (1995-06-01), Yamada et al.
patent: 5457805 (1995-10-01), Nakamura
patent: 5475605 (1995-12-01), Lin
patent: 5508950 (1996-04-01), Bosshart et al.
patent: 5751618 (1998-05-01), Abiko et al.
patent: 5751622 (1998-05-01), Purcell
patent: 5764557 (1998-06-01), Hara et al.
patent: 5847981 (1998-12-01), Kelley et al.
patent: 5867413 (1999-02-01), Yeh
patent: 5880984 (1999-03-01), Burchfiel et al.
patent: 5880985 (1999-03-01), Makineni et al.
patent: 5883825 (1999-03-01), Kolagotla
patent: 5956257 (1999-09-01), Ginetti et al.
patent: 6004022 (1999-12-01), Tsubakihara
patent: 6018758 (2000-01-01), Griesbach et al.
patent: 6286024 (2001-09-01), Yano et al.
patent: 6295628 (2001-09-01), Nakamura et al.
patent: 6385635 (2002-05-01), Ishii
patent: 6546539 (2003-04-01), Lu et al.
patent: 6704762 (2004-03-01), Inoue
patent: 6769007 (2004-07-01), Sutherland et al.
patent: 6781412 (2004-08-01), Yoshida et al.
patent: 6842845 (2005-01-01), Ganapathy et al.
patent: 6895423 (2005-05-01), Kawata
patent: 7111273 (2006-09-01), Ganesan et al.
patent: 7219048 (2007-05-01), Xu
patent: 2003/0061577 (2003-03-01), Saluja et al.
patent: 2006/0059222 (2006-03-01), Dewan
patent: EP0347029 (1989-12-01), None
Mark D. Birnbaum, Essential Electronic Design Automation (EDA); 2004 Pearson Education, Inc.; Prentice Hall Professional Technical Reference, Upper Saddle River, New Jersey 07458, pp. 115-116.
Melvin A. Breuer (Edited by), Design Automation of Digital Systems, vol. One, Chapter Two, Logic Synthesis; pp. 21-101, 1972 by Prentice Hall, Inc., Englewood Cliffs, New Jersey.
M. Morris Mano, Digital Logic and Computer Design, 1979 by Prentice-Hall, Inc., pp. 116-123, Chapter 4, Combinational Logic; Englewood Cliffs, N.J. 07632.
J.Pihl, E.J Aas, “A Multiplier and Squarer Generator for High Performance DSP Applications” in Proceeding of IEEE 39th Midwest Symposium on Circuits and Systems, pp. 109-112, 1997.
J.T. Yoo, K.F. Smith, G. Gopalakrishnan, “A Fast Parallel Squarer Based on Divide-and-Conquer” in IEEE Journal on Solid State Circuits, vol. 32, No. 1, pp. 909-912, Jun. 1997.
R.K. Kolagotla, W.R. Griesbach, H.R. Srinivas, “VLSI Implementation of 350MHz 0.35um, 8 Bit Merged Squarer”, in IEEE Electronics Letters, vol. 34, No. 1, pp. 47-48, Jan 1998.
A.G.M. Strollo, E. Napoli, D. De Caro, “A New Design of Squarer Circuits Using Booth Encoding and Folding Techniques” in Proceedings of 8th IEEE International Conference on Electronics, Circuits and Systems, Malta, pp. 193-196, Sep. 2-5, 2001.
A.G.M. Strollo, E. Napoli, D. De Caro, “Booth Folding Encoding for High Performance Squarer Circuits” in Transactions on Circuits and Systems II: Analog and Digital Signal Processing, vol. 50, No. 5, pp. 250-254, May 2003.
Y. Jeang, L.B. Chen, J.H. Tu, I.J. Huang “An Efficient and Low Power Systolic Squarer” in Proceedings of IEEE International Symposium on VLSI Design Automation and Test, pp. 37-40, Apr. 27-29, 2005 .
C.S. Wallace, “A Suggestion for a Fast Multiplier” in IEEE Transaction on Electronic Computers, pp. 14-17, 1964.
L. Dadda, “Some Schemes for Parallel Multiplies” in Alta Frequenza, vol. 34, pp. 349-356, 1965.
K.C. Bickerstaff, E.E. Swartzlander, M.J. Schulte, “Analysis of Column Compression Multipliers”, in Proceedings of 15th IEEE Symposium on Computer Arithmetic, pp. 33-39, 2001.
R.P. Brent, H.T. Kung, “A Regular Layout for Parallel Adders”, in IEEE Transactions on Computers, pp. 260-264, 1982.
P.M. Kogge, H.S. Stone, “A Parallel Algorithm for Efficient Solution of a General Class of Recurrence Equations” in IEEE Transaction on Computers, No. 8, pp. 786-793, Aug. 1973.
P.F. Stelling, V.G. Oklobdzija, “Design Strategies for the Final Adder in a Parallel Multiplier” 1995 Conference record of the 29th Asilomar Conference on Signals,Systems, and Computers, vol. 1 published in Journal of VLSI Proceedings, pp. 591-595, 1996.
M. Morris Mano, Professor of Eng, CA State University, LA, Digital Logic and Computer Design, 1979 Prentice-Hall, Inc., Chapter 4, pp. 123-125.
J.P. Hayes, University of Southern California, Computer Architecture and Organization, 1978 McGram-Hill, Inc., section 3.3, pp. 171-209.
H.Taub, D. Schilling, Professors of EE, The City College of the City of University of New York, Digital Integrated Electronics, 1977, McGraw-Hill, Inc., pp. 356-391.
D.M. Lewis, An Architecture for Addition and Subtraction of Long Word Length Numbers in the Logarithmic Number System, 1990 IEEE, pp. 1325-1336.
V.G. Oklobdzija, “A Method for Speed Optimized Partial Product Reduction and Generation of Fast Parallel Multipliers Using an Algorithmic Approach”, IEEE Transactions on Computers, vol. 45, issue 3, pp. 294-306, Mar. 1996.
A.J. Al-Kahlili, A. Hu, “Design of a 32-bit Squarer—Exploiting Addition Redundancy”, Proceedings of the 2003 International Symposium on Circuits and Systems, vol. 5, pp. V-325-V328.
G. Jung, G.E. Sobelman, High-Speed Adder Design Using Time Borrowing and Early Carry Propagation, 2000 IEEE, pp. 43-47.
M. S. Alam, Optical Carry-free Addition and Borrow-free Subraction Using Signed-Digit Numbers, 1994, IEEE, pp. 1040-1045.
A. K. Cherri, Optical Carry-free Addition and Borrow-free Subtraction Based on Redundant Signed-Digit Numbers, 1990 IEEE, pp. 1094-1099.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Timing driven synthesis of sum-of-product functional blocks does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Timing driven synthesis of sum-of-product functional blocks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Timing driven synthesis of sum-of-product functional blocks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4231841

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.