Scalable non-blocking switching network for programmable logic

Electronic digital logic circuitry – Multifunctional or programmable – Array

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C326S047000, C326S101000

Reexamination Certificate

active

07417457

ABSTRACT:
A scalable non-blocking switching network (SN) having switches and intermediate (stages of) conductors that are used to connect substantially a first plurality of conductors, through a first set of switches, to a second plurality sets of conductors. The conductors in each set of the second plurality of conductors substantially connect, through a second set of switches, to a third plurality of sets of conductors. Each conductor of a set of the third plurality sets of conductors either connects, physically, to one pin in each of a plurality of functional blocks or, through a third set of switches, to a subsequent fourth set of conductors. The SN is scalable for larger sets of conductors by adding additional sets of intermediate conductors in a hierarchically fashion.

REFERENCES:
patent: 4020469 (1977-04-01), Manning
patent: 4661901 (1987-04-01), Veneski
patent: 4700187 (1987-10-01), Furtek
patent: 4720780 (1988-01-01), Dolecek
patent: 4736333 (1988-04-01), Mead et al.
patent: 4758745 (1988-07-01), Elgamal
patent: 4815003 (1989-03-01), Putatunda et al.
patent: 4847612 (1989-07-01), Kaplinsky
patent: 4870302 (1989-09-01), Freeman
patent: 4912342 (1990-03-01), Wong et al.
patent: 4918440 (1990-04-01), Furtek
patent: 4935734 (1990-06-01), Austin
patent: 4992680 (1991-02-01), Benedetti et al.
patent: 5122685 (1992-06-01), Chan
patent: 5144166 (1992-09-01), Camarota et al.
patent: 5187393 (1993-02-01), Elgamal et al.
patent: 5204556 (1993-04-01), Shankar
patent: 5208491 (1993-05-01), Ebeling et al.
patent: 5221865 (1993-06-01), Phillips et al.
patent: RE34363 (1993-08-01), Freeman
patent: 5243238 (1993-09-01), Kean
patent: 5256918 (1993-10-01), Suzuki
patent: 5260610 (1993-11-01), Pederson et al.
patent: 5260611 (1993-11-01), Cliff et al.
patent: 5296759 (1994-03-01), Sutherland et al.
patent: 5298805 (1994-03-01), Garverick et al.
patent: 5329470 (1994-07-01), Sample et al.
patent: 5349691 (1994-09-01), Harrison et al.
patent: 5369314 (1994-11-01), Patel et al.
patent: 5376844 (1994-12-01), Pederson et al.
patent: 5396126 (1995-03-01), Britton et al.
patent: 5406525 (1995-04-01), Nicholes
patent: 5444394 (1995-08-01), Watson et al.
patent: 5455525 (1995-10-01), Ho et al.
patent: 5457410 (1995-10-01), Ting
patent: 5469003 (1995-11-01), Kean
patent: 5477067 (1995-12-01), Isomura et al.
patent: 5485103 (1996-01-01), Pederson et al.
patent: 5519629 (1996-05-01), Snider
patent: 5537057 (1996-07-01), Leong et al.
patent: 5550782 (1996-08-01), Cliff et al.
patent: 5552722 (1996-09-01), Kean
patent: 5572148 (1996-11-01), Lytle et al.
patent: 5581199 (1996-12-01), Pierce et al.
patent: 5581767 (1996-12-01), Katuski et al.
patent: 5815004 (1998-09-01), Trimberger et al.
patent: 5818254 (1998-10-01), Agrawal et al.
patent: 5825202 (1998-10-01), Tavana
patent: 5835405 (1998-11-01), Tsui et al.
patent: 5841775 (1998-11-01), Huang
patent: 5850564 (1998-12-01), Ting et al.
patent: 5880597 (1999-03-01), Lee
patent: 5883526 (1999-03-01), Reddy et al.
patent: 5894228 (1999-04-01), Reddy
patent: 5903165 (1999-05-01), Jones et al.
patent: 5914616 (1999-06-01), Young
patent: 6016063 (2000-01-01), Trimberger
patent: 6034547 (2000-03-01), Pani et al.
patent: 6038627 (2000-03-01), Plants
patent: 6051991 (2000-04-01), Ting
patent: 6088526 (2000-07-01), Ting et al.
patent: 6160420 (2000-12-01), Gamal
patent: 6163168 (2000-12-01), Nguyen et al.
patent: 6181162 (2001-01-01), Lytle et al.
patent: 6417694 (2002-07-01), Reddy et al.
patent: 6433580 (2002-08-01), Ting
patent: 6507217 (2003-01-01), Ting
patent: 6594810 (2003-07-01), Reblewski
patent: 6597196 (2003-07-01), Ting
patent: 6670825 (2003-12-01), Lane et al.
patent: 6686768 (2004-02-01), Comer
patent: 6693456 (2004-02-01), Wong
patent: 7065076 (2006-06-01), Nemazie
patent: 7123612 (2006-10-01), Lu
patent: 2001/0007428 (2001-07-01), Young
patent: 2002/0163357 (2002-11-01), Ting
patent: 0415542 (1991-03-01), None
patent: 0630115 (1994-06-01), None
patent: 2180382 (1987-03-01), None
patent: 2295738 (1996-05-01), None
patent: 9208286 (1992-05-01), None
patent: 9410754 (1994-05-01), None
patent: 9428475 (1994-12-01), None
patent: 9504404 (1995-02-01), None
patent: 9528769 (1995-10-01), None
patent: 9605964 (1996-04-01), None
patent: 9635261 (1996-11-01), None
patent: WO 03/032492 (2003-04-01), None
PCT Search Report mailed Aug. 31, 2005, International Application No. PCT/US05/06583, International Filing Date Feb. 28, 2005, 8 pages.
Altera Corporation Date Sheet, Flex EPF81188 12,000 Gate Programmable Logic Device, Sep. 1992, Ver. 1, pp. 1-20.
ATMEL Field Programmable Arrays, AT 6000 Series, 1993, p. 1-16.
Britton, et al., “Optimized Reconfigurable Cell Array Architecture for High-Performance Field Programmable Gate Arrays,” Proceedings of the IEEE 1993 Custom Integrated Circuits Conference, 1993, pp. 7.2.1-7.2.5.
Buffoli, E., et al., “Dynamically Reconfigurable Devices Used to Implement a Self-Tuning, High Performances PID Controller,” 1989 IEEE, pp. 107-112.
Bursky, D., “Fine-Grain FPGA Architecture Uses Four Levels of Configuration Hierarchy,” 2328 Electronic Design, 41, No. 20, Cleveland, OH, Oct. 1, 1993, pp. 33-34.
Cliff, et al., “A Dual Granularity and Globally Interconnected Architecture for a Programmable Logic Device”, IEEE '93 pp. 7.3.1-7.3.5.
Devades, S., et al., “Boolean Decomposition of Programmable Logic Arrays,” IEEE 1988, pp. 2.5.1-2.5.5.
F. Zlotnick, P. Butler, W. Li, D. Tang, “A High Performance Fine-Grained Approach to SRAM Based FPGAs”, p. 321-326, Wescon Sep. 28-30, 1993.
Liu, D.L., et al., “Design of Large Embedded CMOS PLA's for Built-In Self-test,” IEEE Transactions on Computed-Aided Design, vol. 7, No. 1, Jan. 1988, pp. 50-53.
Minnick, R.C., “A Survey of Microcellular Research”, vol. 14, No. 2, Apr. 1967, pp. 203-241.
Motorola Project Brief, “MPA10xx Field Programmable Gate Arrays,” Sep. 27, 1993, 2 pages.
Robert H. Krambeck, “ORCA: A High Performance, Easy to Use SRAM Based Architecture”, p. 310-320, Wescon Sep. 28-30, 1993.
Shoup, R. G., “Programmable Cellular Logic Arrays,” Abstract, Ph.D. Dissertation, Carnegie Mellon University, Pittsburgh, PA, Mar. 1970, (partial) pp. ii-121.
Sinan Kaptanoglu, Greg Bakker, Arun Kundu, Ivan Corneillet, Ben Ting, “A New High Density and Very Low Cost Reprogrammable FPGA Architecture”, 10 pages, Actel Corporation.
Spandorfer, L.M., “Synthesis of Logic Functions on an Array of Integrated Circuits,” Contract No. AF 19 (628) 2907, Project No. 4645, Task No. 464504, Final Report, Nov. 30, 1965.
Sun, Y., et al., “An Area Minimizer for Floorplans with L-Shaped Regions,” 1992 International Conference on Computer Design, 1992 IEEE, pp. 383-386.
Vidal, J. J., “Implementing Neural Nets with Programmable Logic,” IEEE Transactions on Acoustic, Speech, and Signal Processing, vol. 36, No. 7, Jul. 1988, pp. 1180-1190.
Wang, P. et al. IEEE, “A High Performance FPGA with Hierarchical Interconnection Structure”, pp. 239-242 (May 30, 1994).
Xilinx, “The Programmable Gate Array Data Book”, 1992.
EP Communication 05724178.8-2215 (PCT/US2005006583) dated Jul. 26, 2007 and Supplementary European Search Report (date of completion of the search Jul. 19, 2007), 05724178.8-2215 (PCT/US2005006583).

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

Scalable non-blocking switching network for programmable logic does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Scalable non-blocking switching network for programmable logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalable non-blocking switching network for programmable logic will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3995396

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