US5594919A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for reordering bytes in a data stream
Assignee: Apple Inc
•
Filing: 1995-06-02
•
Granted: 1997-01-14
•
Expires: 2015-06-02
Abstract
Abstract A method and system are disclosed for efficiently translating data from one known data sequencing arrangement to an alternative sequencing arrangement. The method consists of the steps of generating a source sequence signal which identifies the ordering of units within the source sequence, generating a destination sequence signal which identifies the ordering of units within the destination sequence, and combining the source signal and destination signal to produce a permutation signal which defines the relationship between the source sequence and the destination sequence. Once the permutation signal has been defined, this permutation signal is applied to the source sequence to allow the reordering of the source sequence into the desired destination sequence. A reordering circuit is used to rearrange the source sequence units into the desired destination sequence units utilizing the permutation signal generated in the present invention. The reordering circuit consists of an array of ordered swap units which contain inputs for source sequence signals and permutation signals, and outputs which propagate destination sequences.
Inventors
- 👤 Kenneth E. Turkowski
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 15:02
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/76; G06F7/768; G06F7/762; G06F9/00; G06F9/06; G06F9/30; G06F9/30003; G06F9/30007; G06F9/30025; G06F9/30032
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
147 words
A computer implemented method for translating a source sequence of ordered data units into a destination sequence having a different ordering of said data units, the method comprising the computer implemented steps of: using machine-specific data unit packing parameters to generate a source sequence signal, E S , which identifies the ordering of units within the source sequence; using machine-specific data unit packing parameters to generate a destination sequence signal, E D , which identifies the ordering of units within the destination sequence; combining the source sequence signal and the destination sequence signal to produce a permutation signal, E P , according to the formula: E.sub.P =(E.sub.S XOR E.sub.D)AND(n-1) where n is equal to the number of data units to be translated and is greater than two; and reordering the units from the source sequence in response to the permutation signal to produce a translated destination sequence.
Claim 2
Dependent Claim
147 words
A computer implemented method for translating a source sequence of ordered data units into a destination sequence having a different ordering of said data units, the method comprising the computer implemented steps of: using machine-specific data unit packing parameters to generate a source sequence signal, E S , which identifies the ordering of units within the source sequence; using machine-specific data unit packing parameters to generate a destination sequence signal, E D , which identifies the ordering of units within the destination sequence; combining the source sequence signal and the destination sequence signal to produce a permutation signal, E P , according to the formula: E.sub.P =(E.sub.S XOR E.sub.D)AND(n-1) where n is equal to the number of data units to be translated and is greater than two; and reordering the units from the source sequence in response to the permutation signal to produce a translated destination sequence.
Claim 3
Dependent Claim
16 words
The method for translating according to claim 1, wherein the data unit is an eight-bit byte.
Claim 4
Dependent Claim
16 words
The method for translating according to claim 1, wherein the data unit is a single bit.
Claim 5
Dependent Claim
19 words
The method for translating according to claim 1, wherein n is equal to 2 raised to an integer power.
Claim 6
Dependent Claim
64 words
The method for translating according to claim 1, wherein the step of reordering the data units of the source sequence comprises: determining a destination ordering index D(i) for each data unit of the source sequence based on a source ordering index S(i) of the unit's order in the source sequence, using the permutation signal, E P , according to the formula: D(i)=S(i XOR E.sub.P).
Claim 7
Dependent Claim
141 words
A computer system for translating a source sequence of n ordered data units into a desired destination sequence having a different ordering, the computer system comprising: means for using machine-specific data unit packing parameters to generate a source sequence signal, E S , which identifies the ordering of units within the source sequence; means for using machine-specific data unit packing parameters to generate a destination sequence signal, E D , which identifies the ordering of units within the destination sequence; means for combining the source sequence signal and destination sequence signal to produce a permutation signal, E P defined by the formula: E P =(E S XOR E D )AND(n-1) where n is greater than two; and means for reordering the units from the source sequence in response to the permutation signal to produce a translated destination sequence of data units.
Claim 8
Dependent Claim
141 words
A computer system for translating a source sequence of n ordered data units into a desired destination sequence having a different ordering, the computer system comprising: means for using machine-specific data unit packing parameters to generate a source sequence signal, E S , which identifies the ordering of units within the source sequence; means for using machine-specific data unit packing parameters to generate a destination sequence signal, E D , which identifies the ordering of units within the destination sequence; means for combining the source sequence signal and destination sequence signal to produce a permutation signal, E P defined by the formula: E P =(E S XOR E D )AND(n-1) where n is greater than two; and means for reordering the units from the source sequence in response to the permutation signal to produce a translated destination sequence of data units.
Claim 9
Dependent Claim
16 words
The system for translating according to claim 6, wherein the data unit is an eight-bit byte.
Claim 10
Dependent Claim
16 words
The system for translating according to claim 6, wherein the data unit is a single bit.
Claim 11
Dependent Claim
65 words
The system for translating according to claim 6, wherein the means for reordering the data units of the source sequence comprises: means for determining a destination ordering index D(i) for each data unit of the source sequence using a source ordering index S(i) corresponding to each unit's location in the source sequence, and the permutation signal, E P , in the formula: D(i)=S(i XOR E.sub.P).
Claim 12
Dependent Claim
19 words
The system for translating according to claim 6, wherein n is equal to 2 raised to an integer power.
References Cited (Backward Citations)
US3812467A
Cited
US4866421A
Cited
US4931925A
Cited
US4918600A
Cited
US5107415A
Cited
US5265237A
Cited
US5398328A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-01-14 | 2000-07-15 | 2001-01-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-01-14 | 2004-07-15 | 2005-01-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-01-14 | 2008-07-15 | 2009-01-14 | $7700.00 | Window Closed / Lapsed |