Method and apparatus for multiple access over a communication channel

Abstract

A communication technique based on direct sequence spread spectrum signaling employs, for all users sharing an access channel, a single spreading code that has a duration sufficiently longer than the symbol length that the likelihood of confusion between users is minimized if not eliminated. The length of the spreading code is sufficiently long that contention events can occur only when two bursts occur at the receiver within one chip time of one another.

Description

STATEMENT AS TO RIGHTS TO INVENTIONS MADE UNDER FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

NOT APPLICABLE

REFERENCE TO A “SEQUENCE LISTING,” A TABLE, OR A COMPUTER PROGRAM LISTING APPENDIX SUBMITTED ON A COMPACT DISK

NOT APPLICABLE

BACKGROUND OF THE INVENTION

The present invention relates generally to communication techniques and in particular to a spread spectrum communication technique over a shared asynchronous channel of a communication network.

A spread spectrum communication system is a system in which the transmitted signal is “spread” over a wide range of frequencies. Typically the bandwidth is much wider than the minimum bandwidth needed to transmit the information being sent. The underlying premise of this technique is that, in channels (typically wireless) with narrowband noise, an increase in the transmitted signal bandwidth produces a corresponding increase in the probability that the received information will be correct.

Though inefficient in its use of bandwidth, an advantage of spread spectrum is its resistance to interference. Another advantage is that the technique can be combined with existing systems having narrower operating bandwidths that fall within the spread spectrum bandwidth. The presence of a spread spectrum signal only slightly increases the noise floor that the narrow band receivers see.

Various spread spectrum techniques are known: In a frequency hopping system, the carrier frequency of the transmitter changes from among a pre-selected set of carrier frequencies in accordance with a pseudo-random code sequence. The frequencies selected from the list are dictated by the codes in the sequence. In a time hopping system, the period and duty cycle of the pulsed radio frequency (“RF”) carrier are varied in a pseudo-random manner in accordance with the pseudo-random code sequence. In a pulsed frequency modulated (“FM”) system, the RF carrier is modulated with a fixed period and fixed duty cycle sequence. During the transmission of each pulse, the carrier frequency is frequency modulated. Hybrid systems incorporate aspects of two or more other systems.

Direct sequence (“DS”) spread spectrum is a well known technique for transmitting digital data. The name direct sequence derives from the fact that the data sequence is directly multiplied by a high rate spreading sequence before it is transmitted over the channel. The spreading sequence is a sequence that transitions much faster than the data sequence. Instead of being called bits as in the data sequence, the individual states of the spreading sequence are called chips. The ratio of the chip rate to the data rate is commonly known as the spreading gain (or processing gain), since it is the ratio by which the bandwidth of the data sequence is increased once it is multiplied by the spreading sequence.

Refer to FIG. 1 for an illustration of the operation of direct sequence signaling. The figure shows a time domain representation of a case in which the chip rate of spreading sequence signal C is four times the rate of the data sequence D; i.e.

$\frac{1}{t_C}=4\times \frac{1}{t_D}.$ The resulting spread signal S is the product of the two sequences. When the data bit in D is in a first logic state, signal S follows the spreading sequence C and when the data bit in D is in second logic state, signal S is the complement of C. The spreading sequence signal shown in FIG. 1 does not repeat. In practice though, many conventional direct sequence spread spectrum techniques employ a spreading code that repeats once per data bit. Code representation 100 is the notational convention used in the disclosure of the present invention to represent a spreading sequence in explaining the operation of the invention. The top half of representation 100 contains an identifier for the code, in this case “Code C.” The bottom half of representation 100 indicates the various chips in the spreading sequence and identifies them by number.

These spreading sequences are generally referred to as codes, as in Code Division Multiple Access (“CDMA”). CDMA generally refers to a technique by which users are allocated different spreading codes to enable them to use the same channel without interfering with each other. Another technique, dubbed Spread ALOHA CDMA (“SA/CDMA”), uses a single maximal length code (or a small number of maximal length codes for different service classes) that repeats once per data symbol and relies on arrival time to separate the different incoming signals. A maximal length code is a code of length 2^M−1, where M is an integer, and which has certain desirable autocorrelation properties. For more information on maximal length codes, refer to Pateros, Charles N., “An Adaptive Correlator Receiver for Spread Spectrum Communication,” Ph. D. Thesis, Rensselaer Polytechnic Institute, Troy, N.Y., 1993.

