UA94059C2 - Varied transmission time interval in wireless communication system - Google Patents

Abstract

Embodiments describe a varied transmission time interval in wireless communication system. According to some embodiments is a method for assigning a transmission time interval. The method can include measuring a channel condition and/or a data rate of packet communicated by at least one wireless device. Based in part on the data rate and/or channel condition information, a determination can be made whether to schedule a long transmission time interval or a short transmission time interval to the packet. A long transmission time interval can be scheduled if the channel condition is poor and/or there is a low data rate. A short transmission lime interval can be scheduled if the channel condition is good and/or the data rate is high or fast. The method can be repeated for multiple wireless devices. Also included is an alternative interlacing structure that supports both long transmission time intervals and short transmission time intervals.

Description

For the implementation of the above and related parts, one or more variants of the implementation include features fully described later in this document and separately indicated in the claims. The following description and accompanying drawings set forth in detail certain illustrative aspects of one or more embodiments. However, these aspects indicate only some different ways of possible application of the principles of the various embodiments, and it is intended that the described embodiments include all such aspects and their equivalents.

Brief description of the drawings

Figure 1 shows a radio communication system according to various implementation options presented in this document.

Figure 2 shows a multiple access radio communication system according to various implementation options presented in this document.

Figure 3 shows a system for variable value of the transmission time interval for forward and reverse channel transmissions in multi-user radio communication systems.

Fig. 4 shows the system for the variable value of the transmission time interval using channel conditions and other communication parameters.

Figure 5 shows a block diagram of a method for assigning different transmission time intervals to different users.

Figure 6 shows a short transmission time interval having six alternations.

Figure 7 shows a long transmission time interval that has three alternations.

Fig. 8 shows the flexible distribution of resources with mixed rotations.

Fig. 9 shows the choice of transmission time (protocol) of H-ANVO.

Fig. 10 shows the structure of the H-AKO switching (protocol) for assignments of extended transmission duration.

Fig. 11 shows a block diagram of a method for transmitting a data packet through forward and reverse channels.

Fig. 12 is a block diagram of a method for transmitting a data packet over the reverse channel.

Figure 13 shows a radio communication environment that can be used with the various systems and methods described in this document.

Next, various implementation options are described according to the drawings. In the following description, for purposes of explanation, numerous specific details are set forth to provide a thorough understanding of one or more aspects. However, it may be apparent that such embodiment(s) may be used without these specific details. In other cases, well-known structures and devices are presented in block diagram form for ease of description of these embodiments.

It is understood that the terms, as used in this application, "component", "system", etc., refer to an object associated with the application of a computer, hardware or programmable equipment, or a combination of hardware facilities and software, or software, or executable software. For example, a component can be a process executed by a processor, a processor, an object file, an executable file, a flow of control, a program, and/or a computer, etc. For example, both an application running on a computing device and that computing device can be a component. There may be one or more components within a process and/or control flow, and a component may be localized on one computer and/or distributed between two or more computers. In addition, these components can be executed from different machine-readable storage media that store different data structures. Components can exchange information using local and/or remote processes, for example, according to a signal containing one or more data packets (for example, data from one component interacting with another component in a local system, a distributed system, and/or over a network , example,

Internet with other systems using the mentioned signal).

According to the drawings, in fig. depicts a radio communication system 100 in accordance with various embodiments presented herein. The system 100 may include one or more access points 102 that receive, transmit, repeat, etc., radio communication signals to each other and/or to one or more mobile devices 104. The access point(s) 102 may represent an interface between the radio communication system 100 and the wired network (not shown).

Each access point 102 may contain a transmitter channel and a receiver channel, each of which may in turn contain several components related to signal transmission and reception (eg, processors, modulators, multiplexers, demodulators, demultiplexers, antennas...). Mobile devices 104 may be, for example, cellular telephones, smartphones, laptop computers, handheld communication devices, pocket computing devices, satellite radios, global positioning systems, ROA devices, and/or other suitable devices for exchanging information through system 100 radio communication In the radio communication system 100, the periodic transmission of small data packets (commonly called radio beacons) from the access point 102 can announce the presence of the radio communication system 100 and transmit information to the system 100. Mobile devices 104 can recognize these radio beacons and attempt to establish a radio communication connection. communication with access points 102 and/or with other mobile devices 104.

The system 100 facilitates the scheduling of different transmission time intervals (TTI) to one or more users using the mobile device(s) 104 to adapt to these communication channels and network conditions. System 100 may automatically detect, accept, and/or infer channel conditions, frequency range, data rate, and/or various other communication parameters to determine whether a long TTI or a short TTI is better for that data transfer.

A component residing in the mobile device 104 may work in conjunction with one or more access points 102 to assist in monitoring the capabilities of the mobile device 104, such as the decoding capabilities of the device 104. Alternatively or additionally, the access point 102 may detect this information and schedule for appropriate data packets optimal duration of TT! taking into account various communication parameters, including the volume of traffic in the network.

Fig. 2 is an illustration of a multiple access radio communication system according to one or more embodiments. Shown is a system 200 that may include a local radio network associated with a wired local area network (LAN). The access point 102 may be associated with mobile devices 104. The access point 102 is connected to a hub or switch 202 of EPegpei for GAM. The ESHegtei hub 202 may be connected to one or more electronic devices 204, which may include personal computers, peripheral devices (for example, fax machines, copiers, printers, scanners, etc.), servers, etc. p. ESHegpay hub 202 may be connected to router 206, which transmits data packets to modem 208. Modem 208 may transmit data packets to a global wide area network (WAN) 210, such as the Internet. System 200 depicts one simple network configuration. Many other configurations of system 200 containing alternative electronic devices are possible. Although the system 200 has been illustrated and described with respect to GAM, it is possible that the system 200 may use other technologies, including UUM/AM and/or M/RAM, either separately or simultaneously.

