Usage of additional assignment

UKRAINE

(19) and A (11) 93045 (13) C2

(51) IPC (2011.01)

H04B 7 / 00N04M 16 / 00N04M 72/00

MINISTRY OF EDUCATION SCIENCE OF UKRAINE

STATE DEPARTMENT OF INTELLECTUAL PROPERTY

DESCRIPTION

TO THE INVENTORY PATENT

(54) USE OF ADDITIONAL APPLICATIONS

1

(21) a200711134

(22) March 8, 2006

(24) 10.01.2011

(86) PCT / and32006 / 008455, 08.03.2006

(31) 60 / 659,971

(32) March 09, 2005

(33) from

(31) 11 / 142,121

(32) 31.05.2005

(33) from

(46) 10.01.2011, bulletin # 1, 2011

(72) TIG EDWARD HARRISON, from

(73) kveklkomom incorporated, from

(56) SHO 2004/023834 A; March 18, 2004

SHO 98/37706 A; 08/27/1998

of 5594738 A; January 14, 1997

(57) 1. A method of dynamically distributing system resources in a wireless network environment, comprising the steps:

transmit the initial assignment of resources to at least one mobile device connected to a remote network to assign the said initial set of resources to at least one mobile device;

determine if at least one mobile device requires additional resources; form an additional resource assignment that assigns at least one additional resource to at least one mobile device; and transmit an additional resource assignment to at least one mobile device in order to save the set of resources assigned to at least one mobile device.

2. The method of claim 1, wherein, at the stage of formation of an additional resource allocation, an estimate of a plurality of all resources and a subset of access resources is determined.

3. The method of claim 2, which further comprises a step on which select available resources from a subset of available resources for an additional destination, which minimizes the size of the message for additional resource assignment.

4. The method of claim 3, further comprising a step on which continuous resources are selected, when more than one additional resource is needed to help

2

Make a resource assignment for at least one mobile device.

5. The method of claim 4, further comprising a step in which a continuous additional allocation assignment for at least one mobile device is formed.

6. The method of claim 3, further comprising a step at which an initial initial assignment of resources is formed when less than three additional resources are required to supplement the appointment of at least one mobile device.

7. The method of claim 1, further comprising a step on which the initial assignment of resources is verified.

8. The method of claim 7, wherein the verification of the on-site resource allocation includes a step in which a verification message is transmitted to at least one mobile device to the network.

9. The method of claim 8, further comprising a step at which an indication in the verification message is provided that the initial destination of the resources has been successfully received and decoded in the reverse link of communication.

10. The method of claim 8, further comprising a step on which the confirmation in the report is verified that the initial assignment of resources was successfully adopted and decoded in a straight line communication.

11. A system that facilitates the assignment of additional resources for mobile devices, which contains: the destination component, which forms the initial assignment of resources for a plurality of relevantmobile devices, with the initial allocation of resources is maintained until the next initial assignment of resources will not be acceptedmobile device, which is responsible these prize-giving;

an additional component that receives information relating to requirements in the increased resources of at least one of a plurality of mobile devices and generates an additional resource assignment in order to distribute additional resources to meet the requirements of at least one mobile device at increased resources;

iA (11) 93045 (13) C2

σ>

3

93045

4

receiver-transmitter, which transmits a message assignment of resources to a plurality of mobile devices.

12. The system of claim 11, wherein the additional component generates additional resource assignments when the destination component uses an outline format that restricts the assignment of the subset of resources.

13. The system of claim 12, wherein the message format is at least one of the method of assigning a continuous block, a method for assigning a channel tab or destination in the form known to the user.

14. The system of claim 13, wherein the additional component forms an additional resource assignment to the form, which comprises at least one of the list of indexing blocks and a continuous resource block.

15. The system of claim 11, further comprising a verification component, which receives a verification message using a transmitter receiver from mobile devices, indicating the reception and successful decoding of the initial assignments of re-resources.

16. The system of claim 15, wherein the verification component rejects the assignment of resources to mobile devices that do not transmit the verification message,

and rejected designated resources maintain an available state.

17. The system of claim 11, further comprising an artificial intelligence component (AI), which performs a transient generation of additional attributes to reduce the cost of transmission.

18. The system of claim 17, wherein the AI ​​component outputs an additional message format based on, at least partially, the availability information of the resource at the time of generating an additional allocation of resources.

19. The system of claim 11, wherein the resource is at least one of the transmission channel, frequency, transmission interval, and code channel.

20. The system of claim 11, wherein the mobile device comprises a wireless communication device.

21. The system of claim 11, wherein the mobile device is at least one of a cellular telephone, a portable computer and a personal digital assistant (PCA).

22. A device that facilitates the management of resources of the non-conductive network, which contains:

a means for forming a permanent assignment of initial resources, which assigns resources tomobile device;

a means for detecting whether resources are intended formobile device, sufficient at this timetime;

a means for creating an additional destination resources, when it is determined that the resources assigned to a mobile device are insufficient; A tool for transferring resource assignments to a mobile device.

23. The apparatus of claim 22, wherein the means for generating additional resource assignment contains a means for evaluating all resources in the network and identifying a plurality of available resources.

24. The apparatus of claim 23, wherein the means for forming an additional allocation of resources are additional

forms an additional allocation of resources in the message, which has a format that minimizes the cost oftransfer costs.

25. The apparatus of claim 24, wherein the message describes an additional resource in a continuous format when more than one additional resource is required by mobile devices and when sufficient continuous references are available.

26. The apparatus of claim 24, wherein the message describes an additional resource in the format of the block index list, when the mobile device requires less than an additional resource, or when a sufficient amount of continuous resources is not available to satisfy the identified resource requirements in a mobile device.

27. The apparatus of claim 22, further comprising a means for verifying that the destination has been received successfully and decoded by a mobile device.

28. The apparatus of claim 27, further comprising a means for identifying the resources described in the verified purposes as inaccessible resources to mitigate the conflicting assignment of resources.

29. A computer-readable medium stored by the computer's commands for:

estimating assignment of resources on a device that is exchanged over a wireless network; determining if the device requires additional rescues; and

provision of additional resource assignment to a device that increases the existing destination resources for the device without requiring a complete replacement of resources.

30. The computer-readable media according to claim 29, further comprising instructions executed by the computer, for verifying the device receiving the initial assignment of resources prior to the assignment of the transmitter to this additional device.

31. The computer-readable media according to claim 29, which further includes commands executed by the computer, to provide initial resource prizes that are retained until they are completed or replaced.

32. A computer-readable medium according to claim 29, which further comprises commands executed by the computer, to evaluate the resources available for additional resource assignment and to select an additional subset of resources that minimizes the size of the message for additional resource assignment.

33. A microprocessor that executes commands for completing the assignment of resources of a device that is changed over a wireless network, and the co-mions include:

Provide initial resource assignment for this device;

detecting the requirement for increased resources for this device; and

the formation and transfer of an additional destination resources on this device,

which increases the initial resource assignment for this device.

34. A mobile device facilitating the exchange of a wireless network comprising:

5

93045

6

a component that accepts the initial destination of resources and establishes management of the resources identified in the initial assignment of resources; and

a component that identifies an additional assignment of resources and establishes control over one or more resources identified in the additional resource assignment in order to increase the set of resources assigned to the mobile device by its intended purpose of resources.