Various code spreading strategies are known: In U.S. Pat. No. 5,084,900 to Taylor, the technique described uses a slotted Aloha CDMA system, where each packet uses the same code for the first transmission. When a collision occurs on the first packet, the packet is retransmitted using randomly selected codes from a known pool of codes. No particular code type or relationship of code length to symbol interval is specified.

In U.S. Pat. No. 5,450,395, Hostetter et al. describe a single code system where data bit length codes are used and each user always transmits a data ‘one’. The data is encoded in the time position of each broadcast. The technique requires accurate time synchronization among all of the users.

In U.S. Pat. No. 5,537,397, Abramson describes a spread ALOHA CDMA technique in which multiple users employ the same spreading code. The code is a maximal length code that repeats once per symbol. The users are time aligned at the chip level, but asynchronous at the data bit level. A subtractive multi-user receiver for this application is also described. In U.S. Pat. No. 5,745,485, Abramson extends his '397 patent to allow multiple codes to support different traffic types on the same channel.

Dankberg, et al. describe, in U.S. Pat. No. 5,596,439, a technique for self-interference cancellation for a relay channel. The technique is referred to as Paired Carrier Multiple Access (“PCMA”), since it allows a pair of channels (one in each direction) to share the same relay channel.

In U.S. Pat. No. 5,761,196, Ayerst, et al. describe a CDMA system employing re-use of spreading sequences. A central controller distributes seeds for maximal length codes as needed by users.

What is needed is a communication method which improves upon the multiple access collision performance of the prior art communication techniques. What is needed is a system which can realize improved performance over prior art CDMA communication systems without further complication to the system.

SUMMARY

According to the invention, a communication technique based on direct sequence spread spectrum signaling employs, for all users sharing an access channel, a single spreading code that has a duration sufficiently longer than the symbol length that the likelihood of confusion between users is minimized if not eliminated. The length of the spreading code is sufficiently long that the probability of collision is a function of chip period and not the spreading gain. Called Code Reuse Multiple Access (“CRMA”), the method is a novel and non-obvious extension of the Code Division Multiple Access (“CDMA”) and Spread ALOHA CDMA (“SA/CDMA”) multiple access techniques.

In accordance with the invention, a single spreading code, or at most a small number of spreading codes relative to the number of simultaneous transmitters is provided. In one embodiment, the length of the spreading code is substantially longer than the length of a data symbol such that there is minimal likelihood of interference or collision between. In another embodiment, then the spreading code does not repeat during modulation of the data sequence. To minimize the acquisition implementation complexity of the system, shortened codes are used in the preamble portion of a data burst. In one embodiment, the preamble is spread by using a code that repeats one or more times.

Further in accordance with the invention, the coding technique can be combined with a Paired Carrier Multiple Access (“PCMA”) system. This combination provides a reverse channel without having to allocate an additional operating frequency range or having to provide a separate link.

Still further in accordance with the invention, a multi-user receiver structure efficiently processes a multitude of received signals by centralizing the header acquisition process. A header acquisition component tuned to a spreading code acquires received data bursts. A pool of demodulation components is provided. An individual user data transmission is then fed to a selected one of the demodulation components to process the data portion of the received data burst.

The present invention presents many advantages over prior art systems. The invention exhibits improved multiple access collision performance as compared to SA/CDMA systems. The improved performance is achieved without adding to the complexity of standard CDMA systems. Moreover, the invention further reduces system complexity by eliminating some of the limitations of SA/CDMA, since the spreading codes of the present invention are not required to be maximal length codes of data symbol length.

The invention will be better understood by reference to the following detailed description and accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram demonstrating the operation of direct sequence spread spectrum signaling.

FIG. 2 a is a diagram illustrating the code reuse multiple access (“CRMA”) channel.

FIG. 2 b is an alternate embodiment illustrating the CRMA technique in conjunction with a paired channel multiple access (“PCMA”) system.