System 200 may facilitate scheduling for different users of different TTI durations. For example, if a channel generates traffic or changes slowly, you may benefit from a longer TTI to evaluate the channel.

Accordingly, a specified channel estimation power can be maintained that provides a specified accuracy.

Choosing the optimal ratio between short TTI and long TTI is that with short TTI some characteristics are worse, but it provides the possibility of better processing time.

Figure 3 shows a system 300 for variable amount or duration of TTI for forward and reverse channel transmissions in multi-user radio communication systems. The system 300 includes an access point 302 and an access terminal 304. It should be understood that the system 300 may contain more than one access point 302 and/or more than one access terminal 304, however, for ease of explanation, only one of them is depicted.

The access point 302 may include an encoder 306, an optimizer 308, and a scheduler 310. They may be functional blocks that represent functions implemented by a processor, software, or a combination thereof (eg, programmable hardware). The encoder 306 is configured to encode signals and/or data packets for transmission to the access terminal 304 . In other embodiments, the optimizer 308 and/or the scheduler 310 are associated with the access terminal 304, and the access terminal 304 performs the functionality described below.

The optimizer 308 can be configured to optimize communication between the access point 302 and the access terminal 304 and/or between two or more access terminals. Optimizer 308 can use information regarding channel conditions, frequency range, packet size, data rate, and other parameters to optimize communication. This information can be passed to the scheduler 310. The optimizer 308 can additionally support at least two different queuing structures or two different types of assignments.

The scheduler 310 can be configured to schedule for the access terminal (or its user) a particular frequency range and/or TTI. The size of the packet, or the number of bits that can be transmitted together, depends on this TTI, since a longer TTI allows more bits to be transmitted together. The scheduler 310 may use information received from the optimizer 308 and/or from the access terminal 302 to determine the value of the TTI. For example, the access terminal 304 can inform the access point 302 or the scheduler 310 about the (need) to change the planning from a short TTI to a long TTI or vice versa.

The access terminal 304 may make such a request if it does not receive the entire data packet, has communication problems, in case of receiving and/or sending a large data packet, receives transmitted packets at high speed, etc.

In general, the short duration of the TT! may be beneficial for access terminal(s) with good channel conditions, as a short TTI facilitates high (peak) throughputs. Alternatively, long TTI can be used for users with moderate to poor channel conditions. In a system that dynamically supports both types of users, it is possible to provide a flexible allocation of frequency band resources between short and long TTI or an alternative queuing structure.

The access terminal 304 may include a decoder 312 and a ringing device 314 to confirm reception.

Decoder 312 may decode the received signal and/or data packets for processing contained therein.

The routing device 314 may use an acknowledgment method along with the protocol

ASK/MASK, in other embodiments, the access terminal 304 may include a memory (not shown) and a processor (not shown) to enable the access terminal to process and/or store information.

The access terminal 304 can report its capabilities, including the size of the decoder and what it can work with for decoding. This information may be transmitted to the access point 302, for example, when the access terminal 304 connects to the system 300, and transmitted periodically or continuously while the access terminal 304 is connected to the system 300. With this information, the access point 302 can determine whether the access terminal 304 is a strong access terminal or a weak access terminal. For example, access point 302 may schedule access terminal 304 for a large frequency range in a large channel packet. If the channel causes traffic or is slow to change, you can benefit from a higher TTI for channel estimation because you can maintain the specified capacity for channel estimation. A shorter TTI allows for better processing times. Accordingly, for different types of communication (eg, voice, data, image, video...) the access point 302 can plan a longer TTI or a shorter TT! depending on the best optimization for that particular channel and that connection.

Fig. 4 shows the system for the variable value of the transmission time interval using channel conditions and other communication parameters. The system 400 includes an access point 402 that is in radio communication with the access terminal 404. The access point 402 may include an optimizer 406 and a scheduler 408. The access terminal 404 may include a decoder 410 that may decode the received signal and/or data packets for processing contained therein. The access terminal 404 may also include a paging device 412, which may use an acknowledgment method along with the ASK/MASK protocol. It should be understood that they can be functional blocks that represent functions implemented by the processor, software, or a combination thereof (eg, programmable hardware).

It should be understood that although further discussion will be conducted with respect to the access point 402, in other embodiments these functionalities may be performed by the access terminal 404 and transferred to the access point 402. The optimizer 406 may include a channel conditions module 414 and a data rate module 416. The channel conditions module 414 can be configured to analyze channel conditions.

The mentioned conditions on the channel can include parameters, for example, the amount of network traffic, the amount of data sent/received on this network, etc. The data rate module 416 can be configured to determine the data rate of the current connection and/or the optimal data rate for a particular connection.

The scheduler 408 may include a frequency range module 418 and a transmission time interval (TT) module 420 .

The frequency range module 418 is configured to determine the frequency range for communication. For example, if there are multiple users operating on a long TTI and others on a short TTI, then it may be necessary to allocate the entire frequency range to one user, the frequency range module 418 may wait until the other users have finished because they are on different timescales . When these users are finished, the frequency band will become free.

The TTI module 420 is configured to schedule for a particular short TTI or long TTI connection.

This TTI should be as long as possible to benefit from channel evaluation. This is useful in systems such as block-receiving systems where the user accepts resources in units of blocks.

In some embodiments of the retransmission, scheduler 408 may add an additional bit to

EGAM or AGAM with an indication of the queuing structure for a specific package. And AM would index an identical set of relay ports, but now applied to a larger set of physical frames. The scheduler 408 would further ensure that this I AM does not conflict with other GI AMs that may have been sent earlier, especially if those other GAMs have different queuing structure(s).

