Method of generating a cycle-efficient bit-reverse index array for a wireless communication system
AssigneeTexas Instruments Incorporated
InventorDavid P. Magee
Life of this patent
Estimating the term…
Abstract
An efficient method of generating a bit-reverse index array in real time without performing any bit manipulation for a wireless communication system.
Claims16
In a data processing device including a central processing unit and a memory, a method of generating a bit-reverse index array for a wireless communication system, the method comprising the steps of:
- (a) initializing a first value of an index array, stored in the memory, to 0;
- using the central processing unit:
- (b) multiplying the initialized first value by the number 2 to generate a first portion of the index array;
- (c) adding the number 1 to the first portion of the index array to generate a second portion of the index array, wherein the first portion and the second portion comprise a new set of numbers;
- (d) multiplying each number in the new set of numbers by the number 2 to generate a new first portion of the index array, wherein the new first portion of the index array comprises a new set of numbers;
- (e) adding the number 1 to each number in the new first portion of the index array to generate a new second portion of the index array, wherein the new first portion and the new second portion comprises a new set of numbers;
- and
- (f) repeating steps (d) and (e) until the index array grows to a bit-reverse index array having a desired length.
In a data processing device that includes a central processing unit and a memory, a method of generating a bit-reverse index array comprising the steps of:
- (a) initializing a first value of an index array stored in the memory to 0 to generate a first portion of the index array;
- using the central processing unit:
- (b) adding the number 1 to the first portion of the index array to generate a second portion of the index array, wherein the first portion and the second portion comprise a new set of numbers;
- (c) multiplying each number in the new set of numbers by the number 2 to generate a new first portion of the index array, wherein the new first portion of the index array comprises a new set of numbers;
- (d) adding the number 1 to each number in the new first portion of the index array to generate a new second portion of the index array, wherein the new first portion and the new second portion comprises a new set of numbers;
- and
- (e) repeating steps (c) and (d) until the index array grows to a bit-reverse index array having a desired length.
In a data processing device having a memory and a central processing unit, a method of generating a bit reversed index array of n-bit binary values, the method comprising the steps of:
- (a) initializing a first portion of the index array stored in the memory;
- using the central processing unit:
- (b) computing each value in the first portion of the index array by multiplying each said value by a first predetermined amount;
- (c) updating each value in the first portion of the index array;
- (d) computing each value in a second portion of the index array by adding a second predetermined amount to a corresponding one of the first portion of the index array;
- (e) updating each value in the second portion of the index array;
- (f) re-defining the first portion of the index array to include the second portion of the index array;
- and
- (g) repeating steps (b) through (f) until the re-defined first portion of the index array is of a desired length, wherein the index to each element in the index array being the bit reverse of the value stored in that element of the index array.
Dependencies are inferred from the claim text.