FIG. 3 is a diagram illustrating the operation of a standard multiple access channel.

FIG. 4 is a diagram illustrating the operation of a Spread ALOHA/Code Division Multiple Access (“SA/CDMA”) channel.

FIG. 5 is a diagram illustrating the operation of a CRMA channel according to the invention.

FIG. 6 is a diagram detailing a collision event in a SA/CDMA channel.

FIG. 7 is a diagram detailing the collision avoidance properties of CRMA.

FIG. 8 is a diagram illustrating a spreading code that does not repeat during the burst preamble.

FIG. 9 is a diagram illustrating the process of splitting a preamble spreading code into two shorter codes that repeat during the burst preamble.

FIG. 10 is a diagram illustrating the process of splitting a preamble code into four shorter codes that repeat during the preamble.

FIG. 11 is a schematic representation of a multi-user receiver in accordance with the present invention.

FIG. 12 is a schematic representation showing the basic components of a transmitting station in accordance with the invention.

DESCRIPTION OF SPECIFIC EMBODIMENTS

FIG. 2 a shows a typical environment in which the present invention operates. As shown in the figure, a large number of users 1, 2, . . . N broadcast to a common multi-user receiver 200. The receiver demodulates all of the signals S₁, S₂, . . . S_N received on the single multiple access channel 210, it being understood that each signal S_X occupies the same frequency range as the other signals. A property of this environment is that there is no synchronized coordination among the users and no time synchronization between each user 1, 2 . . . N and the receiver 200. Each user transmits independently of the other and asynchronously, in bursts based on its offered traffic. Consequently, there will be inevitable periods of time when two or more users are transmitting their signals to the receiver 200 simultaneously.

Refer now to the traffic model of FIG. 3 which illustrates a typical pattern of transmission activity on a standard multiple access channel. The signals from the various users are active when that user is transmitting data. In the figure, User 2 is the first to transmit a burst 302. User 1 then transmits a burst 304 during the last half of the transmission of User 2's burst 302, and so on. In a standard channel, there is no way to separate the transmissions at the receiver, so any transmissions that overlap in time will be lost. The scenario depicted in FIG. 3 shows an especially congested traffic pattern. Bursts 302 and 304 overlap and so receiver 200 will not be able to separate the overlapping transmissions. Burst 306 overlaps initially with burst 308 from User 1 and then with burst 310 from User 2. The occurrence of two or more transmissions arriving such that they cannot be resolved is referred to as a “multiple access collision,” or simply collision. In the scenario shown in FIG. 3, only the single transmission 320 received during the time period t₃ is received free of interference; it is the only transmission that is received successfully.

In Code Division Multiple Access (“CDMA”), each user is provided with a unique spreading code so that the bursts from different users can be more easily resolved. This requires a large number of codes. More significantly, the technique requires that each user have a corresponding receiver at the base station tied to that spreading sequence. This translates to a base station that is complex and costly to implement and maintain, since each user-assigned spreading code must have its own dedicated receiver hardware/firmware at the base station.

As discussed in U.S. Pat. No. 5,537,397 (“SA/CDMA”), the multiple access capability of a spread spectrum channel is not derived by the use of different spreading codes by each transmitter, but by the nature of the direct sequence spread spectrum signal itself. For minimum complexity, therefore, a single code system is ideal. U.S. Pat. No. 5,745,485 argues that different codes for different traffic types may be worth the extra complexity in the receiver in order to simplify the total system complexity. It should be noted here that the SA/CDMA systems as described in the referenced patents all use spreading sequences that have a period equal to the symbol period of the transmitted data. That is, the spreading sequence repeats in the same amount of time spanned by a data bit. As well, SA/CDMA utilizes maximal length spreading sequences, which have desirable properties, but are not required for multiple access.

Consider the prior art techniques wherein the spreading code repeats once per data symbol. Each time the code repeats, there is a potential collision with another user who starts transmitting within one chip period of this time. A collision, therefore, is the event when two transmitters use the same spreading sequence and each begins transmitting its data burst within a time span of 1 chip period of the other. The resulting interference of the collision makes both signals unusable to the receiver, so the data sent by both transmitters is lost. As U.S. Pat. No. 5,537,397 shows, the throughput of such a system is a function of the spreading gain, the number of spreading sequence chips per data symbol.