Considering the illustrative systems depicted and described above, methods are provided that may be implemented in accordance with one or more aspects. Although the mentioned methods, for the sake of simplicity of explanation, are depicted and described as a series of actions (or functional blocks), it should be understood and taken into account that these methods are not limited to this order of actions, since some actions, according to these methods, may be performed in a different order from the example and described here and/or performed concurrently with other actions. In addition, not necessarily all of the exemplary actions may be implemented in a method according to one or more aspects of the disclosed embodiments. It should be understood that these various actions may be implemented in software, hardware, a combination thereof, or any other suitable means (eg, device, system, process, component) to perform the functionality associated with these actions. It should also be understood that these actions merely illustrate certain aspects presented herein in simplified form, and that these aspects may be illustrated with fewer and/or more actions. In addition, not necessarily all the actions given as an example can be implemented in the following ways. Those skilled in the art will understand and appreciate that, alternatively, a method can be represented as a sequence of interrelated states or events, such as in a state diagram.

Figure 5 shows a block diagram of a method 500 for assigning different transmission time intervals to different users. The method begins at 502 where channel conditions are detected and measured for a packet transmitted by at least one radio device. Channel conditions can be bad or good depending on various criteria, including traffic in the radio network. At 504, the data rate associated with this channel is determined. This data rate can be a factor in the number of bits or data that must be transferred. This method continues at 506, where it is determined whether to schedule a long or short transmission time interval for said packet based in part on the detected conditions on the channel and the determined data rate. A long transmission time interval can be planned for poor channel conditions and/or low data rates. A short transmission time interval can be planned for good channel conditions and/or high data transfer rates. It should be understood that method 500 may analyze and assign a transmission time interval to more than one radio packet. For example, multiple packets can be analyzed and included in an alternative queuing structure, which will be further discussed below.

In some embodiments, a channel assignment message is issued at 508 . It is necessary to understand that this assignment of the channel is not mandatory. This channel assignment message may provide information regarding the required queuing structure for a particular packet. In some embodiments, an additional bit may be added to the RIAM or VIAM to indicate such a structure. For direct channel transmissions, the channel assignment may be issued and transmitted on that direct channel before or substantially simultaneously with the direct channel packet transmission. For transmissions on the reverse channel, the channel assignment can be issued and transmitted on the forward channel before the packet is transmitted on the reverse channel. To avoid conflicts between different types of assignments, for example, the entire frequency range can be divided into two parts, one for each type of assignment.

Figure b6 shows a short transmission time interval that has six alternations. Namely, the structure is depicted for forward and reverse channels with six alternations with identical transmission and retransmission delay in each interface. The multiple access system can simultaneously exchange data with several terminals on direct and reverse channels. The direct channel (or "downlink") refers to communication from the base station or access points to the terminals. The reverse channel (or "up" channel) belongs to the communication channel from terminals to base stations or access points. Next, the packet transmission and processing timeline for a single forward/reverse link interface will be described.

In the upper part of the drawing, position 602 indicates a structure for an access point having a structure of forward and reverse channels with six alternations, designated as 1,2, 3, 4, 5, and 6. In the lower part of the drawing, position 604 indicates a structure for an access terminal that has a forward and reverse channel structure with six alternations designated as A, B, C, 0, E, and P. It should be understood that, although both the access point 602 and the access terminal 604 are depicted with two data packets with a forward structure and reverse channel with six interleavings, there may be more or less number of data packets and/or there may be more or less number of interleavings associated with this structure.

At position 606, the direct channel access point 602 transmits the encoded direct channel packet. This represents the first short TTI having the duration shown in TTI 1. The access terminal 604 decodes this forward channel packet and encodes and transmits a reverse channel acknowledgment to confirm the successful reception of the last direct channel transmission or retransmission using the hybrid auto-request protocol. retransmission (H-ABO). This confirmation of reception can be a method of confirmation of reception together with the ASK/MASK protocol. Said decoding and transmission of confirmation of reception on the reverse channel occur during the interval marked by position 608, which represents the intervals of TTI B, C and O0. Access point 602 during TTI intervals 2, 3 and 4, represented by position 610, decodes ASK of the direct channel and performs coding of the next transmission on the direct channel or retransmission of H-ABO.

Access point 602 during the interval TTI A, represented by position 612, on the reverse channel transmits an encoded packet of the reverse channel. During TTI intervals (position 614), marked 2, 3 and 4, the reverse channel packet is decoded and an acknowledgment is sent over the forward channel. Acknowledgment of reception confirms that the last reverse channel transmission or H-AKO retransmission was successfully received. In 616, the ASK of the direct channel is decoded and the next VI -transmission or retransmission of H- is encoded

ANO.

Note that this process may be repeated as shown. Each transmission cycle can be accompanied by the possibility of transmitting a channel assignment message. For forward channel transmission, a channel assignment may be issued by the access point 602 and transmitted over this forward channel prior to or substantially concurrently with the transmission of the forward channel packet. In a system that includes a centralized scheduler for the reverse channel (access point), for transmissions on the reverse channel, the channel assignment can be issued and transmitted on the forward channel before the packet is transmitted on the reverse channel. This is usually the case in some orthogonal reverse channel access systems. It should be understood that the access terminal, which is initiated by the assignment of the reverse channel, can be used in the basic system of access to the reverse channel with conflicts (when trying to transfer data simultaneously), for example, O5-SOMA.

