Data burst randomizer

• US 5,659,569 A
• Filed: 02/14/1994
• Issued: 08/19/1997
• Est. Priority Date: 06/25/1990
• Status: Expired due to Term

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Rueth, Timothy Irvin, Jou, Yu-Cheun, Padovani, Roberto, McDonough, John G., Kindred, Daniel Ray
• Primary Examiner(s): Gregory, Bernarr E.
• Application Number:
  US08/194,823
• Time in Patent Office: 1,282 Days
• Field of Search: 375/1, 375/68, 375/200-210, 375/309, 380/34, 380/28, 380/46, 380/48, 380/37, 365/233, 370/18, 370/19, 370/20, 370/58.1, 370/58.2, 370/60, 370/68, 370/91, 370/94.1, 370/95.3
• US Class Current: 370/479
• CPC Class Codes: H04B 1/707 using direct sequence modulation
• CPC Class Codes: H04B 1/70757 with increased resolution, i.e. higher than half a chip H04B1/70758 takes precedence
• CPC Class Codes: H04B 1/7115 Constructive combining of multi-path signals, i.e. RAKE receivers
• CPC Class Codes: H04B 2201/70701 featuring pilot assisted reception
• CPC Class Codes: H04B 2201/70703 using multiple or variable rates
• CPC Class Codes: H04B 7/2618 using hybrid code-time division multiple access [CDMA-TDMA]
• CPC Class Codes: H04B 7/2628 using code-division multiple access [CDMA] or spread spectrum multiple access [SSMA] H04B7/2618 takes precedence
• CPC Class Codes: H04B 7/2637 for logical channel control
• CPC Class Codes: H04J 13/0048 Walsh
• CPC Class Codes: H04J 13/10 Code generation
• CPC Class Codes: H04J 13/18 Allocation of orthogonal codes
• CPC Class Codes: H04J 3/1688 the demands of the users being taken into account after redundancy removal, e.g. by predictive coding, by variable sampling reducing bandwidth of signals in general H04B1/66; in PCM-systems H04B14/046; removal of redundancy in telegraph communication H03M7/30
• CPC Class Codes: H04J 3/22 in which the sources have different rates or codes simultaneous speech and digital data or video transmission H04M11/06; see provisional also H04J3/16
• CPC Class Codes: H04L 1/0006 by adapting the transmission format
• CPC Class Codes: H04L 1/0065 Serial concatenated codes
• CPC Class Codes: H04L 1/0068 by puncturing
• CPC Class Codes: H04L 1/0071 Use of interleaving interleaving per se H03M13/27
• CPC Class Codes: H04L 1/08 by repeating transmission, e.g. Verdan system H04L1/1858 and H04L1/189 take precedence
• CPC Class Codes: H04L 23/02 adapted for orthogonal signalling
• CPC Class Codes: H04L 5/02 Channels characterised by the type of signal
• CPC Class Codes: H04L 5/12 : the signals being represented by different phase modulations of a single carrier
• CPC Class Codes: H04W 52/26 : using transmission rate or quality of service QoS [Quality of Service]

Abstract

A method and system, for use in a communication system in which data is transmitted in data frames of a predetermined time duration, for the positioning of the data within the data frames for transmission. A computation circuit computes according to the deterministic code a pseudorandom position for the data within each data frame. A positioning circuit positions the data within each data frame in the computed position.

Claims

1. In a system in which data bits are transmitted in data frames of a predetermined time duration wherein said data for each frame is provided at a preselected one of a plurality of data rates, with said data provided at each rate comprised of an ordered sequence of a first version of a data bits and R repeated versions of said data bits, where R is an integer, a system for the positioning of data within said data frames for transmission comprising:

means for determining the position of said data bits within each data frame according to a pseudorandom code, said means for determining the positions further responsive to a data rate indication for selecting a set of algorithms from a plurality of algorithm sets wherein each algorithm set corresponds to a predetermined data rate indication, and computing from said selected algorithm set according to said pseudorandom code said data position for each data frame; and