For the purpose of the invention, a unique notation was developed to facilitate the explanation and understanding of the features of the invention. Referring to FIG. 4, for example, each data burst is represented by a series of vertical lines. Each vertical line represents the beginning of the spreading code as it is being applied to (modulated onto) the data sequence comprising the data burst. Hence, each vertical line represents the modulation of one or more data symbols (data bits, where the transmitted information is binary data) by the spreading code. The number of data symbols modulated depends on the bit rate, the chip rate, and the number of chips comprising the spreading code. For example, given a symbol (bit) rate of five symbols (bits) per second and a 200-chip spreading sequence at a chip rate of 40 chips per second, 25 symbols (bits) are modulated in one cycle of the spreading sequence. Thus for a 100 symbol data sequence, the spreading sequence will repeat four times during modulation of the data sequence; the data sequence spans a total time of 20 seconds and the spreading sequence spans a time period of five seconds.

Refer again to the traffic model shown FIG. 3 and to the diagrams of FIGS. 4 and 6. As mentioned before, multiple access collisions can occur every time the spreading sequence repeats. FIG. 4 shows the traffic pattern depicted in FIG. 3 in an SA/CDMA channel, illustrating the operation of collision avoidance. Recall that under SA/CDMA, the spreading code repeats at a rate equal to the data rate, i.e., the code repeats for every data bit.

Consider the traffic pattern of FIG. 3. At time t_x a data burst from user N (signal S_N-A) is transmitted. At time t_x+1, a data burst from user 2 (signal S_2-A) is transmitted. A collision between signal S_2-A and signal S_N-A occurs, since their spreading codes align within one chip interval at the time indicated by 402.

The reason for the occurrence of this collision is explained with reference to FIG. 6. Code A is used for the multiple access on the channel. User 2-A, transmitting signal S_2-A, begins his broadcast at the time indicated by 402. This occurs one data bit after User N-A, who broadcasts signal S_N-A. The first chip of the respective spreading codes aligns. Consequently, both transmissions are lost during the overlap because they cannot be resolved by the receiver into separate transmissions.

It has been discovered that the multiple access contention performance of the system can be improved by allowing the spreading code sequence length to be longer than the data symbol length. In one embodiment of the invention built upon this discovery, the spreading code sequence is longer than the length (i.e., number of bits) of the data sequence to be transmitted in a single data burst. It was discovered that the number of potential collisions decreases dramatically by this technique. In addition, the complexity needed to provide for chip and bit timing coordination is removed. Another advantage of the invention is that different users can transmit with different data rates simultaneously.

This collision reduction property is clearly demonstrated in FIG. 5 using the unique notational convention described above. FIG. 5 is also based on the traffic model of FIG. 3. According to one embodiment of the invention, a long code is used which does not repeat during the length of the data bursts. Consequently, each burst in FIG. 5 is represented by only one line. There is only one possible collision event per burst, greatly decreasing the collision probability. As can be seen in FIG. 5, for the traffic pattern of FIG. 3 no collisions occur.

Referring to FIG. 7, the figure details the same event that caused a collision for the SA/CDMA system in FIG. 6. Code B, which does not repeat during the length of the burst, is used for multiple access in this CRMA channel. Here, at the time indicated by reference numeral 703, the two broadcasts S_2-B and S_N-B are separated by exactly one data bit time, as in FIG. 6. However, since Code B does not repeat for the duration of the data burst, there is no collision.

In accordance with an embodiment of the invention, the length of the spreading code is longer than the length of a data symbol. Length refers to a span of time. Hence, the length of the spreading code refers to the length of time spanned by the code. For a spreading code, this depends on the number of chips in the code and the chip rate of the code. Similarly, the length of a data symbol is simply the inverse of the data rate. For example, a 10 bits/second data rate translates to a data symbol whose time length is 100 milliseconds. In addition, as will be discussed shortly, one can speak of the length of a spreading code in terms of its spreading gain g which is the ratio of the chip rate to the data rate.

