Patent US3703727A successfully refreshed from Google Patents.
US3703727A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for generating random numerical quantities
Assignee: AT&T Inc
•
Filing: 1971-06-18
•
Granted: 1972-11-21
•
Expires: 1991-06-18
Abstract
Abstract In a digital computer, random numbers exhibiting any desired numerical distribution are generated by accessing a table of stored random numbers having the desired distribution starting at a predetermined location and indexing in wrap-around fashion using a predetermined random skip distance. New starting points and skip distances are periodically generated using a conventional random number generator.
Inventors
- 👤 Kenneth Charles Knowlton
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 22:22
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/58
Claims Analysis
Total Claims: 66
Claim 1
Independent Claim
19 words
computing a random starting address, a random skip distance, and a predetermined number of said numbers to be accessed;
Claim 2
Dependent Claim
19 words
computing a random starting address, a random skip distance, and a predetermined number of said numbers to be accessed;
Claim 3
Independent Claim
68 words
The method of accessing a table of entries stored in the memory of a digital computer comprising the steps of: computing a starting address, a skip distance, and a predetermined number of said entries to be accessed; accessing said predetermined number of entries by successively incrementing said starting address with said skip distance in wrap-around fashion; and recalculating said skip distances after accessing said predetermined number of entries.
Claim 4
Independent Claim
68 words
The method of accessing a table of entries stored in the memory of a digital computer comprising the steps of: computing a starting address, a skip distance, and a predetermined number of said entries to be accessed; accessing said predetermined number of entries by successively incrementing said starting address with said skip distance in wrap-around fashion; and recalculating said skip distances after accessing said predetermined number of entries.
Claim 5
Independent Claim
68 words
The method of accessing a table of entries stored in the memory of a digital computer comprising the steps of: computing a starting address, a skip distance, and a predetermined number of said entries to be accessed; accessing said predetermined number of entries by successively incrementing said starting address with said skip distance in wrap-around fashion; and recalculating said skip distances after accessing said predetermined number of entries.
Claim 6
Independent Claim
68 words
The method of accessing a table of entries stored in the memory of a digital computer comprising the steps of: computing a starting address, a skip distance, and a predetermined number of said entries to be accessed; accessing said predetermined number of entries by successively incrementing said starting address with said skip distance in wrap-around fashion; and recalculating said skip distances after accessing said predetermined number of entries.
Claim 7
Dependent Claim
18 words
computing a starting address, a skip distance, and a predetermined number of said random numbers to be accessed;
Claim 8
Dependent Claim
18 words
computing a starting address, a skip distance, and a predetermined number of said random numbers to be accessed;
Claim 9
Dependent Claim
17 words
computing a starting address, a skip distance, and a predetermined number of said entries to be accessed;
Claim 10
Dependent Claim
17 words
computing a starting address, a skip distance, and a predetermined number of said entries to be accessed;
Claim 11
Dependent Claim
17 words
computing a starting address, a skip distance, and a predetermined number of said entries to be accessed;
Claim 12
Dependent Claim
17 words
computing a starting address, a skip distance, and a predetermined number of said entries to be accessed;
Claim 13
Dependent Claim
20 words
accessing said predetermined number of random numbers by successively incrementing said starting address by said skip distance in wrap-around fashion;
Claim 14
Dependent Claim
20 words
accessing said predetermined number of random numbers by successively incrementing said starting address by said skip distance in wrap-around fashion;
Claim 15
Dependent Claim
18 words
accessing said predetermined number of entries by successively incrementing said starting address by said skip distance modulo N;
Claim 16
Dependent Claim
18 words
accessing said predetermined number of entries by successively incrementing said starting address by said skip distance modulo N;
Claim 17
Dependent Claim
16 words
The method defined in claim 1 wherein said skip distance is computed by a random process.
Claim 18
Dependent Claim
18 words
accessing said predetermined number of random numbers by successively incrementing said starting address said skip distance modulo N;
Claim 19
Dependent Claim
18 words
accessing said predetermined number of random numbers by successively incrementing said starting address said skip distance modulo N;
Claim 20
Dependent Claim
19 words
accessing said predetermined number of entries by successively incrementing said starting address by said skip distance in wrap-around fashion;
Claim 21
Dependent Claim
19 words
accessing said predetermined number of entries by successively incrementing said starting address by said skip distance in wrap-around fashion;
Claim 22
Dependent Claim
19 words
recalculating said random starting address and said random skip distance after accessing said predetermined number of random numbers; and
Claim 23
Dependent Claim
19 words
recalculating said random starting address and said random skip distance after accessing said predetermined number of random numbers; and
Claim 24
Dependent Claim
16 words
The method defined in claim 1 wherein said skip distance is recalculated by a random process.
Claim 25
Dependent Claim
13 words
recalculating said skip distance after accessing said predetermined number of random numbers; and
Claim 26
Dependent Claim
13 words
recalculating said skip distance after accessing said predetermined number of random numbers; and
Claim 27
Dependent Claim
12 words
recalculating said skip distance after accessing said predetermined number of entries; and
Claim 28
Dependent Claim
12 words
recalculating said skip distance after accessing said predetermined number of entries; and
Claim 29
Dependent Claim
12 words
recalculating said skip distance after accessing said predetermined number of entries; and
Claim 30
Dependent Claim
12 words
recalculating said skip distance after accessing said predetermined number of entries; and
Claim 31
Dependent Claim
5 words
repeating steps (2) and (3).
Claim 32
Dependent Claim
5 words
repeating steps (2) and (3).
Claim 33
Dependent Claim
5 words
repeating steps (2) and (3).
Claim 34
Dependent Claim
5 words
repeating steps (2) and (3).
Claim 35
Dependent Claim
5 words
repeating steps (2) and (3).
Claim 36
Dependent Claim
5 words
repeating steps (2) and (3).
Claim 37
Dependent Claim
5 words
repeating steps (2) and (3).
Claim 38
Dependent Claim
5 words
repeating steps (2) and (3).
Claim 39
Independent Claim
67 words
The method of accessing a table of N entries stored in the memory of a digital computer comprising the steps of: computing a starting address, skip distance, and a predetermined number of said entries to be accessed; accessing said predetermined number of entries by successively incrementing said starting address with said skip distance modulo N; and recalculating said skip distance after accessing said predetermined number of entries.
Claim 40
Independent Claim
67 words
The method of accessing a table of N entries stored in the memory of a digital computer comprising the steps of: computing a starting address, skip distance, and a predetermined number of said entries to be accessed; accessing said predetermined number of entries by successively incrementing said starting address with said skip distance modulo N; and recalculating said skip distance after accessing said predetermined number of entries.
Claim 41
Dependent Claim
16 words
The method defined in claim 4 wherein said skip distance is computed by a random process.
Claim 42
Dependent Claim
16 words
The method defined in claim 4 wherein said skip distance is recalculated by a random process.
Claim 43
Independent Claim
20 words
The method of accessing a table of entries stored in the memory of a digital computer comprising the steps of:
Claim 44
Independent Claim
20 words
The method of accessing a table of entries stored in the memory of a digital computer comprising the steps of:
Claim 45
Dependent Claim
16 words
The method defined in claim 7 wherein said skip distance is computed by a random process.
Claim 46
Dependent Claim
16 words
The method defined in claim 7 wherein said skip distance is recalculated by a random process.
Claim 47
Independent Claim
21 words
The method of accessing a table of N entries stored in the memory of a digital computer comprising the steps of:
Claim 48
Independent Claim
21 words
The method of accessing a table of N entries stored in the memory of a digital computer comprising the steps of:
Claim 49
Dependent Claim
16 words
The method defined in claim 10 wherein said skip distance is computed by a random process.
Claim 50
Dependent Claim
16 words
The method defined in claim 11 wherein said skip distance is recalculated by a random process.
Claim 51
Independent Claim
22 words
The method of accessing a table of N random numbers stored in the memory of a digital computer comprising the steps of:
Claim 52
Independent Claim
22 words
The method of accessing a table of N random numbers stored in the memory of a digital computer comprising the steps of:
Claim 53
Dependent Claim
16 words
The method defined in claim 13 wherein said skip distance is computed by a random process.
Claim 54
Dependent Claim
16 words
The method defined in claim 13 wherein said skip distance is recalculated by a random process.
Claim 55
Independent Claim
22 words
The method of accessing a table of N random numbers stored in the memory of a digital computer comprising the steps of:
Claim 56
Independent Claim
22 words
The method of accessing a table of N random numbers stored in the memory of a digital computer comprising the steps of:
Claim 57
Dependent Claim
12 words
The method defined in claim 16 wherein N is a prime number.
Claim 58
Independent Claim
101 words
The method of computing address quantities stored in an index register for use in accessing a table of N entries stored in the memory of a digital computer comprising the steps of: computing an initial random address quantity and storing said quantity in said index register; computing a random skip distance; successively adding said skip distance to the contents of said index register modulo N to compute a first plurality of address quantities; recalculating said random skip distance; successively adding said recalculated skip distance to the contents of said index register modulo N to compute a second plurality of address quantities.
Claim 59
Independent Claim
101 words
The method of computing address quantities stored in an index register for use in accessing a table of N entries stored in the memory of a digital computer comprising the steps of: computing an initial random address quantity and storing said quantity in said index register; computing a random skip distance; successively adding said skip distance to the contents of said index register modulo N to compute a first plurality of address quantities; recalculating said random skip distance; successively adding said recalculated skip distance to the contents of said index register modulo N to compute a second plurality of address quantities.
Claim 60
Dependent Claim
12 words
The method defined in claim 18 wherein N is a prime number.
Claim 61
Dependent Claim
47 words
Apparatus for accessing a table of stored digitally coded quantities comprising: means for successively incrementing an index quantity by a predetermined skip distance in wrap-around fashion; and means responsive to said index quantity for selecting from said table each of said quantities indexed by said index quantity.
Claim 62
Dependent Claim
47 words
Apparatus for accessing a table of stored digitally coded quantities comprising: means for successively incrementing an index quantity by a predetermined skip distance in wrap-around fashion; and means responsive to said index quantity for selecting from said table each of said quantities indexed by said index quantity.
Claim 63
Dependent Claim
15 words
The apparatus defined in claim 20 further comprising means for periodically recomputing said skip distance.
Claim 64
Dependent Claim
21 words
The apparatus defined in claim 21 further comprising limiting the size of said table to a predetermined prime number of quantities.
Claim 65
Dependent Claim
47 words
Apparatus for accessing a table of digitally coded quantities to produce a sequence of digitally coded output quantities comprising: means for initiating said sequence at a predetermined position in said group; and means for re-entrantly skipping through said table in wrap-around fashion by a predetermined skip distance.
Claim 66
Dependent Claim
47 words
Apparatus for accessing a table of digitally coded quantities to produce a sequence of digitally coded output quantities comprising: means for initiating said sequence at a predetermined position in said group; and means for re-entrantly skipping through said table in wrap-around fashion by a predetermined skip distance.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1975-11-21 | 1976-05-22 | 1976-11-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1979-11-21 | 1980-05-22 | 1980-11-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1983-11-21 | 1984-05-22 | 1984-11-21 | $7700.00 | Window Closed / Lapsed |