Next, according to Fig.7, a long transmission time interval having three alternations is depicted, and in particular, the structure of a forward and reverse channel with three alternations with identical transmission and retransmission delay in each interface is depicted. These three turns for the access point 702 are labeled 1, 2, and 3, while said three turns for the access terminal 704 are labeled A, B, and C. In this drawing, the duration of the TTI, or the duration of the first transmission of a forward/backhaul packet and its subsequent retransmission of H-AKO, twice the duration of TTI in Fig. 6, discussed above.

During the first TTI, position 706, the access point 702 transmits the forward channel encoded packet. The access terminal 704 decodes this packet of the forward channel and further encodes and transmits a confirmation of reception on the reverse channel during the interval marked by position 708. The device is used to transmit a message about the successful reception of the last transmission on the forward channel or retransmission of H-ABO. This confirmation of reception can be a method of confirmation of reception together with the ASK/MASK protocol. A system using a longer TTI, as shown, transmits the ASK over two RNU frames, which can save on the immediate power requirement for the ASK. During the interval marked by position 716, the ASK of the direct channel is decoded and encoding of the next transmission on the direct channel or retransmission of H-AKO is performed. In some embodiments, during a forward channel transmission, a channel assignment may be issued by the access point 702 and transmitted over the forward channel before or substantially simultaneously with the forward channel packet transmission.

On the reverse channel, the access terminal during the interval marked by position 712, or TTI "A", transmits an encoded packet of the reverse channel. During the interval marked by position 714, the reverse channel packet is decoded and a confirmation of reception is sent on the forward channel, which confirms the successful reception of the last transmission on the reverse channel or the retransmission of H-ANO. During the interval marked by position 716, the ASK of the direct channel is decoded and the next VI-transmission or retransmission of H-AVKO is encoded. In some embodiments, during transmission on the reverse channel, the channel assignment may also be issued by the access point 702. In systems, for example, with a centralized scheduler for the reverse channel, this destination can be transmitted on the forward channel before the packet is transmitted on the reverse channel. This is usually the case in most orthogonal reverse channel access systems.

Reverse channel assignment can be used in conflict-based reverse channel access systems (when attempting simultaneous data transmission), such as O5-SOMA.

Fig. 7 and Fig. 8 show the situation when the user receives a transmission on the forward and reverse channels in the same interface. In general, an access terminal can be scheduled for several packets on several shifts. These several packages may correspond to different H-AKO processes). In addition, the mentioned forward and reverse channel interfaces assigned to an identical access terminal do not necessarily have to be synchronized in time.

Figure 8 shows a flexible distribution of resources with mixed queues or an alternative queue structure. The time interval for the access point 802 is shown in the upper part, and the time interval for the access terminal 804 is shown in the lower part of the drawing. Users of short TTI intervals are represented as A and B, while users of long TTI intervals are represented as C, 0, E, and R. The long TTI is approximately twice as long as the short TTI, and its ASK is transmitted over two RNU frames. An alternative queuing structure can support users limited by the energy potential of the channel. To avoid conflicts in this alternative queuing structure and two different types of assignments, the entire frequency range can be divided into two parts. Each part can be assigned to each type of purpose. It should be understood that the described way of avoiding conflicts is given only as an example, and other means of avoiding conflicts between these types of appointments could be used.

In some embodiments, the structure of the retransmission (which can be a structure of two alternations) can be supported by adding an additional bit to the RIG AM or VI AM, which indicates the required structure of the alternation for a particular packet. | AM can index an identical set of relay ports and can also be applied to a larger set of physical frames. The scheduler can ensure that this I AM does not collide with I AM(s) sent earlier, especially with GAM(s) with a distinct queuing structure. This can be achieved, for example, by reserving a set of channel tree nodes for use with an alternative queuing structure.

The COM control channel may punch out some of the tones assigned to the channel with the alternative queuing structure. For example, in regular structures with six alternations, the COM control channel punches out the entire channel that is not assigned. For BOYU, RI AM in frame 0 means data transmission in frames 0 to 5.

Acknowledgment of reception (ACK) is transmitted over the VI in frames 8 and 9, and data is retransmitted in frames 12-17.

To fully understand the disclosure of the subject, let's now compare the short TT with the alternative of the long TTI.

This comparison assumes that there is a fixed retransmission time in both cases. With the help of the short duration of the TT! a relatively short waiting time for the radio interface can be achieved.

The reduction in waiting time is especially significant when the scheduler plans to finish transmitting a packet in one go

TTI so that retransmission of H-ARO is almost never required.

With a short TTI duration, the traffic transmission duty cycle is relatively small compared to a long TTI duration. This means that the necessary speed of data processing (decoding, planning and encoding) per turn is lower compared to the long duration of TTI. For identical spectral efficiency and destination size, a short TTI duration results in a smaller packet size (number of data bits) compared to a long TTI duration, assuming identical spectral efficiency and a minimum number of H-ANO transmissions,) required to decode the packet for both alternatives .

Short TT duration! can lead to more alternations compared to long durations

TTI. Each alternation can be accompanied by appropriate control of the forward channel/reverse channel, for example, the possibility of channel assignments of the forward channel/reverse channel, and ASK of the forward channel/reverse channel. Therefore, the number of forward/reverse control units will be larger for the short TTI alternative. In addition, the selection of the time of these control channels is tied to the selection of the time of the corresponding alternation, therefore, the advantage of statistical compression and/or joint coding of these control channels is reduced. In some cases, there is a limit to the achievable minimum of unproductive control overhead, as well as the degree of granularity in the allocation of resources between control and traffic. These factors imply higher unproductive management costs for the alternative with a short TI duration.

