CA2281818C - Method to gain access to a base station in a discrete multitone spread spectrum communications system - Google Patents
Method to gain access to a base station in a discrete multitone spread spectrum communications system Download PDFInfo
- Publication number
- CA2281818C CA2281818C CA002281818A CA2281818A CA2281818C CA 2281818 C CA2281818 C CA 2281818C CA 002281818 A CA002281818 A CA 002281818A CA 2281818 A CA2281818 A CA 2281818A CA 2281818 C CA2281818 C CA 2281818C
- Authority
- CA
- Canada
- Prior art keywords
- error detection
- base station
- signal
- error
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0002—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate
- H04L1/0003—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate by switching between different modulation schemes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
Abstract
In a discrete multitone spread spectrum system, a base station distinguishes between normal collisions and noise bursts when receiving access request signals for remote units on a common access channel. The base station is then able to reply to the remote units with information about the quality of the common access channel and why their transmissions where not successful. The remote units then use this information to adapt their retry processes to the channel's quality, depending on whether there was a noise burst, a normal collision, or a successful transmission on the channel.
Description
PCTN~ ~ ~~ 0355?
t:~ ~.~~ ~ P 1998 Gibbons 2-1-1 TITLE THE INVENTION:
"OUT OF CHANNEL CYCLIC REDUNDANCY CODE METHOD FOR A
DISCRETE MULTITONE SPREAD SPECTRUM COMMUNICATIONS
SYSTEM"
Background of the Invention Field of the Invention This invention involves improvements to communications systems and methods in a wireless discrete multitone spread spectrum communications system.
Description of Related A_rt_ Wireless communications systems, such as cellular and personal communications systems, operate over limited spectral bandwidths. They must make highly efficient use of the scarce bandwidth resource to provide good service to a large population of users. Code Division Multiple Access (CDMA) protocol has been used ~W~n ~~
CA U2281818 1999-U8-19 ~~,~~~~, ~ a ~ ~ 3 5 5.7 f ~'~~~.~ 2. ~ S L P 19 98 by wireless communications systems to efficiently make use of limited bandwidths. The protocol uses a unique code to distinguish each user's data signal from other users' data signals. Knowledge of the unique code with which any specific information is transmitted, permits the separation and reconstruction of each user's message at the receiving end of the communication channel.
Adaptive beamforming technology has become a promising technology for wireless service providers to offer large coverage, high capacity, and high quality service. Based on this technology, a wireless communication system can improve its coverage capability, system capacity, and performance significantly.
The personal wireless access network (PWAl~ system described uses adaptive I 5 beamforming combined with a form of the CDMA protocol known as discrete multitone spread spectrum (DMT-SS ) to provide efficient communications between a base station and a plurality of remote units. (The Agee, et al. patent application uses the term "discrete multitone stacked carrier (DMT-SC) to refer to this protocol.) Every effort must be made to avoid loading normal, high priority traffic channels with system management information that has a lower priority. An example of system management information is the characterization of channel quality factors that are not immediately needed to control the realtime operation of the network. What is needed is a way to offload the communication of system management information from high priority traffic channels.
Summary of the Invention The invention disclosed herein is a new method to make the most efficient use of the scarce spectral bandwidth in a wireless discrete multitone spread spectrum communications system. Each remote station and each base station in the network prepares an error detection code, such as a cyclic redundancy code (CRC), on each block of data to be transmitted over the traffic channels. The CRC value computed for a given block of data is a unique mapping of the data block that characterizes the data block. Any change in the data block will result in a different CRC value. Each data block to be sent is numbered with a block number to distinguish it from other data ?~L SHEE:f - l blocks being sent by a sending station. A data message is formed by concatenating the data block with the block number. A CRC value is computed for each data block.
An error detection message is formed by concatenating the CRC value with the block number. The sending station prepares the data message by forming data vectors that will be spread using the discrete multitone spread spectrum (DMT-SS ) protocol to distribute the data message over a plurality of discrete tone frequencies, forming a spread signal for the traffic channel. In accordance with the invention, the sending station prepares the error detection message for transmission over the link control channel of the network. The sending station prepares the error detection message by forming a link control channel vector that will be spread using the discrete multitone spread spectrum (DMT-SS ) protocol to distribute the data message over a plurality of -- discrete tone frequencies, forming a spread signal for the link control channel. A link control channel is associated with communications session using the traffic channels.
Normally, the link control channel carries control information needed by the sending and receiving stations during a session using the trai~c channels. However, its capacity is under-utilized. In accordance with the invention, the instant of transmission of the error detection message is allowed to be different from the instant of transmission of the data message. This permits the error detection messages to be transmitted when capacity is available on the link control channel. The receiving station buffers the error detection messages it receives from the link control channel, so that they are accessible by their block numbers. When the receiving station receives a data message on the traffic channel, it performs a CRC calculation on the data block in the message to obtain a resulting new CRC value. The new CRC value is also buffered at the receiving station with the block number so that it is accessible by its block number.
Then, when both the received error message and the new CRC value are both available at the receiving station, they are matched by their common block number. The received CRC
value in the error detection message is compared with the new CRC computed from the received data block. If the comparison determines that there is a difference in the values, then an error signal is generated. The error signal can be processed and used in several ways. The error signal can initiate a negative acknowledgment signal to be send A~D SH~~fi from the receiving station back to the sender requesting the sender to repeat the data block transmission. The error signal can initiate an update in the spreading and despreading weights at the receiving station in an effort to improve the signal and interference to noise ratio of the traffic channel. The error signal can initiate an alarm to be used for other realtime control. Or, the error signal can be logged for the compilation of a longer term report of the traffic channel quality.
In accordance with one aspect of the present invention there is provided a highly bandwidth-efficient communications method, comprising the steps of receiving at a base station a wireless spread signal comprising an incoming data message including a data block and a block number in a first channel at a first time spread over a plurality of discrete traffic frequencies; adaptively despreading the data message received at the base station by using despreading weights;
receiving at said base station a wireless spread signal comprising an incoming error detection message including said block number and a first error detection code derived from said data block in a second channel at a second time spread over a plurality of wireless link control frequencies; adaptively despreading the error detection message received at the base station by using said despreading weights; computing a second error detection code fox said received data block;
selecting said first error detection code using said block number received in said data message; comparing the first error detection code with said second error detection code; and generating an error response signal at the base station in response to said first error detection code being different from said second error detection code.
In accordance with another aspect of the present invention there is provided a highly bandwidth-efficient communications system, comprising:
means for receiving at a base station a wireless spread signal comprising an incoming data traffic signal including a data block and a block number in a first channel at a first time spread over a plurality of discrete traffic frequencies and an incoming error detection signal including said block number and a first error code derived from said data block in a second channel at a second time spread over a plurality of wireless link control frequencies; means for adaptively despreading the data traffic and error detection signals received at the base station by using despreading weights; means for computing an error detection value including a second error code for said data block; means for selecting said first error code using said block number from said data traffic signal; and means for comparing the first error code with said second error code; means for generating an error response signal at the base station in response to said first error code being different from said second error code.
Currently, the invention has advantageous applications in the field of wireless communications, such as cellular communications or personal communications, where bandwidth is scarce compared to the number of the users and their needs. Such applications may be effected in mobile, fixed, or minimally mobile systems. However, the invention may be advantageously applied to other, non-wireless, communications systems as well.
Brief Description of the Drawings FIGURE 1 is an architectural diagram of the PWAN system, including remote stations transmitting to a base station.
FIGURE 2 is an architectural diagram of the remote stations X as a sender.
FIGURE 3 is an architectural diagram of the base station Z as a receiver.
FIGURE 4 is a more detailed architectural diagram of the vector disassembly and CRC comparison logic at a receiving station.
FIGURE 5 is an architectural diagram of the base station Z as a sender.
FIGURE 6 is an architectural diagram of the remote station X as a receiver.
FIGURE 7 is a flow diagram showing the remote station as the sender and the base station as the receiver.
FIGURE 8 is a flow diagram showing the base station as the sender and the remote station as the receiver.
Description of the Preferred Embodiment FIGURE 1 an architectural diagram of the personal wireless access network 4a PCT/US98~03557 ~J$ 24 SEP 1998 (PWAI~ system described. Two users, Alice and Bob, are located at the remote station X and wish to transmit their respective data messages to the base station Z.
Station X is positioned to be equidistant from the antenna elements A, B, C, and D of the base station Z. Two other users, Chuck and Dave, are located at the remote station Y and also wish to transmit their respective data messages to the base station Z.
Station Y is geographically remote from Station X and is not equidistant from the antenna elements A, B, C, and D of the base station Z. The remote stations X and Y and the base station Z use the form of the CDMA protocol known as discrete multitone spread spectrum DMT-SS ) to provide efficient communications between the base station and the plurality of remote station units. This protocol is designated in Figure 1 as mufti-tone CDMA. In this protocol, the user's data signal is modulated by a set of weighted discrete frequencies or tones. The weights are spreading weights that distribute the data signal over many discrete tones covering a broad range of frequen:ies. The weights are complex numbers with the real component acting to modulate the amplitude of a tone while the complex component of the weight acts to modulate the phase of the same tone. Each tone in the weighted tone set bears the same data signal. Plural users at the transmitting station can use the same tone set to transmit their data, but each of the users sharing the tone set has a different set of spreading weights. The weighted tone set for a particular user is transmitted to the receiving station where t is processed with despreading weights related to the user's spreading weights, to recover the user's data -., 25 signal. For each of the spatially separated antennas at the receiver, the received multitone signals are transformed from time domain signals to frequency domain signals. Despreading weights are assigned to each frequency component of the signals received by each antenna element. The values of the despreading weights are combined with the received signals to obtain an optimized approximation of individual transmitted signals characterized by a particular multitone set and transmitting location.
The PWAN system has a total of 2560 discrete tones (carriers) equally spaced in 8 MHZ of available bandwidth in the range of 1850 to 1990 MHZ. The spacing between the tones is 3.125 kHz. The total set of tones are numbered consecutively form 0 to 2559 starting ~M,~tdDLD SHEET
/~ 9~~ 0355 ~~~ 4 S E P 1998 from the lowest frequency tone. The tones are used to carry traffic messages and overhead messages between the base station and the plurality of remote units.
The traffic tones are divided into 32 traffic partitions, with each traffic channel requiring at least one traffic partition of 72 tones.
In addition, the PWAN system uses overhead tones to establish synchronization and to pass control information between the base station and the remote units.
A
Common Link Channel (CLC) is used by the base to transmit control information to the Remote Units. A Common Access Channel (CAC) is used to transmit messages from the Remote Unit to the Base. There is one grouping of tones assigned to each channel.
These overhead channels are used in common by all of the remote units when they are exchanging control messages with the base station.
,- In the PWAN system, Time Division Duplexing (TDD) is used by the base sta~ion and the remote unit to transmit data and control information in both directions over the same mufti-tone frequency channel.
Transmission from the base station to the remote unit is called forward transmission and transmission from the remote unit to the base station is called reverse transmission. The time between recurrent transmissions from either the remote unit or the base station is the TDD period. In every TDD period, there are four consecutive transmission bursts in each direction. Data is transmitted in each burst using multiple tones. The base station and each remote unit must synchronize and conform to the TDD timing structure and both the base station and the remote unit must synchronize to a framing structure. All remote units and base stations must be synchronized so that all remote units transmit at the same time and then all base stations transmit at the same time. When a remote unit initially powers up, it acquires synchronization from the base station so that it can exchange control and traffic messages within the prescribed TDD
time format. The remote unit must also acquire frequency and phase synchronization for the DMT-SS signals so that the remote is operating at the same frequency and phase as the base station.
Selected tones within each tone set are designated as pilots distributed throughout the frequency band. Pilot tones carry known data patterns that enable an AllfffJDcD Sf;EET
PC~T/US 9 ~ i 0' 557 2 4 S ~P 1998 accurate channel estimation. The series of pilot tones, having known amplitudes and phases, have a known level and are spaced apart by approximately 30 KHz to provide an accurate representation of the channel response (i.e., the amplitude and phase distortion introduced by the communication channel characteristics) over the entire transmission band.
In accordance with the invention, each remote station and each base station in the network prepares an error detection code, such as a cyclic redundancy code (CRC), on each block of data to be transmitted over the traffic channels. A variety of error detecting codes can be used, in accordance with the invention. Polynomial codes, also known as cyclic redundancy codes, are preferred for the invention. The sender and receiver must agree on a generator polynomial in advance of the communication.
A
-.- checksum is computed for a data block based on the generator polynomial.
The checksum is a unique mapping of the data block. Any changes to the bit pattern of the datablock will result in a different checksum. Examples of error detecting codes for the preferred embodiment of the invention are given in Tanenbaum, "Computer Networks", second edition, Prentice-Hall, 1989. The CRC value computed for a given block of data is a unique mapping of the data block that characterizes the data block. Any change in the data block will result in a different CRC value. Each data block to be sent is numbered with a block number to distinguish it from other data blocks being sent by a sending station. A data message is formed by concatenating the data block with the block number. A CRC value is computed for each data block. An error detection message is formed by concatenating the CRC value with the block number. The sending station prepares the data message by forming data vectors that will be spread using the discrete multitone spread spectrum (DMT-SS ) protocol to distribute the data message over a plurality of discrete tone frequencies, forming a spread signal for the tragic channel. In accordance with the invention, the sending station prepares the error detection message for transmission over the link control channel of the network. The sending station prepares the error detection message by forming a link control channel vector that will be spread using the discrete multitone spread spectrum ( DMT-SS ) protocol to distribute the data message over a plurality of discrete tone frequencies, ~c..~
A~t;~a~L~ ~" ~r CA 02281818 1999-08-19 ~ ~ ~ ~ 0 3 5 5 ?
~~~~ 2 4 S E P 1998 forming a spread signal for the link control channel. A link control channel is associated with communications session using the traffic channels. Normally, the link control channel carries control information needed by the sending and receiving stations during a session using the traffic channels. However, its capacity is under-utilized.
In accordance with the invention, the instant of transmission of the error detection I O message is allowed to be different from the instant of transmission of the data message.
This permits the error detection messages to be transmitted when capacity is available on the link control channel. The receiving station buffers the error detection messages it receives from the link control channel, so that they are accessible by their block numbers. When the receiving station receives a data message on the traffic channel, it performs a CRC calculation on the data block in the message to obtain a resulting new CRC value. The new CRC value is also buffered at the receiving station with the block number so that it is accessible by its block number. Then, when both the received error message and the new CRC value are both available at the receiving station, they are matched by their common block number. The received CRC value in the error detection message is compared with the new CRC computed from the received data block. If the comparison determines that there is a difference in the values, then an error signal is generated. The error signal can be processed and used in several ways. The error signal can initiate a negative acknowledgement signal to be send from the receiving station back to the sender requesting the sender to repeat the data block transmission. The error signal can initiate an update in the spreading and despreading weights at the receiving station in an effort to improve the signal and interference to noise ratio of the tragic channel. The error signal can initiate an alarm to be used for other realtime control. Or, the error signal can be logged for the compilation of a longer term report of the traffic channel quality.
FIGURE 2 is an architectural diagram of the remote station X as a sender.
Alice and Bob each input data to remote station X. The data is sent to the vector formation buffer 202 and also to the cyclic redundancy code generator 204. Data vectors are output from bufJ'er 202 to the trellis encoder 206. The data vectors are in the form of a data message formed by concatenating a 64K-bit data block with its serially assigned ~'1P.."E;~1GLD ~>JEET
CA 02281818 1999-08-19 ~ ~ ~ 3 5 5 7 ~~~d2 4 S E P 1998 block number. The LCC vectors output from the CRC generator 204 to the trellis encoder 206 are in the form of an error detection message formed by concatenating the CRC value with the block number. The trellis encoded data vectors and LCC
vectors are then output to the spectral spreading processor 208. The resultant data tones and LCC tones are then output from processor 208 to the transmitter 210 for transmission to the base station.
The first four steps in the flow diagram 700 of Figure 7 show the steps at remote station X when it is the sender. The steps in the method of transmission from a remote station to a base station are first for the Remote Station in step 710 to generate .. a CRC value on the data block, assign a data block number to the CRC value, and concatenate the CRC value and the block number in a error message which is input as a vector to the link control channel (LCC). Then in step 720, the Remote Station performs trellis encoding of the CRC link control channel vector and the data block vectors. Then in Step 730, the Remote Station performs spectral spreading of the trellis encoded CRC link control channel vector and data block vectors. Then in Step 740, the Remote Station transmits the CRC link control channel tone and data block tones to the base station.
The personal wireless access network (PWAI~ system described provides a more detailed description of a high capacity mode, where one traffic partition is used in -~,,.r one traffic channel. The Base transmits information to multiple Remote Units in its cell.
The transmission formats are for a 64 kbits/sec traffic channel, together with a 4 kbps Link Control Channel (LCC) between the Base and a Remote Unit. The binary source delivers data to the sender's transmitter at 64 kbits/sec. This translates to 48 bits in one transmission burst. The information bits are encrypted according to a triple data encryption standard (DES) algorithm. The encrypted bits are then randomized in a data randomization block. A bit to octal conversion block converts the randomized binary sequence into a sequence of 3-bit symbols. The symbol sequence is converted into 16 symbol vectors. The term vector generally refers to a column vector which is generally complex. One symbol from the LCC is added to form a vector of 17 symbols.
Af~fEi~Ju=D ~~~EET
~CTI~~ 9 g ~ 0 3 5 5 7 ~~~I~' ~ ~ S E P 1998 The 17-symbol vector is trellis encoded. The trellis encoding starts with the most significant symbol (first element of the vector) and is continued sequentially until the last element of the vector (the LCC symbol). This process employs convolutional encoding that converts the input symbol (an integer between 0 and 7) to another symbol (between 0 and 15) and maps the encoded symbol to its corresponding (or 16PSK) signal constellation point. The output of the trellis encoder is therefore a vector of 17 elements where each element is signal within the set of 16 QAM
(or 16PSK) constellation signals. (The term signal will generally refer to a signal constellation point.) - 15 A link maintenance pilot signal (LMP) is added to form an 18-signal vector, with the LMP as the first elements of the vector. The resulting (18 X 1) vector is pre-multiplied by a (18 x 18) forward smearing matrix to yield a (18x 1) vector b.
Vector b is element-wise multiplied by the (18 x 1) gain preemphasis vector to yield another (18 x 1) vector, c, where p denotes the traffc channel index and is an integer. Vector c is post-multiplied by a (1 x 32) forward spatial and spectral spreading vector to yield a (18 x 32) matrix R(p). The number 32 results from multiplying the spectral spreading factor 4 and spatial spreading factor 8. The 18 x 32 matrices corresponding to all traffic channels carried (on the same traffic partition) are then combined (added) to produce the resulting 18 x 32 matrix S.
The matrix S is partitioned (by groups of four columns) into eight ( 18 x 4) submatrices (Ao to A~). (The indices 0 to 7, corresponds to the antenna elements over which these symbols will eventually be transmitted.) Each submatrix is mapped to tones within one traffic partition.
A lower physical layer places the baseband signals in discrete Fourier transfer (DFT) frequency bins where the data is converted into the time domain and sent to its corresponding antenna elements (0 to 7) for transmission over the air.
This process is repeated from the start for the next 48 bits of binary data to be transmitted in the next forward transmission burst.
FIGURE 3 is an architectural diagram of the base station Z as a receiver. The ~~1~".1~~ [
~,Yl.~.t.::~ vi~~:-i.!
~,~ 2 4 S E P 1998 data tones and LCC tones are received at the base station antennas A, B, C, and D. The receiver 310 passes the data to»es and the LCC tones to the spectral and spatial despreading processor 312. The despread signals are then output from the processor 312 to the trellis decoder 314. The data vectors 400, 400 and 400" are then output to the vector disassembly buffer 316, shown in greater detail in Figure 4. The LCC
vectors 402, 402 and 402 " are output to the CRC comparison processor 320, shown in greater detail in Figure 4. Alice 's data and Bob 's data are output from the buffer 316 to the public switched telephone network (PSTN). Alice 's data and Bob 's data are also input to the CRC generator 318. CRC generator 318 computes a new CRC value for every 64 K bit data block and outputs the new CRC value and the block number to the .. 15 buffer 406 of the CRC comparison processor 320. FIGURE 4 is a more detailed architectural diagram of the vector disassembly and CRC comparison logic at a receiving station. The receiving station buffers in the CRC comparison processor 320 the error detection messages it receives from the link control channel, so that they are accessible by their block numbers N, N+1, N+2, etc. When the receiving station receives a data message on the traffic channel, it performs a CRC calculation on the data block in the message with CRC generator 318 to obtain a resulting new CRC
value. The new CRC value is buffered in buffer 406 at the receiving station with the block number so that it is accessible by its block number. Then, when both the received error message and the new CRC value are both available at the receiving station, they .:
are matched by selector 404 by their common block number. The received CRC
value in the error detection message 402 is compared with the new CRC computed from the received data block 400 by means of the comparator 408. If the comparison determines that there is a difference in the values, then an error signal is generated by generator 322. The error signal can be processed and used in several ways by the error processor 330. The error signal can initiate a negative acknowledgment signal to be sent from the receiving station back to the sender requesting the sender to repeat the data block transmission. The error signal can initiate an update in the spreading and despreading weights at the receiving station in an effort to improve the signal and interference to noise ratio of the traffic channel. The error signal can initiate an alarm to be used for ~,;~F~ ~!','.'-,~ c~ ~'~T
A~ . ~.. , . ~, ~CT~1~ 9 ~ l ~ 3 5 5 7 ~~;~ ~ x S E P 1998 other realtime control. Or, the error signal can be logged for the compilation of a longer term report of the traffic channel quality.
The last five steps in the flow diagram of Figure 7, show the base station as the receiver. I» Step 750, the Base Station performs spectral and spatial despreading of the CRC link control channel tone and data block tones. Then, in Step 760, the Base Station performs trellis decoding of despread CRC link control channel tone and data block tones. Then in Step 770, the Base Station generates new a CRC value on the data block and uses the block number to select the corresponding CRC vector received from the link control channel. Then in Step 780, the Base Station compares the new CRC
j value computed on the received data block with the CRC vector received from the link control channel. Then in Step 790, the Base Station generates an error signal if the new CRC does not compare with the received CRC.
FIGURE 5 is an architectural diagram of the base station Z as a sender and FIGURE 6 is an architectural diagram of the remote station X as a receiver.
is a flow diagram showing the base station as the sender and the remote station as the receiver. These three figures illustrate a communications direction opposite to that shown in Figures 2, 3, and 7. The same principle of the invention applies to figures 5, 6, and 8 as the principles discussed for Figures 2, 3, and 7.
FIGURE 5 is an architectural diagram of the base station as a sender. The PSTN
inputs data to base station Z. The data is sent to the vector formation buffer 502 and also to the cyclic redundancy code generator 504. Data vectors are output, from buffer 502 to the trellis encoder 506. The data vectors are in the form of a data message formed by concatenating a 64 K-bit data block with its serially assigned block number.
The LCC vectors output from the CRC generator 504 to the trellis encoder 506 are in the form of an error detection message formed by concatenating the CRC value with the block number. The trellis encoded data vectors and LCC vectors are then output to the spectral and spatial spreading processor 508. The resultant data tones and LCC
tones are then output from processor 508 to the transmitter 2I0 for transmission to the remote station.
The fast four steps in the flow diagram 800 of Figure 8 show the steps at base AMENDED SHEET
~ 9 8I 03557 ,~~, ~ ~ 5 E P 1998 station Z when it is the sender. The steps in the method of transmission from a base station to a remote station are first for the Base Station in step 810 to generate a CRC
value on the data block, assign a data block number to the CRC value, and concatenate the CRC value and the block number in a error message which is input as a vector to the link control channel (LCC). Then in step 820, the Base Station performs trellis encoding of the CRC link control channel vector and the data block vectors.
Then in Step 830, the Base Station performs spectral spreading of the trellis encoded CRC link control channel vector and data block vectors. Then in Step 840, the Base Station transmits the CRC link control channel tone and data block tones to the remote station.
FIGURE 6 is an architectural diagram of the remote station X as a receiver.
The data tones and LCC tones are received at the remote station antenna X. The receiver 6I0 passes the data tones and the LCC tones to the spectral despreading processor 612. The despread signals are then output from the processor 6l ~ to the trellis decoder 614. The data vectors 400, 400' and 400 " of Figure 4 are then output to the vector disassembly buffer 616, shown in greater detail in Figure 4. The LCC
vectors 402, 402' and 402 " are output to the CRC comparison processor 620, shown in greater detail in Figure 4. Data to Alice and data to Bob are output from the buffer 616 to Alice and to Bob. Data to Alice and Bob are also input to the CRC
generator 618. CRC generator 618 computes a new CRC value for every 64K bit data block and outputs the new CRC value and the block number to the buffer 406 of the CRC
comparison processor 620.
FIGURE 4 is a more detailed architectural diagram of the vector disassembly and CRC comparison logic at a receiving station. The receiving station buffers in the CRC comparison processor 620 the error detection messages it receives from the link control channel, so that they are accessible by their block numbers N, N+1, N+2, etc.
When the receiving station receives a data message on the traffic channel, it performs a CRC calculation on the data block in the message with CRC generator 618 to obtain a resulting new CRC value. The new CRC value is buffered in buffer 406 at the receiving station with the block number so that it is accessible by its block number.
Then, when both the received error message and the new CRC value are both available at the ~~~~~;~~~~~ ~~;~rr ~ 03 55T
jP°',~2~SEP~
99g receiving station, they are matched by selector 404 by their common block number. The received CRC value in the error detection message 402 is compared with the new CRC
computed from the received data block 400 by means of the comparator 408. If the comparison determines that there is a difference in the values, then an error signal is generated by generator 622. The error signal can be processed and used in several ways by the error processor 630. The error signal can initiate a negative acknowledgment signal to be sent from the receiving station back to the sender requesting the sender to repeat the data block transmission. The error signal can initiate an update in the spreading and despreading weights at the receiving station in an effort to improve the signal and interference to noise ratio of the traffic channel. The error signal can initiate an alarm to be used for other realtime control. Or, the error signal can be logged for the compilation of a longer term report of the traffic channel quality.
The last five steps in the flow diagram of Figure 8, show the remote station as the receiver. In Step 850, the Remote Station performs spectral and spatial despreading of the CRC link control channel tone and data block tones. Then, in Step 860, the Remote Station performs trellis decoding of despread CRC link control channel tone and data block tones. Then in Step 870, the Remote Station generates new a CRC
value on the data block and uses the block number to select the corresponding CRC
vector received from the link control channel. Then in Step 880, the Remote Station compares the new CRC value computed on the received data block with the CRC
vector received from the link control channel. Then in Step 890, the Remote Station generates an error signal if the new CRC does not compare with the received CRC.
Although the preferred embodiments of the invention have been described in detail above, it will be apparent to those of ordinary skill in the art that obvious modifications may be made to the invention without departing from its spirit or essence.
Consequently, the preceding description should be taken as illustrative and not restrictive, and the scope of the invention should be determined in view of the following claims.
~,scs~(~~ c, C
P::;.~ D N_ET
t:~ ~.~~ ~ P 1998 Gibbons 2-1-1 TITLE THE INVENTION:
"OUT OF CHANNEL CYCLIC REDUNDANCY CODE METHOD FOR A
DISCRETE MULTITONE SPREAD SPECTRUM COMMUNICATIONS
SYSTEM"
Background of the Invention Field of the Invention This invention involves improvements to communications systems and methods in a wireless discrete multitone spread spectrum communications system.
Description of Related A_rt_ Wireless communications systems, such as cellular and personal communications systems, operate over limited spectral bandwidths. They must make highly efficient use of the scarce bandwidth resource to provide good service to a large population of users. Code Division Multiple Access (CDMA) protocol has been used ~W~n ~~
CA U2281818 1999-U8-19 ~~,~~~~, ~ a ~ ~ 3 5 5.7 f ~'~~~.~ 2. ~ S L P 19 98 by wireless communications systems to efficiently make use of limited bandwidths. The protocol uses a unique code to distinguish each user's data signal from other users' data signals. Knowledge of the unique code with which any specific information is transmitted, permits the separation and reconstruction of each user's message at the receiving end of the communication channel.
Adaptive beamforming technology has become a promising technology for wireless service providers to offer large coverage, high capacity, and high quality service. Based on this technology, a wireless communication system can improve its coverage capability, system capacity, and performance significantly.
The personal wireless access network (PWAl~ system described uses adaptive I 5 beamforming combined with a form of the CDMA protocol known as discrete multitone spread spectrum (DMT-SS ) to provide efficient communications between a base station and a plurality of remote units. (The Agee, et al. patent application uses the term "discrete multitone stacked carrier (DMT-SC) to refer to this protocol.) Every effort must be made to avoid loading normal, high priority traffic channels with system management information that has a lower priority. An example of system management information is the characterization of channel quality factors that are not immediately needed to control the realtime operation of the network. What is needed is a way to offload the communication of system management information from high priority traffic channels.
Summary of the Invention The invention disclosed herein is a new method to make the most efficient use of the scarce spectral bandwidth in a wireless discrete multitone spread spectrum communications system. Each remote station and each base station in the network prepares an error detection code, such as a cyclic redundancy code (CRC), on each block of data to be transmitted over the traffic channels. The CRC value computed for a given block of data is a unique mapping of the data block that characterizes the data block. Any change in the data block will result in a different CRC value. Each data block to be sent is numbered with a block number to distinguish it from other data ?~L SHEE:f - l blocks being sent by a sending station. A data message is formed by concatenating the data block with the block number. A CRC value is computed for each data block.
An error detection message is formed by concatenating the CRC value with the block number. The sending station prepares the data message by forming data vectors that will be spread using the discrete multitone spread spectrum (DMT-SS ) protocol to distribute the data message over a plurality of discrete tone frequencies, forming a spread signal for the traffic channel. In accordance with the invention, the sending station prepares the error detection message for transmission over the link control channel of the network. The sending station prepares the error detection message by forming a link control channel vector that will be spread using the discrete multitone spread spectrum (DMT-SS ) protocol to distribute the data message over a plurality of -- discrete tone frequencies, forming a spread signal for the link control channel. A link control channel is associated with communications session using the traffic channels.
Normally, the link control channel carries control information needed by the sending and receiving stations during a session using the trai~c channels. However, its capacity is under-utilized. In accordance with the invention, the instant of transmission of the error detection message is allowed to be different from the instant of transmission of the data message. This permits the error detection messages to be transmitted when capacity is available on the link control channel. The receiving station buffers the error detection messages it receives from the link control channel, so that they are accessible by their block numbers. When the receiving station receives a data message on the traffic channel, it performs a CRC calculation on the data block in the message to obtain a resulting new CRC value. The new CRC value is also buffered at the receiving station with the block number so that it is accessible by its block number.
Then, when both the received error message and the new CRC value are both available at the receiving station, they are matched by their common block number. The received CRC
value in the error detection message is compared with the new CRC computed from the received data block. If the comparison determines that there is a difference in the values, then an error signal is generated. The error signal can be processed and used in several ways. The error signal can initiate a negative acknowledgment signal to be send A~D SH~~fi from the receiving station back to the sender requesting the sender to repeat the data block transmission. The error signal can initiate an update in the spreading and despreading weights at the receiving station in an effort to improve the signal and interference to noise ratio of the traffic channel. The error signal can initiate an alarm to be used for other realtime control. Or, the error signal can be logged for the compilation of a longer term report of the traffic channel quality.
In accordance with one aspect of the present invention there is provided a highly bandwidth-efficient communications method, comprising the steps of receiving at a base station a wireless spread signal comprising an incoming data message including a data block and a block number in a first channel at a first time spread over a plurality of discrete traffic frequencies; adaptively despreading the data message received at the base station by using despreading weights;
receiving at said base station a wireless spread signal comprising an incoming error detection message including said block number and a first error detection code derived from said data block in a second channel at a second time spread over a plurality of wireless link control frequencies; adaptively despreading the error detection message received at the base station by using said despreading weights; computing a second error detection code fox said received data block;
selecting said first error detection code using said block number received in said data message; comparing the first error detection code with said second error detection code; and generating an error response signal at the base station in response to said first error detection code being different from said second error detection code.
In accordance with another aspect of the present invention there is provided a highly bandwidth-efficient communications system, comprising:
means for receiving at a base station a wireless spread signal comprising an incoming data traffic signal including a data block and a block number in a first channel at a first time spread over a plurality of discrete traffic frequencies and an incoming error detection signal including said block number and a first error code derived from said data block in a second channel at a second time spread over a plurality of wireless link control frequencies; means for adaptively despreading the data traffic and error detection signals received at the base station by using despreading weights; means for computing an error detection value including a second error code for said data block; means for selecting said first error code using said block number from said data traffic signal; and means for comparing the first error code with said second error code; means for generating an error response signal at the base station in response to said first error code being different from said second error code.
Currently, the invention has advantageous applications in the field of wireless communications, such as cellular communications or personal communications, where bandwidth is scarce compared to the number of the users and their needs. Such applications may be effected in mobile, fixed, or minimally mobile systems. However, the invention may be advantageously applied to other, non-wireless, communications systems as well.
Brief Description of the Drawings FIGURE 1 is an architectural diagram of the PWAN system, including remote stations transmitting to a base station.
FIGURE 2 is an architectural diagram of the remote stations X as a sender.
FIGURE 3 is an architectural diagram of the base station Z as a receiver.
FIGURE 4 is a more detailed architectural diagram of the vector disassembly and CRC comparison logic at a receiving station.
FIGURE 5 is an architectural diagram of the base station Z as a sender.
FIGURE 6 is an architectural diagram of the remote station X as a receiver.
FIGURE 7 is a flow diagram showing the remote station as the sender and the base station as the receiver.
FIGURE 8 is a flow diagram showing the base station as the sender and the remote station as the receiver.
Description of the Preferred Embodiment FIGURE 1 an architectural diagram of the personal wireless access network 4a PCT/US98~03557 ~J$ 24 SEP 1998 (PWAI~ system described. Two users, Alice and Bob, are located at the remote station X and wish to transmit their respective data messages to the base station Z.
Station X is positioned to be equidistant from the antenna elements A, B, C, and D of the base station Z. Two other users, Chuck and Dave, are located at the remote station Y and also wish to transmit their respective data messages to the base station Z.
Station Y is geographically remote from Station X and is not equidistant from the antenna elements A, B, C, and D of the base station Z. The remote stations X and Y and the base station Z use the form of the CDMA protocol known as discrete multitone spread spectrum DMT-SS ) to provide efficient communications between the base station and the plurality of remote station units. This protocol is designated in Figure 1 as mufti-tone CDMA. In this protocol, the user's data signal is modulated by a set of weighted discrete frequencies or tones. The weights are spreading weights that distribute the data signal over many discrete tones covering a broad range of frequen:ies. The weights are complex numbers with the real component acting to modulate the amplitude of a tone while the complex component of the weight acts to modulate the phase of the same tone. Each tone in the weighted tone set bears the same data signal. Plural users at the transmitting station can use the same tone set to transmit their data, but each of the users sharing the tone set has a different set of spreading weights. The weighted tone set for a particular user is transmitted to the receiving station where t is processed with despreading weights related to the user's spreading weights, to recover the user's data -., 25 signal. For each of the spatially separated antennas at the receiver, the received multitone signals are transformed from time domain signals to frequency domain signals. Despreading weights are assigned to each frequency component of the signals received by each antenna element. The values of the despreading weights are combined with the received signals to obtain an optimized approximation of individual transmitted signals characterized by a particular multitone set and transmitting location.
The PWAN system has a total of 2560 discrete tones (carriers) equally spaced in 8 MHZ of available bandwidth in the range of 1850 to 1990 MHZ. The spacing between the tones is 3.125 kHz. The total set of tones are numbered consecutively form 0 to 2559 starting ~M,~tdDLD SHEET
/~ 9~~ 0355 ~~~ 4 S E P 1998 from the lowest frequency tone. The tones are used to carry traffic messages and overhead messages between the base station and the plurality of remote units.
The traffic tones are divided into 32 traffic partitions, with each traffic channel requiring at least one traffic partition of 72 tones.
In addition, the PWAN system uses overhead tones to establish synchronization and to pass control information between the base station and the remote units.
A
Common Link Channel (CLC) is used by the base to transmit control information to the Remote Units. A Common Access Channel (CAC) is used to transmit messages from the Remote Unit to the Base. There is one grouping of tones assigned to each channel.
These overhead channels are used in common by all of the remote units when they are exchanging control messages with the base station.
,- In the PWAN system, Time Division Duplexing (TDD) is used by the base sta~ion and the remote unit to transmit data and control information in both directions over the same mufti-tone frequency channel.
Transmission from the base station to the remote unit is called forward transmission and transmission from the remote unit to the base station is called reverse transmission. The time between recurrent transmissions from either the remote unit or the base station is the TDD period. In every TDD period, there are four consecutive transmission bursts in each direction. Data is transmitted in each burst using multiple tones. The base station and each remote unit must synchronize and conform to the TDD timing structure and both the base station and the remote unit must synchronize to a framing structure. All remote units and base stations must be synchronized so that all remote units transmit at the same time and then all base stations transmit at the same time. When a remote unit initially powers up, it acquires synchronization from the base station so that it can exchange control and traffic messages within the prescribed TDD
time format. The remote unit must also acquire frequency and phase synchronization for the DMT-SS signals so that the remote is operating at the same frequency and phase as the base station.
Selected tones within each tone set are designated as pilots distributed throughout the frequency band. Pilot tones carry known data patterns that enable an AllfffJDcD Sf;EET
PC~T/US 9 ~ i 0' 557 2 4 S ~P 1998 accurate channel estimation. The series of pilot tones, having known amplitudes and phases, have a known level and are spaced apart by approximately 30 KHz to provide an accurate representation of the channel response (i.e., the amplitude and phase distortion introduced by the communication channel characteristics) over the entire transmission band.
In accordance with the invention, each remote station and each base station in the network prepares an error detection code, such as a cyclic redundancy code (CRC), on each block of data to be transmitted over the traffic channels. A variety of error detecting codes can be used, in accordance with the invention. Polynomial codes, also known as cyclic redundancy codes, are preferred for the invention. The sender and receiver must agree on a generator polynomial in advance of the communication.
A
-.- checksum is computed for a data block based on the generator polynomial.
The checksum is a unique mapping of the data block. Any changes to the bit pattern of the datablock will result in a different checksum. Examples of error detecting codes for the preferred embodiment of the invention are given in Tanenbaum, "Computer Networks", second edition, Prentice-Hall, 1989. The CRC value computed for a given block of data is a unique mapping of the data block that characterizes the data block. Any change in the data block will result in a different CRC value. Each data block to be sent is numbered with a block number to distinguish it from other data blocks being sent by a sending station. A data message is formed by concatenating the data block with the block number. A CRC value is computed for each data block. An error detection message is formed by concatenating the CRC value with the block number. The sending station prepares the data message by forming data vectors that will be spread using the discrete multitone spread spectrum (DMT-SS ) protocol to distribute the data message over a plurality of discrete tone frequencies, forming a spread signal for the tragic channel. In accordance with the invention, the sending station prepares the error detection message for transmission over the link control channel of the network. The sending station prepares the error detection message by forming a link control channel vector that will be spread using the discrete multitone spread spectrum ( DMT-SS ) protocol to distribute the data message over a plurality of discrete tone frequencies, ~c..~
A~t;~a~L~ ~" ~r CA 02281818 1999-08-19 ~ ~ ~ ~ 0 3 5 5 ?
~~~~ 2 4 S E P 1998 forming a spread signal for the link control channel. A link control channel is associated with communications session using the traffic channels. Normally, the link control channel carries control information needed by the sending and receiving stations during a session using the traffic channels. However, its capacity is under-utilized.
In accordance with the invention, the instant of transmission of the error detection I O message is allowed to be different from the instant of transmission of the data message.
This permits the error detection messages to be transmitted when capacity is available on the link control channel. The receiving station buffers the error detection messages it receives from the link control channel, so that they are accessible by their block numbers. When the receiving station receives a data message on the traffic channel, it performs a CRC calculation on the data block in the message to obtain a resulting new CRC value. The new CRC value is also buffered at the receiving station with the block number so that it is accessible by its block number. Then, when both the received error message and the new CRC value are both available at the receiving station, they are matched by their common block number. The received CRC value in the error detection message is compared with the new CRC computed from the received data block. If the comparison determines that there is a difference in the values, then an error signal is generated. The error signal can be processed and used in several ways. The error signal can initiate a negative acknowledgement signal to be send from the receiving station back to the sender requesting the sender to repeat the data block transmission. The error signal can initiate an update in the spreading and despreading weights at the receiving station in an effort to improve the signal and interference to noise ratio of the tragic channel. The error signal can initiate an alarm to be used for other realtime control. Or, the error signal can be logged for the compilation of a longer term report of the traffic channel quality.
FIGURE 2 is an architectural diagram of the remote station X as a sender.
Alice and Bob each input data to remote station X. The data is sent to the vector formation buffer 202 and also to the cyclic redundancy code generator 204. Data vectors are output from bufJ'er 202 to the trellis encoder 206. The data vectors are in the form of a data message formed by concatenating a 64K-bit data block with its serially assigned ~'1P.."E;~1GLD ~>JEET
CA 02281818 1999-08-19 ~ ~ ~ 3 5 5 7 ~~~d2 4 S E P 1998 block number. The LCC vectors output from the CRC generator 204 to the trellis encoder 206 are in the form of an error detection message formed by concatenating the CRC value with the block number. The trellis encoded data vectors and LCC
vectors are then output to the spectral spreading processor 208. The resultant data tones and LCC tones are then output from processor 208 to the transmitter 210 for transmission to the base station.
The first four steps in the flow diagram 700 of Figure 7 show the steps at remote station X when it is the sender. The steps in the method of transmission from a remote station to a base station are first for the Remote Station in step 710 to generate .. a CRC value on the data block, assign a data block number to the CRC value, and concatenate the CRC value and the block number in a error message which is input as a vector to the link control channel (LCC). Then in step 720, the Remote Station performs trellis encoding of the CRC link control channel vector and the data block vectors. Then in Step 730, the Remote Station performs spectral spreading of the trellis encoded CRC link control channel vector and data block vectors. Then in Step 740, the Remote Station transmits the CRC link control channel tone and data block tones to the base station.
The personal wireless access network (PWAI~ system described provides a more detailed description of a high capacity mode, where one traffic partition is used in -~,,.r one traffic channel. The Base transmits information to multiple Remote Units in its cell.
The transmission formats are for a 64 kbits/sec traffic channel, together with a 4 kbps Link Control Channel (LCC) between the Base and a Remote Unit. The binary source delivers data to the sender's transmitter at 64 kbits/sec. This translates to 48 bits in one transmission burst. The information bits are encrypted according to a triple data encryption standard (DES) algorithm. The encrypted bits are then randomized in a data randomization block. A bit to octal conversion block converts the randomized binary sequence into a sequence of 3-bit symbols. The symbol sequence is converted into 16 symbol vectors. The term vector generally refers to a column vector which is generally complex. One symbol from the LCC is added to form a vector of 17 symbols.
Af~fEi~Ju=D ~~~EET
~CTI~~ 9 g ~ 0 3 5 5 7 ~~~I~' ~ ~ S E P 1998 The 17-symbol vector is trellis encoded. The trellis encoding starts with the most significant symbol (first element of the vector) and is continued sequentially until the last element of the vector (the LCC symbol). This process employs convolutional encoding that converts the input symbol (an integer between 0 and 7) to another symbol (between 0 and 15) and maps the encoded symbol to its corresponding (or 16PSK) signal constellation point. The output of the trellis encoder is therefore a vector of 17 elements where each element is signal within the set of 16 QAM
(or 16PSK) constellation signals. (The term signal will generally refer to a signal constellation point.) - 15 A link maintenance pilot signal (LMP) is added to form an 18-signal vector, with the LMP as the first elements of the vector. The resulting (18 X 1) vector is pre-multiplied by a (18 x 18) forward smearing matrix to yield a (18x 1) vector b.
Vector b is element-wise multiplied by the (18 x 1) gain preemphasis vector to yield another (18 x 1) vector, c, where p denotes the traffc channel index and is an integer. Vector c is post-multiplied by a (1 x 32) forward spatial and spectral spreading vector to yield a (18 x 32) matrix R(p). The number 32 results from multiplying the spectral spreading factor 4 and spatial spreading factor 8. The 18 x 32 matrices corresponding to all traffic channels carried (on the same traffic partition) are then combined (added) to produce the resulting 18 x 32 matrix S.
The matrix S is partitioned (by groups of four columns) into eight ( 18 x 4) submatrices (Ao to A~). (The indices 0 to 7, corresponds to the antenna elements over which these symbols will eventually be transmitted.) Each submatrix is mapped to tones within one traffic partition.
A lower physical layer places the baseband signals in discrete Fourier transfer (DFT) frequency bins where the data is converted into the time domain and sent to its corresponding antenna elements (0 to 7) for transmission over the air.
This process is repeated from the start for the next 48 bits of binary data to be transmitted in the next forward transmission burst.
FIGURE 3 is an architectural diagram of the base station Z as a receiver. The ~~1~".1~~ [
~,Yl.~.t.::~ vi~~:-i.!
~,~ 2 4 S E P 1998 data tones and LCC tones are received at the base station antennas A, B, C, and D. The receiver 310 passes the data to»es and the LCC tones to the spectral and spatial despreading processor 312. The despread signals are then output from the processor 312 to the trellis decoder 314. The data vectors 400, 400 and 400" are then output to the vector disassembly buffer 316, shown in greater detail in Figure 4. The LCC
vectors 402, 402 and 402 " are output to the CRC comparison processor 320, shown in greater detail in Figure 4. Alice 's data and Bob 's data are output from the buffer 316 to the public switched telephone network (PSTN). Alice 's data and Bob 's data are also input to the CRC generator 318. CRC generator 318 computes a new CRC value for every 64 K bit data block and outputs the new CRC value and the block number to the .. 15 buffer 406 of the CRC comparison processor 320. FIGURE 4 is a more detailed architectural diagram of the vector disassembly and CRC comparison logic at a receiving station. The receiving station buffers in the CRC comparison processor 320 the error detection messages it receives from the link control channel, so that they are accessible by their block numbers N, N+1, N+2, etc. When the receiving station receives a data message on the traffic channel, it performs a CRC calculation on the data block in the message with CRC generator 318 to obtain a resulting new CRC
value. The new CRC value is buffered in buffer 406 at the receiving station with the block number so that it is accessible by its block number. Then, when both the received error message and the new CRC value are both available at the receiving station, they .:
are matched by selector 404 by their common block number. The received CRC
value in the error detection message 402 is compared with the new CRC computed from the received data block 400 by means of the comparator 408. If the comparison determines that there is a difference in the values, then an error signal is generated by generator 322. The error signal can be processed and used in several ways by the error processor 330. The error signal can initiate a negative acknowledgment signal to be sent from the receiving station back to the sender requesting the sender to repeat the data block transmission. The error signal can initiate an update in the spreading and despreading weights at the receiving station in an effort to improve the signal and interference to noise ratio of the traffic channel. The error signal can initiate an alarm to be used for ~,;~F~ ~!','.'-,~ c~ ~'~T
A~ . ~.. , . ~, ~CT~1~ 9 ~ l ~ 3 5 5 7 ~~;~ ~ x S E P 1998 other realtime control. Or, the error signal can be logged for the compilation of a longer term report of the traffic channel quality.
The last five steps in the flow diagram of Figure 7, show the base station as the receiver. I» Step 750, the Base Station performs spectral and spatial despreading of the CRC link control channel tone and data block tones. Then, in Step 760, the Base Station performs trellis decoding of despread CRC link control channel tone and data block tones. Then in Step 770, the Base Station generates new a CRC value on the data block and uses the block number to select the corresponding CRC vector received from the link control channel. Then in Step 780, the Base Station compares the new CRC
j value computed on the received data block with the CRC vector received from the link control channel. Then in Step 790, the Base Station generates an error signal if the new CRC does not compare with the received CRC.
FIGURE 5 is an architectural diagram of the base station Z as a sender and FIGURE 6 is an architectural diagram of the remote station X as a receiver.
is a flow diagram showing the base station as the sender and the remote station as the receiver. These three figures illustrate a communications direction opposite to that shown in Figures 2, 3, and 7. The same principle of the invention applies to figures 5, 6, and 8 as the principles discussed for Figures 2, 3, and 7.
FIGURE 5 is an architectural diagram of the base station as a sender. The PSTN
inputs data to base station Z. The data is sent to the vector formation buffer 502 and also to the cyclic redundancy code generator 504. Data vectors are output, from buffer 502 to the trellis encoder 506. The data vectors are in the form of a data message formed by concatenating a 64 K-bit data block with its serially assigned block number.
The LCC vectors output from the CRC generator 504 to the trellis encoder 506 are in the form of an error detection message formed by concatenating the CRC value with the block number. The trellis encoded data vectors and LCC vectors are then output to the spectral and spatial spreading processor 508. The resultant data tones and LCC
tones are then output from processor 508 to the transmitter 2I0 for transmission to the remote station.
The fast four steps in the flow diagram 800 of Figure 8 show the steps at base AMENDED SHEET
~ 9 8I 03557 ,~~, ~ ~ 5 E P 1998 station Z when it is the sender. The steps in the method of transmission from a base station to a remote station are first for the Base Station in step 810 to generate a CRC
value on the data block, assign a data block number to the CRC value, and concatenate the CRC value and the block number in a error message which is input as a vector to the link control channel (LCC). Then in step 820, the Base Station performs trellis encoding of the CRC link control channel vector and the data block vectors.
Then in Step 830, the Base Station performs spectral spreading of the trellis encoded CRC link control channel vector and data block vectors. Then in Step 840, the Base Station transmits the CRC link control channel tone and data block tones to the remote station.
FIGURE 6 is an architectural diagram of the remote station X as a receiver.
The data tones and LCC tones are received at the remote station antenna X. The receiver 6I0 passes the data tones and the LCC tones to the spectral despreading processor 612. The despread signals are then output from the processor 6l ~ to the trellis decoder 614. The data vectors 400, 400' and 400 " of Figure 4 are then output to the vector disassembly buffer 616, shown in greater detail in Figure 4. The LCC
vectors 402, 402' and 402 " are output to the CRC comparison processor 620, shown in greater detail in Figure 4. Data to Alice and data to Bob are output from the buffer 616 to Alice and to Bob. Data to Alice and Bob are also input to the CRC
generator 618. CRC generator 618 computes a new CRC value for every 64K bit data block and outputs the new CRC value and the block number to the buffer 406 of the CRC
comparison processor 620.
FIGURE 4 is a more detailed architectural diagram of the vector disassembly and CRC comparison logic at a receiving station. The receiving station buffers in the CRC comparison processor 620 the error detection messages it receives from the link control channel, so that they are accessible by their block numbers N, N+1, N+2, etc.
When the receiving station receives a data message on the traffic channel, it performs a CRC calculation on the data block in the message with CRC generator 618 to obtain a resulting new CRC value. The new CRC value is buffered in buffer 406 at the receiving station with the block number so that it is accessible by its block number.
Then, when both the received error message and the new CRC value are both available at the ~~~~~;~~~~~ ~~;~rr ~ 03 55T
jP°',~2~SEP~
99g receiving station, they are matched by selector 404 by their common block number. The received CRC value in the error detection message 402 is compared with the new CRC
computed from the received data block 400 by means of the comparator 408. If the comparison determines that there is a difference in the values, then an error signal is generated by generator 622. The error signal can be processed and used in several ways by the error processor 630. The error signal can initiate a negative acknowledgment signal to be sent from the receiving station back to the sender requesting the sender to repeat the data block transmission. The error signal can initiate an update in the spreading and despreading weights at the receiving station in an effort to improve the signal and interference to noise ratio of the traffic channel. The error signal can initiate an alarm to be used for other realtime control. Or, the error signal can be logged for the compilation of a longer term report of the traffic channel quality.
The last five steps in the flow diagram of Figure 8, show the remote station as the receiver. In Step 850, the Remote Station performs spectral and spatial despreading of the CRC link control channel tone and data block tones. Then, in Step 860, the Remote Station performs trellis decoding of despread CRC link control channel tone and data block tones. Then in Step 870, the Remote Station generates new a CRC
value on the data block and uses the block number to select the corresponding CRC
vector received from the link control channel. Then in Step 880, the Remote Station compares the new CRC value computed on the received data block with the CRC
vector received from the link control channel. Then in Step 890, the Remote Station generates an error signal if the new CRC does not compare with the received CRC.
Although the preferred embodiments of the invention have been described in detail above, it will be apparent to those of ordinary skill in the art that obvious modifications may be made to the invention without departing from its spirit or essence.
Consequently, the preceding description should be taken as illustrative and not restrictive, and the scope of the invention should be determined in view of the following claims.
~,scs~(~~ c, C
P::;.~ D N_ET
Claims (20)
1. A highly bandwidth-efficient communications method, comprising the steps of:
receiving at a base station a wireless spread signal comprising an incoming data message including a data block and a block number in a first channel at a first time spread over a plurality of discrete traffic frequencies;
adaptively despreading the data message received at the base station by using despreading weights;
receiving at said base station a wireless spread signal comprising an incoming error detection message including said block number and a first error detection code derived from said data block in a second channel at a second time spread over a plurality of wireless link control frequencies;
adaptively despreading the error detection message received at the base station by using said despreading weights;
computing a second error detection code for said received data block;
selecting said first error detection code using said block number received in said data message;
comparing the first error detection code with said second error detection code; and generating an error response signal at the base station in response to said first error detection code being different from said second error detection code.
receiving at a base station a wireless spread signal comprising an incoming data message including a data block and a block number in a first channel at a first time spread over a plurality of discrete traffic frequencies;
adaptively despreading the data message received at the base station by using despreading weights;
receiving at said base station a wireless spread signal comprising an incoming error detection message including said block number and a first error detection code derived from said data block in a second channel at a second time spread over a plurality of wireless link control frequencies;
adaptively despreading the error detection message received at the base station by using said despreading weights;
computing a second error detection code for said received data block;
selecting said first error detection code using said block number received in said data message;
comparing the first error detection code with said second error detection code; and generating an error response signal at the base station in response to said first error detection code being different from said second error detection code.
2. The highly bandwidth-efficient communications method of claim 1, wherein said base station is part of a wireless discrete multitone spread spectrum communications system.
3. The highly bandwidth-efficient communications method of claim 1, wherein said second error detection code is a checksum resulting from the operation of a polynomial generator on said data block.
4. The highly bandwidth-efficient communications method of claim 1, wherein said second error detection code is a cyclic redundancy code.
5. The highly bandwidth-efficient communications method of claim 1, which further comprises:
prior to said comparing step, buffering said first error detection code.
prior to said comparing step, buffering said first error detection code.
6. The highly bandwidth-efficient communications method of claim 1, which further comprises:
initiating a negative acknowledgment signal to be sent from the base station to the sender requesting the sender to repeat the data block transmission, in response to said error response signal.
initiating a negative acknowledgment signal to be sent from the base station to the sender requesting the sender to repeat the data block transmission, in response to said error response signal.
7. The highly bandwidth-efficient communications method of claim 1, which further comprises:
initiating an update in the spreading and despreading weights at the receiving station in an effort to improve the signal and interference to noise ratio of a traffic channel, in response to said error response signal.
initiating an update in the spreading and despreading weights at the receiving station in an effort to improve the signal and interference to noise ratio of a traffic channel, in response to said error response signal.
8. The highly bandwidth-efficient communications method of claim 1, which further comprises:
initiating an alarm to be used for realtime control, in response to said error response signal.
initiating an alarm to be used for realtime control, in response to said error response signal.
9. The highly bandwidth-efficient communications method of claim 1, which further comprises:
logging the error signal for compilation of a longer term report of a traffic channel quality, in response to said error response signal.
logging the error signal for compilation of a longer term report of a traffic channel quality, in response to said error response signal.
10. A highly bandwidth-efficient communications system, comprising:
means for receiving at a base station a wireless spread signal comprising an incoming data traffic signal including a data block and a block number in a first channel at a first time spread over a plurality of discrete traffic frequencies and an incoming error detection signal including said block number and a first error code derived from said data block in a second channel at a second time spread over a plurality of wireless link control frequencies;
means for adaptively despreading the data traffic and error detection signals received at the base station by using despreading weights;
means for computing an error detection value including a second error code for said data block;
means for selecting said first error code using said block number from said data traffic signal;
means for comparing the first error code with said second error code; and means for generating an error response signal at the base station in response to said first error code being different from said second error code.
means for receiving at a base station a wireless spread signal comprising an incoming data traffic signal including a data block and a block number in a first channel at a first time spread over a plurality of discrete traffic frequencies and an incoming error detection signal including said block number and a first error code derived from said data block in a second channel at a second time spread over a plurality of wireless link control frequencies;
means for adaptively despreading the data traffic and error detection signals received at the base station by using despreading weights;
means for computing an error detection value including a second error code for said data block;
means for selecting said first error code using said block number from said data traffic signal;
means for comparing the first error code with said second error code; and means for generating an error response signal at the base station in response to said first error code being different from said second error code.
11. The highly bandwidth-efficient communications system of claim 10, wherein said base station is part of a wireless discrete multitone spread spectrum communications system.
12. The highly bandwidth-efficient communications system of claim 10, wherein said error detection signal is a checksum resulting from the operation of a polynomial generator on a data block.
13. The highly bandwidth-efficient communications system of claim 10, wherein said error detection signal is a cyclic redundancy code.
14. The highly bandwidth-efficient communications system of claim 10, which further comprises:
means for buffering said error detection signal.
means for buffering said error detection signal.
15. The highly bandwidth-efficient communications system of claim 10, which further comprises:
means for initiating a negative acknowledgment signal to be sent from the base station to the sender requesting the sender to repeat the data block transmission, in response to said error response signal.
means for initiating a negative acknowledgment signal to be sent from the base station to the sender requesting the sender to repeat the data block transmission, in response to said error response signal.
16. The highly bandwidth-efficient communications system of claim 10, which further comprises:
means for initiating an update in the spreading and despreading weights at the receiving station in an effort to improve the signal and interference to noise ratio of a traffic channel, in response to said error response signal.
means for initiating an update in the spreading and despreading weights at the receiving station in an effort to improve the signal and interference to noise ratio of a traffic channel, in response to said error response signal.
17. The highly bandwidth-efficient communications system of claim 10, which further comprises:
means for initiating an alarm to be used for realtime control, in response to said error response signal.
means for initiating an alarm to be used for realtime control, in response to said error response signal.
18. The highly bandwidth-efficient communications system of claim 10, which further comprises:
means for logging the error signal for compilation of a longer term report of a traffic channel quality, in response to said error response signal.
means for logging the error signal for compilation of a longer term report of a traffic channel quality, in response to said error response signal.
19. A highly bandwidth-efficient communications method, comprising the steps of:
receiving at a base station a first spread signal comprising an incoming data traffic signal in a first channel at a first time having a data block portion and a block number portion spread over a plurality of discrete traffic frequencies;
receiving at said base station a second spread signal comprising an incoming error detection signal in a second, different channel at a different time when capacity is available on the second channel, having an error detection portion and said block number portion spread over a plurality of link control frequencies;
adaptively despreading said first spread signal received at the base station by using despreading weights, recovering said data block portion and a block number portion;
buffering said data block portion and a block number portion;
computing an error detection value for said data block portion at said base station;
adaptively despreading said second spread signal received at the base station by using despreading weights, recovering said error detection portion and said block number portion;
buffering said error detection portion and said block number portion;
comparing the error detection value with said error detection portion when both are available at said base station; and generating an error response signal at the base station in response to said error detection value not comparing with said error detection portion.
receiving at a base station a first spread signal comprising an incoming data traffic signal in a first channel at a first time having a data block portion and a block number portion spread over a plurality of discrete traffic frequencies;
receiving at said base station a second spread signal comprising an incoming error detection signal in a second, different channel at a different time when capacity is available on the second channel, having an error detection portion and said block number portion spread over a plurality of link control frequencies;
adaptively despreading said first spread signal received at the base station by using despreading weights, recovering said data block portion and a block number portion;
buffering said data block portion and a block number portion;
computing an error detection value for said data block portion at said base station;
adaptively despreading said second spread signal received at the base station by using despreading weights, recovering said error detection portion and said block number portion;
buffering said error detection portion and said block number portion;
comparing the error detection value with said error detection portion when both are available at said base station; and generating an error response signal at the base station in response to said error detection value not comparing with said error detection portion.
20. A highly bandwidth-efficient communications system, comprising:
means for receiving at a base station a first spread signal comprising an incoming data traffic signal in a first channel at a first time having a data block portion and a block number portion spread over a plurality of discrete traffic frequencies;
means for receiving at said base station a second spread signal comprising an incoming error detection signal in a second, different channel at a different time when capacity is available on the second channel, having an error detection portion and said block number portion spread over a plurality of link control frequencies;
means for adaptively despreading said first spread signal received at the base station by using despreading weights, recovering said data block portion and a block number portion;
means for buffering said data block portion and a block number portion;
means for computing an error detection value for said data block portion at said base station;
means for adaptively despreading said second spread signal received at the base station by using despreading weights, recovering said error detection portion and said block number portion;
means for buffering said error detection portion and said block number portion;
means for comparing the error detection value with said error detection portion when both are available at said base station; and means for generating an error response signal at the base station in response to said error detection value not comparing with said error detection portion.
means for receiving at a base station a first spread signal comprising an incoming data traffic signal in a first channel at a first time having a data block portion and a block number portion spread over a plurality of discrete traffic frequencies;
means for receiving at said base station a second spread signal comprising an incoming error detection signal in a second, different channel at a different time when capacity is available on the second channel, having an error detection portion and said block number portion spread over a plurality of link control frequencies;
means for adaptively despreading said first spread signal received at the base station by using despreading weights, recovering said data block portion and a block number portion;
means for buffering said data block portion and a block number portion;
means for computing an error detection value for said data block portion at said base station;
means for adaptively despreading said second spread signal received at the base station by using despreading weights, recovering said error detection portion and said block number portion;
means for buffering said error detection portion and said block number portion;
means for comparing the error detection value with said error detection portion when both are available at said base station; and means for generating an error response signal at the base station in response to said error detection value not comparing with said error detection portion.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US08/803,831 | 1997-02-24 | ||
| US08/803,831 US6289037B1 (en) | 1997-02-24 | 1997-02-24 | Out of channel cyclic redundancy code method for a discrete multitone spread spectrum communications system |
| PCT/US1998/003557 WO1998037647A2 (en) | 1997-02-24 | 1998-02-24 | Method to gain access to a base station in a discrete multitone spread spectrum communications system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2281818A1 CA2281818A1 (en) | 1998-08-27 |
| CA2281818C true CA2281818C (en) | 2003-04-01 |
Family
ID=25187549
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002281818A Expired - Fee Related CA2281818C (en) | 1997-02-24 | 1998-02-24 | Method to gain access to a base station in a discrete multitone spread spectrum communications system |
Country Status (5)
| Country | Link |
|---|---|
| US (2) | US6289037B1 (en) |
| EP (1) | EP0962064B1 (en) |
| CA (1) | CA2281818C (en) |
| DE (1) | DE69834478T2 (en) |
| WO (1) | WO1998037647A2 (en) |
Families Citing this family (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6289037B1 (en) * | 1997-02-24 | 2001-09-11 | At&T Wireless Services Inc. | Out of channel cyclic redundancy code method for a discrete multitone spread spectrum communications system |
| FR2773427B1 (en) * | 1998-01-08 | 2000-02-04 | Alsthom Cge Alcatel | METHOD FOR SECURING INFORMATION TRANSMISSIONS MADE THROUGH AN OPEN TELECOMMUNICATIONS NETWORK |
| US6643281B1 (en) | 1998-03-05 | 2003-11-04 | At&T Wireless Services, Inc. | Synchronization preamble method for OFDM waveforms in a communications system |
| US6490260B1 (en) * | 1998-08-03 | 2002-12-03 | Samsung Electronics, Co., Ltd. | Transmitter with increased traffic throughput in digital mobile telecommunication system and method for operating the same |
| DE19845109A1 (en) * | 1998-09-30 | 2000-04-13 | Siemens Ag | Method for evaluating a presentation layer data unit |
| US6639899B1 (en) * | 1999-10-14 | 2003-10-28 | Alcatel Canada Inc. | Method and apparatus for providing integral cell payload integrity verification in ATM Telecommunication devices |
| CA2308643A1 (en) * | 1999-10-14 | 2001-04-14 | Alcatel Networks Corporation Societe Par Actions De Regime Federal De Re Seaux Alcatel | Method and apparatus for providing integral cell payload integrity verification and detecting defective modules in telecommunication devices |
| DE10009444A1 (en) * | 2000-02-29 | 2001-09-06 | Philips Corp Intellectual Pty | Operating method for a mobile phone |
| JP2002027537A (en) * | 2000-07-10 | 2002-01-25 | Sharp Corp | Data communication system using portable telephone |
| US6807578B2 (en) * | 2001-03-14 | 2004-10-19 | International Business Machines Corporation | Nack suppression for multicast protocols in mostly one-way networks |
| US7298718B2 (en) * | 2001-05-07 | 2007-11-20 | Qualcomm Incorporated | Channel allocations in a communications system |
| US7590386B2 (en) | 2002-04-18 | 2009-09-15 | Interdigital Technology Corporation | Method for control of contention-based wireless access |
| US7796574B2 (en) | 2002-09-10 | 2010-09-14 | Texas Instruments Incorporated | Multi-carrier reception for ultra-wideband (UWB) systems |
| EP1568185B1 (en) * | 2002-12-04 | 2011-05-11 | Interdigital Technology Corporation | Reliability detection of channel quality indicator (cqi) and application to outer loop power control |
| WO2004084438A1 (en) * | 2003-03-17 | 2004-09-30 | Samsung Electronics Co. Ltd. | Power control method and apparatus using control information in mobile communication system |
| US20040190447A1 (en) * | 2003-03-26 | 2004-09-30 | Dacosta Behram M. | Dynamic routing for data transmissions |
| JP2008517535A (en) * | 2004-10-15 | 2008-05-22 | アウェア， インコーポレイテッド | DMT symbol repetition in the presence of impulse noise |
| US7827475B2 (en) * | 2005-05-02 | 2010-11-02 | Nokia Corporation | Enhanced random access transmission |
| US20070019805A1 (en) * | 2005-06-28 | 2007-01-25 | Trustees Of Boston University | System employing systematic robust error detection coding to protect system element against errors with unknown probability distributions |
| US7324913B2 (en) * | 2006-02-01 | 2008-01-29 | International Business Machines Corporation | Methods and apparatus for testing a link between chips |
| CN101662820B (en) * | 2007-01-09 | 2014-12-24 | 华为技术有限公司 | Base station device, mobile station device, control information transmitting method, control information receiving method and program |
| US9781685B2 (en) | 2013-11-21 | 2017-10-03 | At&T Intellectual Property I, L.P. | Self-adaptive coverage of wireless networks |
| US10771194B2 (en) * | 2018-05-25 | 2020-09-08 | Arm Limited | Interconnection network for integrated circuit |
Family Cites Families (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4831624A (en) * | 1987-06-04 | 1989-05-16 | Motorola, Inc. | Error detection method for sub-band coding |
| US5056112A (en) | 1989-07-28 | 1991-10-08 | At&T Bell Laboratories | Interleaving in coded modulation for mobile radio |
| US5278862A (en) * | 1992-04-03 | 1994-01-11 | Intellon Corporation | Timing for spread-spectrum communication across noisy media |
| US5054035A (en) | 1989-12-21 | 1991-10-01 | At&T Bell Laboratories | Digital signal quality evaluation circuit using synchronization patterns |
| US5130987A (en) * | 1990-03-23 | 1992-07-14 | Metricom, Inc. | Method for synchronizing a wide area network without global synchronizing |
| EP0944179A3 (en) | 1991-08-23 | 2000-06-28 | Kabushiki Kaisha Toshiba | Radio information communication system |
| US5367539A (en) | 1991-12-31 | 1994-11-22 | At&T Bell Laboratories | Digital block processor for processing a plurality of transmission channels in a wireless radiotelephony system |
| GB9213273D0 (en) * | 1992-06-23 | 1992-08-05 | Digital Equipment Int | Efficient atm cell synchronization |
| US5509020A (en) * | 1993-05-27 | 1996-04-16 | Sony Corporation | Viterbi decoding apparatus and methods |
| US5425049A (en) * | 1993-10-25 | 1995-06-13 | Ericsson Ge Mobile Communications Inc. | Staggered frequency hopping cellular radio system |
| US5719883A (en) * | 1994-09-21 | 1998-02-17 | Lucent Technologies Inc. | Adaptive ARQ/FEC technique for multitone transmission |
| US5784368A (en) * | 1994-09-23 | 1998-07-21 | Motorola, Inc. | Method and apparatus for providing a synchronous communication environment |
| US5745479A (en) * | 1995-02-24 | 1998-04-28 | 3Com Corporation | Error detection in a wireless LAN environment |
| US5703902A (en) * | 1995-06-16 | 1997-12-30 | Qualcomm Incorporated | Method and apparatus for determining signal strength in a variable data rate system |
| US5692006A (en) | 1995-07-31 | 1997-11-25 | Qualcomm Incorporated | Adaptive despreader |
| US6289037B1 (en) * | 1997-02-24 | 2001-09-11 | At&T Wireless Services Inc. | Out of channel cyclic redundancy code method for a discrete multitone spread spectrum communications system |
-
1997
- 1997-02-24 US US08/803,831 patent/US6289037B1/en not_active Expired - Lifetime
-
1998
- 1998-02-24 EP EP98911401A patent/EP0962064B1/en not_active Expired - Lifetime
- 1998-02-24 DE DE69834478T patent/DE69834478T2/en not_active Expired - Lifetime
- 1998-02-24 WO PCT/US1998/003557 patent/WO1998037647A2/en active IP Right Grant
- 1998-02-24 CA CA002281818A patent/CA2281818C/en not_active Expired - Fee Related
-
2001
- 2001-07-12 US US09/902,730 patent/US6639935B2/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| EP0962064A2 (en) | 1999-12-08 |
| US6289037B1 (en) | 2001-09-11 |
| US20010040912A1 (en) | 2001-11-15 |
| WO1998037647A2 (en) | 1998-08-27 |
| EP0962064B1 (en) | 2006-05-10 |
| CA2281818A1 (en) | 1998-08-27 |
| US6639935B2 (en) | 2003-10-28 |
| WO1998037647A3 (en) | 1998-10-29 |
| DE69834478D1 (en) | 2006-06-14 |
| DE69834478T2 (en) | 2007-05-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2281818C (en) | Method to gain access to a base station in a discrete multitone spread spectrum communications system | |
| US5864543A (en) | Transmit/receive compensation in a time division duplex system | |
| US7339978B2 (en) | Adaptive weight update method and system for a discrete multitone spread spectrum communications system | |
| US5923700A (en) | Adaptive weight update method and system for a discrete multitone spread spectrum communications system | |
| CA2262360C (en) | Synchronization preamble method for ofdm waveforms in a communications system | |
| EP1234401B1 (en) | Variable rate coding for forward link | |
| US5872814A (en) | Method for linearization of RF transmission electronics using baseband pre-distortion in T/R compensation pilot signals | |
| US6782039B2 (en) | Vertical adaptive antenna array for a discrete multitone spread spectrum communications system | |
| US6600776B1 (en) | Vertical adaptive antenna array for a discrete multitone spread spectrum communications system | |
| RU2380845C2 (en) | Transmission with multiple carriers using multiple sizes of ofdm symbols | |
| JP3967385B2 (en) | Frequency division duplex communication method | |
| RU2390935C2 (en) | Variable-characteristic signalling channels for return communication line in wireless communication system | |
| US6621851B1 (en) | Priority messaging method for a discrete multitone spread spectrum communications system | |
| WO1998037654A9 (en) | Vertical adaptive antenna array for a discrete multitone spread spectrum communications system | |
| WO2005002103A1 (en) | Transmission method, transmission apparatus and communication system | |
| WO1998035458A1 (en) | Method of synchronizing a remote station with a base station in a discrete multitone spread spectrum communications system | |
| CA2503248C (en) | Highly bandwidth-efficient communications | |
| JP3029226B2 (en) | Frequency diversity transmission equipment | |
| MXPA99007730A (en) | Out of channel cyclic redundancy code method for a discrete multitone spread spectrum communications system | |
| Fortune | Multi-level modulation schemes for digital cellular mobile radio | |
| MXPA99002052A (en) | Synchronization preamble method for forms of multiplexion waves by orthogonal frequency division in a communication system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed | ||
| MKLA | Lapsed |
Effective date: 20120224 |