RU2427961C2 - Data transfer by means of auxiliary resources - Google Patents

Abstract

FIELD: information technologies.

SUBSTANCE: multiple subpackets from a data packet are generated, the last subpacket is processed into coded parts in quantity that is equal to a total quantity of subpackets, multiple subpackets are sent so that the whole subpacket is transferred along a traffic channel, and coded parts of the last subpacket are transferred along the specified auxiliary resources.

EFFECT: minimised repetition of coded bits.

18 cl, 21 dwg

Description

Cross reference to related application (s)

This application claims priority to provisional patent application US No. 60/833,627, filed July 26, 2006 and entitled "DATA TRANSMISSION WITH SUPPLEMENTAL RESOURCES", and provisional patent application US No. 60/834,126, filed July 27, 2006 and entitled "DATA TRANSMISSION WITH SUPPLEMENTAL RESOURCE ", which are hereby incorporated by reference in their entirety.

State of the art

The advent of various communication systems and the spread of sophisticated applications in mobile systems has led to a lack of available resources, such as frequencies available for communication. Various multi-access technologies have been proposed that support traffic growth in communication networks. Frequency Division Multiple Access (FDMA) represents one such technology that allows communication by assigning and reusing frequencies between different users. Another example of multiple access technology is code division multiple access (CDMA), which employs a spread spectrum technique to simultaneously accommodate different users in a wide range.

Accordingly, CDMA systems are characterized by impulse transmission, in which communication channels are filled during data transmission, but remain unused at other points in time. This is corrected by the flexible use of channels, in which channels are assigned to different tasks as needed. Thus, channels are assigned to the user only during data transmission, are reassigned for other tasks during the period when data is not transmitted, and reassigned after data transmission.

Channels in a communication system can be divided into physical and logical channels, with physical channels being frequencies carrying transmissions, and logical channels are schematic sections created at these frequencies based on tasks to be carried out. Therefore, one physical channel can be divided into one or more logical channels. In other words, logical channels are different names assigned to physical frequencies based on urgent tasks.

Physical channels are usually further divided into dedicated channels and common channels depending on the facilities being served. A dedicated channel is assigned to facilitate communication between the base station and a specific user. The common channel is shared by different users and is used by the base station to transmit signals that are shared to all users in the geographic area (cell) served by the base station. Examples of dedicated channels include a fundamental channel (FCH), a dedicated control channel (DCCH), and an auxiliary channel (SCH). The FCH may transmit a speech signal, a data signal, and a signaling signal or a control signal. The DCCH transmits data signals as well as control signals in discontinuous transmission mode, in which data transmission occurs only if data transmission is generated from a higher layer, which makes the DCCH suitable as a control channel for efficiently providing packet service. SCH is a channel that, optionally, is used when it is necessary to transfer a large amount of data. Examples of common channels on a forward / downlink from a base station to a mobile station include, in particular, a paging channel, a broadcast channel, and a direct common control channel. An access channel, an extended access channel, and a reverse common control channel are examples of common channels on the reverse link.

Logical channels established on dedicated physical channels include a dedicated signaling channel (DSCH) and a dedicated traffic channel (DTCH). DSCHs can be assigned on the FCH and DCCH for exchanging control signals between the base station and the mobile station, while DTCHs can be set on the FCH, DCCH and SCH for exchanging user data. The common logical channels assigned on the common physical channels include a common destination channel used by the base station to acknowledge the user / mobile terminal, a common control channel (CSCH) for transmitting a control signal, and a common traffic channel (CTCH) for transmitting user data. Common logical channels can be installed on the forward link, as well as on the reverse link.

When the data is generated for transmission by the user, the service request is transmitted through the established communication channels and, based on the agreed service / use capabilities, resources are assigned to the user. Accordingly, various control and data resources are assigned on shared / dedicated channels. For example, auxiliary resources can be assigned subject to availability, if it is assumed that a large amount of data will be transmitted, and if the service capabilities associated with the user allow the assignment of such auxiliary resources. A resource assignment message detailing various resources, including information regarding allocated auxiliary resources, is transmitted by the base station to the user after allocation of resources. Therefore, when the user transmits data, the data is demodulated based on the assigned resources.

For various reasons, for example, due to a limited range and harmful effects, such as Doppler shift on moving terminals, the resource assignment message from the base station may be destroyed. This leads to a situation where the user is not able to demodulate messages, because he does not know what, if at all, resources have been assigned for this particular communication session. For example, if service capabilities allow the allocation of auxiliary resources, the destruction of the resource assignment message does not allow the user to know whether any auxiliary resources have been assigned. Additionally, the presence of auxiliary resources may lead to non-optimal repetition of the encoded bits.

SUMMARY OF THE INVENTION

The following is a brief description of the claimed invention to provide an understanding of the basics of some aspects of the claimed invention. This brief description is not an extensive overview of the claimed invention. It is neither intended to identify key or critical elements of the claimed invention nor to limit the scope of the claimed invention. Its sole purpose is to present some concepts of the claimed invention in a simplified form as a prelude to the more detailed description that is presented below.

A communication system in accordance with various aspects described herein provides for the allocation of auxiliary resources for transmitting traffic data. A control channel in a communication system contains link assignment units (LABs) that are mapped to channel nodes reserved for the control channel. If any of the LABs are not involved in the transfer of control signals, the channel nodes associated with such LABs are used as auxiliary resources for transmitting traffic data. The processor processes the data packet from the traffic data into S subpackets of encoded data. When the first subpacket is transferred by the base station to the terminal on a forward link, the terminal generates an acknowledgment (ACK) if the subpacket is decoded correctly, or a negative acknowledgment (NAK) if the subpacket is decoded with errors. Upon receiving an ACK or NAK message, the base station transmits a second subpacket. The terminal receives the second transmission, decodes the first and second subpackets, and transmits an ACK or NAK based on the decoding result. Thus, the base station transmits one subpacket one by one until it receives the ACK for the packet, or until all the subpackets have been transmitted, or until the packet transmission is completed.

Another aspect relates to a communication system that facilitates the transmission of data packets with minimal repetition of encoded bits. The system comprises a processor that generates subpackets from a data packet that contains P information bits encoded in Q encoded bits at a P / Q code rate. The system also contains a buffer from which the generated subpackets are populated by taking Q encoded bits in cyclic mode. The communication system transmits subpackets in such a way that the entire subpacket is transmitted over the traffic channel, while the corresponding coded portion of the last subpacket is transmitted over the available auxiliary resources, thereby minimizing the repetition of the coded bits due to the presence of auxiliary resources in the communication system.

According to another aspect, a transmission method is disclosed, which comprises indicating to the base station whether the transmitted data subpacket is decoded correctly. The method begins with the fact that traffic data is processed into subpackets of encoded data. The first subpacket is transmitted in a straight line. After receiving at the terminal, the first subpacket is decoded. If the subpacket is decoded correctly, an acknowledgment (ACK) is generated. If the subpacket is not decoded correctly, a negative acknowledgment (NAK) is generated. Thus, subpackets are transmitted until at least one ACK message for the packet is received, or until all subpackets are used, or until the packet transmission is completed.