Block retransmission mode is usually used for VI traffic in orthogonal systems (for example, OROMA 48. AND EOMA) and, in addition, can be useful for RI (for example, OROMA TOI). One TTI can contain one or more consecutive (TOM) blocks. In block retransmission mode, channel and interference estimation can be done locally in each block, depending on special pilot signals (for example, placed in that block). For slow-changing (pedestrian) access terminals, the channel estimation characteristics depend on the number of pilot signal groups in the frequency range overlapped by the unit, as well as the total power of the pilot signal. Therefore, a longer TTI duration helps to reduce the unproductive costs of the pilot signal without loss of performance. Therefore, a long TT duration leads to better channel efficiency for slowly changing channels. It is worth mentioning that there is no degradation of the main channel performance for fast-changing channels when choosing a long duration

THOSE.

There is a tendency for access terminals with high data transfer rates and good channel conditions to accept the assignment of a large channel (in terms of the number of tones per turn) to use high spectral efficiency and the ability to achieve high data transfer rates. For access terminals with very high speeds at the link level, the total bandwidth may be limited by the full cycle time of the radio interface. Therefore, a low level of radio interface latency is important, this requires a short TTI duration, a large destination size and a high spectral efficiency to reduce the (peak) load of TX/AX data processing, such as decoding. A large assignment per access terminal indicates a relatively low unproductive control overhead (since the unproductive assignment cost and ASK do not increase with assignment size). Finally, the accuracy of channel estimation improves at high signal-to-noise ratios (SNR), so the degradation of channel characteristics with short TTI duration is not so critical. All in all, a short TT alternative! may be suitable for access terminals with high data rates under good channel conditions.

For access terminals with low data rates and moderate to poor channel conditions, the total bandwidth may be limited by the link-level transmission rate, so strict latency requirements are not acceptable. Due to the limited transmission rate, the usual packet sizes are relatively small and lead to low demands on the computational capabilities of decoding. Therefore, some pulsating processing can be allowed. In general, the key advantages of short TTI duration are not very important for access terminals with average channel quality. However, a short TTI duration can lead to very small packet sizes for access terminals with poor channel conditions, taking into account that along with the TTI duration, the energy potential of the switching channel decreases. A small packet size (approximately 100 bits or less) results in significant losses in coding efficiency, thus further harming access terminals with poor channel conditions. In terms of channel efficiency, this is advantageous for PC users with poor channel conditions. Therefore, multiple users can be scheduled for the same queue, thereby increasing unproductive queue management costs. In this context, the reduction in the number of turns (associated with the increase in the duration of TTI) contributes to the reduction of unproductive management costs. Finally, access terminals with poor channel conditions can benefit from the increased channel level performance that comes with long TTI durations.

Figure 9 shows the choice of transmission time (protocol) of H-AKO. Both forward and reverse data transmissions are supported by H-ANVO. To ensure the processing time belonging to the H-ANO at the access point (AP) and the access terminal (AT), both the forward and reverse channels can use a structure with six alternations. It should be understood that you can use more or less frames, and the structure with six alternations is taken as an example. The timing of transmissions associated with one of the six alternations is shown for the forward channel at 902 and for the reverse channel at 904. The timing of the other alternations is identical, but with all transmissions shifted by the same number of RNU frames. In this switching structure, the presence of the superframe preamble is neglected, for example, the selection of the transmission time of the RNU frame level occurs as if there was no superframe preamble on the forward channel, and as if the first RNU frame was not extended on the reverse channel.

For the direct channel, the assignments that arrive in the RNU frame of the forward channel are applied to the queue containing the RNU frame of the forward channel, and the forward channel transmission in the RNU frame of the forward channel is confirmed in the RNU frame of the reverse channel. NARO retransmissions related to the transmission sent in the RNU K frame take place in the RNU frames K--bp, where n is the retransmission index, n--0, 1, ....

This frame structure provides a waiting time for H-AKO retransmission of -5.5 meu with a processing time of 1.8 meu (2 RNU frames) and VAT, and in AR.

For the reverse channel, assignments that arrive in the RNU K frame of the forward channel are applied to the queue containing the RNU K-2 frame of the reverse channel, and the transmission on the reverse channel in the RNU K frame of the reverse channel is confirmed in the RNU K-2 frame of the forward channel . Retransmissions of NAKO, related to the transmission sent in the RNM K frame, occur in the RNM frames K--bp, where n is the retransmission index, n--0, 1....

This frame structure provides an H-ABO retransmission waiting time of -5.5 ms with a processing time of 0.9 ms (1 RNU frame) in AT and a processing time of 2.7 ms (3 RNU frames) in AR. The reduced processing time in the AT is suitable for the reverse channel, since the AT only has to perform destination demodulation and encoding/modulation of the data packet, tasks that are much simpler than demodulation of the data packet.

Next, according to Fig. 10, the structure of the H-ABO sequence (protocol) for assignments of extended transmission duration is shown. It should be understood that the examples disclosed herein are merely examples, and there may be more or less frames than described and depicted in the drawings. In addition to the Н-АНО alternation structure described above, an extended transmission duration is provided. Such designations may extend the transmission to several RNU frames and may change the selection of transmission times and corresponding transmissions

ASK relative to the assignments depicted in the above drawings. The aforementioned extended transmission duration assignments may be useful for users with limited channel energy potential who may benefit from encoding transmissions with longer transmission durations. Extended transmission duration assignments can potentially lead to resource assignment conflicts with standard assignments, and the access node (AM) must manage resource assignments to prevent such conflicts.

For the direct channel shown in the upper part of the drawing, at 1002, the assignment of extended transmission durations that arrive in the direct channel RNU frame K is applied to the queue containing the forward channel RNU frames K through K-5. Transmission on the direct channel in RNU frames from K to K-5 of the direct channel is confirmed in RNM frame(s) from K-8 to KU of the return channel. NATO retransmissions related to the transmission sent in the RNU K frame are sent in the RNU K-12n frames, where n is the retransmission index, n-:0, 1.... The structure of the 1002 frame provides the retransmission waiting time transmission H-AKO 11 ms with a processing time of 1.8 ms (2 RNU frames) both in the access terminal (AT) and in the access node.

