Boots – shoes – and leggings
Patent
1994-08-26
1997-10-21
Moore, David K.
Boots, shoes, and leggings
395 20, 395 67, 364717, 371 27, G06F 1518
Patent
active
056805187
ABSTRACT:
A new probabilistic computing system (PCS) provides computational functionality needed to efficiently realize randomized computing methods in otherwise standard, deterministic digital computing systems. The PCS may be incorporated in a standard computing platform such as a PC or workstation. In the PCS, a computational path includes a random access memory (RAM) where a predetermined computing problem is stored in conjunctive normal form. A nondeterministic subsystem generates random binary values forming a proposed solution to the problem, which solution is rapidly checked through a crosspoint switch array coupled to the RAM. The computational path essentially runs asynchronously, while a delay circuit provides delay and timing signals for interfacing with external DRAM, as well as a synchronizing signal for operation of several of the PCS systems together for enhanced performance.
REFERENCES:
patent: 3816725 (1974-06-01), Greer
patent: 4056807 (1977-11-01), Thornber
patent: 4355366 (1982-10-01), Porter
patent: 5007087 (1991-04-01), Bernstein et al.
patent: 5016220 (1991-05-01), Yamagata
patent: 5101409 (1992-03-01), Hack
patent: 5121349 (1992-06-01), Naito
patent: 5208771 (1993-05-01), Kumanoya
patent: 5214423 (1993-05-01), Antoniou
patent: 5235672 (1993-08-01), Carson
patent: 5276897 (1994-01-01), Stalmarck
patent: 5295227 (1994-03-01), Yokono
patent: 5297232 (1994-03-01), Murphy
patent: 5325500 (1994-06-01), Bell et al.
patent: 5339268 (1994-08-01), Machida
patent: 5343438 (1994-08-01), Choi
patent: 5379438 (1995-01-01), Bell et al.
patent: 5414666 (1995-05-01), Kumagai
patent: 5414716 (1995-05-01), Bershteyn
patent: 5432719 (1995-07-01), Freeman et al.
patent: 5438511 (1995-08-01), Maxwell, III et al.
patent: 5469367 (1995-11-01), Puri et al.
patent: 5485471 (1996-01-01), Bershteyn
patent: 5499364 (1996-03-01), Klein et al.
patent: 5515329 (1996-05-01), Dalton
Sivaramakrishnan et al., Parallel Test Pattern Generation Using Boolean Satisfiability, IEEE pp. 69-74 1991.
Jiang et al., LDS-ATPG: An Automatic Test Pattern Generation System for Combinational VLSI Circuits, pp. 159-161.
Sastry et al., Detectability of CMOS Stuck-Open Faults Using Random and Pseudorandom Test Sequences, pp. 933-946 1988.
Seroussi et al., Vector Sets for Exhaustive Testing of Logic Circuits, IEEE pp. 513-522 1988.
Wunderlich, Multiple Distributions for Biased Random Test Patterns, IEEE pp. 236-244 1988.
Chang et al., Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions, IEEE pp. 255-269 1991.
Franco et al., Probabilistic Performance of a Heuristic for the Satisfiability Problem, NTIS pp. 1-18 1986.
Devadas, Optimal Layout Via Boolean Satisfiability, NTIS pp. 1-4 1989.
Franco, Probabilistic Analysis of Algorithms for NP-complete Problems, pp. 1-31 1989.
Monfroglio, Connectionist networks for pivot selection in linear programming, pp. 51-78 1995.
"Simple Binary Random Number Generator" Electronics Letters, Mar. 26, 1992, vol. 28, No. 7, pp. 617-619.
"A Simple Binary Random Number Generator: New Approaches for CMOS VLSI", Proceedings of the 35th Midwest Symposium on Circuits and Ssystems, Aug. 9-12, 1992, pp. 127-129.
Freeman, "Improvements to Propositional Satisfiability Search Algorithms," UMI Dissertation Abstracts, Ann Arbor Dec. 1995.
Moore David K.
Smith Jeffrey S.
LandOfFree
Probabilistic computing methods and apparatus does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Probabilistic computing methods and apparatus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic computing methods and apparatus will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1013773