In an embodiment of the invention, spreading codes are selected that are much longer than a data symbol. Thus, the spreading code can have a length that exceeds the length of the longest data sequence. For example, a data sequence of 100 bits at 10 bits/second data rate would have a length of 10 seconds. In accordance with an embodiment of the invention, the spreading code would span period of time greater than 10 seconds long. Expressed in terms of spreading gain g, a spreading code having a 10 second period would comprise (100×g) chips. In this case, there would be only one possible contention event per burst. Only if two transmitters started their bursts within one chip time of each other would a contention collision occur. Note that the collision probability is only a function of the chip period (not the spreading gain) and the burst transmission rate.

Generation of long spreading codes is a straightforward process. Well understood pseudo-random number generation techniques are known for producing spreading sequences (codes). Similarly, it is a simple matter to provide logic which breaks up the long spreading codes into segments of lengths appropriate for the modulation of a data sequence in preparation for transmission, and for the subsequent demodulation of a received data burst.

It is noted the invention is advantageous in that a transmitter can receive data for transmission at a rate different from another transmitter. Consequently, the spreading gain of one transmitter can be different from the spreading gain of another transmitter.

Referring for a moment to FIG. 12, an embodiment of a transmitter according to the invention includes a data source to provide data sequences for transmission. The data sequence feeds into a combining component 1202 which produces the spread sequence for transmission. The combining component preferably includes a digital signal processor (“DSP”) 1212 in communication with a memory 1214. DSP firmware is provided to perform the spreading operations. Among other things, memory 1214 contains the spreading code(s) to be combined with an incoming data sequence by DSP 1212. As will be explained further below, memory 1214 also contains the spreading code(s) used to spread the data preamble for the preamble portion of transmitted data burst. Combining component 1202 feeds the spread signal to a conventional transmission component 1204 for subsequent transmission.

An impact that must be considered are the ramifications of using the long code scheme of the present invention in connection with the burst acquisition complexity. At the beginning of each broadcast burst, a known data preamble is transmitted to allow the receiver to acquire the transmitted signal. Typically this involves correlating the incoming signal with a stored copy of the spread header. For the case of a spreading sequence that is only the length of the data bit, the correlator need only be as long as the data bit. For longer codes, the correlator has to be as long as the shorter of the spreading code length or the header length. Complexity in the correlator component is an issue because the multiply and add operations of the correlator must run at the chip rate, rather than at the much slower data symbol rate. Once the signal is acquired, the downstream demodulation of the data portion of the data burst occurs at the data symbol rate. Hence, the data portion of a burst can be spread using much longer codes without degrading system performance during demodulation at the receiving end.

To address the complexity of the acquisition component, two strategies are provided in accordance with the invention. First, we can minimize the effective length of the spreading sequence in connection with the preamble portion of the data burst. Two techniques for accomplishing this are provided by the invention.

FIG. 8 illustrates the first technique. Where the spreading code, Code C, is longer than the preamble, the code is truncated to a length to fit the period of time spanned by the data sequence comprising the preamble. Note that though the entire length of the spreading code may be longer than the preamble, it can be considered to be the length of the preamble for acquisition purposes. If this code requires a preamble detector that is too complex to implement, then shorter codes can be used that repeat during the preamble. This is the second technique, namely, repeating segments of the spreading sequence during the preamble. It is noted that this second technique has the effect of increasing the collision probability, thus presenting a design trade-off decision to the system designer. However, another aspect of the invention permits shorter codes to be used, while keeping the collision probability the same. The discussion now turns to additional embodiments of the invention.

In the embodiment shown in FIG. 9, two codes are employed, Code D and Code E. One half of the transmitters use Code D to spread its preamble data sequence and the half of the transmitters use Code E. Each code is half the length of the preamble and repeats once during modulation of the preamble. Each time the code repeats, a multiple access collision can occur among the transmitters using Code D; likewise with the Code E transmitters. However, since only half of the channel users will be using either Code D or Code E, the collision probability is the same as if all users were using a single, long code. Note that all users could use the same code, Code D. This would result in a simpler system that had a larger probability of collision compared to a system employing Code C.