Next, according to the reverse channel depicted in the lower part of the drawing, position 1004, the assignment of the extended duration of transmission, which arrive in the RNU K frame of the forward channel, is applied to the sequence containing the RNU frames from KZ to K9 of the reverse channel. Transmission through the reverse channel in the cadres of RNU from KZ to

K9 of the return channel is confirmed in the RNU frame K--12 of the return channel. NACO retransmissions associated with the transmission sent in the RNU K frame are sent in the RNU frames K--12n, where n is the retransmission index, n-0, 1.... This structure of 1004 frames provides the waiting time for the retransmission H-AVO transmission 11 ms with a processing time of 1.8 ms (2 RNU frames) in the access terminal and a processing time of 2.7 ms (3 RNU frames) in the access node.

Fig. 11 is a block diagram of a method 1100 for transmitting a data packet over a direct channel. This method begins at position 1102, where the forward channel packet is encoded at the access point. This encoded packet is then transmitted to the access terminal. This access terminal receives this forward channel packet and decodes it at position 1104.

If this packet is successfully decoded, the access terminal encodes a reverse channel acknowledgment (ACC) to confirm successful reception of the direct channel transmission (or retransmission using the hybrid automatic retransmission request (H-AVO) protocol). This ASK is transmitted to the access point, at 1106. Said reverse channel ASK is received at said access point, at position 1108, and the forward channel ASK is decoded at this access point. At the access point, in position 1110, the next transmission on the direct channel (or retransmission of H-ABO) is then coded.

In other embodiments, each transmission cycle may be accompanied by an opportunity to transmit a channel assignment message. For transmission) on the direct channel, the channel assignment is issued in position 1112 and transmitted on this direct channel before the packet is transmitted on the direct channel (or essentially simultaneously with it). It should be noted that block 1112 is shown in dashed lines to indicate that it is optional.

Fig. 12 is a block diagram of a method 1200 for transmitting a data packet over a reverse channel. This method begins at position 1202, where the reverse channel packet is encoded. This encoding can be done at the access point. This encoded packet is then forwarded to the destination, which may be an access terminal.

This encoded packet of the reverse channel is received and decoded in position 1204. If the packet (or the last transmission on the reverse channel or the retransmission of H-AKO) was successfully received and decoded, then in position 1206 the acknowledgment of receipt (ACK) of the forward channel is encoded and transmitted. The encoding and transmission of the confirmation of reception of the direct channel can be performed, for example, in the access terminal. At 1208, for example, at the access point, the aforementioned confirmation of reception of the direct channel is received. In position 1210, the next transmission on the reverse channel (or retransmission of H-ABO) is coded.

In other embodiments, the transmission cycle must be accompanied by the possibility of transmitting the channel assignment message. In these embodiments, a channel assignment may be issued at position 1212 prior to transmission of the encoded reverse channel packet, at position 1202. This channel assignment may be transmitted over the forward channel. Channel assignment and transmission are useful in a system with a centralized (access point) reverse channel plan. This is usually the case in an orthogonal reverse channel access system. It should be noted that the access terminal initiated by the reverse channel assignment can be used in a basic reverse channel access system with conflicts (when attempting to transmit data simultaneously), for example, code division multiple access and forward spread spectrum access (05-SOMA).

It should be understood that Fig. 11 and Fig. 12 are depicted and described above in accordance with the situation when the user receives a transmission on forward and reverse channels in the same interface. In general, several packets (corresponding to different H-ANKO processes) can be scheduled for each access terminal on several shifts. In addition, queues in forward and reverse channels assigned to an identical access terminal may not be synchronized in time.

Fig. 13 shows an illustrative radio communication system 1300. Briefly, one base station and one terminal are depicted in the radio communication system 1300. However, it should be understood that system 1300 may include more than one base station or access point and/or more than one terminal or user device, where the additional base stations and/or terminals may be substantially similar to the illustrative base station and terminal described below, or different from them. In addition, it should be understood that the base station and/or terminal may use the systems and/or methods described herein to facilitate radio communication between them.

Next, according to Fig. 13, on the "down" channel, at the access point 1305, the transmitter data processor (TX) 1310 receives, formats, encodes, interleaves and modulates (or maps into symbols) traffic data and provides modulation symbols ("symbols data"). Symbol modulator 1315 receives and processes data symbols and pilot symbols and provides a stream of symbols. The symbol modulator 1315 multiplexes the data and pilot symbols and obtains a set of M transmitter symbols. Each transmitter symbol can be a data symbol, a pilot symbol, or a null signal value. Pilot symbols can be sent continuously in each symbol period. The symbols of the pilot signal can be frequency-division multiplexed (channels) (ROM), orthogonal frequency-division (channels) multiplexed (OBOM), time-division multiplexed (channels) (TOM), frequency-division multiplexed (channels) (FEM). or code division multiplexed (COM).