means for positioning said data bits in said determined positions within each data frame, said means for positioning including means for receiving said ordered sequence of said first version and R repeated versions of said data bits, and deleting in accordance with said computed data position, all except one version of said first and R repeated versions of data bits, to provide an output of one said first version and R repeated versions of data bits in said selected data position.

2. The system of claim 1 wherein each data frame is comprised of a sequence of time slots with each time slot corresponding to a different one of said first version of said data bits and said R repeated versions of said data bits.

3. The system of claim 2 wherein said first version of data bits is defined by a plurality of first data groups, and said R repeated version of said data bits are defined by a plurality of second data groups with each of R second data groups identical to a corresponding one of said first data groups, and wherein each one of said first and second data groups corresponds to a different time slot in said data frame.

4. In a system in which data bits are transmitted in data frames of a predetermined time duration wherein said data provided for at least one data frame is of a duration insufficient to span said data frame duration, and each data frame is comprised of a sequence of time slots into which portions of said data is positioned, a system for the positioning of data within said data frames for transmission comprising:

means for determining the positions of said data bits within each data frame according to a pseudorandom code, said means for determining the position further responsive to an indication corresponding said duration of said data for selecting in accordance with said indication at least one algorithm from a plurality of algorithms, computing from said selected algorithms according to said pseudorandom code at least one time slot for which portions of said data is to be positioned within said data frame; and

means for positioning said data bits in said determined position within each data frame, said means for positioning including means for placing a different portion of said data within a different computed time slot of said data frame.

5. In a communication system in which data is transmitted in data frames of a predetermined time duration and defining a predetermined number of time slots, a system for positioning variable rate data within said time slots comprising:

a computation circuit that receives a first pseudorandom (PN) code at an input determines from said first PN code pseudorandomly selected time slots within a data frame and has an output at which an indication of said selected time slots are provided;

a gating circuit having a first input coupled to said computation circuit output, having a second input for receiving an input frame of data, said gating circuit responsive to said indication for selectively deleting bits of data in time slots of said data frame other than said selected time slots, and having an output at which said data at said selected time slots is provided in an output frame of data wherein transmission of said output frame of data is time-gated in accordance with position of said selected time slots.

6. The system of claim 5 wherein said gating circuit comprises a power amplifier having a control input coupled to said computation circuit output, and a data input for receiving said data and an output.

7. The system of claim 5 wherein said gating circuit comprises switching logic having a control input coupled to said computation circuit output, a data input for receiving said data and an output.

8. In a communication system in which data is transmitted in data frames of a predetermined time duration and defining a predetermined number of time slots, a system for positioning variable rate data within said time slots comprising:

a computation circuit that receives a first pseudorandom (PN) code at an input determines from said first PN code pseudorandomly selected time slots within a data frame and has an output at which an indication of said selected time slots are provided;

wherein said computation circuit comprises a logic circuit comprising;

latch circuitry having an input for receiving said first PN code, said latch circuitry storing at a predetermined time for each data frame a portion of said PN code, and an output for providing said stored PN code portion;

counter logic that identifies each time slot within each data frame having an output at which an identification of each time slot is provided;

selection logic having inputs coupled to said latch circuitry output and said counter logic output, and an output for providing said selected bits of said stored PN code portion; and

determination logic having an input coupled to said selection logic output and an output at which is provided an indication of each selected time slot; and

a gating circuit having a first input coupled to said computation circuit output, a second input for receiving an input frame of data, said gating circuit responsive to said indication for selectively deleting bits of data in time slots of said data frame other than said selected time slots, and having an output at which said data at said selected time slots is provided in an output frame of data.

9. The system of claim 8 wherein said gating circuit comprises a masked finite impulse response (FIR) filter having a masking input coupled to said determination logic output, a data input for receiving said data and an output.

10. The system of claim 9 wherein said gating circuit further comprises a power amplifier having a control input coupled to said determination logic output and a data input coupled to said FIR filter output.

11. The system of claim 8 wherein said gating circuit comprises a power amplifier having a control input coupled to said determination logic output, a data input for receiving said data and an output.