35. The mobile device of claim 34, wherein the mobile device is at least one of a cellphone, a smartphone, a portable computer, a satellite radio, a global system for determining a location, a handheld computer, a handheld device, and a personal digital Assistant (CAC).

36. The mobile device of claim 34, further comprising a verification component that generates a verification message to indicate the prize-giving of resources and transmits wirelessly.

37. The mobile device of claim 36, wherein the verification message indicates whether the resources identified in the assignment of resources are successfully awarded to the mobile device.

38. The mobile device of claim 36, wherein resource assignment is at least one of the initial assignment of resources and additional allocation of resources.

39. Mobile device according to claim 34, wherein the initial assignment of resources is a permanent appointment,

which is stored by the mobile device, until at least one of the new destination and destination destination resources is accepted.

40. The mobile device of claim 34, wherein the mobile device provides indication of the requirement of increased resources to the wireless network in order to cause an additional allocation of resources.

41. A microprocessor of a mobile device that executes commands to complement the assignment of respaws to a mobile device when exchanging wirelessly the network, and the commands include:

reception of initial assignment of resources; Indicator of the requirement of increased resources; and reception of additional allocation of resources; and

integrating the resources identified in the additional allocation of resources into a set of resources identified in the initial allocation of resources.

42. Method of securing resources for usemobile device, comprising the steps: reception of the initial assignment of resources in the mobile device;

establishing management of the resources identified in the initial allocation of resources; provision of indications regarding requirements in increased resources;

reception of additional allocation of resources; and installing management of resources identified in the additional allocation of resources in order to increase the set of resources received from the start-up destination.

This patent application declares the priority of application No. 60 / 659,971 "iZE OЕ 3υΡΡΙ_ΕΜΕΝΤΑΙ_Α33ΙΟΝΜΕΝΤ3", filed March 9, 2005 and transferred to the assignee of this application and solemnly included in the link in this description.

The following description relates to generally unconventional exchanges, and more specifically, the dynamic assignment of network resources to help provide additional resource allocations that ease resource constraints.

Wireless network systems have become widespread means by which most people all over the world want to communicate. Wireless connectivity devices have become smaller and more power-hungry to meet consumer needs and enhance the mobility and convenience. The increase in the processing power in mobile devices, such as cell phones, leads to an increase in requirements for wireless network transmission systems. Such systems are usually not so easy to do, as the cellular devices that make the exchange in them. Because the capabilities of mobile devices are expanding, it may be difficult to support an older wireless network system, which facilitates the full use of new and improved capabilities of wireless devices.

For example, it may be expensive (for example, to determine the number of bits, ...) to accurately describe the assignment of channels in a wireless network environment. This can be especially true when it is not necessary for users (for example, mobile devices) to be notified about the assignment of system resources to other users of the wireless system. In such cases, the assignment of system resources, such as broadcasting channels, and the like, may require an update in virtually every broadcasting loop to provide each user with an adequate bandwidth and / or power level that can load a non-conductive network system and accelerate the realization network constraints. Additionally, requiring such continuous updates and / or messages about full reassignment, which should be transmitted to users so often,

Multiple access communication systems usually use methods for assigning system resources to individual users of the system. When such appointments change quickly for some time, the overhead (office) costs of the system are only required for management purposes.

7

93045

8

nami, can become an essential part of the full pro-capacity of the system. When appointments are made using messages that restrict the assignment of resource blocks to the subset of all possible permutations of blocks, the cost of the prize-giving can be reduced somewhat, but by definition, the appointment is limited. In addition, in the system where the destination is "freely changeable" ("sticky") (for example, the value is stored in time instead of the ma-ti deterministic end time), it can difficult to formulate a limited message when value related to the available resources for this moment.

As a result, at least, the aforementioned, there is a need in the given field of technology in the system and / or methodology of the improved notification of assignment and / or updating and reduction of the overhead of the destination messages in the wireless network systems.

Below is a simplified version of one or more implementation options to provide a basic understanding of such implementation options. This essence is not a comprehensive overview of all intended options, and is not recognized either to identify the key or critical elements of all implementation options, nor to limit the scope of any or all of the implementation options. Its only purpose is to present some concepts of one or more embodiments in a simplified form as an integral part of a more detailed description, which is presented below.

In accordance with one or more options implementation and their respective disclosure, various aspects are described with references to the management of system resources and to meet the needs of the user in the unconnected network environment. In accordance with this aspect, additional assignments may be used to increase the "slowly varying" destination (e.g. assignments that are valid until the next signal destination is accepted). Ordinarychanges that slowly vary, maybe restrictive (for example, an inability to give a prize-to start arbitrary sets of resource blocks, ...). Descriptions of additional appointments can facilitate the assignment of instantly available system resources, as well as provide a more reliable user experience for the reduced cost of overhead, than can be achieved by conventional systems and / or methodologies. In accordance with another embodiment, the method of dynamically distributing system resources in a wireless network environment may include a non-additional assignment to at least one mobile device connected to a wireless network to assign an initial set of resources to at least one mobile device, determining whether it requires , at least one mobile device of additional resources, the formation of an additional assignment of resources, which assigns at least one additional resource to at least one mobile at triy and transfer dodatkovohopryznachennya on at least one mobile

a device for increasing the set of resources assigned to at least one mobile device. The methods may further include receiving confirmation of an appointment on a mobile device prior to the assignment of an additional destination.

In another aspect, there is described a system that addresses the assignment of additional resources for mobile devices. The system may include a component of a destination that generates no additional assignment of resources for a plurality of relevant mobile devices, and an additional component that accepts information relating to increased requirements for resources of at least one of a plural mobile device, and forms an additional assignment to allocate additional resources to meet the requirements in increased resources of at least one mobile device. The system topic may further include a transmitter transmitting an assignment message to a plurality of mobile devices. In addition, appointments can be permanent or "slowly varying", such that they are stored on a mobile device before,

In another aspect, a device facilitating the management of wireless network resources may provide a means for generating a permanent initial assignment of resources assigned by the resource to a mobile device, and a means for detecting whether resources allocated to a mobile device are sufficient at a predetermined time point, a tool for generating additional resource assignment to resolve the resource shortfalls found on the mobile device, and a means for transferring rescue agent assignments to a mobile device. Additionally, the device may include a means for verifying a mobile device of destination, to ensure that the additional purpose of the resource complements the initial assignment of the resource to him.

To address the foregoing and related problems, one or more embodiments contain signs, described in detail below and specifically specified in the claims. The following description and the attached drawings describe in detail some illustrative aspects of one or more embodiments of implementation. These aspects, however, are illustrative and some of the various ways in which the principles of various embodiments can be implemented, and the described embodiments are intended to include all such aspects and their equivalents.

FIG. 1 illustrates a group of N system drive units to facilitate understanding of the method by which the various embodiments disclosed herein may function.

FIG. 2 is an illustration of a channel table that can be used in a wireless network system to facilitate the assignment of system resources that contains a plurality of users (for example, devices) and the assignment of their respective resources.

FIG. 3 illustrates a group of resource blocks that may be distributed to a plurality of users. FIG.

9

93045

10

4 is an illustration of a sequence of non-constant (for example, non-slow) assignments made for some time.