The transmitter unit (TMTA) 1320 receives and converts a stream of symbols into one or more analog signals and further conditions (eg, amplifies, filters, and up-converts) these analog signals to form a downlink signal suitable for transmission on the radio channel. The "down" channel signal is then transmitted through the antenna 1325 to the terminals. In the terminal 1330, the antenna 1335 receives this signal of the "down" channel and provides the received signal to the receiver unit (ASUR) 1340. The receiver unit 1340 brings the received signal into a specified state (for example, filters, amplifies and down-converts) the received signal and converts the reduced into a specified state state signal into digital form for obtaining samples. A symbol demodulator 1345 receives M received symbols and provides the received pilot signal symbols to the processor 1350 for channel evaluation. Symbol demodulator 1345 then receives the downlink frequency response estimate from processor 1350, performs data demodulation on the received data symbols to obtain data symbol estimates (which are estimates of transmitted data symbols), and provides these data symbol estimates to AX data processor 1355, which demodulates (ie, maps from the symbols), deinterleaves, and decodes these data symbol estimates to reconstruct the transmitted traffic data. The processing by the demodulator 1345 of the symbol and the processor 1355 of the AX data is complementary to the processing by the modulator 1315 of the symbol and the processor 1310 of the TX data, respectively, at the access point 1305.

On the upstream channel, TX data processor 1360 processes traffic data and provides data symbols. A 1365 symbol modulator accepts and multiplexes data symbols with pilot symbols, performs modulation, and provides a symbol stream. The transmitter unit 1370 further receives and processes this stream of symbols to form an "up" channel signal, which is transmitted using the antenna 1335 to the access point 1305.

At access point 1305, the uplink signal from terminal 1330 is received by antenna 1325 and processed in receiver block 1375 to obtain samples. The symbol demodulator 1380 then processes these samples and provides received pilot symbols and data symbol estimates for the up channel. AX data processor 1385 processes these data symbol estimates to recover the traffic data transmitted by terminal 1330. Processor 1390 performs a channel estimate for each active terminal transmitting on the "up" channel.

Processors 1390 and 1350 manage (eg, regulate, coordinate, organize, etc.) the operation of access point 1305 and terminal 1330, respectively. The respective processors 1390 and 1350 may be associated with memory blocks (not shown) that store program codes and data. Processors 1390 and 1350 may also perform calculations to obtain frequency and impulse response estimates for uplink and downlink channels, respectively.

For a multiple access system (for example, ROMA, BOMA, SOMA, TOMA, etc.), several terminals can transmit simultaneously on the "up" channel. For such a system, subbands of the pilot signal can be divided between different terminals. The mentioned channel estimation methods can be used in cases where the subbands of the pilot signal for each terminal cover the entire working frequency range (possibly with the exception of the edges of this frequency range). Such a structure of subbands of the pilot signal would be required to obtain different frequencies for each terminal. The methods described here can be implemented by various means.

For example, these methods can be implemented by hardware, software, or a combination thereof. For hardware implementation, the processors used for channel estimation can be implemented in one or more specialized integrated circuits (SICs), digital signal processors (DSPs), digital signal processing devices (DSPs), programmable logic devices (PLDs), user programmable gate arrays (PSAs), processors, controllers, microcontrollers, microprocessors, other electronic devices designed to perform the functions described here, or their combinations. With the help of software tools, the implementation can be done through modules (eg, procedures, functions, etc.) that perform the functions described here. Software codes can be stored in memory and executed by the 1390 and 1350 processors.

It should be understood that the embodiments described herein may be implemented in hardware, software, programmable hardware, middleware, microcode, or any combination thereof. When the systems and/or methods are implemented in software, programmable hardware, middleware, microcode, or code segment, they may be stored in a machine-readable medium, such as a memory component. A code segment can represent a procedure, function, routine, program, standard program, standard routine, module, program package, class, or any combination of instructions, data structures, or program statements.

A code segment can be connected to another code segment or a hard-wired circuit by transmitting and/or receiving information, data, arguments, parameters, or memory contents. Information, arguments, parameters, data, etc. may be forwarded, sent or transmitted using any appropriate means, including memory sharing, message passing, token forwarding, network transmission, etc.

For software implementation, the methods described herein may be implemented using modules (eg, procedures, functions, etc.) that perform the functions described herein. Software codes can be stored in memory blocks and executed by processors. The memory block can be implemented inside the processor or outside the processor, in the latter case it can be communicatively connected to the processor in various ways known in the art.

The foregoing includes examples of one or more embodiments. Of course, it is not possible to describe every possible combination of components or methods in order to describe the above embodiments, but one skilled in the art can understand that many other combinations and permutations of the various embodiments are possible. Accordingly, it is intended that the described embodiments cover all such changes, modifications and deviations that are within the essence and scope of the appended claims. Furthermore, since the term "comprising" is used either in the detailed description or in the claims, it is understood that such term means includes like the term "comprising" when the term "comprising" is interpreted when used as a transitive words in the claim. ; , Rash shk nu ra z: , shop sa M 303 --- Sh,

A o Where is my child and where are you 493 and "el

On se yan a ze-- De y lany y s tuzheRneh u ve mch Nd ves uh as y .

B these that - Zhro t that oz s Y

AK still x and KO x la g: EI Mch - in fig.

ul zvi zm tane tt rzv ayuuth | and In fozlyumtaydtyaih days and | | ш- fr одняннтятяняння | ' and khthdke gi Her day and ta

E and dykhODEE M mn shen botyayannyai shi TT ortyudd tim ya sus u JSC: KK i E: va ROrokktuyutTvAnsya p

OS and en cheniem the same child!

EP oovvvnnnn I N !

Their PLANNING WITH H ! mn and N

Ek and ! y N Ya' y shi dilettnAT A AKAKVYE Yuni new; faith 3

ЗХ ше да онов клад орооововостя щи

Goa girls netnyatnnntya

Pe TI MEATOK N i

E vi flirt NYA zhk

VM modudyuko and Shri molultkok and t roriozhkAnazh her N and what

Oh SHE I |oaeempah zhu dvir rt '

Si | dyan she I | | also V melon

About rolekodh dyn avezhenoi ryaniya and

NOT valid and NOT | o she - Ambassadors: R nn yah

R zi and p: SYA 7

OO ii Go laziness I I or peacunalnnu do NOT do