According to another aspect, a method for transmitting data packets is disclosed. The method comprises generating subpackets from a data packet that contains P information bits encoded in Q encoded bits at a P / Q code rate. Then, the generated subpackets are filled with Q encoded bits in a cyclic mode, in which, after filling with the Qth bit, the first bit is filled again. After that, all subpackets are transmitted in such a way that the entire subpacket is transmitted over the traffic channel, while the encoded part of the last subpacket is transmitted over the available auxiliary resources.

The following description and the annexed drawings set forth in detail certain illustrative aspects of the claimed invention. However, these aspects indicate only a few different ways of applying the principles of the claimed invention, and the claimed invention is intended to include all such aspects and their equivalents. Other advantages and features of the claimed invention will become apparent from the following detailed description of the claimed invention, taken in conjunction with the drawings.

Brief Description of the Drawings

1 is a multiple access wireless communication system in accordance with various aspects disclosed herein.

Figure 2 is a block diagram of a communication system.

3 is an embodiment of a channel structure for a forward link or a downlink.

4A is an example of mapping a LAB to reserved channel nodes according to an aspect.

4A is a block diagram of an embodiment of a transmitter according to an aspect.

4B is an example in which only one control message is transmitted on LAB 1 according to an aspect.

5 is an embodiment of a message format for a control channel assignment message used to carry control messages transmitted on a control channel.

6A is a diagram of a HARQ transmission with dynamically assigned auxiliary resources.

6B is a diagram of four HARQ transmissions according to an aspect.

7A is an embodiment of a HARQ transmission scheme implemented with dynamically assigned auxiliary resources.

7B is a diagram of four HARQ transmissions according to an aspect.

8A is an embodiment of a HARQ transmission scheme implemented with dynamically assigned auxiliary resources.

8B is a diagram of four HARQ transmissions in accordance with an aspect.

Figa - the first four HARQ transmissions for an illustrative scenario according to an aspect.

9B is a diagram of four HARQ transmissions according to an aspect.

10 is an embodiment illustrating a method for allocating auxiliary resources in a communication network.

11 is an embodiment illustrating a method for determining whether any auxiliary resources have been assigned to carry traffic data.

12 is a diagram of the transfer of data packets using both traffic channels and an auxiliary resource.

FIG. 13 is another data packet transmission method that can be applied when auxiliary resources are available.

FIG. 14 is yet another data packet transmission method that can be applied when auxiliary resources are available.

Detailed description

The claimed invention is described here with reference to the drawings, in which like numbers are used to denote like elements. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the claimed invention. However, it is obvious that the claimed invention can be practiced without these specific details. In other examples, well-known structures and devices are shown in block diagram form in order to facilitate describing the claimed invention.

Various embodiments are described herein with reference to the drawings, in which like numbers are used to denote like elements. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of one or more aspects. However, it is obvious that such option (s) may be practiced without these specific details. In other examples, well-known structures and devices are shown in block diagram form in order to facilitate describing one or more embodiments. The terms “component”, “module”, “system”, etc., used in this application refer to a computer object, namely hardware, firmware, a combination of hardware and software, software, or running software. For example, a component may, but is not required to, be a process running on a processor, a processor, an object, an executable module, a thread of execution, a program, and / or a computer. By way of illustration, the component can be either an application running on a computing device or the computing device itself. One or more components may (may) be located in the process and / or thread of execution, and the component may be located on one computer and / or distributed between two or more computers. In addition, these components can be run from various computer-readable media on which various data structures are stored. Components can communicate through local and / or remote processes, for example, according to a signal having one or more data packets (for example, data from one component interacting with other components in a local system, distributed system, and / or over a network, such as the Internet, with other systems via signal).

In addition, various embodiments are described herein in connection with a wireless terminal and / or base station. A wireless terminal may refer to a device that provides voice and / or data to a user. The wireless terminal may be connected to a computing device, such as a laptop computer or desktop computer, or may be a standalone device, such as a personal digital assistant (PDA). A wireless terminal may also be called a system, subscriber unit, subscriber station, mobile station, mobile device, remote station, access point, remote terminal, access terminal, user terminal, user agent, user device, or user equipment. A wireless terminal may be a subscriber station, a wireless device, a cellular telephone, a PCS telephone, a wireless telephone, a Session Initiation Protocol (SIP) telephone, a wireless subscriber access station (WLL), a handheld personal computer (PDA), and a handheld device with wireless capability, or another processing device connected to the wireless modem. A base station (eg, access point) may refer to a device in an access network that communicates over the air, through one or more sectors, with wireless terminals. The base station can act as a router between the wireless terminal and the rest of the access network, which can include an Internet Protocol (IP) network, by converting the received frames of the radio interface to IP packets. The base station also coordinates attribute management for the radio interface. In addition, the various aspects or features described herein may be implemented as a method, device, or product of manufacture using standard programming and / or design methods. As used herein, the term “article of manufacture” is intended to encompass a computer program accessible from any computer-readable device, medium, or medium. For example, a computer-readable medium may include, but is not limited to, a magnetic storage device (e.g., hard disk, floppy disk, magnetic strips ...), optical disks (e.g., compact disc (CD), digital versatile disk (DVD) ...), smart cards and flash drives (e.g. card, ruler, USB drive ...).

Various embodiments will be presented in relation to systems, which may include a number of devices, components, modules, etc. Obviously, various systems may include additional devices, components, modules, etc. and / or may not include all devices, components, modules, etc., discussed in connection with the figures. You can also use a combination of these approaches.

1 shows a wireless multiple-access communication system 100 in accordance with various aspects. In one example, multiple access wireless communication system 100 includes multiple base stations 110 and multiple terminals 120. Each base station 110 and each terminal 120 in system 100 may have one or more antennas to facilitate communication with one or more base stations 110 and / or terminals 120 in system 100. In one example, base station 110 may simultaneously transmit multiple data streams for broadcast, multicast, and / or unicast services in which the data stream is a data stream that may be of individual interest to terminal 120. Terminal 120 in the coverage area of base station 110 may then receive one or more data streams transmitted from base station 110. By way of non-limiting example, base station 110 may be an access point, Node B and / or other appropriate network entity. Each base station 110 provides communication coverage for a particular geographic area 102. As used herein and generally in the art, the term “cell” may refer to base station 110 and / or its coverage area 102, depending on the context in which the term is used. To increase the capacity of the system, the coverage area 102 corresponding to the base station 110 can be divided into multiple smaller areas (e.g., areas 104a, 104b, and 104c). Each of the smaller areas 104a, 104b, and 104c may be served by a respective base transceiver subsystem (BTS not shown). As used herein and generally in the art, the term “sector” may refer to the BTS and / or its coverage area depending on the context in which the term is used. In a cell 102 having multiple sectors 104, BTSs for all sectors 104 of the cell 102 may be combined in base station 110 for the cell 102.

