Patent US5757767A successfully refreshed from Google Patents.
US5757767A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for joint transmission of multiple data signals in spread spectrum communication systems
Assignee: Qualcomm Inc
•
Filing: 1996-10-29
•
Granted: 1998-05-26
•
Expires: 2016-10-29
Abstract
Abstract A more efficient and less complex structure and method for combining multiple user channels onto a single carrier frequency in spread spectrum communication systems. A single transformation element, such as a fast Hadamard Transformation processor, is used to orthogonally encode and combine a series of subscriber digital data signals in parallel. Portions of the orthogonally encoded and combined data signals are then selected over preselected time intervals to generate a single encoded data signal which is subsequently PN spread, subjected to analog signal processing, and transmitted to system subscribers. This is typically effected by summing digital values in an array of data signal combiners. An exemplary data transformation device uses at least one of a preselected set of orthogonal functions as a controlling pattern for interconnection of the combining elements. Each of the combining elements receives at least two input signals, either data or previously combined data, and produces a combined encoded signal output. The order of combination maps the input data signals into an orthogonal combined signal. Portions of the combined data signals are then selected and transferred in order as a serialized data stream for subsequent spreading and transmission as a communication signal.
Inventors
- 👤 Ephraim Zehavi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 16:19
CPC Classifications
H; H04; H04J; H04J13/00; H04J13/0007; H04J13/004; H04J13/0048; H04B; H04B1/00; H04B1/69; H04B1/707; H04B7/00; H04B7/14; H04B7/15; H04B7/204; H04B7/216; H04J13/10
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
140 words
Apparatus for orthogonally encoding a plurality of digital data signals in a spread spectrum communication system in which information is communicated over orthogonally encoded data signals which are subsequently spectrum spread, comprising: first multiplexing means for receiving a plurality of said digital data signals in parallel and forming them into single a bit-wise serial data stream; second multiplexing means for receiving a plurality of channel gain factors in parallel, each corresponding to a predetermined digital data signal, and forming them into a single bit-wise serial gain stream; and a bit serial Fast Hadamard transformation means connected to receive said bit-wise serial data and gain streams for combining together in a corresponding pairwise fashion and for applying at least one preselected orthogonal function thereto from a plurality of orthogonal functions so as to produce an orthogonally covered gain adjusted data signal.
Claim 2
Dependent Claim
140 words
Apparatus for orthogonally encoding a plurality of digital data signals in a spread spectrum communication system in which information is communicated over orthogonally encoded data signals which are subsequently spectrum spread, comprising: first multiplexing means for receiving a plurality of said digital data signals in parallel and forming them into single a bit-wise serial data stream; second multiplexing means for receiving a plurality of channel gain factors in parallel, each corresponding to a predetermined digital data signal, and forming them into a single bit-wise serial gain stream; and a bit serial Fast Hadamard transformation means connected to receive said bit-wise serial data and gain streams for combining together in a corresponding pairwise fashion and for applying at least one preselected orthogonal function thereto from a plurality of orthogonal functions so as to produce an orthogonally covered gain adjusted data signal.
Claim 3
Dependent Claim
14 words
The apparatus of claim 1 wherein said plurality of orthogonal functions comprise Walsh functions.
Claim 4
Dependent Claim
27 words
The apparatus of claim 1 wherein said plurality of orthogonal functions comprise short orthogonal PN code sequences, with a period less than 2 15 chips in length.
Claim 5
Dependent Claim
29 words
The apparatus of claim 1 further comprising control means coupled to said Fast Hadamard transformation means for generating a transformation structure for use by said Fast Hadamard transformation means.
Claim 6
Dependent Claim
21 words
The apparatus of claim 4 wherein said control means dynamically adjusts said transformation structure in response to data signals being received.
Claim 7
Dependent Claim
28 words
The apparatus of claim 1 wherein said plurality of orthogonal functions comprise short orthogonal PN code sequences with a period on the order of 27 chips in length.
Claim 8
Dependent Claim
43 words
The apparatus of claim 1 further comprising: means for spreading said orthogonally covered gain adjusted data signal using at least one predetermined PN spreading code; and a bit-wise filter bank for removing unwanted frequency components from said orthogonally covered gain adjusted data signal.
Claim 9
Dependent Claim
19 words
The apparatus of claim 7 wherein said bit-wise filter bank comprises a plurality of one bit input FIR filters.
Claim 10
Dependent Claim
35 words
The apparatus of claim 1 further comprising at least one gain adjusting element connected to receive the output from said Fast Hadamard transformation means to perform an additional spreading function for symbol data output therefrom.
Claim 11
Dependent Claim
57 words
The apparatus of claim 9 further comprising: delay means connected to receive an output from said gain adjusting element for delaying a gain adjusted signal by a preselected period on the order of the length of one orthogonal function period; and summation means for adding an output of said gain adjusting element to a delayed version thereof.
Claim 12
Independent Claim
147 words
A method of orthogonally encoding a plurality of digital data signals to be transmitted to system subscribers over separate user channels in a spread spectrum communication system in which information is communicated over orthogonally encoded data signals which are subsequently spectrum spread, comprising the steps of: receiving a plurality of said digital data signals in parallel for active channels, and multiplexing them into single a bit-wise serial data stream; receiving a plurality of channel gain factors in parallel, each corresponding to a predetermined digital data signal, and multiplexing them into a single bit-wise serial gain stream; and receiving and combining together said bit-wise serial data and gain streams in a bit serial Fast Hadamard transformation means, in a corresponding pairwise fashion, and applying at least one preselected orthogonal function thereto from a plurality of orthogonal functions so as to produce an orthogonally covered gain adjusted data signal.
Claim 13
Independent Claim
147 words
A method of orthogonally encoding a plurality of digital data signals to be transmitted to system subscribers over separate user channels in a spread spectrum communication system in which information is communicated over orthogonally encoded data signals which are subsequently spectrum spread, comprising the steps of: receiving a plurality of said digital data signals in parallel for active channels, and multiplexing them into single a bit-wise serial data stream; receiving a plurality of channel gain factors in parallel, each corresponding to a predetermined digital data signal, and multiplexing them into a single bit-wise serial gain stream; and receiving and combining together said bit-wise serial data and gain streams in a bit serial Fast Hadamard transformation means, in a corresponding pairwise fashion, and applying at least one preselected orthogonal function thereto from a plurality of orthogonal functions so as to produce an orthogonally covered gain adjusted data signal.
Claim 14
Dependent Claim
14 words
The method of claim 11 wherein said plurality of orthogonal functions comprise Walsh functions.
Claim 15
Dependent Claim
27 words
The method of claim 11 wherein said plurality of orthogonal functions comprise short orthogonal PN code sequences, with a period less than 2 15 chips in length.
Claim 16
Dependent Claim
29 words
The method of claim 11 wherein said plurality of orthogonal functions comprise short orthogonal PN code sequences, with a period on the order of 2 7 chips in length.
Claim 17
Dependent Claim
44 words
The method of claim 11 further comprising the steps of: spreading said orthogonally covered gain adjusted data signal using at least one predetermined PN spreading code; and removing unwanted frequency components from said orthogonally covered gain adjusted data signal using a bit-wise filter bank.
Claim 18
Dependent Claim
26 words
The method of claim 11 further comprising the step of applying an additional gain adjustment function to symbol data output from said Fast Hadamard transformation means.
Claim 19
Dependent Claim
45 words
The method of claim 16 further comprising the steps of: receiving gain adjusted symbol data and applying a preselected period of delay thereto, on the order of the length of one orthogonal function period; and adding gain adjusted symbol data to a delayed version thereof.
Claim 20
Dependent Claim
28 words
The method of claim 11 further comprising the steps of generating a transformation structure for use by said Fast Hadamard transformation means; and transferring said transformation structure thereto.
Claim 21
Dependent Claim
22 words
The method of claim 18 further comprising the step of dynamically adjusting said transformation structure in response to data signals being received.
References Cited (Backward Citations)
US4901307A
Cited
US4888788A
Cited
US5109390A
Cited
US5101501A
Cited
US5309474A
Cited
US5103459A
Cited
US5103459B1
Cited
US5228056A
Cited
US5166951A
Cited
US5267261A
Cited
US5228054A
Cited
US5550809A
Cited
US5406629A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-05-25 | 2001-11-24 | 2002-05-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-05-25 | 2005-11-24 | 2006-05-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-05-25 | 2009-11-24 | 2010-05-26 | $7700.00 | Window Closed / Lapsed |