Method and apparatus for automated synthesis of...

Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C716S030000, C716S030000

Reexamination Certificate

active

07093204

ABSTRACT:
Methods and apparatuses to automatically generate time multiplexed multi-channel circuits from single-channel circuits. At least one embodiment of the present invention automatically and efficiently synthesize multi-channel hardware for time-multiplexed resource sharing by automatically generating a time multiplexed design of multi-channel circuits from the design of a single-channel circuit. Channel specific elements of the single-channel design (e.g., registers and memories) are replaced with corresponding elements of N-times more capacity for pipelining the signal processing for multiple channels.

REFERENCES:
James R. Thornton: “Pallel Operation in the Control Data 6600” ,AFIPS Proc. FJCC, pt. 2 vol. 03, pp. 33-40, 1964.
Eran Halperin; uri Zwick: “Combinatorial Approximation Algorithms for the Maximum Directed Cut Problem”, Proceedings of the 12th Symposium on Discrete Algorithms, pp. 1-7, 2001.
Keshab K. Parhi: “VLSI digital signal processing systems: design and implementation”, Wiley Interscience, pp. 91-118 & 149-187, 1999.
Jhon, J. Leon Franco; Migule A. Melgarejo: “FPGA Implementation of a Serial Organized DA Multichannel FIR Filter”,Tenth ACM International Symposium on Filed Programmable Gate Arrays, Monterey, California, Feb. 24-26, 2002.
Habinc, Sandi “Functional Triple Modular Redundancy (FTMR)” Design and Assessment Report, pp. 1-56. European Space Agency Contract Report, Gaisler Research, Sweden, FPGA-003-01 Version 0.2 Dec.2002 www.gaisler.com.
Lyons, R.E.; Vanderkulk, W.; “The Use of Triple-Modular Redundancy to Improve Computer Reliability” pp. 200-209. Apr. 1962, IBM Journal.
Weaver, Nicholas; Markovskiy, Yury; Patel, Yatish; Wawrzynek, John; “POst-Placement C-Slow Retiming for the Xilinx Virtex FPGA” 10 pages. Copyright 2003 ACM 1-58113-651-X/03/002 FPGA '03, FEb. 23-25, Monterey, California USA.
Notification to Pay Additional Fees for International Application No. PCT.US2004/010006, mailed Jun. 23, 2005, 8 pages. European Patent Office, Rijswijk,. Authorized Officer: Iveta Bujanska.
Shalash, Ahmad F., et al., “Power Efficient Fir Folding Transformation For Wireline Digital Communications”, Copyright 1998 IEEE, 0-7803-5973-9/00, pp. 153-156.
Sundararajan, Vijay, et al., “Synthesis of Low Power Foleded Programmable Coefficient Fir Digital Filters”, Copyright 2000, IEEE 0-7803-5973-9/00, pp. 153-156.
Lin, John, et al., “A New Multi-Algorithm Multichannel Cascadable Digital Filter Processor”, IEEE 1988 Custom Integrated Circuits Conference, CH2584-1/88/0000/0060. Copyright 1988 IEEE. pp. 10.7.1-10.7.5.
Hassoun, Soha, et al., “Architectural Retiming: Pipelining Latency-Constrained Circuits” Copyright 1996 ACM, INc. 0-89791-833-9/96/006, pp. 708-713. 33rdDesign Automation Conference. XP-002330653.
Parhi, Keshab K., et al, “Synthesis of Control Circuits in Foled Pipeline DSP Architectures”, Copyright 1992 IEEE, 0018-9200/92503.00 vol. 27, No. 1, Jan. 1992. pp. 29-43.
PCT Notification Of Transmittal Of The International Search Report And The Written Opinion Of The International Searching Authority, Or The Declaration, for PCT International Appln. No. US2004/010006, mailed Sep. 2, 2005, (17 pages total).

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

Method and apparatus for automated synthesis of... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for automated synthesis of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for automated synthesis of... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3634464

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