In another example, system 100 can utilize a centralized architecture by employing a system controller 130 that can be connected to one or more base stations 110 and provide coordination and control for base stations 110. According to alternative aspects, system controller 130 may be a single network An object or set of network objects. Additionally, system 100 may utilize a distributed architecture that allows base stations 110 to communicate with each other as needed. In one aspect, terminals 120 may be distributed throughout system 100. Each terminal 120 may be fixed or mobile. By way of non-limiting example, terminal 120 may be an access terminal (AT), a mobile station, user equipment, a subscriber station, and / or another appropriate network entity. The terminal may be a wireless device, a cell phone, a personal digital assistant (PDA), wireless modem, handheld device, etc. In one example, terminal 120 may transmit data to base station 110 or to another terminal 120.

According to another aspect, system 100 may generate transmission resources in the form of channels. By way of non-limiting example, these channels can be generated by one or more of code division multiplexing (CDM), frequency division multiplexing (FDM), and time division multiplexing (TDM). Orthogonal Frequency Division Multiplexing (OFDM), a form of FDM, can be used to efficiently split the entire band of the system 100 into multiple orthogonal subcarriers, which can then be modulated with data. These subcarriers can also be called tones, bins, and frequency channels. Alternatively, according to a time division based method, each subcarrier may comprise a portion of consecutive time slots or time slots. Each terminal 120 may be provided with one or more combinations of time slots / subcarriers for transmitting and receiving information in a given pulse period or frame. The time division method may also use a symbol rate switching scheme and / or block switching scheme.

In another example, a code division based technique may facilitate data transmission over several frequencies available at any time in a range. Data can be digitized and distributed over the available bandwidth of the system 100 so that multiple terminals 120 can overlap the channel, and a unique sequence code can be assigned to the corresponding terminals 120. Terminals 120 can then transmit in the same broadband portion of the spectrum in which the signal corresponding to each terminal 120 is spread over the entire band with a corresponding unique spreading code. In one example, this method can provide sharing in which one or more terminals 120 can simultaneously transmit and receive. Such sharing can be achieved, for example, by spread spectrum digital modulation, in which a bit stream corresponding to terminal 120 is encoded and distributed over a very wide channel in a pseudo-random manner. Base station 110 can then recognize a unique sequence code associated with terminal 120 and cancel randomization to collect bits for a specific terminal 120 in coherent mode.

In another example, system 100 may use one or more multiple access schemes, such as CDMA, TDMA, FDMA, OFDMA, Single Carrier FDMA (SC-FDMA) and / or other suitable multiple access schemes. OFDMA employs Orthogonal Frequency Division Multiplexing (OFDM), and SC-FDMA employs Single Carrier Frequency Division Multiplexing (SC-FDM). Additionally, system 100 may use a combination of multiple access schemes, such as OFDMA and CDMA. Additionally, system 100 may utilize various framing structures to indicate how data and signaling are transmitted on the forward and reverse links. System 100 may optionally use one or more dispatchers (not shown) to assign lanes and other system resources. In one example, a dispatcher can be applied to one or more base stations 110, terminal 120, and system controller 130.

FIG. 2 shows a block diagram of an embodiment of a transmitting system 210 (also known as an access point) and a receiving system 250 (also known as an access terminal) in a MIMO 200 system. On the transmitting system 210, traffic data for a number of data streams comes from a source data 212 to a TX data processor 214.

According to an embodiment, each data stream is transmitted through a respective transmit antenna. TX data processor 214 formats, codes, and interleaves the traffic data for each data stream based on a particular coding scheme selected for that data stream to provide encoded data.

The coded data for each data stream can be multiplexed with pilot data using OFDM techniques. The pilot data is typically a known data pattern that is processed in a known manner and which can be used at the receiving system to estimate channel performance. Then, the multiplexed pilot data and encoded data for each data stream is modulated (i.e., mapped into symbols) based on a particular modulation scheme (e.g., BPSK, QSPK, M-PSK or M-QAM) selected for that data stream for provide modulation symbols. The data rate, coding, and modulation for each data stream may be determined by instructions executed by processor 230.

Modulation symbols for all data streams are fed to a MIMO TX processor 220, which can further process modulation symbols (e.g., for OFDM). The MIMO TX processor 220 provides N _T modulation symbol streams to N _T transmitters (TMTR) 222a-222t. In some embodiments, the MIMO TX processor 220 applies beamforming weights to the symbols of the data streams and to the antenna from which the symbol is transmitted.

Each transmitter 222 receives and processes a respective symbol stream to provide one or more analog signals, and further converts (e.g., amplifies, filters, and boosts) the analog signals to provide a modulated signal suitable for transmission over the MIMO channel. Then, N _T modulated signals from transmitters 222a-222t are transmitted from N _T antennas 224a-224t, respectively.

At the receiving system 250, the transmitted modulated signals are received by N _R antennas 252a-252r, and the received signal from each antenna 252 is supplied to a respective receiver (RCVR) 254a-254r. Each receiver 254 converts (eg, filters, amplifies, and lowers the frequency) the corresponding received signal, digitizes the converted signal to provide samples, and further processes the samples to provide a corresponding “received” symbol stream.

Then, RX data processor 260 receives and processes the N _R received symbol streams from N _R receivers 254 based on a specific receiver processing technique to provide N _T “detected” symbol streams. Then, the RX data processor 260 demodulates, deinterleaves, and decodes each detected symbol stream to recover traffic data for the data stream. The processing by RX data processor 260 is complementary to that performed by TX MIMO processor 220 and TX data processor 214 on transmission system 210.

The processor 270 periodically determines which precoding matrix to use (discussed below). The processor 270 generates a reverse link message comprising an index portion and a matrix rank value portion.

The reverse link message may contain various types of information related to the communication link and / or the received data stream. The reverse link message is then processed by TX data processor 238, which also receives traffic data for a number of data streams from data source 236, is modulated by modulator 280, converted by transmitters 254a-254r, and transmitted back to transmitter system 210.

At transmitter system 210, modulated signals from receiver system 250 are received by antennas 224, converted by receivers 222, demodulated by demodulator 240, and converted by RX data processor 242 to extract the reverse link message transmitted by receiver system 250. Then, processor 230 determines which precoding matrix to use for determining the weighting factors of the beam formation, then processes the selected message.

The data transmission methods described here can be used for various communication systems, for example, code division multiple access (CDMA) systems, frequency division multiple access (FDMA) systems, time division multiple access systems (TDMA), spatial division multiple access systems ( SCMA), orthogonal FDMA systems (O-FDMA) and single carrier frequency division multiplexing (SC-FDM) systems. The OFDMA system uses orthogonal frequency division multiplexing (O-FDM). The SC-FDMA system uses single-carrier frequency division multiplexing (SC-FDM). OFDM and SC-FDM divide the system band into multiple (K) orthogonal subcarriers, which are also referred to as tones, bins, etc. Each subcarrier may be modulated with data. In general, modulation symbols are transmitted in the frequency dimension by OFDM and in the time dimension by SC-FDM. For clarity, the methods are described with reference to the OFDMA system.