12. The system of claim 8 wherein said gating circuit comprises switching logic having a control input coupled to said determination logic output, a data input for receiving said data and an output.

13. In a communication system in which data is transmitted in data frames of a predetermined time duration and defining a predetermined number of time slots, a system for positioning variable rate data within said time slots comprising:

a computation circuit that receives a first pseudorandom (PN) code at an input determines from said first PN code pseudorandomly selected time slots within a data frame and has an output at which an indication of said selected time slots are provided;

a gating circuit having a first input coupled to said computation circuit output, a second input for receiving an input frame of data, said gating circuit responsive to said indication for selectively deleting bits of data in time slots of said data frame other than said selected time slots, and having an output at which said data at said selected time slots is provided in an output frame of data;

wherein said computation circuit and said gating circuit comprises a microprocessor operating under preprogrammed instructions.

14. In a communication system in which data is transmitted in data frames of a predetermined time duration and defining a predetermined number of time slots, a system for positioning variable rate data within said time slots comprising:

a computation circuit that receives a first pseudorandom (PN) code at an input determines from said first PN code pseudorandomly selected time slots within a data frame and has an output at which an indication of said selected time slots are provided;

wherein said computation circuit comprises a microprocessor operating under preprogrammed instructions having an output at which is provided an indication of each selected time slot; and

a gating circuit having a first input coupled to said computation circuit output, a second input for receiving an input frame of data, said gating circuit responsive to said indication for selectively deleting bits of data in time slots of said data frame other than said selected time slots, and having an output at which said data at said selected time slots is provided in an output frame of data.

15. The system of claim 14 wherein said gating circuit comprises a masked finite impulse response (FIR) filter having a masking input coupled to said microprocessor output, a data input for receiving said data and an output.

16. The system of claim 15 wherein said gating circuit further comprises a power amplifier having a control input coupled to said microprocessor output and a data input coupled to said FIR filter output.

17. The system of claim 14 wherein said gating circuit comprises a power amplifier having a control input coupled to said microprocessor output, a data input for receiving said data and an output.

18. The system of claim 14 wherein said gating circuit comprises switching logic having a control input coupled to said microprocessor output, a data input for receiving said data and an output.

19. A method for arranging a set of data bits in data frames for transmission, each data frame comprised of a predetermined number of time slots, said method comprising the steps of:

computing from a pseudorandom (PN) code at least one time slot value, each at least one time slot value corresponding to a selected one of said time slots within each data frame; and

positioning said data bits into each said selected ones of said time slots wherein transmission of said data frames is time-gated based upon respective positions within said data frames of said selected ones of said time slots.

20. A method for arranging a set of data bits in data frames for transmission, each data frame comprised of a predetermined number of time slots, said method comprising the steps of:

providing said data for each frame at a preselected one of a plurality of data rates wherein said data provided at each rate is comprised of an ordered sequence of a first version of data bits and R repeated versions of said data bits, where R is an integer;

computing from a pseudorandom (PN) code at least one time slot value each corresponding to a respective time slot within each data frame; and

positioning said data bits in said data frame into a respective time slot within each data frame corresponding to each commuted time slot value.

21. The method of claim 20 wherein said step of computing comprises the steps of:

receiving a rate indication corresponding to a data rate for said data;

selecting, in response to said rate indication, a set of algorithms from a plurality of algorithm sets where each algorithm set corresponds to a predetermined data rate indication; and

determining, from said selected algorithm set according to said pseudorandom code, said at least one time slot value.

22. The method of claim 21 wherein said step of positioning comprises the steps of:

receiving an input of said ordered sequence of said first version and R repeated versions of said data bits each corresponding to a frame respective time slot;

deleting in said ordered sequence, according to said at least one of said time slot values, all except one version of said first and R repeated versions of data bits; and

providing said one version of said first and R repeated versions of data bits in each time slot for said data frame corresponding to said at least one of said time slot values.

23. A method for arranging a set of data bits in data frames for transmission wherein said data is of a duration insufficient to span a duration of said data frame, each data frame comprised of a predetermined number of time slots, said method comprising the steps of:

computing from a pseudorandom (PN) code at least one time slot value each corresponding to a respective time slot within each data frame, said step of computing comprises of steps of;

receiving an indication corresponding to said duration of said data;

selecting, in response to said indication, at least one algorithm from a plurality of algorithms wherein at least one algorithm from said plurality of algorithm corresponds to a respective indication;

determining, from said selected at least one algorithm according to said pseudorandom code, said at least one time slot value; and

positioning said data bits in said data frame into a respective time slot within each data frame corresponding to each commuted time slot value.

24. A method for arranging a set of data bits in data frames for transmission wherein said data is of a duration insufficient to span a duration of said data frame and wherein said data is provided at one of a plurality of data rates for each data frame, each data frame comprised of a predetermined number of time slots, said method comprising the steps of:

computing from a pseudorandom (PN) code at least one time slot value each corresponding to a respective time slot within each data frame, wherein in said step of computing each computed slot for data of a given data rate is a subset of computed time slots for data of another data rate wherein said data at another data rate requires more bits than said data at said given data rate; and

positioning said data bits in said data frame into a respective time slot within each data frame corresponding to each commuted time slot value.

25. In a communication system, in which data is transmitted in data frames with a predetermined maximum number of data bits capable of being transmitted in each data frame, and wherein provided for each frame is a set of data bits with each set comprised of one of a plurality of predetermined number of data bits, a system for providing for each frame of data a spreading of transmitted energy throughout the frame comprising:

conversion means for, receiving each set of data bits, and generating an ordered sequence of a first version and R repeated versions of said data bits, where R is an integer, to provide for each frame a number of data bits corresponding to said maximum number of data bits for said frame; and

filter means for, receiving for each frame said ordered sequence of said first version and R repeated versions of said data bits, and reducing for each frame having at least one repeated version of said data bits a transmission energy of said first version and said R repeated versions of said data bits for said frame by an R multiple of a predetermined value.

26. The system of claim 25 further comprising:

encoder means for encoding each set of data bits according to a predetermined encoding scheme and providing a corresponding set of data symbols, wherein a set of a maximum number of data bits for a frame are encoded to a corresponding maximum number of symbols for said frame, and wherein;

said conversion means receives each set of data symbols for conversion to a corresponding ordered sequence of first version and R repeated versions of said data symbols of a maximum number of data symbols for a frame; and

said filter means receives for each frame said ordered sequence of first version and R repeated versions of said data symbols for reducing for each frame having at least one repeated version of said data symbols a transmission energy of said first version and said R repeated versions of said data symbols for said frame by an R multiple of a predetermined value.

27. In a communication system, in which data is transmitted in data frames where up to a predetermined maximum number of data bits are transmitted in each data frame, and wherein provided for each frame is a set of data bits with each set comprised of one of a plurality of predetermined number of data bits, a method for providing for each frame of data a spreading of transmitted energy throughout the frame comprising the steps of:

receiving a set of data bits for transmission in a frame;

generating for said set of received data bits an ordered sequence of a first version and R repeated versions of said data bits, where R is an integer, to provide for said frame a number of data bits corresponding to a predetermined maximum number of data bits;

reducing for said frame when having at least one repeated version of said data bits a transmission energy of said first version and said R repeated versions of said data bits for said frame by an R multiple of a predetermined value.

28. The method of claim 27 further comprising the step of:

encoding said set of received data bits according to a predetermined encoding scheme to provide a corresponding set of data symbols, wherein a set of a maximum number of data bits for a frame are encoded to a corresponding maximum number of symbols for said frame, and wherein in said step of generating said set of data symbols are converted to a corresponding ordered sequence of first version and R repeated versions of said data symbols of a maximum number of data symbols for a frame; and

in said step of reducing for said frame when having at least one repeated version of said data symbols a transmission energy of said first version and said R repeated versions of said data symbols for said frame by an R multiple of a predetermined value.

29. In a system in which data bits are transmitted in data frames of a predetermined time duration, a system for providing said data bits within said data frames for transmission comprising:

means for determining positions of said data bits within each data frame according to a pseudorandom code;