To further lower the correlation overhead in the acquisition circuitry, this process is further extended in FIG. 10. Here, four codes, Code F, Code G, Code H and Code I, are utilized by four groups of transmitters. Each code repeats four times during modulation of the preamble, so the four codes are each allocated to one fourth of the users. Hence by splitting the preamble spreading code in this fashion, per the invention, the complexity in the acquisition circuitry is greatly reduced without affecting the collision performance. Here, the use of one, two or three codes would simplify the acquisition system while again increasing the collision probability compared to a system using a longer code.

The spreading code used for spreading the preamble data sequence can be simply a portion of the spreading code used to spread the data sequence of the data portion of the burst. More generally, the spreading code for the preamble does not have to be derived from the spreading code for the data portion. In an embodiment of the invention, more than one spreading code is used for spreading preambles, while an identical longer code is used to spread the data sequence of the data burst. In yet another embodiment of the invention, more than one spreading code is used for spreading preambles, while two or more identical longer codes are used to spread the data sequences of data bursts from multiple transmitters.

The preamble is always shorter than the burst, and is often a very small fraction of the burst. Thus, the multiple access collision performance of the system may be adequate even if there is only one spreading code used for the burst preambles, and even if that code repeats many times during the preamble interval. The performance enhancement comes about by the use of the longer code used for the data portion of the data bursts.

In still yet another embodiment, one may consider the bandwidth of the single carrier multiple access channel. If the channel bandwidth far exceeds the bandwidth required of the highest spreading chip rate, then the channel may be divided into multiple narrower sub-channels. The sub-channels may be of equal or unequal bandwidth, depending on the bandwidth requirements of the different spreading codes. Thus, where lower complexity transmitters are desired, this embodiment realizes greater utilization of a given multiple access carrier channel by allowing for lower chip rates.

FIG. 11 shows a receiver 1100 configured in accordance with the invention. The receiver represents the second strategy to address the acquisition complexity issue. The embodiment of receiver 1100 shown in FIG. 11 uses a preamble detector module (typically implemented as a correlator) that hands off the demodulation to a pool of demodulators.

Receiver 1100 includes an antenna 1102 for receiving a beam bearing a signal. The antenna feeds the signal to an analog-to-digital (a/d) front end 1102. The a/d front end is coupled to a preamble detection component 1106. A demodulation controller component 1108 selectively activates a pool of demodulation units 1110. The demodulation units feed into a data handling system 1112.

In operation, an incoming signal is received by an antenna 1110 and is processed by a/d front end 1102. The front-end digitizes the signal to produce a stream of samples. The samples are placed on a digital sample bus 1134. The sample bus makes the samples available to preamble detection component 1106 and to the demodulation units in demodulator pool 1110.

The preamble detection component receives the sample stream, and using the same data preamble and preamble spreading code as in the transmitters, determines the timing, phase and frequency offsets of transmission preambles in the received signal. This detection data is placed on a control bus 1136.

In an alternate embodiment, transmitters are divided into two or more groups. Each group having a preamble spreading code (or codes) assigned to it where each transmitter in a group uses its assigned spreading code to spread the preamble. At the receiver end, additional preamble detectors 1120 are provided, one for each spreading code that is used. The output of a/d front end 1104 feeds into each of the additional preamble detection components 1120.

When a burst is detected by preamble detection component 1106, demodulation controller 1108 is activated by appropriate signaling over control line 1132. The demodulation controller selects an idle demodulator from pool 1110. The selected demodulator picks up the corresponding detection data from sample bus 1134 and utilizes it to process the data portion of the burst. After demodulation, the demodulator forwards the demodulated data to data handling system 1112 over signal bus 1138. Once the burst is over, the demodulator informs demodulation controller 1108. The demodulator is placed back into the pool of available demodulators 1110. The number of demodulators in pool 1110 is a function of the maximum number of simultaneous transmitters that are allowed on the channel. This number is typically determined by the number of simultaneous transmissions that can occur on the channel without compromising the ability of the receiver to detect all the transmitters.