The system can define physical channels to facilitate the allocation and use of available system resources. The physical channel is a means for transmitting data at the physical level. The physical channel used to transmit traffic data (or user data) is called a traffic channel. The physical channel used to transmit control (or signaling) data is called a control channel. Physical channels can be specified for any type of system resources, such as subcarriers, time intervals, code sequences, etc.

FIG. 3 shows an embodiment of a channel structure 300 for a forward link or a downlink. The channel structure 300 includes N channel nodes that are associated with different system resources, where N can be of any integer value. For example, N channel nodes may be displayed in N different mosaic elements based on a mapping scheme. Each tile may cover a predetermined number (e.g., 16) of subcarriers during a predetermined number (e.g., 8) symbol periods. Channel nodes may correspond to the base nodes of the channel tree.

According to the embodiment shown in FIG. 3, M channel nodes are reserved for the control channel, where, in the general case, 1 ≤ M N N. The control channel can be used to transmit control messages to the terminals. Control messages may include unicast messages transmitted to specific terminals and used to assign resources of the forward link and / or reverse link, to provide access, etc. According to an embodiment, each control message has a predetermined size (for example, a specific number of information bits) and is processed with a specific coding and modulation scheme to generate a specific number of modulation symbols. According to this embodiment, different control messages have the same number of modulation symbols. M channel nodes can also be used for signaling channels, for example, an acknowledgment channel (ACKCH), a power control channel (PCCH), etc. Resources dedicated to these other signaling channels may be permanent and not be used for other purposes.

The number of channel nodes (M) (and therefore the amount of system resources) to reserve for the control channel is determined by the maximum number of control messages (L) that can be transmitted for the control channel in a given frame or time interval, by the number of modulation symbols per control message, and transmission capacity of each channel node. L can be chosen so that (1) the dispatcher can operate efficiently and is not limited by signaling restriction, and (2) the overhead for the control channel is as low as possible. Then M can be determined based on the selected L and other parameters. L and M can be tunable (e.g., quasistatic) system parameters, and tuned values of these parameters can be transmitted via the broadcast channel. In an exemplary embodiment, M is approximately 3 or 4, each channel node can carry approximately 40 modulation symbols, and approximately 120 to 160 modulation symbols are allocated to the control channel. Up to L control messages can be transmitted over the control channel in this frame with M reserved channel nodes. According to various aspects, the control nodes are explicitly assigned to the AT through the assignment message, similar to the resource assignment for the AT.

FIG. 3 also shows an embodiment of a control channel 300. According to this embodiment, the control channel comprises L link assignment units (LABs) that are mapped to M reserved channel nodes based on a predetermined mapping scheme. The L LAB can be used to carry L control messages, one control message in each LAB.

The remaining N-M channel nodes can be used for traffic channels and / or other physical channels, for example, a broadcast channel, a pilot channel, etc. In the example shown in FIG. 3, channel nodes M + 1 through M + 3 are allocated to traffic channel 1, channel nodes M + 4 and M + 5 are allocated to traffic channel 2, etc. In general, any number of channel nodes can be allocated to each traffic channel.

According to an embodiment, one or more traffic channels are associated with M reserved channel nodes for the control channel. In general, a given traffic channel can be associated with any number and any of the reserved channel nodes. M reserved channel nodes can also be associated with any number and any of the traffic channels. The connection between the traffic channels and the reserved channel nodes can be quasi-static, for example, determined whenever the reserved channel nodes are configured for the control channel and / or whenever the traffic channels are assigned to the terminals. In the example shown in FIG. 3, traffic channel 1 is connected to a reserved channel node M. The remaining reserved channel nodes can be connected to other traffic channels (not shown in FIG. 3 for simplicity).

According to another embodiment, one or more traffic channels are associated with an L LAB for the control channel. In general, traffic channels or system resources (eg, channel nodes) for traffic channels can be differently associated with system resources for the control channel.

Reserved channel nodes or LABs associated with the traffic channel can be considered as auxiliary resources that are assigned to carry traffic data on a trial basis. If any part of the connected reserved channel nodes or if the associated LABs are not used for transmitting control messages, then the unused part of the connected reserved channel nodes or unused LABs can be used to transmit traffic data for the terminal to which this traffic channel is assigned. For example, according to FIG. 3, a reserved channel node M is connected to a link assignment unit LAB 3, which is not used to carry control messages. Accordingly, a reserved channel node M can be allocated to carry traffic data.

FIG. 4A shows an example of mapping a LAB to reserved channel nodes. According to another embodiment, each LAB is mapped to one or more reserved channel nodes, and each channel node can be used for only one LAB. According to this embodiment, each reserved channel node may be fully accessible for carrying traffic data. However, the average number of LABs used in this frame may be less than L. If this LAB is not used in this frame, then part of the M reserved channel nodes allocated for this LAB can be used to transfer traffic data.

FIG. 4B shows an example in which only one control message is transmitted on LAB 1. In this example, parts B11 through B1M of the control message transmitted on LAB 1 are mapped to a portion of reserved channel nodes 1 through M, respectively. Each reserved channel node has a part that is not used for transferring control messages and, thus, can be used for transferring traffic data.

According to the embodiments shown in FIGS. 4A and 4B, if some LABs are not used in this frame, then each reserved channel node has a part not used for control messages. The unused portion of each reserved channel node can be used to transfer traffic data for the traffic channel associated with this reserved channel node. For example, if only half of the LAB is used in this frame, then approximately half (possibly less) of each reserved channel node is available for transferring traffic data. The unused resources of the control channel are thus dynamically assigned to carry traffic data for each reserved channel node, and not for each LAB.

4A and 4B show an embodiment of transmitting control messages over a control channel. Control messages can also be transmitted by other means.

бит битовой карты можно связать с

LAB. Поле 504 битовой карты может иметь фиксированный размер L_max битов, где L_max это максимально возможное значение для L. Каждый бит битовой карты указывает, используется ли соответствующий LAB для передачи сообщения управления. В примере, показанном на фиг.5, сообщения управления передаются по LAB 2, 3, …, L и не передаются по LAB 1, 4, …, L-1. Поле битовой карты также может иметь регулируемый размер, который можно переносить, например, в поле размера битовой карты сообщения назначения (не показано на фиг.3). Битовую карту также можно передавать в множественных сообщениях, в каковом случае каждое сообщение включает в себя порядкового ID для указания, какая часть битовой карты переносится в сообщение. Поле CRC несет значение CRC, используемое терминалом для определения, декодировано ли сообщение назначения правильно или с ошибками. Перенос информации, указывающей, какие из LAB используются или не используются, также можно осуществлять иначе, в сообщениях других форматов.5 shows an embodiment of a message format for an assignment message of a control channel 500 used to carry control messages transmitted on a control channel. According to this embodiment, the destination message 500 includes a message type field 502, a bitmap 504, and a cyclic redundancy check (CRC) field 506. The message type field 502 carries a specific value for identifying this message as a control channel assignment message. Different messages can be assigned different message type values. The bitmap field carries a bit for each of the L LABs, for example,

bitmap bit can be associated with

