US3731284A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for reordering data
Assignee: AT&T Inc
•
Filing: 1971-12-27
•
Granted: 1973-05-01
•
Expires: 1991-12-27
Abstract
Abstract A reordering method and associated apparatus for storing and accessing samples of a physical process to facilitate the generation of Fourier series coefficients is disclosed. In particular, methods and apparatus for generating storage and retrieval patterns for a sequence of sampled data for facilitating the computation of fast Fourier transformation (FFT) of a plurality of overlapped records is disclosed.
Inventors
- 👤 F Thies
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 14:49
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/76; G06F7/768; G06F17/00; G06F17/10; G06F17/14; G06F17/141; G06F17/142
Claims Analysis
Total Claims: 35
Claim 1
Independent Claim
126 words
Apparatus for buffering and digits-reversed scrambling an input sequence of ordered signals to generate sets of N output signals comprising A. a memory having N storage locations, B input addressing means for generating alternate patterns of straight sequential address input signals and scrambled-withinquadrant address input signals, C output addressing means for generating patterns of signals representing output addresses having digits of greatest significance varying for each set of R consecutive addresses, where R is an integer factor of N, D means responsive to said input address signals for causing said input sequence of ordered signals to be stored at corresponding locations in said memory, and E means responsive to said output address signals for reading out signals stored in said memory, thereby deriving said output signals.
Claim 2
Dependent Claim
126 words
Apparatus for buffering and digits-reversed scrambling an input sequence of ordered signals to generate sets of N output signals comprising A. a memory having N storage locations, B input addressing means for generating alternate patterns of straight sequential address input signals and scrambled-withinquadrant address input signals, C output addressing means for generating patterns of signals representing output addresses having digits of greatest significance varying for each set of R consecutive addresses, where R is an integer factor of N, D means responsive to said input address signals for causing said input sequence of ordered signals to be stored at corresponding locations in said memory, and E means responsive to said output address signals for reading out signals stored in said memory, thereby deriving said output signals.
Claim 3
Dependent Claim
26 words
a modulo-N/R counter for generating a plurality of first count signals representative of a count of said first clock signals, R and N/R being positive integers,
Claim 4
Dependent Claim
26 words
a modulo-N/R counter for generating a plurality of first count signals representative of a count of said first clock signals, R and N/R being positive integers,
Claim 5
Dependent Claim
11 words
Apparatus according to claim 1 wherein said input addressing means comprises
Claim 6
Dependent Claim
20 words
a modulo-N counter for generating a plurality of second count signals representative of a count of said second clock signals,
Claim 7
Dependent Claim
20 words
a modulo-N counter for generating a plurality of second count signals representative of a count of said second clock signals,
Claim 8
Dependent Claim
20 words
a modulo-N counter for generating a plurality of second count signals representative of a count of said second clock signals,
Claim 9
Dependent Claim
20 words
a modulo-N counter for generating a plurality of second count signals representative of a count of said second clock signals,
Claim 10
Dependent Claim
28 words
a modulo-R counter for generating first output address signals representative of the number of transitions of said modulo-N counter from its maximum count to its minimum count, and
Claim 11
Dependent Claim
28 words
a modulo-R counter for generating first output address signals representative of the number of transitions of said modulo-N counter from its maximum count to its minimum count, and
Claim 12
Dependent Claim
28 words
a modulo-R counter for generating first output address signals representative of the number of transitions of said modulo-N counter from its maximum count to its minimum count, and
Claim 13
Dependent Claim
28 words
a modulo-R counter for generating first output address signals representative of the number of transitions of said modulo-N counter from its maximum count to its minimum count, and
Claim 14
Dependent Claim
38 words
Apparatus according to claim 2 wherein R represents the redundancy for said sets of N output signals and wherein said first source of clock signals comprises means for generating clock signals at the rate of N/R per second.
Claim 15
Dependent Claim
30 words
a modulo-R counter for generating a set of first address signals representative of the number of transitions of said modulo-N/R counter from its maximum count to its minimum count, and
Claim 16
Dependent Claim
30 words
a modulo-R counter for generating a set of first address signals representative of the number of transitions of said modulo-N/R counter from its maximum count to its minimum count, and
Claim 17
Dependent Claim
26 words
means responsive to said first address signals for selectively reversing the significance of selected ones of said first count signals, thereby to generate second address signals.
Claim 18
Dependent Claim
26 words
means responsive to said first address signals for selectively reversing the significance of selected ones of said first count signals, thereby to generate second address signals.
Claim 19
Dependent Claim
28 words
means responsive to said first output address signals for selectively reversing the significance of selected ones of said second count signals, thereby to generate second output address signals.
Claim 20
Dependent Claim
28 words
means responsive to said first output address signals for selectively reversing the significance of selected ones of said second count signals, thereby to generate second output address signals.
Claim 21
Dependent Claim
28 words
means responsive to said first output address signals for selectively reversing the significance of selected ones of said second count signals, thereby to generate second output address signals.
Claim 22
Dependent Claim
28 words
means responsive to said first output address signals for selectively reversing the significance of selected ones of said second count signals, thereby to generate second output address signals.
Claim 23
Dependent Claim
11 words
Apparatus according to claim 1 wherein said output addressing means comprises
Claim 24
Dependent Claim
103 words
Apparatus for generating a sequence of input addresses for a memory having N locations comprising A. a source of clock signals, B. a modulo-N/R counter for generating first count signals representative of a count of said clock signals, R and N/R being Positive integers, C. a modulo-R counter for generating first address signals representative of the number of transitions of said modulo-N/R counter from maximum count to minimum count, R and N/R being positive integers, and D. means responsive to said first address signals for selectively reversing the significance of selected ones of said first count signals, thereby to generate second address signals.
Claim 25
Dependent Claim
103 words
Apparatus for generating a sequence of input addresses for a memory having N locations comprising A. a source of clock signals, B. a modulo-N/R counter for generating first count signals representative of a count of said clock signals, R and N/R being Positive integers, C. a modulo-R counter for generating first address signals representative of the number of transitions of said modulo-N/R counter from maximum count to minimum count, R and N/R being positive integers, and D. means responsive to said first address signals for selectively reversing the significance of selected ones of said first count signals, thereby to generate second address signals.
Claim 26
Dependent Claim
36 words
Apparatus according to claim 5 wherein each of said counters is a binary counter and said means responsive to said first address signals comprises means for reversing the significance of the bits of said modulo-N/R counter.
Claim 27
Dependent Claim
16 words
Apparatus for generating a sequence of output address signals for a memory having N locations comprising
Claim 28
Dependent Claim
16 words
Apparatus for generating a sequence of output address signals for a memory having N locations comprising
Claim 29
Dependent Claim
46 words
Apparatus according to claim 7 wherein each of said counters is a binary counter, and said means responsive to said first output address signals comprises a control means for selectively reversing the significance of the signals representing the log2(N/R) most significant bits of said modulo-N counter.
Claim 30
Dependent Claim
70 words
Apparatus according to claim 8 wherein said control means comprises an R-bit adder for forming the sum of the signals representing the R least significant bits of said modulo-N counter and the contents of said modulo-R counter, said adder also comprising means for generating an overflow signal, and second control means responsive to said overflow signal for reversing the significance of said log2(N/R) most significant bits of said modulo-N counter.
Claim 31
Dependent Claim
28 words
Apparatus according to claim 9 wherein said second control means also comprises means responsive to said first output address signals for reversing the significance of said log2(N/R) bits.
Claim 32
Dependent Claim
21 words
Apparatus according to claim 10 for combining said first and second output address signals, thereby to form composite output address signals.
Claim 33
Dependent Claim
128 words
The machine method for generating sets of N output signal sequences each of which is a digits-reversed reordered version of a corresponding input signal sequence comprising the steps of A. generating a sequence of binary input address signals, said address signals indicating alternate R-address subsequences of addresses having a straight-sequential ordering and scrambled-within-quadrant ordering, B. storing each of said sequences in a memory having N locations, the locations for storing said sequences being determined by said sequence of input address signals, C. generating a sequence of binary output address signals which indicate addresses for which the N/R digits of greatest significance vary for sets of R consecutive addresses, and D. reading sets of N signals from locations in said memory in accordance with said sequence of output addresses.
Claim 34
Dependent Claim
128 words
The machine method for generating sets of N output signal sequences each of which is a digits-reversed reordered version of a corresponding input signal sequence comprising the steps of A. generating a sequence of binary input address signals, said address signals indicating alternate R-address subsequences of addresses having a straight-sequential ordering and scrambled-within-quadrant ordering, B. storing each of said sequences in a memory having N locations, the locations for storing said sequences being determined by said sequence of input address signals, C. generating a sequence of binary output address signals which indicate addresses for which the N/R digits of greatest significance vary for sets of R consecutive addresses, and D. reading sets of N signals from locations in said memory in accordance with said sequence of output addresses.
Claim 35
Dependent Claim
91 words
The method of claim 12 wherein said step of generating said sequence of binary input addresses comprises (1) generating a sequence of clock signals at the desired input signal rate, (2) modulo-N/R counting said clock signals, thereby generating first count signals, (3) modulo-R counting the number of cycles occurring in said modulo-N/R counting of said clock signals, thereby generating first input address signals, and (4) selectively bit-reversing said first count signals in response to an indication of the number of cycles of said modulo-R counter, thEreby generating second input address signals.
References Cited (Backward Citations)
US3517173A
Cited
US3440618A
Cited
US3564505A
Cited
US3584781A
Cited
US3591784A
Cited
US3633173A
Cited
US3601592A
Cited
US3673399A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1976-04-30 | 1976-10-30 | 1977-05-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1980-04-30 | 1980-10-30 | 1981-05-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1984-04-30 | 1984-10-30 | 1985-05-01 | $7700.00 | Window Closed / Lapsed |