Referring to FIG. 2b, in another embodiment of the present invention, the inventive code reuse scheme is combined with a PCMA technique. This communication technique is explained, for example, in U.S. Pat. No. 5,596,439, which is fully incorporated herein for all purposes. In this embodiment, a base station 220 is the hub to which a number of users are connected. The forward channel is a high powered signal 222 that is broadcast from the hub to all the users 230. The reverse channel 232 (backchannel), from the users back to the hub, is a CRMA channel configured according to the present invention. By using PCMA, hub 220 can broadcast data (as well as control messages) to users 230 in the same frequency band as the multiple access reverse channels. By employing PCMA, the hub can remove its own transmitted signal from its received signal and then detect all the CRMA users accordingly as disclosed above.

The unique combination of a PCMA technique and the inventive code reuse technique permits data exchange in both directions between a base station and its associated transmitters. Conventionally, the back-channel is provided by a landline connection or by a wireless method that uses a different frequency range. An advantage of this unique combination is that the back-channel is obtained practically for free. The back-channel can contain controlling information sent to the hub. The hub can be an Internet service provider (ISP) where the downlink is the PCMA channel and user inputs are transmitted by the CRMA channel of the invention.

The invention has been explained with reference to specific embodiments. Other embodiments will be evident to those of ordinary skill in the art in light of this disclosure. Therefore, it is not intended that this invention be limited, except as indicated by the appended claims.

Claims

1. A method for spreading a repeating preamble spreading code for a preamble of a data sequence of a data burst, the method comprising: partitioning a plurality of transmitters into a plurality of transmitter groups;associating each of the plurality of transmitter groups with a different unique preamble spreading code among a plurality of preamble spreading codes, wherein: each of the different unique preamble spreading codes has a non-repeating length equal to a fraction of an entire length of the preamble data sequence,the non-repeating length is the same for all of the preamble spreading codes,each of the preamble spreading codes has a different non-repeating code sequence,the plurality of preamble spreading codes is equal in number to the entire length of the preamble data sequence divided by the non-repeating length of the preamble spreading codes, andthe plurality of transmitter groups is equal in number to the number of preamble spreading codes;for each of the plurality of transmitter groups: spreading the preamble data sequence with the different unique preamble spreading code associated with said transmitter group to generate a uniquely coded preamble data sequence; andtransmitting its uniquely coded preamble data sequence to at least one receiver.

2. The method of claim 1, wherein partitioning the plurality of transmitters comprises assigning a number of transmitters into predetermined groups by a processor.

3. The method of claim 1, wherein partitioning the plurality of transmitters comprises randomly assigning transmitters into the transmitter groups by a processor.

4. The method of claim 1, wherein partitioning the plurality of transmitters comprises the transmitters dividing themselves into the transmitter groups.

5. The method of claim 1, wherein the data preamble sequence comprises a constant repeating sequence.

6. The method of claim 1, further comprising: spreading a data sequence of the data burst using a data sequence spreading code; andfor each of the plurality of transmitters, transmitting to the number of users the coded data sequence after transmitting its respective uniquely coded preamble data sequence.

7. The method of claim 1, further comprising: spreading a data sequence of the data burst using one data sequence spreading code from a plurality of data sequence spreading codes; andfor each of the plurality of transmitters, transmitting to the number of users the coded data sequence after transmitting its respective uniquely coded preamble data sequence.

8. The method of claim 1, wherein partitioning the plurality of transmitters into the plurality of transmitter groups is based on managing a collision probability between a plurality of transmissions of the uniquely coded preamble data sequence among each of the plurality of transmitter groups.

9. A system for spreading a repeating preamble spreading code for a preamble of a data sequence of a data burst, the system comprising: a plurality of transmitters configured to be partitioned into a plurality of transmitter groups;a memory comprising a plurality of different unique preamble spreading codes, wherein: each of the different unique preamble spreading codes has a non-repeating length equal to a fraction of an entire length of the preamble data sequence,the non-repeating length is the same for all of the preamble spreading codes,each of the preamble spreading codes has a different non-repeating code sequence,the plurality of preamble spreading codes is equal in number to the entire length of the preamble data sequence divided by the non-repeating length of the preamble spreading codes, andthe plurality of transmitter groups is equal in number to the number of preamble spreading codes;a processor configured to associate each of the plurality of transmitter groups with a different unique preamble spreading code among the plurality of preamble spreading codes;at least one encoder for each of the plurality of transmitter groups configured to spread the preamble data sequence with the different unique preamble spreading code associated with said transmitter group to generate a uniquely coded preamble data sequence; andwherein the plurality of transmitter groups are configured to transmit its uniquely coded preamble data sequence to at least one receiver.