LAB. The bitmap field 504 may have a fixed size L _max bits, where L _max is the maximum possible value for L. Each bit of the bit map indicates whether the corresponding LAB is used to transmit the control message. In the example shown in FIG. 5, control messages are transmitted on LAB 2, 3, ..., L and are not transmitted on LAB 1, 4, ..., L-1. The bitmap field may also have an adjustable size that can be carried, for example, in the bitmap size field of the destination message (not shown in FIG. 3). A bitmap can also be transmitted in multiple messages, in which case each message includes an ordinal ID to indicate which part of the bitmap is carried in the message. The CRC field carries the CRC value used by the terminal to determine if the destination message is decoded correctly or with errors. The transfer of information indicating which of the LABs are used or not used can also be done differently in messages of other formats.

According to an embodiment, an assignment message 500 is transmitted on a control channel in conjunction with other control messages. For example, the destination message may be transmitted on the LAB 0 of the control channel. According to an embodiment, the assignment message is scrambled by a pseudo random number (PN) sequence, which is a function of a sector identifier (ID), broadcast MAC ID and / or other parameters. The sector ID identifies the base station transmitting the message. The Broadcast (Media Access Control) MAC ID indicates that the message is intended for all terminals. This embodiment allows the terminals to receive the destination message and establish which LABs to process to recover control messages. The destination message can also be transmitted via a broadcast channel and / or other means.

The destination message 500 may be broadcast in each frame to indicate which LABs are used in this frame to carry control messages. The destination message 500 also indicates which LABs are not used for control messages. The LABs used determine how much of each reserved channel node is used for control data. Unused LABs determine which part of each reserved channel node is not used for control data and thus can be used for traffic data. The terminals can set the used and unused parts of each reserved channel node based on the destination message 500. The base station can transmit traffic data on the assigned traffic channel 302, as well as the unused part of each reserved channel node associated with this traffic channel 304.

Traffic data can be transmitted with or without hybrid automatic repeat request (HARQ). HARQ can be used to increase the reliability of data transmission. To transmit HARQ over a forward link, the base station processes (for example, formats, encodes, and interleaves) a data packet to generate S subpackets of encoded data, where S can be any integer value.

The base station transmits the first subpacket (SP1) on the forward link to the terminal. The terminal receives the transmission, decodes subpacket SP1 and transmits acknowledgment (ACK) if subpacket (SP1) is decoded correctly, or negative acknowledgment (NAK) if subpacket is decoded with errors. If the terminal transmits a NAK, then the base station transmits a second subpacket (SP2). The terminal receives the transmission, decodes the first and second subpackets, and transmits an ACK or NAK based on the decoding result. Thus, the base station can transmit one subpacket until it receives the ACK for the packet, or until all the subpackets have been transmitted, or until the packet transfer ends for some other reason.

The size of the subpackets is usually determined and consistent with the transmission capacity of the traffic channel. This allows you to fully transmit each subpacket on the traffic channel. However, if the auxiliary resources can be dynamically assigned and used for traffic data, then the transmission capacity may vary from transmission to transmission. Packets can be efficiently transmitted using HARQ with variable transmission capacity, as described below.

6A shows a HARQ 610 transmission scheme with dynamically assigned auxiliary resources. The data packet is processed to generate S subpackets (for simplicity, only the first four subpackets 1-4 are shown in FIG. 6A). Each subpacket n (SPn) includes a first encoded portion (SPna) and a second encoded portion (SPnb). In this scheme, the first encoded part (SPna) of the subpacket can be transmitted on the traffic channel, and the second encoded part (SPnb) of the subpacket can be transmitted on auxiliary resources (if available). The first encoded part is determined by the capacity of the traffic channel. The second encoded part is determined by the capacity of all auxiliary resources that may be available.

In the illustrative scenario shown in FIG. 6A, the first four HARQ transmissions are depicted. In this scenario, ancillary resources are not available for the first and fourth HARQ transmissions and are available for the second and third HARQ transmissions. For the first HARQ transmission, the first encoded portion (SP1a) of the first subpacket is transmitted on the traffic channel. The packet is decoded in error after the first HARQ transmission. For the second HARQ transmission, the first encoded part (SP2a) of the second subpacket is transmitted on the traffic channel, the second encoded part (SP2b) of the second subpacket, in whole or in part, is transmitted on auxiliary resources. The packet is decoded with errors after the first two HARQ transmissions. For the third HARQ transmission, the first encoded part (SP3a) of the third subpacket is transmitted on the traffic channel, and the second encoded part (SP3b) of the third subpacket, in whole or in part, is transmitted on the auxiliary resources. The packet is decoded in error after the first three HARQ transmissions. For the fourth HARQ transmission, the first encoded portion (SP4a) of the fourth subpacket is transmitted on the traffic channel.

6B shows encoded data transmitted in four HARQ transmissions. In this scheme, the second encoded part of the subpacket is not transmitted if auxiliary resources are not available. Although not shown in FIG. 6B, the second encoded portion of the subpacket is not transmitted in its entirety if not all of the auxiliary resources are available. This scheme may have a loss in coding efficiency due to (1) lack of transmission of some encoded data when auxiliary resources are unavailable or (2) lack of reception of encoded data transmitted on auxiliary resources, for example, due to a bitmap detection error.

7A shows an embodiment of a HARQ transmission scheme 710 with dynamically assigned auxiliary resources. A data packet is processed to generate S subpackets, as described above with reference to FIG. 6A. However, according to this embodiment, the entire subpacket can be transmitted over the traffic channel, and the second encoded part (SPxb) of the subpacket, in whole or in part, can be transmitted over auxiliary resources from the unused portion of the corresponding reserved channel nodes.

FIG. 7A also shows the first four HARQ transmissions for the illustrative scenario described above with reference to FIG. 6A. For the first HARQ transmission, the entire first subpacket (SP1) is transmitted on the traffic channel. The packet is decoded in error after the first HARQ transmission. For the second HARQ transmission, the entire second subpacket (SP2) is transmitted on the traffic channel, and the second encoded part (SP1b) of the first subpacket is transmitted on the auxiliary resources. The packet is decoded with errors after the first two HARQ transmissions. For the third HARQ transmission, the entire third subpacket (SP3) is transmitted on the traffic channel, and the second encoded part (SP2b) of the second subpacket is transmitted on the auxiliary resources. The packet is decoded in error after the first three HARQ transmissions. For the fourth HARQ transmission, the entire fourth subpacket (SP4) is transmitted on the traffic channel. Thus, according to this transmission scheme, for each subpacket, the entire subpacket is transmitted on the traffic channel, and the encoded part of this subpacket is transmitted on the auxiliary channels during subsequent transmission.

7B shows encoded data transmitted in four HARQ transmissions. According to this embodiment, all encoded data for each subpacket is transmitted on a traffic channel. Part of the encoded data may be repeated and transmitted over auxiliary resources, if available. According to this embodiment, in any given HARQ transmission other than the first HARQ transmission, the base station will fill auxiliary resources (if available) with some coded data transmitted in the previous HARQ transmission. For the first HARQ transmission, the base station will fill auxiliary resources (if available) with some encoded data to be sent in the next HARQ transmission.