FIG. 5 is an illustration of a sequence of constant assignments or "slowly varying" assignments made for some time, for example, which can be used in relation to various embodiments described in the description.

6 is an illustration of a system that facilitates the use of additional assignments for distributing system resources in a manner that reduces system charge charges and / or transmission requirements by reducing the size of a signal.

FIG. 7 illustrates a system that facilitates the provision of additional resource assignments by network users in order to reduce the cost of the overhead of the destination signal.

8 is an illustration of a system that facilitates the creation of additional assignments for assigning system resources to network users, while reducing the cost of resource allocation.

9 illustrates a system that facilitates assigning system resources to a user for a minimum cost of overhead.

10 illustrates a methodology for generating and providing additional system resource assignments to users of a wireless network.

FIG. 11 illustrates a methodology for generating and transmitting additional assignments to a user in an unconnected network environment.

12 is an illustration of a methodology to provide additional resource assignments for exchange between devices over a wireless network.

FIG. 13 is an illustration of a wireless network environment that can be used in conjunction with different systems and methods described herein.

Various embodiments are described below with reference to the drawings, in which similar numerical reference symbols are used to refer to similar elements. In the description below, in order to explain, many specific details have been formulated to provide a complete understanding of one or more embodiments. It may be obvious, however, that such (s) implementation (s) may (may) be implemented (i) without these particular details. The best examples are well-known structures and devices are shown in block diagrams to facilitate the description of one or more embodiments.

The terms "component," "system," etc., used in this application, are intended for assigning to an object-connected computer or hardware, a combination of hardware and software, software provision, or software in execution. For example, a component may be, but not limited to, a process executed on a processor, processor, object, executable program, execution stream, program and / or computer. One or more components can be continuously located in process and / or flow of execution, and the component can be localized on one computer and / or distributed between two or bi-

Larger than computers. Also, these components can come from a variety of computer-readable media that has different data structures stored on it. Components can be associated with local and / or remote processes, for example, according to a signal having more than one data packet (for example, data from a single component interacting with another component on a local system, a distributed system, and / or network, such as the Internet, with other systems using such a signal).