data source means for providing said data bits in said determined positions within each data frame; and

time-gating transmission of each data frame based upon said determined positions of said data bits.

30. In a system in which data bits are transmitted in data frames of a predetermined time duration wherein each of said data frames comprises a set of distinct time slots of a duration equal to the duration of a predetermined number of said data bits and wherein said data bits are grouped into control groups of said predetermined number, a system for providing said data bits within said data frames for transmission comprising:

means for determining positions of said data bits within each data frame according to a pseudorandom code wherein said means for determining positions determines slot positions in said data frames for each of said control groups; and

data source means for providing said data bits in said determined positions within each data frame wherein said data source means provides said control groups into said slots in accordance with said determined slot positions.

31. In a system in which data bits are transmitted in data frames of a predetermined time duration, a system for providing said data bits within said data frames for transmission comprising:

means for determining positions of said data bits within each data frame according to a pseudorandom code wherein said means for determining positions is responsive to a data rate signal in determining said data bit positions; and

data source means for providing said data bits in said determined positions within each data frame.

32. In a system in which data bits are transmitted in data frames of a predetermined time duration, a method for the positioning of data within said data frames for transmission comprising the steps of:

determining positions of said data bits within each data frame according to a pseudorandom code; and

providing said data bits in said determined positions within each data frame and for time-gating transmission of each data frame based upon said determined positions of said data bits.

33. In a system in which data bits are transmitted in data frames of a predetermined time duration, a method for the positioning of data within said data frames for transmission comprising the steps of:

determining positions of said data bits within each data frame according to a pseudorandom code;

receiving a data rate signal indicative of a data rate of said data bits and wherein said step of determining positions is responsive to said data rate signal; and

providing said data bits in said determined position within each data frame.

34. In a system in which data bits are transmitted in data frames of a predetermined time duration, a system for the positioning of data within said data frames for transmission comprising:

a data randomizer circuit for determining the position of said data bits within each data frame according to a pseudorandom code and having an output for providing a positioning signal indicative of said position of said data bits within each data frame; and

a data source having input coupled to said data burst randomizer output for providing said data bits in accordance with said positioning signal wherein transmission of said data bits provided by said data source is time-gated based upon said positioning signal.

35. In a system in which data bits are transmitted in data frames of a predetermined time duration wherein each of said data frames comprises a set of distinct time slots of a duration equal to the duration of a predetermined number of said data bits and wherein said data bits are grouped into control groups of said predetermined number, a system for the positioning of data within said data frames for transmission comprising:

a data randomizer circuit for determining the position of said data bits within each data frame according to a pseudorandom code and having an output for providing a positioning signal indicative of said position of said data bits within each data frame wherein said data burst randomizer determines slot positions in said data frames for each of said control groups; and

a data source having an input coupled to said data burst randomizer output for providing said data bits in accordance with said positioning signal wherein said data source provides said control groups into said slots in accordance with said positioning signal.

36. In a system in which data bits are transmitted in data frames of a predetermined time duration, a system for the positioning of data within said data frames for transmission comprising:

a data randomizer circuit for determining the position of said data bits within each data frame according to a pseudorandom code and having an output for providing a positioning signal indicative of said position of said data bits within each data frame wherein said data burst randomizer is responsive to a data rate signal in determining said data bit positions; and

a data source having an input coupled to said data burst randomizer output for providing said data bits in accordance with said positioning signal.

37. In a system in which data bits are transmitted in data frames of a predetermined time duration and wherein repetition frames comprise a first version of said data bits and repeated versions of said data bits, a system for the positioning of said data bits within said data frames for transmission comprising:

means for determining positions of said data bits within each data frame according to a pseudorandom code;

filtering means for receiving said repetition frames and filtering out ones of said first version of said data bits and said repeated versions of said data bits in accordance with said determined position of said data bits thereby producing output frames; and

wherein transmission of said output frames is time-gated based upon said determined position of said data bits.