The embodiment shown in FIGS. 7A and 7B guarantees coding efficiency for terminals that do not use auxiliary resources, and ensures that these terminals do not experience any loss in coding efficiency associated with the circuit described with reference to FIGS. 6A, 6B. These terminals may not use auxiliary resources for various reasons. For example, ancillary resources may not be available on any HARQ transmission if all LABs are used to transmit control messages. In another example, traffic data may be transmitted over auxiliary resources in some or all of the HARQ transmissions, but terminals may receive control channel assignment messages with errors and may pass traffic data transmitted over auxiliary resources. This embodiment ensures that encoded data for each transmitted subpacket can be received at least over the traffic channel.

FIG. 8A shows an embodiment of a HARQ 810 transmission scheme with dynamically assigned auxiliary resources. A data packet is processed to generate S subpackets, as described above with reference to FIG. 6A. According to this embodiment, the entire subpacket (SPn) can be transmitted on the traffic channel, and the encoded part (SP (n + 1) x) of the next subpacket can be transmitted, in whole or in part, on auxiliary resources.

On figa shows the first four HARQ transmission for the illustrative scenario described above with reference to figa. For the first HARQ transmission, the entire first subpacket (SP1) is transmitted on the traffic channel. The packet is decoded in error after the first HARQ transmission. For the second HARQ transmission, the entire second subpacket (SP2) is transmitted on the traffic channel, and the encoded portion (SP3x) of the next subpacket (SP3) is transmitted on the auxiliary resources. The packet is decoded with errors after the first two HARQ transmissions. For the third HARQ transmission, the entire third subpacket (SP3) is transmitted on the traffic channel, and the encoded part (SP4x) of the next subpacket is transmitted on the auxiliary resources. The packet is decoded in error after the first three HARQ transmissions. For the fourth HARQ transmission, the entire fourth subpacket (SP4) is transmitted on the traffic channel. Thus, according to this transmission scheme, for each subpacket, the entire subpacket is transmitted on the traffic channel, and the encoded portion of the next subpacket is simultaneously transmitted on the auxiliary channels.

FIG. 8B shows encoded data transmitted in four HARQ transmissions. According to this embodiment, all encoded data for each subpacket is transmitted on a traffic channel. Part of the encoded data from the subpacket can be repeated and transmitted over auxiliary resources, if they are available before the subpacket is transmitted over the traffic channel. According to this embodiment, in any given HARQ transmission, the base station will fill auxiliary resources (if available) with some coded data for future HARQ transmission.

According to the embodiments shown in FIGS. 7A-8B, encoded data for a subpacket may be repeated and transmitted over auxiliary resources, if available, in a previous or next HARQ transmission.

In general, encoded data can be transmitted over auxiliary resources, if available, so as to delay data repetition. A data packet may contain P information bits and may be encoded into Q encoded bits at a P / Q code rate (e.g., 1/5 code rate). Then S subpackets are generated from Q encoded bits. To fill in the subpackets, Q coded bits can be taken from the buffer in cyclic mode, so that after using the Qth coded bit, the first coded bit is then taken as follows:

1, 2, 3, ..., Q-2, Q-1, Q, 1, 2, 3, ..., Q-2, Q-1, Q, ...

Depending on the number of subpackets (S) and the size of the subpacket, this encoded bit can be used at zero, one or many subpackets. Coded data for ancillary resources can be taken in reverse cyclic order as follows:

Q, Q-1, Q-2, ..., 3, 2, 1, Q, Q-1, Q-2, ..., 3, 2, 1, ...

The number of encoded bits taken from the buffer in the reverse direction for each HARQ transmission is determined by the capacity of the auxiliary resources, which can vary from transmission to transmission.

FIG. 9A shows the first four HARQ transmissions for the illustrative scenario described above with reference to FIG. 6A. For the first HARQ transmission, the entire first subpacket (SP1) is transmitted on the traffic channel. The packet is decoded in error after the first HARQ transmission. For the second HARQ transmission, the entire second subpacket (SP2) is transmitted on the traffic channel, and the encoded part (SPSa) of the last subpacket is transmitted on the auxiliary resources. The packet is decoded with errors after the first two HARQ transmissions. For the third HARQ transmission, the entire third subpacket (SP3) is transmitted on the traffic channel, and the encoded part (SPSb) of the last subpacket is transmitted on the auxiliary resources. The packet is decoded in error after the first three HARQ transmissions. For the fourth HARQ transmission, the entire fourth subpacket (SP4) is transmitted on the traffic channel. Thus, according to this transmission scheme, for each subpacket, the entire subpacket is transmitted on the traffic channel, and the encoded portion of the last subpacket is transmitted on the auxiliary channels.

9B shows encoded data transmitted in four HARQ transmissions. According to this embodiment, all encoded data for each subpacket is transmitted on a traffic channel. Additional (possibly new) encoded data can be transmitted over auxiliary resources, if available. According to this embodiment, in any given HARQ transmission, the base station will fill auxiliary resources (if available) with some encoded data that might not have been transmitted before. In general, traffic data can be transmitted over the traffic channel and auxiliary resources in such a way as to achieve the following objectives:

1) to avoid wasting coded bits for a terminal that does not use auxiliary resources, and not to start repeating code bits for a traffic channel until all coded bits are used, and

2) reduce the amount of repetition of coded bits due to the availability of auxiliary resources,

3) provide an AT that does not support auxiliary resources or that cannot decode a resource assignment message (erase event) to process data received on non-auxiliary resources.

All of the above embodiments meet goal 3. The embodiments shown in FIGS. 5A-9B achieve goal 1. The embodiments shown in FIGS. 7A-8B use ancillary resource repetition, if available, starting from the second HARQ transmission. The embodiment shown in FIGS. 9A and 9B delays repetition in the presence of auxiliary resources for as long as possible.

According to this embodiment, a terminal that uses auxiliary resources does not see any repetition until all coded bits have been used. The Q coded bits generated for the data packet may be of equal value with respect to error correction ability or may have different values, depending on the structure of the code used to generate the coded bits. If the Q encoded bits are of equal value, then the embodiment shown in FIGS. 9A and 9B may provide better performance than the embodiments shown in FIGS. 7A-8B. If the Q encoded bits have different values (for example, for a code with a speed of 1/5, which contains an embedded code with a speed of 1/3), then coded bits for auxiliary resources can be selected taking into account various factors, for example, relative values of the encoded bit, potential reduction coding efficiency due to repetition, etc.

The embodiments shown in FIGS. 7A-9B provide high performance for terminals that use auxiliary resources, as well as terminals that do not use auxiliary resources. According to an embodiment, the encoded data transmitted over the traffic channel is modulated (mapped to symbols) according to the first modulation scheme selected for the traffic channel. The encoded data transmitted over the auxiliary resources is modulated according to the second modulation scheme selected for the control channel. The first modulation scheme may be identical to or different from the second modulation scheme. According to this embodiment, the traffic data transmitted over the auxiliary resources is modulated according to the same modulation scheme as the control messages, regardless of the modulation scheme used on the corresponding traffic channel.