10. The system of claim 9, further comprising: at least one receiver configured to receive at least one of the uniquely coded preamble data sequences, the at least one receiver comprising a preamble detection module.

11. The system of claim 10, wherein the preamble detection module is configured to detect at least one of the preamble codes encoded into any of the uniquely coded preamble data sequences from the plurality of transmitter groups.

12. The system of claim 11, wherein the at least one receiver further comprises at least one demodulator coupled to the preamble detection module and is configured to demodulate a received uniquely coded preamble data sequence.

13. The system of claim 11, wherein the at least one receiver further comprises: a plurality of demodulators coupled to the preamble detection module; anda demodulation controller coupled to the preamble detection module and the plurality of demodulators, the demodulation controller being configured to: identify which of the plurality of demodulators is idle;instruct one of the idle demodulators to demodulate a received uniquely coded preamble data sequence; andplace any of the plurality of demodulators back into a pool of available demodulators once said demodulator has finished demodulating.

14. The system of claim 13, wherein the plurality of demodulators is equal in number to a number of simultaneous transmissions that can occur on a channel without compromising an ability of the at least one receiver to detect all of the plurality of transmitters.

15. A transmitter for spreading a repeating preamble spreading code for a preamble of a data sequence of a data burst, the transmitter comprising: a memory comprising at least one of a plurality of preamble spreading codes, wherein: the at least one of the plurality of preamble codes has a non-repeating length equal to a fraction of an entire length of the preamble data sequence,the non-repeating length is the same for all of the preamble codes,each of the plurality of preamble spreading codes has a different non-repeating code sequence, andthe plurality of preamble spreading codes is equal in number to the entire length of the preamble data sequence divided by the non-repeating length of the preamble spreading codes;at least one encoder configured to spread the preamble data sequence with the preamble spreading code associated with said transmitter to generate a uniquely coded preamble data sequence; andat least one antenna configured to transmit the uniquely coded preamble data sequence to at least one receiver.

16. A receiver for receiving a repeating preamble spreading code for a preamble of a data sequence of a data burst, the receiver comprising: at least one memory comprising at least one of a plurality of preamble spreading codes, wherein: the at least one of the plurality of preamble spreading codes has a non-repeating length equal to a fraction of an entire length of the preamble data sequence,the non-repeating length is the same for all of the preamble spreading codes,each of the plurality of preamble spreading codes has a different non-repeating code sequence, andthe plurality of preamble spreading codes is equal in number to the entire length of the preamble data sequence divided by the non-repeating length of the preamble spreading codes;at least one antenna configured to receive at least one uniquely coded preamble data sequence from a transmitter; andat least one preamble detection module configured to detect the uniquely coded preamble data sequence from the transmitter according to the at least one preamble code in the memory, the uniquely coded preamble data sequence generated by spreading the preamble data sequence with the different unique preamble spreading code associated with the transmitter.

17. The receiver of claim 16, wherein the preamble detection module includes memory comprising the preamble data sequence, and wherein the uniquely coded preamble data sequence is equal in length to the number of the plurality of preamble spreading codes multiplied by the non-repeating length of the preamble spreading codes.

18. The receiver of claim 17, further comprising at least one demodulator coupled to the preamble detection module and configured to demodulate the received uniquely coded preamble data sequence.

19. The receiver of claim 16, further comprising: a plurality of demodulators coupled to the preamble detection module; anda demodulation controller coupled to the preamble detection module and the plurality of demodulators, the demodulation controller being configured to: determine which of the plurality of demodulators is idle;instruct one of the idle demodulators to demodulate a received uniquely coded preamble data sequence; andplace any of the plurality of demodulators back into a pool of available demodulators once said demodulator has finished demodulating.