In addition, various embodiments are described herein by reference to the subscriber station. A subscriber station may also be referred to as a system, subscriber unit, mobile station, mobile device, remote station, access point, base station, remote terminal, access terminal, user terminal, user agent, or user equipment. A subscriber station may be a cellular telephone, a radio telephone, a telephone initiation session (ZIR), a local radio station (ISCH, a personal digital assistant (RSA), a pocket-device capable of wireless communication, or another device processing associated with a modem.

In addition, various aspects or features, as described herein, can be implemented as a method, device, or product of production, using standard software and / or technical techniques. The term "productproduct" used herein is intended to encompass a computer program, access pencil from any device read by a computer, carrier, or carrier. For example, a computer readable media may include, but are not limited to, magnetic storage devices (for example, a hard disk, a flexible disk, magnetic tapes ...), optical discs (for example, a CD ( CU), a digital universal disk (YUYU, ...), smart cards and flash memory devices (for example, a card, a stick, a key ...).

With reference to the drawings, FIG. 1 illustrates a group of N blocks of 100 system resources to facilitate understanding of the method by which the various embodiments presented herein may function. Such blocks of 100 resources may be, for example, time intervals, frequencies, code channels, combinations of the above, etc. A general description of the subset of such blocks maybe, for example, a list of block indexes, for example, a list of blocks, designed for a specific user. For example, a list of indices, such as {2, 3, 10, 11, 12, 13} can be used to represent that this user is assigned such blocks. Alternatively, an array of values ​​can be used to describe the same assignment, for example, an array of N bits {01100000011110}. Conventional systems that use such assignment mechanisms will be atwhich will spend a significant cost, albeit with different properties. For example, the list of index blocks can be significantly more expensive in the sense of the number of bits needed to pass such attributes when the subset of blocks that should be prize-wise

11

93045

12

mined, increases in size. The array of values, on the other hand, shows partially fixed costs irrespective of the number of units and zeros, but these waste are relatively large, especially when N grows.

Additionally, in cases where the purpose is limited to continuous sets of blocks, or re-surs, such assignments can be transmitted, indicating the first block in the appointment and the total number of blocks in the destination. For example, the assignment of block indices, such as {11, 12, 13, 14, 15} can be transmitted as {11, 5}, where "11" represents the first block to be assigned to this user, and " 5 "represents the total number of continuous blocks, which should be assigned, of which 11 is the first block. In addition, if the ordering of users is known, the sig-ul of the destination can be transferred without informing the user. For example, only the number of blocks to be assigned should be passed until all users have been notified about the destination for all other users. Example, if the value for users 1-3 is presented as {user 1: 1-5}, {user 2: 6-7}, and {user 3: 8-12}, and if all users know their respective user numbers, such an appointment can be written as {5, 2, 5}. However, such a structure requires that all users in the system know about the assignment for all other users, oski-

For example, user 2 may not know that his appointment begins with block 6, as long as he does not know that blocks 1-5 were assigned to user 1. Thus, one can see that systems that use such conventional methods of assigning system resources can be sustainable in realization and can be an essential part of the system resources for transmission, in which they are implemented. As will be seen, the systems and methods described herein facilitate the overcoming of such common difficulty.

FIG. 2 is an illustration of 200 table channels, which can be used in a wireless network system to facilitate the assignment of system resources (eg, transmission channels, time intervals, code channels, frequencies, ...), which contains a number of users (such as devices) and their appropriate resource assignment. Such a table 200 may be known to all users who may use the table table indexes to interrogate the destination message. For example, according to table 200, an appointment such as {user 1: index 2} can be written, which can reduce the cost of the destination signal in comparison with the methods of indexing blocks and / orbased arrays. The following table formulates the characteristics of the usual mechanism of assignment with their relative benefits and consequences.

<tr><td><p>Way</p></td><td><p>Limitation</p></td><td><p>Costs</p></td><td><p>All users should see all appointments</p></td></tr><tr><td><p>List of block indexes</p></td><td><p>No</p></td><td><p>High</p></td><td><p>No</p></td></tr><tr><td><p>Continuous block</p></td><td><p>So</p></td><td><p>Medium</p></td><td><p>No</p></td></tr><tr><td><p>Array of values</p></td><td><p>No</p></td><td><p>High</p></td><td><p>No</p></td></tr><tr><td><p>Known order of users</p></td><td><p>So</p></td><td><p>Low</p></td><td><p>So</p></td></tr><tr><td><p>Channel table</p></td><td><p>So</p></td><td><p>Medium</p></td><td><p>No</p></td></tr>

Thus, one can see that the typical allocation distribution schemes do not provide a mechanism that is both cheap and non-restrictive, and which does not require all users in the system to see the appointment of all users.

FIG. 3 illustrates a group of blocks of 300 resources that can be distributed to a plurality of users. Such resources may include, for example, system channels, time intervals, frequencies, code channels, etc. According to the embodiment, slow-moving prizes (for example, appointments that are permissible until an optional destination signal is accepted) may be used to assign system resources, for example, in wireless networks (e.g. , OBUM, OBUM, SUMA, TYUMA, SPM, ...). Such assignments can also be restrictive, so that the cost of the signal is reduced due to the price limitations of the ability to freely assign resource pool sets. To overcome such constraints, at the same time minimizing the cost of the destination signal, may use additional destinations, to manage the system resources and satisfy the user's needs for resources. For example, blocks of 300 resources may include a first set of 302 blocks that contains blocks 1-4 that are assigned co-

user 1. User 2 may be assigned a second set of 304 blocks, which contains blocks 5 and 6. Finally, blocks 7-9 can be a set of 306 blocks, which consists of unused blocks. It may be discovered that user-requirements requirements 1 have increased to a point where user 1 requires additional resource blocks. According to this view, an additional prize may be generated, which may increase the current appointment of the first user, instead of replacing it completely. For example, an indication bit (indications) may be included in the aforementioned additional purpose, to mark this appointment as an additional assignment, so that the recipient's device can also recognize it. If the bit is set to the "extra" level, then the channel or resource described by the message may be updated to the appointment of this user, which is supported earlier. If the bit of the designation is not set to the "extra", then this message can be interpreted so as to replace the predetermined purpose. It will be apparent to those skilled in the art that other methods of denoting the message may be used for additional / non-additional purposes, and that the embodiments described herein are not limited to the use of the bit designation, but instead may

13

93045

14

use any suitable mechanism of the meaning, either implicit or explicit.

For example, for user 1, the slowly changing initial value can be represented as {1, 2, 3, 4: 0}, where 0 indicates non-target destination, and channels 1-4 are assigned. Additionally, in order to reduce the transmission cost of a signal in cases where the assigned channels are continuous (with sequential numbers), so an additional destination may be represented as not [1,4: 0], where the first integer "1" represents the first assigned channel, and the second integer number "4" represents the length (list) of designated channels. If additional channels should be prize-wielded to user 1, for example, due to increased user needs, etc., then an additional assignment may be called and passed to user 1. For example, {7, 8, 9: 1} may pretend that Channels 7, 8 and 9 should be additionally assigned to User 1. In this example, the tag bit is set to "1" to indicate that the destination is optional and should not simply replace the previous assignment of Channels 1 through 4, but instead increase that assignment. Additionally, since additional channels 7-9 are continuous, the additional destination can be expressed as [7, 3: 1], where 7 is the destination of the first additional channel, and the length of the continuous additional channels to be assigned is 3. According to With this latter aspect, the charge (commission) of the destination signal can be further reduced in comparison with the original systems (for example, necessary for the transmission of a large second signal, such as {1,2,3,4,7,8 , 9: 0}). but instead increase this appointment. Additionally, since additional channels 7-9 are continuous, the additional destination can be expressed as [7, 3: 1], where 7 is the destination of the first additional channel, and the length of the continuous additional channels to be assigned is 3. According to With this latter aspect, the charge (commission) of the destination signal can be further reduced in comparison with the original systems (for example, necessary for the transmission of a large second signal, such as {1,2,3,4,7,8 , 9: 0}). but instead increase this appointment. Additionally, since additional channels 7-9 are continuous, the additional destination can be expressed as [7, 3: 1], where 7 is the destination of the first additional channel, and the length of the continuous additional channels to be assigned is 3. According to With this latter aspect, the charge (commission) of the destination signal can be further reduced in comparison with the original systems (for example, necessary for the transmission of a large second signal, such as {1,2,3,4,7,8 , 9: 0}).

According to the related aspect, transfer permissions for additional allocations can be based on confirmation of the pre-assignment to the user (for example, acceptance of some verification data reliability, for example, a verification message indicating the successful decoding of the packet or sequence on the back link, confirmation successful reception or decoding of the forward link, ...). Thus, the network can check the correctness of the user's appointment to complete the addition of such appointment.

4 is an illustration of a sequence of non-constant (for example, slow-changing) assignments of 400 made during a certain time. Frequencies are illustrated as the type of system rescue, which is assigned, although the system resources that are assigned are not limited to those that are exactly such. According to the drawing, the first user u1 is assigned a frequency t₃ at time 1. Time time 2 frequency t₃ may be re-assigned to user 2, in particular, because this initial assignment is not a slow-changing destination. The frequency ίο is illustrated as assigned to user 3 both at the time of time 1 and at the instant of time.2 However, since the assignment of the frequency to the user 3 is not a slowly changing destination, the preservation of the frequency t₀ for user 3 may require individual appointments in each from the time of time 1 and the time of time 2, resulting in undesirable increases in overhead costs

destination signal, which in turn can negatively affect the system resources. Thus, a system that uses a destination other than those that are slowly changing may require n different message assignments per loop to indicate η available frequencies to N users.

5 is an illustration of a series of constant assignments or "slowly varying" purposes, made over a period of time, so that they can be used in relation to various embodiments described in this specification. For example, the first set of assignments can be passed to users 1-N during the first frame, and such assignments can be kept until one or more further assignments will be edited to one or more individual users. Thus, the first set of N assignments may be sufficient to provide the assignment of system resources to all users, until the change in such appointments becomes desirable and / or necessary (for example, due to the needs of the user, the availability of bandwidth, ...). For the next user, for example, ib, the frequency Ta may be recognized, if such a frequency becomes available, as illustrated at time t3. Thus, the less number of destination messages should be transmitted over the network, rather than using slow-changing attributes.

Additionally, available system resources can be assigned to any 1-N user if this user requires additional resources. For example, it may be determined that 5 requires an additional frequency availability at a certain time during the exchange over the network, in addition to the frequency of Thy. The next announcement can be transmitted to i5 to indicate that the time T_is and t are for 5. In addition, together with different implementation variants, detailed herein, such additional message prize-giving can be an additional appointment to soften the consumption of network resources by re-assigning frequencies to 5.

Fig. B is an illustration of system 600 that facilitates the use of additional assignments for the distribution of system resources in a manner that reduces the system's cost of charge and / or transmission requirements by reducing the size of the signal. System 600 may include a destination component 602 that controls the distribution of a system resource (eg, channel, frequency, time interval, code channel, ...). The destination component 602 comprises a slowly varying component 604 that is slowly changing, which can be stored in time, until further information of the destination is accepted by the user (e.g., the device). The assignment component 602 additionally includes an additional com-component 606 that generates additional destinations for distributing system resources according to the user's needs when they are changed. Example, the additional component 606 can form one or more additional channel assignments in order to serve one or more user users whose channel requirements have changed during the event of the connection. Such assignments can be transferred

15

93045

16

through one or more base stations 608 operatively coupled to assignment component 602 to one or more user devices 610.

According to the example, the user device 610 may be originally designed to dial available resources, for example, {1, 3, 4, 6: 0}. The user device 610 may then require additional resources, and it may be determined that the resource block or channel 2 is accessable. According to an embodiment, the additional value [2, 1: 1] can be formed and passed to the user to add resources starting from block 2 and having a length of 1 (for example, channel 2). Thus, the system 600 does not need to repeatedly transmit a three-dimensional full notification of the destination (for example, {1, 2, 3, 4, 6: 0}).

According to another example, the user may be assigned resources 1-4 of the destination component 602 by assignment, such as [1, 4: 0] (for example, using massividges of blocks, continuous assignments, ...), or the like. With increasing user needs in resources, additional resources can be recognized by the user through the message for an additional appointment. A common approach is to re-transmit a completely new destination message, such as [1, 5: 0], to add a resource block 5 to the list of assigned resources for the user. Alternatively, an additional prize-trick can be formed with an additional component, such as [5, 1: 1]. However, resource block 5 should be available for a custom system so that you can use the reduced format of the message of continuous assignment for resources 1 -5, as indicated here squared brackets (for example, "[]"). If resource 5 is subject to a changeable purpose to another user (for example, unavailable), system 600 may allow an additional assignment of resources with reduced incremental costs, even when resources are not continuous. Thus, when non-continuous resources are available, the regular system will require that a new, new destination message be generated, for example {1, 2, 3, 4, 6: 0}, and passed to the user to assign the resource 1, 2, 3, 4 and 6. Conversely, the additional component606 may generate an additional assignment message such as [6, 1: 1] indicating that the assigned resources assigned must be increased by allocating resources that begin with resource 6 and have a vector length1.

According to another example, the user who is in the initial stage of the exchange event may require a plurality of system resource blocks. For example, blocks 3, 4, 7, and 8 may be an identifiable destination component 602 as available. In this case, two simple messages maybe simultaneously formed and / or transmitted toassign these channels to the user. For example, messages can be presented as [3, 2: 0]

and [7: 2: 1]. Thus, the variable component 604 may generate an initial message of the destination, and an additional component 606 may generate an additional destination that can be simultaneously transmitted to the user to assign non-continuous channels 3, 4, 7, and 8 to the user at a lower cost for system600. As can be seen, the systems and / or methods detailed herein according to various embodiments can be used in conjunction with systems that use such slow-moving applications as well as those that are slowly changing.

FIG. 7 illustrates a system 700 that facilitates the allocation of additional resource assignments to network users in order to reduce the cost of overhead destination costs. System 700 contains a destination component commas 702 that can form a resource assignment for users. The destination component 702 includes a variable component 704 that can selectively formulate slow-varying (e.g., constant) assignments for users, and such assignments are maintained until further sig-ul no additional purpose is set repeatedly assigning the resources of this user.Component 702 appointment can form suchappointments that are not slowly changing, if you want, while the use of appointments, slowly changing, can reduce the system system overhead (office) costs by reducing the number of assignment messages needed to allocate resources to users of the network. Once the destination has been assigned to users of the network by the assignment component 702 and / or the slowly changing component 704, the additional component 706 may form additional appointments as necessary to distribute additional resources to one or more users. Additional assignments can split recently-available resources, for example, resources that were released due to the fact that a particular user completed a communication session on the network (for example, after completing a communication session with a cell phone, a computing session of a portable computer, youtra, ...). Thus, when conventional systems may require a new, complete destination,

System 700 may further comprise a memory 712 operatively attached to the assignment component 702 and which stores information related to the user device 710, system resets, their assignments, and any other suitable information that is relevant providesdynamic distribution of system resources (for example, channels, frequencies, time intervals, code

17

93045

18

channels, ...) to one or more users. The processor 714 can be operatively connected to the destination com-component 702 (and / or memory 712) to facilitate the analysis of information relating to the designation of resource assignments, and so on. It is understood that the processor 714 may be a processor for analyzing and / or forming an infomation adopted by the destination component 702, a processor that controls one or more components of the system 700, and / or a processor that analyzes and generates information received Component 702 assignment, and controls one or more components of system 700.

The memory 712 may additionally store proto-times associated with the formation of additional and / or non-taxable assignments, etc., so that the system can use stored protocols and / or algorithms to achieve additional assignment of system resources as described here. The bottom line is that the components of the data warehouse (for example, a storage device) described here can be either energy-dependent memory or non-volatile memory, or they may include energy-dependent and non-volatile memory. As an illusion, and not a limitation, a non-volatile memory can include a permanent memory device (ROM, ROM), programmable ROM (PPZP, RroM), electrically programmable ROM (EPPAY, ERROM), electrically Eraser ROM (ESPA, EERRO), or flash memory. Energy-lying memory It may include an operational memory device (RAM, RAM), which acts as an external cache memory. With illustrations and restrictions, the RAM is available in many forms, for example, in the form of a synchronous RAM (RAM), dynamic RAM (URAM), synchronous YURAM (ZYURAM), Dual-rate data transfer URUM (YUUR ZYURAM), EXTENDED ZYURAM (ESYURAM), ZupSMipK YURAM (ZBYURAM), and RAM Direct Ratyiv (YURRAM). Memory 712 systems and methods being considered are intended to cover without limitation these and any other matching memory types. expanded ZYURAM (ESYURAM), ZupSMipK YURAM (ZBYURAM), and RAM direct Ratyiv (YURRAM). Memory 712 systems and methods being considered are intended to cover without limitation these and any other matching memory types. expanded ZYURAM (ESYURAM), ZupSMipK YURAM (ZBYURAM), and RAM direct Ratyiv (YURRAM). Memory 712 systems and methods being considered are intended to cover without limitation these and any other matching memory types.

8 is an illustration of system 800 that facilitates the creation of additional assignments in order to recognize the system resources of users of the network, while reducing the cost of resource allocation. System 800 includes an assignment component 802 that generates resource assignment signals for transmitting via one or more base stations 808 to one or more network consumer devices 810. Such assignments may not be such as to change slowly (e.g. , formed during each time frame). The destination component comprises a slowly changing component 804 that generates no additional, slow-varying, or permanent assignments, for devices 810, where such resource assignments are stored for the user device 810, as long as the subsequent message no additional purpose is not transferred to a specific user. When transferring constant assignments, the slowly varying component 804 can improve the reductions in the number of destination messages that should

be sent to network users. In order to further reduce the transmission costs and the size of the destination message, the destination component 802 may include an additional component 806 that generates an additional destination message, as described with references to the previous drawings. Such additional destination messages may contain a bit indicating that the receiving device 810 that the message is truly add-on and should increase the existing assignment of resources to device 810 instead of replacing such existing assignments. For example, a tag bit can be attached to a destination by the destination component 802, and a message in which the bit value of the tag is "0" may indicate that this destination statement is a slowly changing standard purpose, so that the appointment is composed in such a way should replace the existing appointments. Additionally, if the symbol bit has a value of "1", this may indicate that the destination message is an additional message assignment, and the destination in it must be added to the existing resource assignments. As is apparent to one skilled in the art, a tag bit may be assigned in order to provide an active low-level indexation relative to the additional / non-performing state, whereby the "1" bit (eg, high) may not indicate an additional state, while the null-value may indicate an additional state as desirable for system development purposes, and so on.

System 800 may further comprise memory 812 and processor 814, as described in detail with reference to FIG. 7. In addition, the component 816 of artificial intelligence (AI) can be operatively linked to the destination component 802 and can draw conclusions regarding the allocation of resources in connection with the considerations of the cost of overhead, etc. As used herein, the term "withdrawal" or "conclusion" refers to a general process of measurement (conclusions), or conclusion, relative to the state of the system, the environment and / or user from the set of observations that are recorded with the help of an event / data. Conclusion (reasoning) can be used to identify a specific text or action, or it can form a distribution of immoderations in states, for example. The conclusion may be probabilistic, that is, the calculation of the probability distribution by states of interest, on the basis of the review of data and events. Such a conclusion may also relate to methods used to construct events of a higher level of event and / or data capture. Such a conclusion leads to the design of new events or actions on the side of events observed and / or stored events about the events, whether these events are correlated in the near-time closeness or not, and whether these events come from one or more events and sources data.

According to example, component 816 of an artificial intelligence can output an appropriate message to an additional destination based on, at least partially, for example, the available block system resources. According to this example, it may be determined that the user requires three additional

19th

93045

20

System blocks of system resources, for example, channels, frequencies, etc. An artificial intelligence component 816 together with the processor 814 and / or memory 812 may decide that blocks 7, 8, 10, 14, 15 and 16 are available to supplement the resources already allocated to the user device 810. Component 816 Artificial intelligence may deduce that an additional appointment message, such as [14, 3: 1], is more efficient at cost than before an additional destination message, for example, {7, 8, 10: 1}. In this case, the artificial intelligence component 816 can facilitate the efficient generation of the additional assignment message to the cheapest (for example, the smallest, ...) possible way to reduce costs ahead of time.

According to a related example, the intelligence component 816 may decide that Channel 9 is already assigned to the user. In this case, component 816 of artificial intelligence can indicate that the additional message artificial intelligence, such as [7, 4: 1], is the most effective message. Although this additional message may require a similar number of bits for transmission, an additional message such as [14, 3: 1], [7, 4: 1] leads to a denser grouping of resources which, in its turn, can help in managing resources when coordinated by a large number of users and resources.

FIG. 9 illustrates a system 900 that facilitates the assignment of system resources to a user for a nominal cost of overhead (office) costs. System 900 includes a destination component 902 that can assign resources such as frequencies, channels, slots, etc. to one or more the user devices 910 by the help of one or more base stations 908 in the communication network. The destination component 902 may comprise a slowly varying component 904 that provides no additional assignments, and an add-on component 906 that can form an additional destination as described herein with references to the previous drawings. The component 902 is additionally operatively linked to each of: memory 912, processor 914 and component 916 AI, each of which can in turn be operatively connected to another.

The destination component 902 may additionally include a verification component 918 that accepts such acknowledgments from one or more user devices 910 via one or more base stations 908. According to this scenario, the user devices 910 may include functional reception capabilities for transmitting validation information back to destination 902. Some authentication data may be, for example, a verification message that indicates a successful decoding of the packet or backward sequencing, an acknowledgment (ACC) of a successful reception of destination and / or decoding over a forward link, and so on. Such verification of verification may be generated by the verification component (not shown) associated with

the user (s) of the device (s), etc., whichcan recognize the successful assignment of the resource, the reception of a message transmittinginformation, etc. Thus, the 900 system can check the correct destination of the user-user to complement the appointment with the signal generated by the additional component 906.

Referring to FIGS. 10 to 12, illustrates the mehodology associated with the formation of additional assignments of system resources. For example, methodologies may relate to additional assignments in the environment OIEUM, environment OIEUM, medium-high SUMA, or any other suitable nonconducting environment. While in order to simplify the explanation, these methodologies are shown and described as a sequence of actions, it should be clear that these methodologies are not limited to the order of operations, so, some actions in accordance with one or more variants of implementation may occur in the same order and / or at the same time other actions that are shown and described here. For example, the specialists will understand and appreciate that the methodology may alternatively be presented as a sequence of interconnected states or events, for example, in a state diagram. In addition,

With reference only, FIG. 10 describes the methodology 1000 for the formation and provision of additional assignments of system resources to users of a wireless network. Methodology 1000 can allow the use of efficient channel allocation methods, while avoiding the main constraints of such methods. Using the use of additional resource assignments of the network can closely coordinate the assignment of user resources to the needs of the user and enable the network to optimize the use of system resources, even when the subsets of resources assigned, limited format destination messaging. Additionally, using an additional destination message, method 1000 may reduce the number of destination messages that are required for transmission in order to achieve the desired resource allocation. Example, if the network needs to increase the resources assigned to a particular user, an additional assignment can be used to award-create available resources addressed to the destination message. Regular system themes / methods require that no additional message be sent to the user when a necessary change of user resources, which usually initiates a plurality of messages of the additional prize-giving and / or cancellation of the appointment, which should be sent to a plurality of other users, in order to safeguard the place for desired destination for the target user. Additional assignments are allowed to allow a change in resource allocation to be executed in a single message, while any additional assignment messages require that the message be sent to the sender. an additional assignment can be used to award-create available resources addressed to the destination message. Regular system themes / methods require that no additional message be sent to the user when a necessary change of user resources, which usually initiates a plurality of messages of the additional prize-giving and / or cancellation of the appointment, which should be sent to a plurality of other users, in order to safeguard the place for desired destination for the target user. Additional assignments are allowed to allow a change in resource allocation to be executed in a single message, while any additional assignment messages require that the message be sent to the sender. an additional assignment can be used to award-create available resources addressed to the destination message. Regular system themes / methods require that no additional message be sent to the user when a necessary change of user resources, which usually initiates a plurality of messages of the additional prize-giving and / or cancellation of the appointment, which should be sent to a plurality of other users, in order to safeguard the place for desired destination for the target user. Additional assignments are allowed to allow a change in resource allocation to be executed in a single message, while any additional assignment messages require that the message be sent to the sender. so that no additional message is sent to the user when necessary change of user resources, which usually initiates a plurality of messages of the additional prize-giving and / or cancellation of the destination, which should be sent to a plurality of other users, in order to secure the place for the intended destination of the target user. Additional assignments are allowed to allow a change in resource allocation to be executed in a single message, while any additional assignment messages require that the message be sent to the sender. so that no additional message is sent to the user when necessary change of user resources, which usually initiates a plurality of messages of the additional prize-giving and / or cancellation of the destination, which should be sent to a plurality of other users, in order to secure the place for the intended destination of the target user. Additional assignments are allowed to allow a change in resource allocation to be executed in a single message, while any additional assignment messages require that the message be sent to the sender.

21

93045

22

not at least two users (e.g. at least two messages).

To facilitate the use of additional resource values, in step 1002, initial resource assignments and re-data can be configured to one or more user devices across the entire network. For example, the destination maybe not an additional purpose of resources, such as network frequencies, channels, time intervals, etc. Additionally, such appointments may be slow-changing appointments, in order to facilitate the minimization of the total number of assignments to be transmitted over the network for some time. Once the destination has been assigned to network users, the network may be monitored to determine if any additional resource users are requesting at 1004. After determining that the user needs to assign resources to an extension to existing user assignments,

For example, the user may be initially provided with blocks 1-5 of resources at 1002. If the user requires additional resources, the definition at step 1004 may detect such a possibility, and at block 1006, such resource assignmentsformed in a way that facilitates the reduction of system overhead costs relative to the size of the appointment, etc. For example, an additional destination generation may first include determining which resources (and / or resource blocks) are available. After such an estimate, an additional destination may be formed and also a flag can be seen to allow the network and / or receiver to identify this appointment as an additional one. For example, if it is determined that blocks 11 and 12 of the resources are available for assignment to the user, then an additional message that only assigns blocks 11 and 12

Tagging (tagging) message assignment can be facilitated by adding bits to all destination messages, or additional or non-additional, so that the value of the tag bit denotes the device to the recipient and / or network that this destination must either replace the existing destination or must add it. For example, when the bit of the notation has a value of 0, it may indicate that the destination is not an additional one, while the value "1" may indicate that the destination is optional. The bottom line is that the value of the bit designation can be inverted, until such values ​​are sequentially applied.

Consistent to indicate each of the two possible states of the destination message (for example, additional and optional). In addition, the designation of the purpose as such is not limited to the use of the bit designation, but instead can be implemented using any (i) matching indicator (s) (for example, sequence bits, message prefix, flag in the message header, ...)

Referring now to FIG. 11, the methodology 1100 illustrates the methodology for generating and transmitting to a user in a wireless network environment with higher advanced assignments. At stage 1102, initial distribution of resources can be passed to users of the network. For example, no additional messaging destinations can be generated and transmitted to individual devices user-wach who do not need to know about the appointment to other devices. At block 1104, mobile devices may receive a network validation signal to verify successful decoding and acceptance of the intended resource message. In step 1106, a determination may be made relative to whether one or more mobile devices require additional system resources. If the definition is because no additional resources are needed, then the method can be completed.

If, at 1106, it is determined that additional resources are required by the device, then at such a stage 1108, such a resource can be distributed with an additional purpose. For example, mobile devices, such as a cellular phone, can take initial allocation of resources at step 1102, which allows telephone communication. The determination at step 1106 may indicate that the user of the mobile device is attempting to download a network page, transmit a digital photo or video file, etc., which may require an additional bandwidth. Thus, at step 1108, an additional resource assignment may Be formed to meet the needs of the bandwidth of the device, and can be transmitted to the device to meet the needs of the device.

According to a similar example, if at first-level verifies the reception and / or reception of blocks of 100 resources in step 104 and requires an additional four blocks of resources, then an announcement of an additional destination, such as [X, 4: 1], may be transferred to this device, where X - integer number representing the first resource block in the first continuous set of available blocks of resources. Since the authenticity of all previous resource assignments has been confirmed at step 1104, a complete list of available resources may be known for generating and transmitting an additional prerequisite at step 1108. After transferring an additional destination at step 1108, the method can be returned to step 1104 for another iteration of the verification assignment, which may include an examination of additional assignments before the network will exercise control to determine,

23

93045

24

managed to not require that messages on additional resource assignments contain continuous resource assignments, but that such appointments can be expressed in a way (for example, the mass of the blocks of vindeks, ...), which facilitates the generation of a convenient and efficient notification of the destination. For example, such messages can be expressed by two indexes and a bit of a notation.

Referring to FIG. 12, a 1200 methodology is illustrated to provide additional resource assignments for the exchange of devices over a wireless network. Initial resource allocations may be made at step 1202, and the assignment may be transmitted to one or more devices using the network. For example, the first user may be assigned resource blocks using a non-incrementally variable purpose, such as {1, 2, 3, 6.7, 10: 0}, while the second user may be Assigned resource blocks are assigned according to a second message of no additional purpose, such as {4, 5, 8: 0}, where «: 0» represents a bit identifier that identifies the assignment message as an optional one. Users do not need to know (for example, there is no need to batch) the message of appointment to other users. At stage 1204, announcement of the prize-giving can be confirmed by obtainingmobile device. For example, a simple confirmation message can be transmitted to the network that verifies the reception, successful decoding and / or reception of the destination message. Thus, the network can be informed precisely about the resources available for additional purpose, etc. At step 1206, a definition may be made, regarding which, if any, devices require additional system resources. If no additional re-resources are needed, the method can be completed. If additional resources are required for one or more devices, the message may go to step 1208. For example, the first user, as a descriptor, may require additional three blocks of resources to work on the network.

For example, if all initial assignment of resource blocks has been confirmed at step 1204, then the following three available resource blocks maybe known as blocks 7, 9 and 11. The postdoctoral message containing the assignment of these blocks can be represented as {7, 9, 11 : 1} and can be passed to the first user on stage 1210. However, more efficient messages (for example, a shorter message) may be [9, 4: 1], which transmits additional allocations of resources to four continuous rescue blocks, starting with block 9. Since block 10 is already ryznachenyy the user at the first-order, not any conflict, and new blocks 9, 11 and 12 should be further designated the first

the user to meet the needs of the user in the resources. Conclusions can be made at the stage 1208 (for example, using methods of personal intelligence, methods of machine learning, ...), which may facilitate the determination of the need for a more efficient (for example, cheaper) messages, and this can be chosen for the generation and transfer at 1210.

According to a similar example, at step 1204, it can be determined that the second user has failed to verify receipt / acceptance of his initial notification. As long as these resource blocks are still available (for example, they were not assigned to the third or subsequent user device), they can be assigned to the first user in an additional message of purpose, for example, {4, 5, 8: 1}. Only the first user should know about an additional assignment, when additional appointments can be transparent to all users other than the recipient, in order to further reduce network charges, processing time, etc. Additionally, on the e-mail 1208, it may be deduced that the message of an additional destination may be reduced to a continuous destination, such as [4, 5: 1], where "4" represents the first resource block, "5" pre-sets a continuous sequence of blocks, which begins with "4", and ": 1" defines the message as an additional one. This is acceptable because it is known that blocks 6 and 7 are already assigned to the first user, so that this more effective continuous dated assignment is not in conflict with the existing appointments of the first user. Thus, the conclusions made at stage 1208, can facilitate the generation and transfer of the message of additional appointment in stage 1210, which is the most effective in value relative to the requirements of overhead costs and / or the size of transmission of the destination. so that this is more effective continuous-pre-dated appointment is not in contradiction with the existing appointments of the firstuser. Thus, the conclusions made at stage 1208, can facilitate the generation and transfer of the message of additional appointment in stage 1210, which is the most effective in value relative to the requirements of overhead costs and / or the size of transmission of the destination. so that this is more effective continuous-pre-dated appointment is not in contradiction with the existing appointments of the firstuser. Thus, the conclusions made at stage 1208, can facilitate the generation and transfer of the message of additional appointment in stage 1210, which is the most effective in value relative to the requirements of overhead costs and / or the size of transmission of the destination.

FIG. 13 shows an exemplary wireless communication system 1300. The wireless communication system 1300 abbreviated to one base station and one-to-one. However, it should be appreciated that the system may include more than one base station and / or more than one terminal, and additional base stations and / or terminals may be substantially similar or different to the reference base station and terminal described below. Except for it should be understood that the base station and / or terminal can use the systems (FIGS. 6-9) and / or methods (FIGS. 9-12) described in the description in order to facilitate the wireless communication between them .

Referring to FIG. 13, in the forward (downlink) line at the access point 1305, the transmitter (TX) processor 1310 receives, formats, encodes, interchanges and modulates (or converts symbols) traffic data and generates modulation symbols ("symbol data") . ΘΒμΜ (frequency division multiplexing), the modulator 1315 receives and processes these data symbols and the pilot of the c-wave and outputs a stream of ΘΒΜΜ characters. The multiplex modulator 1315 is data and pilot symbols in the appropriate sub-bands, provides a zero-signal for each unused sub-

25

93045

26

zone, and receives a set of N transmission symbols for the N bands for each period of OIEUM characters. Each transmission symbol may be a data symbol, a pilot symbol, or a zero signal value. Pilot characters can be sent continuously in each period of OWE characters. Alternatively, pilot symbols may be multiplexed by time division (T0M), multiplexed by Frequency Division (ROM) or multiplexed with code division (COM) channels. The OROMmodulator 1315 can convert each set of NN characters transmitted to the time domain using N-point IRPT (reverse fast Fourier transform, SCFF) to obtain a "non-redundant" character that contains N elements of the time domain signal. The OROM modulator 1315 usually repeats the part of each converted character in order to receive the corresponding OROM sim-wol.

The transmitter module 1320 (TMTR) receives and converts the stream of OROM symbols into one or more than the analog signals, and then leads to the necessary form (for example, amplifies, filters, and converts with increasing frequency) analog signals to form a signal of the direct line of communication , suitable for wireless transmission. The forward link signal is then transmitted through the antenna 1325 to the terminals. In Terminal-1330, the antenna 1335 receives a forward-link signal and provides an received signal to the receiver module 1340. The receiver module 1340 generates a desired signal (for example, filters, amplifies, and reduces the frequency) to the receiver signal and digitizes the signal to the desired type to get the readings. The ARM demodulator 1345 deletes the cyclic prefix added to each ORO symbol converts each received transformed symbol into a frequency region using N-point PPT (Fast Fourier Transform, FFT), receives Accepted Characters for N subbands for each period of the OROM symbol and outputs the received pi-lot characters to the processor 1350 for the estimation of the channel. The ARM demodulator 1345 then takes the evaluation of the response response for the direct line from the 1350 Procesor, performs demodulation of the data over the accepted data symbols, in order to obtain evaluations of data symbols (which are estimates of the transferred symbols data), and issues estimates data symbols to the processor 1355 of the received (RX) data that demodulates (that is, performs a reverse character conversion), performs an inverse intersection, and decodes the estimation of data symbols in order to restore the transmitted datatraff.

On the reverse (uplink) communication processor1360 of the transmitted data, (TX) processes the datatraffice and issues data symbols. OROM modulator1365 accepts and multiplexes the data symbols with the symbol, executes the OROM modulation and

gives flow of OROM characters. Pilot symbols may be transmitted over subranges that have been recognized by the pilot terminal 1330, wherein the number of pilot subbands for the reverse link may be the same or different from the number of pilot subbands for the recipe lines of communication. The transmitter module 1370 then receives and processes an OROM stream of characters to form a backlink signal that transmits the antenna 1335 to the access point 1305.

At the access point 1305, the feedback signal from the terminal 1330 is received by the antenna 1325 and processed by the receiver unit 1375, so that the counters can be maintained. The OROM demodulator 1380 thenmakes the counters and issues the received pilot symbols andassessment of the data symbols for the reverse link. The predecessor RH processor 1385 processes the estimation of data symbols in order to recover traffic data transmitted by terminal 1330. The processor 1390 executes the channel estimation for each active terminal, which carries forward transmission over the back link. A plurality of terminals can transmit the signal sig-nal simultaneously on the reverse link on their respective assigned sets of sub-bands of pilot signals, with sub-sets of pylons whitefish can peremizhuvatysya to left.

Processors 1390 and 1350 issue commands (for example, manage, coordinate, control, etc.) at the point 1305 of access and the terminal 1330, respectively. The respective processors 1390 and 1350 may be associated with memory units (not shown) that store program codes and data. Processors 1390 and 1350 may also perform calculations to obtain frequency and pulse response estimates for the reverse link and direct lines of communication, respectively.

For a multiplier OROM system (for example, multiple-access systems with orthogonal frequency division (ORUMA)), a plurality of terminals can transmit at the same time on the reverse link. For such systems, the sub-bands of pilot signals may be tokens that are commonly used between different terminals. Channel estimation methods can be used in cases where pilot subbands for each terminal cover the full working range (possibly, except for diagonal boundaries). Such a subband signal structure of the signal pilot may be desirable to obtain a frequency resolution for each terminal. The methods described herein may be implemented by various means. For example, these methods may be implemented for hardware support, software, or a combination thereof. For hardware implementation processors,

microprocessors, other electronic modules designed to perform the functions described herein, or combinations thereof. For software

27

93045

28

Implementation can be accomplished using modules (for example, procedures, functions, and so on) that perform the functions described here. Program codes can be stored in the memory block and executed processors 1390 and 1350.

As described above, includes examples of one or more embodiments. Of course, it is not possible to describe each conceivable combination of components or methods for the purpose of describing the above-mentioned embodiments, but it is obvious to the facsimile that many additional combinations and permutations of various embodiments are possible . Accordingly, the described implementation options are intended to cover all such changes, modifications and changes that fall into the scope and essence of the enclosed formulas of the invention. In addition, to the extent that the term "includes" is used either in the introductory description or in the claims of the invention, such a term is intended to encompass a method that is related to the term "containing it", since "the tactile containing "Is interpreted when used as a transitive word in the formula of the invention.

Reference positions

100 system resource blocks

200 table of channels

300 resource blocks

302 the first set of blocks

304 second set of blocks

306 set of unused blocks

500 "slowly changing" destinations

600 system, which facilitates the use of pre-dated assignments for the distribution of system resources

602, 702, 802, 902 destination components

604, 704, 804, 904, which is slowly changing

606, 706, 806, 906 an additional component

608, 708, 808, 908 base stations

610, 710, 810, 910 custom devices

700 system, which facilitates the issuance of additional assignment of resources to users of the network

712, 812, 912 memory

714, 814, 914 processor

800 system that facilitates the creation of additional assignments

816, 916 artificial intelligence component (AI)

918 verification component

900 system that facilitates the assignment of system dark resources to the user for a minimum cost of overhead (office) costs

1000 methodology for the formation and provision of additional assignments of system resources to users of a wireless network

1100 methodology for the formation and transmission user in a wireless network environment of additional destinations

1200 methodology to provide additional resource assignments for sharing between devices on a wireless network

1300 wireless communication system

1305 access point

1310 transfer processor (access point) 1315,1365 ΘΒώΜ modulator

1320, 1370 transmitter module

1325, 1335 antenna

1330 terminal

1340,1375 receiver module

1345, 1380 ΘΒώΜ demodulator

1350, 1390 CPU for channel estimation

1355 processor of received data

1360 data processor transmitted

1385 receiving processor

29

93045

30

31

93045

32

Frequency

FIG. 4

FIG. 6

608

606

604

Destination component

Component that

slowly changing

Additional

components

Custom (s)

presbytery (s)

33

93045

34

component

708

FIG. 7

704

Destination component

Component that

CHANGE CHANGELY

Additional

5

Custom (s)

device (s)

Memory

Processor

FIG. 8

816

808

814

Component AI

810

804

Destination component

Component that

FULLY CHEMIOS AND, SEE

806

Additional

component

Custom (s)

device (s)

Memory

Processor

35

93045

36

37

93045

38

39

93045

40

Computer layout of T. Chopelov Signature Circulation 26 copies.

Ministry of Education and Science of Ukraine

State Department of Intellectual Property, st. Uritskogo, 45, Kyiv, SME, 03680, Ukraine

State Enterprise "Ukrainian Institute of Industrial Property", st. Glazunova, 1, Kyiv - 42, 01601