According to another embodiment, the traffic data is transmitted using the same modulation scheme for the traffic channel and auxiliary resources. In general, the same or different coding schemes and the same or different modulation schemes can be used for traffic data transmitted over a traffic channel and traffic data transmitted over auxiliary resources.

10 is an embodiment illustrating a method 1000 for allocating auxiliary resources in a communication network. The method begins with step 1002, in which N channel nodes communicate with system resources by mapping them into N different mosaic elements. At step 1004, M nodes of N channel nodes are reserved for transmitting control messages, so that M <N. The remaining N-M channels can be assigned to carry traffic data. In other embodiments, control messages can be transmitted on all N channels, in which case there will be no traffic channels. At step 1006, a determination is made whether all L link assignment units (LABs) associated with the M channel nodes carry control messages. If all L LABs are involved in the transmission of control messages, then it is determined that no auxiliary resources are available, user traffic is transmitted through the traffic channels, which is indicated at step 1012. If it is determined that among the N channel nodes there are channel nodes (M + 1 ,. .., N) that do not participate in the transfer of control messages, then such channels are identified at step 1008. At step 1010, the identified channel nodes are assigned as auxiliary resources for transferring traffic data. According to an embodiment (not shown), it can be determined whether the user capabilities allow the assignment of auxiliary resources, prior to the allocation of resources.

11 is an embodiment illustrating a method for determining whether any auxiliary resources have been assigned to carry traffic data. At 1102, the terminal receives a message broadcast by the base station. A message may include a message type field, a bitmap, and a cyclic redundancy check (CRC) field. The received message is identified as a control channel assignment message by checking the message type field in step 1104. In step 1106, the bitmap field is checked to determine which LABs are used to transmit control messages and which LABs are not used to transmit control messages. At 1108, a CRC field is used to confirm that the message has been decoded correctly. At 1110, control channels not participating in the transmission of control messages are used as auxiliary resources for transferring data traffic.

After identifying the channels that can be used as auxiliary resources for transferring data traffic, various schemes can be applied for transferring data packets, both on dedicated traffic channels and on auxiliary resource channels, which is described in detail below. 12 shows one such data packet transfer scheme using both traffic channels and an auxiliary resource. At 1202, data packets are processed to generate subpackets. At step 1204, each subpacket is divided into a first encoded portion and a second encoded portion. At step 1206, a determination is made whether auxiliary resources are available. If resources are unavailable, the data packets are completely transferred over the traffic channel at step 1208. If they are available, the first encoded part is transferred over the traffic channel, and the second encoded part is transferred over the auxiliary channels received from the reserved control channels at step 1210. At step 1212, determining if there are other packets to be transmitted. The process is thus repeated for all data packets. As indicated above, this scheme may have a loss in coding efficiency due to (1) lack of transmission of some encoded data when auxiliary resources are unavailable, or (2) lack of reception of encoded data transmitted over auxiliary resources, for example, due to a bitmap detection error.

13 shows another method for transmitting data packets that can be applied when auxiliary resources are available. At block 1302, data packets are processed to generate subpackets. At step 1304, each subpacket is divided into a first encoded portion and a second encoded portion. At step 1306, a determination is made whether auxiliary resources are available. If resources are unavailable, the data packets are entirely transferred over the traffic channel at step 1308. If they are available, the first HARQ transmission carries the entire first subpacket over the traffic channel at step 1310. For the second transmission at step 1312, the entire second subpacket is transmitted over the traffic channel, whereas the encoded portion of the first subpacket is repeated and transmitted over available auxiliary resources. At step 1314, a determination is made whether there are other packets to be transmitted. The process is thus repeated for all subpackages. Therefore, this method relates to a transmission scheme in which the entire subpacket is transmitted over a traffic channel, and the encoded portion of the subpacket is repeated and transmitted through available auxiliary resources during subsequent transmission.

On Fig shows another method of transmitting data packets that can be applied when auxiliary resources are available. At step 1402, data packets are processed to generate subpackets. At step 1404, each subpacket is divided into a first encoded portion and a second encoded portion. At step 1406, a determination is made whether auxiliary resources are available. If resources are unavailable, the data packets are completely transferred over the traffic channel at step 1408. If they are available, the first HARQ transmission carries the entire first subpacket over the traffic channel at step 1410. For the second transmission at step 1412, the entire second subpacket is transmitted over the traffic channel, whereas the encoded part of the third subpacket is transmitted over available auxiliary resources. At step 1414, the entire third subpacket is repeated and transmitted over the traffic channel. At step 1416, a determination is made whether there are still subpackets to be transmitted. The process is thus repeated for all data packets. Therefore, this method relates to a transmission scheme in which the entire subpacket is transmitted over a traffic channel, while the encoded portion of the subpacket is repeated and transmitted through available auxiliary resources during a previous transmission.

Although the methods illustrated in FIGS. 13 and 14 make it possible to avoid wasting coded bits for terminals that do not use auxiliary resources, since repetition does not start until all coded bits have been used, they do not allow minimizing repetition due to the availability of auxiliary resources. This can be achieved by adopting the circuit shown in FIG. Here is shown a method of transmitting data packets in which data packets are transmitted in such a way that the repetition amount of the coded bits due to the presence of auxiliary resources is minimized. Therefore, according to the circuit illustrated in FIG. 15, a terminal that uses auxiliary resources does not see any repetition until all coded bits are used.

Initially, in step 1502, P information bits to be transmitted are encoded into Q encoded bits at a P / Q code rate. At step 1504, S subpackets are generated by filling them with Q encoded bits taken from the buffer in cyclic mode, so that after using the Qth encoded bit, the first encoded bit is taken next. At step 1506, the last subpacket, subpacket S, is divided by the number of encoded parts. The size of the coded portions may vary dynamically based on a number of factors. For example, the capacity of available auxiliary resources can be determined dynamically, and the last subpacket can be divided accordingly. Assuming the availability of auxiliary resources, at step 1508, the subpacket is transmitted in its entirety over the traffic channel, while the encoded portion of the last subpacket is transmitted over the auxiliary resources. For example, during the first HARQ transmission, the first subpacket is transmitted in its entirety over the traffic channel, while the first encoded part of the last (S) subpacket is transmitted over the available auxiliary resources. This process is repeated at 1510 for all (S-1) subpackets so that the entire subpacket is transmitted over the traffic channel, while the encoded portion of the last subpacket is transmitted over auxiliary resources. Therefore, this process minimizes the repetition of coded bits, i.e., ideally, all coded bits in all subpackets are transmitted / read only once.

FIG. 16 is a block diagram of a communication system 1600 that minimizes data repetition in the presence of auxiliary resources according to an aspect. The system comprises a first communication component 1602 and a second communication component 1620, which are capable of transmitting / receiving data according to various schemes described above.