38. In a system in which data bits are transmitted in data frames of a predetermined time duration and wherein repetition frames comprise a first version of said data bits and repeated versions of said data bits, wherein each of said repetition frames comprise a set of time slots of a duration equal to the duration of a predetermined number of said data bits and wherein said data bits are grouped into control groups and of said predetermined number and wherein said control groups are repeated within said repetition frame, a system for the positioning of said data bits within said data frames for transmission comprising:

means for determining positions of said data bits within each data frame according to a pseudorandom code wherein said means for determining positions determines transmission slot positions for said data frames for each of said control groups;

filtering means for receiving said repetition frames and filtering out ones of said first version of said data bits and said repeated versions of said data bits and said repeated versions of said data bits in accordance with said determined position of said data bits wherein said filtering means removes said control groups from said repetition frames except those in said determined slots.

39. In a system in which data bits are transmitted in data frames of a predetermined time duration and wherein repetition frames comprise a first version of said data bits and repeated versions of said data bits, a system for the positioning of said data bits within said data frames for transmission comprising:

means for determining positions of said data bits within each data frame according to a pseudorandom code wherein said means for determining positions is responsive to a data rate signal in determining said data bit positions;

filtering means for receiving said repetition frames and filtering out ones of said first version of said data bits and said repeated versions of said data bits and said repeated versions of said data bits in accordance with said determined position of said data bits.

40. A method for converting an input frame of data into an output frame of data of a predetermined time duration for transmission, said input frame of data being comprised of a first version of data bits and repeated versions of said data bits, said method comprising the steps of:

determining a position of said first version and said repeated versions of said data bits within said output frame of data according to a pseudorandom code; and

filtering ones of said first version and said repeated versions of said data bits in said input frame of data in accordance with predetermined filter coefficients to provide said output frame of data.

41. The system of claim 40 wherein each of said input frame comprises a set of time slots of a duration equal to the duration of a predetermined number of said data bits and wherein said data bits are grouped into control groups and of said predetermined number and wherein said control groups are repeated within said repetition frame and wherein said step of determining positions determines slot positions for said data frames for each of said control groups and wherein said step of filtering removes said control groups from said repetition frames except those in said determined slots.

42. The system of claim 40 wherein said step of determining positions is responsive to a data rate signal in determining said data bit positions.

43. In a system in which data bits are transmitted in data frames of a predetermined time duration in re repetition frames wherein said repetition frames comprise a first version of said data bits and repeated versions of said data bits, a method for generating said data frames for transmission comprising the steps of:

a data randomizer circuit for determining a positioning signal indicative of the position of said data bits within each data frame according to a pseudorandom code, said data randomizer circuit having an output for providing said positioning signal; and

a filter having a first input coupled to said data burst randomizer output and having a second input for receiving said repetition frames and having an output for providing said data frames.

44. The system of claim 43 wherein each of said repetition frames comprise a set of time slots of a duration equal to the duration of a predetermined number of said data bits and wherein said data bits are grouped into control groups and of said predetermined number and wherein said control groups are repeated within said repetition frame and wherein said data burst randomizer determines transmission slot positions for said data frames for each of said control groups and wherein said filter removes said control groups from said repetition frames except those in said determined slots.

45. The system of claim 43 wherein said data burst randomizer is responsive to a data rate signal in determining said data bit positions.

46. A method for generating an output frame of data for transmission, said method comprising the steps of:

receiving an input frame of data comprised of a predetermined sequence of a first version of data bits and N repeated versions of said data bits;

determining from a pseudo random code ones of said first version and N repeated versions for inclusion in said output frame of data; and

filtering said input frame of data within predetermined filter coefficients, said filtering eliminating ones of other than said determined ones of said first version and N repeated versions in said output frame.

47. The system of claim 46 wherein each of said input frame comprises a set of time slots of a duration equal to the duration of a predetermined number of said data bits and wherein said data bits are grouped into control groups and of said predetermined number and wherein said control groups are repeated within said repetition frame and wherein said step of determining determines slot positions for said data frames for each of said control groups and wherein said step of filtering removes said control groups from said repetition frames except those in said determined slots.

48. The system of claim 46 wherein said step of determining is responsive to a data rate signal in selecting said data for inclusion in said output frame.