With ! In nn s-

E | rentable

KZ EE mini and shk UAZ!

GTK ovavkyuvh and ri taro I forbnnnttnnnyaya KE: and N Ki for YOU y y N

Do not live in heaven and hell

EN I on I dtp AAKATT KAVI NATAN Kt vn a

502-400 DISCOVERY OF CONDITIONS FOR

CHANNELS

504 - SPEED DETERMINATION

DATA TRANSFER

506 -) LONG TERM PLANNING

OR SHORT t "08 ISSUANCE OF NOTICE

C CHANNEL DEFINITION

It's the end

Chng. 5 - what's more! ii «m xi zh zh sh sly Hek spades PASSING MSA WAR MASSES VENIA NO way i le da p Й p 16 he

And st shi a NI po--y z nn She

. dentin 1: you and cm IN:

software

, pi and ote with is Y ' vPUnh khiv wiki I; li | si in ki; and KZHOO whose E

Kk y / m a OH y b zukdsyah Gete kg kiz pt Vrva spring a v'pivi, which r M Sp z | mitsordnyk y y no Tvshlh! AND

Mt Y 1

NV ' and chi N with shk ih lo Ye i tih.Ya

PEN nin PN KK ZAV A KN

KEN v i i it ee GAMI with Every Yum ruk x

RY YAKU ord KHIT

A N i Y i u i i 1 : i N : and futurists wash here m | Y N on Z VD S VA: inn mon mon zno nn nn in k 1 N CI 1 x feny - (NOYA fey i I

KE. OA YN Zh o bkumzhka motif I izzhtru! urine rock N

ВЛЖЖЮ; I N : x i , N N ( U i

EMV in SAN ANNA SIGN AK N 7 TYHO ANMY N t ,

MON

Still KI rozhi i i ese shin nin pon pnia nyni nar Nipples nn z LU 1! 4 M N - ezveya NI pi VI EN MY EE PASSING В ж і k Ні N ї po PO PO NN A O p e "i r MISHI SHO ATAK r і ! and and and and and N and

Geama tn Koshty KEOMO and ren zimi KOSTEshKi BU!

I kn m S pa ak i

DU diA

Phi: 5 ii 2 x 7 z x N m g "4 1. x . g and

Pe vish po on in rytya tr 00OrOA EOR h

N y N N ' yy N m ! She v s y , kla: i V uhi efe fr fr ris shin nn i ny nia KODIMA N

Rzhku SHO and rony Y bl, Y: N Y N N n ny a ZO vida i I - and -e o piroookoe st PY MY ' pn vy pi m ia A zt i as HORROR N Ko u ia

COUNTRIES AND M YN WE HAVE NN and 1 and Н N and N i and Y zh , pi PV, topics of knowledge pop MVV MARKETS "1 Her Te ! T game Yes No. and and and ! and ! N N and

Or ain PMM MELE i

NA VA : PA nki, N Vy I nena ee ; ROOF, H NOT and

N KMU ladies I

F. rati that ethno tin

Pen se NK ZDA knowledge NK DSN ZK ZBE pn p i p YOU W ON ZE DY WIN DOA PL MN

NNC ZIM sleep m: NI AK OV ZAYA for sleepy ZNA MNN NEW, porn! and ri Rode Ronnie

No N i WILL BE IN 1 NO N nes ny vo vo PE DK v z 1 nn Z khmigru rr roz rkh ri» reggi rt nt pi poza yun magvepvovs zrva ne mne i psch i n | Y S OA Tsi i mm ny t o p t p r v p v v

ABOVE NNNN O HN POVI UNO ANNE MONO ZAV VON VONNI ZONNI ZONI

"ET EN tt Ann, r-r rn OS KT

N N B... N N N N t---.1 N ! N N N N en an p p p p p p ny p a V V VO he V nn nn p p a V NN VN SHE

Ash from Mon to Tue in M

Trve M NK o o V vn chn, Gi

Fk.

the beginning) the student knows and I ZANI ISSUING THE APPOINTMENT NO I b 1 CHANNEL and

M dyn wedges kzhchkyutoto tot zh -4 ARIREDAE t

AND LOCKED PACKAGES

N pkiyuomi Her am

N Decoupage package and ! ; in a dream

I opevvdlalayeky, ZM

S. y

You are the one who is the one

And hvo AV TSPRZNMASILEKODUYE | r o. o. and ASK.

OO young -k

CALL NNYA he COODUES INSTRUCTION

I WILL TRANSFER KE and

There is bark Z fic. re

CD seals retiyayannnnt nave pi- VNDACHAIRDEFINITION OF ZHK fo MANALUPKPREDAATSM. YOU are to blame! mice VYMONNNNN their A? GOVERNED by PAKKT coders of the city of 5-5 and DEDUVAVNYANAKET. in VM

And her! tr

N

N

UOKHUVANNHI | with

E | MMK TRANSFER. VI. Mr

OS still ARPUNYMAE AK M. !

T210--) Encoded and TRANSFERRED as Z

S.U.K. Z

"kp pechichiyutknyi "vn.

My, in the Pkhtchnky there are Zzadu and Kozazav and Nzv -ah zkh

ZL. FIELDS; N cl is ai

Their ID 0101 M Unit and Unit:

MZHK re Z. nykh rya ked M z

I ADYA We VAN PI M BOYU in M 1 I and NK zenith | and mya zok chu: N and z

I pre Z ts N | tsa KO

N and : and ! ! nt I | Sweeping

NI: N i5uk., uoiozzha: Pou: ta, te pni i shkh pt p - MM vezhk iyulak- U Z MY

A nn OVO Misha Kish Maga. horses 157 eats o proldyeme hu im cheri