The first communication component 1602 further comprises a processing component 1604 that converts the traffic data into subpackets based on one or more of the available power in the system, the capacity of the traffic channel, etc. It further comprises a memory component 1606, operatively connected to a processing component, which buffers the bits of code and facilitates the generation of subpackets by filling them with code bits. According to various schemes described in detail above, the subpackages can be filled sequentially or in a cyclic mode, etc. The transmission component 1608 is also part of the first communication component, because the transmission component transmits data packets / subpackets based on various transmission schemes, which are determined by the processing component 1604. According to an aspect, the processing component 1604 may assign reserved control channels not involved in the transfer control messages to traffic channels as auxiliary resources for transferring traffic data. Therefore, the transmission component is capable of transmitting one or more of data packets, subpackets, encoded portions of the subpackets, or a combination thereof at different frequencies according to various schemes.

The communication system 1600 also comprises a second communication component 1620 that can receive subpackets transmitted by the first communication component. The second communication component may also comprise a processing component 1622, a memory component 1624, as well as a transmission component 1626. The second communication component 1620 may demodulate received data packets based on the channel assignment message broadcast by the first component 1602. The channel assignment message also makes it easier to determine if decoded received data packets / subpackets. If they are decoded correctly, then the second communication component generates an acknowledgment message (ACK), otherwise it generates a negative acknowledgment message (NAK). Based on the type of acknowledgment message received, the first component 1602 may transmit subpackets one at a time until an ACK message for a data packet is received, or until all subpackets are transmitted, or until the communication session is ended for other reasons.

The data transmission methods described here can be implemented by various means. For example, these methods can be implemented in hardware, firmware, software, or a combination thereof. For a hardware implementation, the processing units used to transmit data at a transmitter or to receive data at a receiver can be implemented in one or more of specialized integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs) ), programmable logic devices (PLUs), user-programmable gate arrays (FPGAs), processors, controllers, microcontrollers, microprocessors, electronic devices, and other electronic units designed for functions of the functions described here, or combinations thereof.

For hardware and software and / or software implementations, methods can be implemented using modules (eg, procedures, functions, etc.) that perform the functions described here. Firmware and / or software codes may be stored in memory and executed by a processor. Memory can be implemented on or off the processor.

The above description of the disclosed embodiments enables a person skilled in the art to use the disclosure. Various modifications to these embodiments are apparent to those skilled in the art, and the general principles set forth herein can be applied to other embodiments without departing from the spirit and scope of the disclosure. Thus, the disclosure is not limited to the embodiments presented here, but should correspond to the broadest scope consistent with the principles and features of novelty disclosed herein.

The methods described here, generally related to the selection of data for auxiliary resources, involve the use of various reverse link channels, including data and control channels. According to an embodiment, the methods can be used for reverse link control channels, for example, a channel quality indicating channel (CQICH), a request channel (REQCH), a pilot channel (PICH), an acknowledgment channel (ACKCH), a beamforming feedback channel (BFCH), channel (SFCH), etc. that can be processed and transmitted. Methods can also be used for a time division multiplexed (TDM) pilot signal, which is expanded by a channelization code and scrambled.

The above description includes examples of various embodiments. Of course, it is impossible to describe all conceivable combinations of components or methods for describing embodiments, but it will be apparent to those skilled in the art that many additional combinations and permutations are possible. Accordingly, the detailed description is intended to cover all such changes, modifications and variations that correspond to the essence and scope of the attached claims.

In particular, in connection with the various functions carried out by the above components, devices, circuits, systems, etc., the terms (including references to “means”) used to describe such components mean, unless otherwise indicated, any component that implements the specified function of the described component (for example, a functional equivalent), which may not even be the structural equivalent of the disclosed structure, which performs the function in the illustrative aspects illustrated here comrade embodiment. In this regard, it should be noted that the embodiments include a system as well as a computer-readable medium having computer-executable instructions for performing actions and / or events in various ways.

In addition, although a particular feature may be disclosed with respect to only one of several implementations, such a feature may be combined with one or more other features of other implementations that may be desirable and advantageous for any given or specific application. In addition, to the extent that the terms “includes” and “including” and their variants are used in the detailed description or claims, these terms should be construed as inclusive in the same way as the term “comprising”.

Claims (18)

1. A communication system for minimizing data repetition, comprising a processing component that processes one or more data packets into a plurality of subpackets filled with encoded bits, the last subpacket being further divided into encoded parts, a transmission component that transmits a plurality of subpackets, the transmission component transmitting a plurality subpackets in such a way that the entire subpacket is transmitted over the traffic channel, and wherein the transmission component further transmits the encoded parts of the last subpacket and for allocated auxiliary resources, and
a mobile terminal that receives transmitted subpackets. 2. The system according to claim 1, additionally containing a memory component, operatively connected to the processing component, the memory component buffering the encoded bits so that the subpackets are filled in a cyclic mode. 3. The system according to claim 1, in which the processing component allocates auxiliary resources from one or more control channels that are not used when transferring control messages. 4. The system of claim 3, wherein the processing component identifies link assignment units not carrying control messages to determine unused control channels. 5. The system of claim 1, wherein the processing component processes data packets associated with messages generated by the user containing one or more of the data messages, voice messages, or video messages. 6. The system of claim 1, wherein the mobile terminal generates an acknowledgment message (ACK) if the received subpacket is decoded correctly. 7. The system according to claim 1, in which the mobile terminal generates a negative acknowledgment (NAK) if the received subpacket is decoded incorrectly. 8. A method of minimizing data repetition in communication systems, comprising the steps of generating a plurality of subpackets from a data packet, processing the last subpacket into encoded parts in an amount equal to the total number of subpackets, transmitting the plurality of subpackets so that the entire subpacket is transmitted over a traffic channel, and transmit the encoded parts of the last subpacket on the assigned auxiliary resources. 9. The method of claim 8, wherein the size of the generated subpackets is determined and matched with the bandwidth of the traffic channel. 10. The method of claim 8, in which the size of the encoded parts is changed dynamically based on the bandwidth of the assigned auxiliary resources. 11. The method of claim 8, in which the subpackets transmitted on the traffic channel are modulated according to the first modulation scheme selected for the traffic channel, and the encoded parts transmitted on the auxiliary resources are modulated according to the second modulation scheme selected for the corresponding control channel. 12. The method according to claim 11, in which the destination blocks of the communication line displayed in the control channels are not involved in the transmission of control messages. 13. The method of claim 12, wherein the link assignment units not transmitting control messages are determined based on information carried by the assignment message. 14. The method of claim 8, further comprising the step of generating an acknowledgment (ACK) when the transmitted subpacket is correctly decoded. 15. The method of claim 8, wherein a negative acknowledgment (NAK) is generated when the transmitted subpacket is incorrectly decoded. 16. A communication system to minimize data repetition in the presence of auxiliary resources, containing
means for generating subpackages from the data packet,
means for processing the last subpacket into encoded parts in an amount equal to the total number of subpackets,
means for transmitting the full subpackets over the traffic channel and the encoded parts of the last subpacket to the assigned auxiliary resources. 17. The communication system according to clause 16, further comprising means for decoding the received subpackets. 18. The system of clause 16, further comprising means for generating one of an acknowledgment message (ACK) or a negative acknowledgment message (NAK) based on the results of decoding the subpackets.

Images