Next Patent: Radio communication system, terminal and packet
Next Patent: Radio communication system, terminal and packet
Plaque It!
Sponsored by: Flash of Genius |
[0001] The present application claims priority under 35 U.S.C. §119(e) to provisional Application, Attorney Docket No. PA010319P, filed May 7, 2001, the contents of which is incorporated herein by reference.
[0002] 1. Field
[0003] The present invention relates generally to communications systems, and more specifically, to systems and techniques to optimize channel allocations in a communications systems.
[0004] Modern communications systems are designed to allow multiple users to access a common communications medium. Numerous multiple-access techniques are known in the art, such as time division multiple-access (TDMA), frequency division multiple-access (FDMA), space division multiple-access, polarization division multiple-access, code division multiple-access (CDMA), and other similar multi-access techniques. The multiple-access concept is a channel allocation methodology which allows multiple user access to a common communications medium. The channel allocations can take on various forms depending on the specific multi-access technique. By way of example, in FDMA systems, the total frequency spectrum is divided into a number of smaller sub-bands and each user is given its own sub-band to access the communications medium. Alternatively, in TDMA systems, each user is given the entire frequency spectrum during periodically recurring time slots. In CDMA systems, each user is given the entire frequency spectrum for all of the time but distinguishes its transmission through the use of a unique code.
[0005] CDMA is a modulation and multiple access technique based on spread-spectrum communications. In a CDMA communications system, a large number of signals share the same frequency spectrum. This is achieved by transmitting each signal with a different code that modulates a carrier, and thereby, spreads the spectrum of the signal waveform. The transmitted signals are separated in the receiver by a correlator that uses a corresponding code to despread the desired signal's spectrum. The undesired signals, whose codes do not match, are not despread in bandwidth and contribute only to noise.
[0006] The use of CDMA techniques for multiple access communications generally provides increased user capacity over traditional TDMA and FDMA techniques. As a result, more users can access a network, or communicate with one another, through one or more base stations. In CDMA communications systems, the channel allocations are based on orthogonal sequences known as Walsh codes. Theoretically, maximum capacity of the CDMA communications system can be achieved when each available Walsh code is used to spread the traffic channels between multiple users. However, as a practical matter, numerous Walsh code channels may be required to support various control channels such as the pilot channel and other commonly used control channels. These control channels can generally be thought of as overhead which tends to consume bandwidth and decrease user capacity by reducing the number of Walsh channels available for traffic. With the tremendous increase in wireless applications over the past years, there is a need for a more efficient and robust data format which reduces overhead and increases throughput. This need is not limited to CDMA communications, but applies to various other communications systems.
[0007] In one aspect of the present invention, a method of communications includes forming a data packet, selecting a plurality of transmission parameters for the data packet, generating information having one of a plurality of codes identifying the transmission parameters, and transmitting the data packet on a first channel and the information on a second channel.
[0008] In another aspect of the present invention, a transmitting device includes a channel scheduler configured to select a plurality of transmission parameters for a data packet, and generate information having one of a plurality of codes identifying the transmission parameters, a channel element configured to generate the data packet as a function of the transmission parameters, and a transmitter configured to transmit the data packet on a first channel and the information on a second channel.
[0009] In yet another aspect of the present invention, computer-readable media embodying a program of instructions executable by a computer program performs a method of communications includes forming a data packet, selecting a plurality of transmission parameters for the data packet, generating information having one of a plurality of codes identifying the transmission parameters, and transmitting the data packet on a first channel and the information on a second channel.
[0010] In a further aspect of the present invention, a transmitting device includes means for selecting a plurality of transmission parameters for a data packet, means for generating information having one of a plurality of codes identifying the transmission parameters, means for generating the data packet as a function of the transmission parameters, and transmission means for transmitting the data packet on a first channel and the information on a second channel.
[0011] In yet a further aspect of the present invention, communications system includes a base station having a channel scheduler configured to select a plurality of transmission parameters for a data packet, and generate information having one of a plurality of codes identifying the transmission parameters, a channel element configured to generate the data packet as a function of the transmission parameters, and a transmitter configured to transmit the data packet on a first channel and the information on a second channel, and a subscriber station configured to receive the transmitted information, and use said one of the codes to receive the transmitted data packet.
[0012] It is understood that other aspects of the present invention will become readily apparent to those skilled in the art from the following detailed description, wherein is shown and described only exemplary embodiments of the invention, simply by way of illustration. As will be realized, the invention is capable of other and different embodiments, and its several details are capable of modifications in various respects, all without departing from the invention. Accordingly, the drawings and description are to be regarded as illustrative in nature, and not as restrictive.
[0013] Aspects of the present invention are illustrated by way of example, and not by way of limitation, in the accompanying drawings in which like reference numerals refer to similar elements wherein:
[0014]
[0015]
[0016]
[0017]
[0018]
[0019] The detailed description set forth below in connection with the appended drawings is intended as a description of exemplary embodiments of the present invention and is not intended to represent the only embodiments in which the present invention can be practiced. The term “exemplary” used throughout this description means “serving as an example, instance, or illustration,” and should not necessarily be construed as preferred or advantageous over other embodiments. The detailed description includes specific details for the purpose of providing a thorough understanding of the present invention. However, it will be apparent to those skilled in the art that the present invention may be practiced without these specific details. In some instances, well-known structures and devices are shown in block diagram form in order to avoid obscuring the concepts of the present invention.
[0020] In an exemplary embodiment of a communications system, a data packet can be formed with various transmission parameters such as data rate and modulation format. A data compression algorithm can be applied to information identifying the transmission parameters of the data packet and transmitted over a control channel.
[0021] Various aspects of the present invention will be described in the context of a CDMA communications system supporting circuit-switch voice and high speed packet data applications. However, those skilled in the art will appreciate that these inventive aspects are likewise suitable for use in various other communications environments. Accordingly, any reference to a CDMA communications system is intended only to illustrate the inventive aspects of the present invention, with the understanding that such inventive aspects have a wide range of applications.
[0022]
[0023]
[0024] The selector element
[0025] The base station
[0026] The control and scheduling functions can be provided by a channel scheduler
[0027] The channel scheduler
[0028] The forward link transmission generated by the base station
[0029] In at least one embodiment of a CDMA communications system employing multiple slot transmissions, the primary and secondary packet data control channels can be consolidated into one forward packet data control channel. In this embodiment, the number of time slots occupied by the information subpacket carried on the forward packet data control channel can be determined from subpacket itself. This can be achieved in a variety of fashions. By way of example, a cyclic redundancy check (CRC) value can be included in the information subpacket carried on the forward packet data control channel. The CRC can be calculated by performing a known algorithm on the bit sequence forming the information subpacket. At the subscriber station, a CRC check function can be performed on information subpackets addressed to the subscriber station via the MAC ID. Specifically, the CRC can be recalculated over various time slot arrangements, and the recalculated CRC values can be compared to the CRC value included in the information subpacket. The length of the information subpacket, i.e., the number of time slots occupied by the information subpacket, can then be determined from the recalculated CRC value that matches the CRC value from the information subpacket. If none of the CRC values recalculated by the subscriber station match the CRC value from the information subpacket, then the subscriber station assumes that the corresponding data subpacket was intended for another subscriber station.
[0030] Once the number of time slots occupied by the information subpacket is determined, it can be used to decode the corresponding data packet. If the subscriber station can successfully decode the data packet, which includes the current data subpacket and any previously received data subpackets for the data packet, then the subscriber station sends can acknowledgment (ACK) response to the base station. If the data packet cannot be successfully decoded, the subscriber station then sends a negative acknowledgement (NACK) response requesting additional data subpackets. The data packet may be deemed successfully decoded if the data packet CRC checks.
[0031] The CRC protected subpacket may also provide additional benefits. By way of example, increased system throughput may be realized by decreasing the false-alarm probability of the forward packet data control channel. The false-alarm probability is the probability that a subscriber station will attempt to erroneously decode a data subpacket intended for another subscriber station.
[0032] Further increases in user capacity and throughput may be achieved by expanding the length of the MAC ID from 6-bits to 8-bits to increase the number of users that can access the CDMA communications system. The exact number of bits used for the MAC ID is a matter of design and may vary depending on the overall design criteria of the communications system and the performance requirements. Regardless of the number of bits ultimately selected by the skilled artisan, an expanded MAC ID can reduce the delay and signaling overhead associated with frequent changes in active users. The expanded MAC ID length may also minimize the false-alarm probability by requiring more bits to be matched with the subscriber station MAC ID before the information subpacket is declared valid. By minimizing the false-alarm probability, the throughput of the CDMA communications system may be increased. Those skilled in the art will readily be able to assess performance tradeoffs of the system to ascertain the optimal bit length for the MAC ID to maximize user capacity and throughput.
[0033] In at least one exemplary embodiment of a CDMA communications system, a data compression algorithm can be used to minimize the overhead required to transmit the information needed for decoding the forward packet data channel. This can be achieved by establishing various forward link transmission formats and assigning a binary code to each transmission format. By way of illustration, the channel element
[0034] Table 1 illustrates one possible approach for transmitting the data subpackets over the forward link using twenty-eight 32-chip Walsh subchannels. In this embodiment, there are twenty-four possible forward link transmission formats with six different data packet sizes, fifteen different data rates, and three different modulation formats for transmission over one, two, four or eight time slots.
TABLE 1 Number of Number Number Payload of Number Number Sub-packet Number of Modulation Payload of of 32-Chip Data of Slots Modula- Effective Payload Symbols Binary Bits per Walsh Rate per Sub- tion Code Modulation per Walsh Code Packet Channels (kbps) packet Order Rate Symbols Channel Symbols 384 28 38.4 8 2 0.017857 10,752 384 21,504 384 28 76.8 4 2 0.035714 5,376 192 10,752 768 28 76.8 8 2 0.035714 10,752 384 21,504 384 28 153.6 2 2 0.071429 2,688 96 5,376 768 28 153.6 4 2 0.071429 5,376 192 10,752 1,536 28 153.6 8 2 0.071429 10,752 384 21,504 2,304 28 230.4 8 2 0.107143 10,752 384 21,504 384 28 307.2 1 2 0.142857 1,344 48 2,688 768 28 307.2 2 2 0.142857 2,688 96 5,376 1,536 28 307.2 4 2 0.142857 5,376 192 10,752 3,072 28 307.2 8 2 0.142857 10,752 384 21,504 4,224 28 422.4 8 2 0.196429 10,752 384 21,504 2,304 28 460.8 4 2 0.214286 5,376 192 10,752 768 28 614.4 1 2 0.285714 1,344 48 2,688 1,536 28 614.4 2 2 0.285714 2,688 96 5,376 3,072 28 614.4 4 2 0.285714 5,376 192 10,752 4,224 28 844.8 4 2 0.392857 5,376 192 10,752 2,304 28 921.6 2 2 0.428571 2,688 96 5,376 1,536 28 1,228.8 1 2 0.571429 1,344 48 2,688 3,072 28 1,228.8 2 2 0.571429 2,688 96 5,376 4,224 28 1,689.6 2 2 0.785714 2,688 96 5,376 2,304 28 1,843.2 1 3 0.571429 1,344 48 4,032 3,072 28 2,457.6 1 4 0.571429 1,344 48 5,376 4,244 28 3,379.2 1 4 0.785714 1,344 48 5,376
[0035] Table 2 illustrates an exemplary compression algorithm for specifying the data subpacket format and ID of Table 1. The data subpacket format specifies one of the forward link transmission formats for a fixed number of available Walsh subchannels and the data subpacket ID identifies the data subpackets. The described exemplary data subpacket format and ID is 6-bits in length, and therefore, has sixty-four values. The first twenty-four values, i.e., 00
TABLE 2 Value Meaning 00 Initial Subpacket (Subpacket ID = 0) with a Format of 0 to 23 18 Reserved 3D Noninitial Subpacket with a Subpacket ID of 1 to 3
[0036] The exemplary compression algorithm described in connection with Table 2 may also reduce the false-alarm probability, and thereby, increase system throughput. Since more than one-half of the binary codes for the data subpacket format and ID are not used, the probability that this 6-bit sequence, if corrupted by the communications channel, will match a valid sequence is less than one-half. Those skilled in the art will be readily able to ascertain system tradeoffs to determine the optimal compression algorithm to enhance system performance. By way of example, the bit sequence can be expanded to increase the number of transmission formats available and/or the throughput of the system at the cost of additional overhead. Alternatively, the compression algorithm can be fixed at 6-bits with additional transmission formats being assigned to the unused values at the risk of a higher false-alarm rate. Conversely, the number of transmission formats can be reduced resulting in more unused values which tends to decrease the false-alarm probability.
[0037] The compression algorithm for specifying the data subpacket format and ID of Table 1 can be reduced twofold by using the slot duration of the information subpacket to specify the slot duration of the corresponding data subpacket. By way of example, the information subpacket on the forward packet data control channel can be transmitted over one time slot for a one time slot data subpacket, two time slots for a two time slot data subpacket, or four time slots for a four or eight time slot data subpacket. This approach reduces the number of possible subpacket formats from twenty-four to twelve. As a result, only the first twelve values, i.e., 00
[0038] The channel element
[0039] The channel element
[0040]
[0041] The 24-bit CRC protected payload can be provided to an encoder tail generator
[0042] The 32-bit CRC protected payload with the encoder tail can be provided to a convolutional encoder
[0043] The 96-symbol sequence generated by the convolutional encoder
[0044] Various processing techniques can be applied to the two 48-symbol sequences to minimize the affect of burst errors on the ability of the decoder at the subscriber station to decode the symbol sequence. By way of example, the two 48-symbol sequences from the demultiplexer
[0045] The symbol sequence from the block interleaver
[0046] Alternatively, the forward packet data control channel can be transmitted over a single Walsh subchannel to conserve resources during periods of high demand among the packet data users. With this approach, the demultiplexer
[0047]
[0048] The main difference between the one and two slot transmission formats is the addition of a sequence repeater
[0049] The 192-symbol sequence can be coupled to the demultiplexer
[0050] The symbol sequence from the block interleaver
[0051] Alternatively, the forward packet data control channel can be transmitted over a single Walsh subchannel. This can be accomplished in a variety of fashions. By way of example, the demultiplexer
[0052] Further reductions in computational complexity for a single Walsh subchannel transmission can be achieved by simply eliminating the sequence repeater
[0053]
[0054] The 96-symbol sequence can be provided to the sequence repeater
[0055] The demultiplexer
[0056] The symbol sequence from the block interleaver
[0057] The symbol sequences from the sequence repeaters
[0058] The configuration of the channel element
[0059] In yet another approach for a single Walsh subchannel transmission having a four-slot format, the demultiplexer
[0060] Returning to
[0061] In an exemplary CDMA communications system, the samples are released from the memory
[0062] To reduce computation complexity and conserve processor resources, one time slot worth of samples are initially released from the memory
[0063] Assuming that the decoded bit sequence includes the MAC ID for the subscriber station, the decoded bit sequence can then provided to a CRC generator
[0064] Those skilled in the art will appreciate that the various illustrative logical blocks, modules, circuits, and algorithms described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and algorithms have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
[0065] The various illustrative logical blocks, modules, and circuits described in connection with the embodiments disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor DSP, an ASIC, a FPGA or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
[0066] The methods or algorithms described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal. In the alternative, the processor and the storage medium may reside as discrete components in a user terminal.
[0067] The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.