Content channel generation apparatus and method

Abstract

The present application relates to a content channel generation device and method. A content channel generation device includes a split circuit for generating a plurality of resource units according to a plurality of resource configurations; a resource unit configuration circuit for generating a full binary tree according to the plurality of resource units; a node operation circuit for generating a minimum full binary tree according to the full binary tree; a load balancing circuit for generating a plurality of user field quantities corresponding to a plurality of content channels according to the minimum full binary tree and a load balancing function; a merge circuit for generating a search result of the minimum full binary tree according to a search algorithm, and generating a merged search result according to the search result; and a common field generation circuit for generating a resource configuration indicator according to the merged search result to generate a common field.

Description

Technical Field

[0001] This invention relates to an apparatus and method for a communication system, and more particularly to an apparatus and method for performing content channel generation. Background Technology

[0002] In communication systems, the transmitting end uses resource units (RUs), sorting algorithms, and link sequences to generate user fields for configuring user resources. Resource units are generated by segmenting bandwidth; however, when the transmitting end uses multiple resource units to configure user resources, the gaps between these units are difficult to utilize for configuring user resources, reducing bandwidth utilization efficiency. Furthermore, sorting algorithms and link sequences have high complexity (e.g., time complexity), making them difficult to implement in embedded systems. Moreover, excessively long user fields generated by sorting algorithms and link sequences further reduce bandwidth utilization efficiency. Therefore, how to improve upon these problems to obtain the shortest user field and generate the shortest content channel is a pressing issue that needs to be addressed. Summary of the Invention

[0003] The present invention provides a method and apparatus for generating content channels to solve the above-mentioned problems.

[0004] A content channel generation apparatus includes: a segmentation circuit for generating multiple resource units based on various resource configurations; a resource unit configuration circuit coupled to the segmentation circuit for generating a full binary tree based on the multiple resource units; a node operation circuit coupled to the resource unit configuration circuit for generating a minimum full binary tree based on the full binary tree; a load balancing circuit coupled to the node operation circuit for generating multiple user field numbers corresponding to multiple content channels based on the minimum full binary tree and a load balancing function; a merging circuit coupled to the load balancing circuit for generating a search result of the minimum full binary tree based on a search algorithm, and generating a merged search result based on the search result; and a common field generation circuit coupled to the merging circuit for generating a resource configuration indicator based on the merged search result to generate a common field.

[0005] The present invention also discloses a method for generating content channels, comprising: generating multiple resource units based on multiple resource configurations; generating a full binary tree based on the multiple resource units; generating a minimum full binary tree based on the full binary tree; generating multiple user field counts corresponding to multiple content channels based on the minimum full binary tree and a load balancing function; generating a search result of the minimum full binary tree based on a search algorithm; generating a merged search result based on the search result; and generating a resource configuration indicator based on the merged search result to generate a common field. Attached Figure Description

[0006] Figure 1 This is a schematic diagram of the communication system according to Embodiment 1 of the present invention.

[0007] Figure 2 This is a schematic diagram of the EHT-SIG field in Embodiment 1 of the present invention.

[0008] Figure 3 This is a schematic diagram of the content channel generation device according to Embodiment 1 of the present invention.

[0009] Figure 4 This is a schematic diagram of a full binary tree representing multiple resource units in a 320MHz bandwidth, according to Embodiment 1 of the present invention.

[0010] Figure 5 This is a schematic diagram of a full binary tree representing multiple resource units in a 20MHz bandwidth, according to Embodiment 1 of the present invention.

[0011] Figure 6 This is a schematic diagram of the minimum full binary tree in Embodiment 1 of the present invention.

[0012] Figure 7 This is a resource unit configuration table according to Embodiment 1 of the present invention.

[0013] Figure 8 This is a schematic diagram of a minimum full binary tree generated based on multiple resource units in a 320MHz bandwidth according to an embodiment of the present invention.

[0014] Figure 9 This is a flowchart of a first embodiment of the present invention. Detailed Implementation

[0015] Figure 1 This is a schematic diagram of a communication system 10 according to an embodiment of the present invention. The communication system 10 can be simply composed of a transmitting end TX and a receiving end RX. Figure 1In this diagram, the transmitting end TX and the receiving end RX are used to illustrate the architecture of the communication system 10. The communication system 10 can be a wireless local area network (WLAN), a Long Term Evolution (LTE) system, an LTE-advanced (LTE-A) system, a 5th generation (5G) system, or other wireless communication systems. The transmitting end TX can be an access point (AP) in the WLAN. Furthermore, the transmitting end TX and the receiving end RX can be implemented through devices such as mobile phones and laptops, but are not limited to these. The transmitting end TX and the receiving end RX can support the Institute of Electrical and Electronics Engineers (IEEE) 802.11 standard (e.g., 802.11AX, 802.11be, or later versions). The 802.11 standard can support Orthogonal Frequency Division Multiple Access (OFDMA) or Multi-User Multiple-Input Multiple-Output (MU-MIMO) technology. To efficiently communicate transmission information from all scheduled stations (STAs) to the receiving end (RX), the 802.11 standard defines the EHT-SIG field for the Extremely High Throughput Multi-User Physical Protocol Data Unit (EHT-MUPPDU). The EHT-MUPPDU can transmit zero-data packet format, single-user packet format, multi-user packet format, or orthogonal frequency division multiple access packet format.

[0016] Figure 2 This is a schematic diagram of the EHT-SIG field 20 in Embodiment 1 of the present invention, which can be used as... Figure 1 The EHT-SIG field 20 may contain at least one content channel, which may include at least one first content channel and at least one second content channel. For example... Figure 2As shown, each content channel 200 may include a common field 210, which may include a resource unit configuration subfield 2100 to inform all scheduled sites of the current resource unit configuration (assignment) of all data bandwidth. Each content channel 200 may include a user-specific field 220, which may include multiple user fields 2200 to carry transmission information (e.g., resources) for a specific scheduled site. Each content channel 200 may include padding values ​​2202, which are used to fill the length of the user-specific field 220 to meet the format requirements of the EHT-SIG field 20.

[0017] In the 802.11 standard, each resource unit less than 242 tones can (e.g., must) be configured with at least one scheduling station. Therefore, for an empty resource unit, the transmitter (TX) can configure an empty scheduling station with a scheduling station identity (STA ID) of "2046" in the EHT-SIG field. For resource units greater than 242 tones, the transmitter (TX) can configure multiple user fields to multiple content channels in the EHT-SIG field to ensure that the number of user fields carried by multiple content channels (i.e., the length (e.g., size) of the content channels) is the same or similar. In one embodiment, load balancing can be used to balance the length of the content channels. The length of the EHT-SIG field can be changed based on the resource unit configuration and load balancing results. In one embodiment, an excessively long EHT-SIG field can lead to an excessively long Physical Layer Convergence Procedure (PLCP), resulting in a reduced output rate.

[0018] Resource unit (RRU) configurations can improve output rate by increasing bandwidth and improve bandwidth utilization efficiency by supporting multiple resource units (MRUs). RRU sizes can include 26-band, 52-band, 106-band, 242-band, 484-band, 996-band, 996x2-band, and 996x4-band. Multiple RRUs include combinations of multiple RRUs, such as 52+26-band, 106+26-band, 242+484-band, 996+484-band, 996x2+484-band, 996x3-band, 996x3+484-band, and 996+484+242-band, but are not limited to these.

[0019] Figure 3 This is a schematic diagram of the content channel generation device 30 according to Embodiment 1 of the present invention, which can be used to implement... Figure 1The TX transmitter and the generator that can be used to generate Figure 2 The common field 210 and user-specific field 220 are used to generate content channels 200, and subsequently, EHT-SIG field 20. The content channel generation device 30 may include a resource unit configuration circuit 300, a node operation circuit 310, a load balancing circuit 320, and a user field generation circuit 330, and may also include a segmentation circuit 340, a merging circuit 350, and a common field generation circuit 360. Specifically, the segmentation circuit 340 can be used to generate multiple resource units based on various resource configurations. The resource unit configuration circuit 300, coupled to the segmentation circuit 340, can be used to generate a full binary tree based on the multiple resource units. The node operation circuit 310, coupled to the resource unit configuration circuit 300, can be used to generate a minimum full binary tree based on the full binary tree. The load balancing circuit 320, coupled to the node operation circuit 310, can be used to generate multiple user fields corresponding to multiple content channels based on the minimum full binary tree and a load balancing function. The merging circuit 350, coupled to the load balancing circuit 320, can be used to generate a traversal result for a minimum full binary tree based on the traversal algorithm, and to generate a merged traversal result based on the traversal result. The common field generation circuit 360, coupled to the merging circuit 350, can be used to generate resource configuration indicators based on the merged traversal result to generate common fields. The common field generation circuit 360 can also be further coupled to the node operation circuit 310 to obtain node (e.g., storage) information.

[0020] In one embodiment, according to a search algorithm, the resource unit configuration circuit 300 can be used to configure (e.g., locate) multiple resource units as at least one node in a full binary tree. The search algorithm may include the following operations: if the resource unit with the smallest size (e.g., 26-frequency) is determined as a leaf node and adjacent resource units are determined as sibling nodes, the resource unit configuration circuit 300 establishes (e.g., determines, generates) a full binary tree based on the rule that the resource unit size of a child node is not greater than the resource unit size of its parent node, wherein each resource unit corresponds to a node in the full binary tree. In one embodiment, the node corresponds to at least one user field, that is, each resource unit may correspond to one or more user fields.

[0021] In one embodiment, the content channel generation apparatus 30 may include receiving circuitry coupled to the segmentation circuitry 340, which can be used to receive (e.g., upper-layer (e.g., Media Access Control (MAC) layer) multiple resource configurations of multiple scheduling sites. In one embodiment, the search result may include multiple leaf nodes. In one embodiment, the operation of the merging circuitry 350 to generate a merged search result based on the search result includes: when at least one of the multiple leaf nodes stores at least one first scheduling site identified as the same, the merging circuitry 350 merges at least one leaf node (e.g., stored information) to generate a merged search result. In one embodiment, based on the merged search result, the common field generation circuitry 360 queries a resource configuration table and generates a resource configuration indicator based on a comparison result between the merged search result and the resource configuration table. In one embodiment, the resource configuration table may include multiple resource configuration indicators and multiple resource unit numbers. Each resource configuration indicator corresponds to a set of resource units, and each set of resource units includes at least one resource unit and / or at least one multiple resource units. In one embodiment, a resource configuration table is defined in the 802.11 standard (e.g., tables 36-34 of P802.11be_D1.1).

[0022] In one embodiment, the user field generation circuit 330 is coupled to the merging circuit 350 and can be used to generate multiple user fields corresponding to multiple content channels based on the merged search results. The user field generation circuit 330 may also be coupled to the node processing circuit 310 to obtain node (e.g., stored) information. In one embodiment, based on multiple scheduling site identifications and multiple multi-resource unit information stored in multiple leaf nodes in the search results, the user field generation circuit 330 retains a first leaf node from the multiple leaf nodes and generates multiple user fields based on the first leaf node. In one embodiment, the operation of the user field generation circuit 330 generating multiple user fields based on the search results further includes: deleting at least one second leaf node from the multiple nodes based on the multiple scheduling site identifications and multiple multi-resource unit information stored in the multiple leaf nodes in the search results.

[0023] In one embodiment, the multi-resource unit information may include a multi-resource unit flag. The multi-resource unit flag may contain two bits, used to indicate whether the resource unit corresponding to the node is a non-multi-resource unit, the starting resource position of a multi-resource unit, an intermediate resource position of a multi-resource unit, or the ending resource position of a multi-resource unit. In one embodiment, when the two bits of the multi-resource unit flag are "00", "01", "10", or "11", the resource unit corresponding to the node is a non-multi-resource unit, a multi-resource unit where the multi-resource unit is the starting resource position, a multi-resource unit where the multi-resource unit is the intermediate resource position, or a multi-resource unit where the multi-resource unit is the ending resource position.

[0024] In one embodiment, the search algorithm includes a binary tree pre-order search algorithm. In another embodiment, the search algorithm may include a binary tree mirrored pre-order search algorithm.

[0025] In one embodiment, the order of multiple frequencies corresponding to multiple user fields can be ascending, that is, the order of multiple frequencies corresponding to multiple user fields is from the minimum frequency to the maximum frequency (e.g., from the most negative frequency to the most positive frequency).

[0026] In one embodiment, the load balancing function can be implemented according to equation (Equation 1):

[0027]

[0028] in S is a resource unit pointer, representing a resource unit with a size greater than 242-frequency (e.g., 484-frequency, 996-frequency, 996x2-frequency, or 996x4-frequency) or multiple resource units (e.g., 484+242-frequency, 996+484-frequency, 996x2+484-frequency, 996x3-frequency, or 996x3+484-frequency); S is a set of 80MHz sub-bandwidth pointers that can be divided into bandwidths (e.g., for a bandwidth of 320MHz, S = {1, 2, 3, 4}). The number of user fields corresponding to the first content channel of the s-th 80MHz sub-bandwidth; k represents the number of user fields corresponding to the second content channel of the s-th 80MHz sub-bandwidth. i The number of user fields configured for the i-th node corresponds to resource units or multiple resource units with a resource unit size greater than 242-frequency. The weight value indicates whether the i-th node corresponds to the s-th 80MHz sub-bandwidth; y represents the number of user fields for the resource unit corresponding to the i-th node that are configured in the first content channel; iThe number of user fields that are configured in the second content channel for the resource unit corresponding to the i-th node; is a natural number. In one embodiment, the load balancing function can be implemented by a transformation (e.g., simplification) of equation (Equation 1).

[0029] Figure 4 This is a schematic diagram of a full binary tree 40 representing multiple resource units in a 320MHz bandwidth, according to Embodiment 1 of the present invention. Figure 4 As shown, the resource unit is represented as a trapezoid, containing six levels from top to bottom: 16 sub-full binary trees, 16 242-frequency units (e.g., containing 242 subcarriers), 8 484-frequency resource units, 4 996-frequency resource units, 2 996x2-frequency resource units, and 1 996x4-frequency resource unit. Each 242-frequency unit is the root node of the sub-full binary tree. Each resource unit has a resource unit pointer (e.g., which may correspond to a frequency defined in the 3GLP standard or its successors, a frequency determined by the transmitter's TX, or a frequency defined in the 802.11 standard), for example... Figure 4 Resource unit pointers 257-287. Furthermore, in Figure 4 In this context, a full binary tree is represented as a tree structure containing multiple nodes. For example... Figure 4 As shown, the correspondence between resource units and nodes in a full binary tree is one-to-one, meaning that each resource unit corresponds to a node in the full binary tree.

[0030] Figure 5 This is a schematic diagram of a full binary tree 50 representing multiple resource units in a 20MHz bandwidth according to Embodiment 1 of the present invention, which can be used to implement... Figure 4 Any one of the 16 sub-full binary trees. Figure 5 In this diagram, resource units are represented as trapezoids, comprising, from top to bottom, nine 26-band resource units, four 52-band resource units, two 106-band resource units, and one 242-band resource unit. Any of the 26-band resource units can be composed of two 13-band resource units. Each resource unit has a resource unit pointer (e.g., defined in the 3GPP standard or its subsequent standards, determined by the transmitter's TX, or defined in the 802.11 standard), which is represented as... Figure 5 Indicators 1-16. Furthermore, in Figure 5 In this diagram, a full binary tree is represented as a tree structure containing circles filled with diagonal stripes (hereinafter referred to as striped circles), circles filled with grids (hereinafter referred to as grid circles), and circles filled with dots (hereinafter referred to as dot circles). Striped circles represent empty nodes, grid circles represent nodes where scheduling stations are configured, and dot circles represent reserved nodes. Figure 5The arrows shown represent a node merging into another node, and the resulting tree structure can (for example, must) satisfy the structure of a full binary tree. Figure 5 As shown, the correspondence between resource units and nodes in a full binary tree is one-to-one or one-to-two, meaning that one or two resource units correspond to one node in a full binary tree.

[0031] Figure 6 This is a schematic diagram of the minimum full binary tree 60 according to Embodiment 1 of the present invention. Figure 6 In the text, the way resource units and their pointers are drawn is similar to... Figure 5 The same applies, so I won't elaborate further. (And...) Figure 5 The difference is that a full binary tree contains unfilled circles, where the unfilled circles represent empty leaf nodes generated after merging nodes. After removing (e.g., deleting) the empty leaf nodes (e.g., nodes 1-4, 6, 7, 10, 11), the remaining nodes can generate a minimum full binary tree.

[0032] Figure 7 This is a resource unit configuration table 70 according to an embodiment of the present invention. The resource unit configuration table 70 shows a plurality of resource configuration indicators 700, such as 0 (00000000) to 55 (000110111) and 96-103 (001100y2y1y0), but is not limited thereto. The resource unit configuration table 70 also shows a plurality of resource unit numbers 710, such as 1 to 9. Each resource configuration indicator in the resource configuration indicators 700 corresponds to a group of resource units, and each group of resource units contains at least one resource unit and / or at least one or more resource units. It should be noted that the resource configuration table 70 is defined in the 802.11 standard (e.g., tables 37-34 of P802.11be_D1.1).

[0033] The following is based on Figures 4-7 This example illustrates how the content channel generation device 30 generates the common field 210. First, the receiving circuit receives multiple resource configurations (e.g., {[106+26][52+26]

[26] }) from multiple scheduling sites (e.g., {1, 2, 3}) at the upper layer. Based on (e.g., by segmentation) the multiple resource configurations, the segmentation circuit 340 generates multiple resource units (e.g., {

[106] ,

[26] ,

[52] ,

[26] ,

[26] }). Based on (e.g., by a search algorithm) the multiple resource units, the resource unit configuration circuit 300 generates a full binary tree (e.g., ...). Figure 5), where multiple resource units correspond to multiple nodes in a full binary tree. For example, resource unit

[106] corresponds to the node of resource unit pointer 14 in the full binary tree, resource unit

[52] corresponds to the node of resource unit pointer 12 in the full binary tree, and resource units

[26] ,

[26] and

[26] correspond to the nodes of resource unit pointers 5, 8 and 9 in the full binary tree, respectively. For the sake of simplicity, the node corresponding to resource unit pointer X in the full binary tree will be referred to as node X below.

[0034] In addition, multiple nodes store multiple scheduling site identifications and multiple resource unit information. For example, node 14 stores the identification of scheduling site 1 and its multi-resource unit information, indicating that node 14's resource unit is a multi-resource unit and that this multi-resource unit is the starting resource position. Node 5 stores the identification of scheduling site 1 and its multi-resource unit information, indicating that node 5's resource unit is a multi-resource unit and that this multi-resource unit is the ending resource position. Node 12 stores the identification of scheduling site 2 and its multi-resource unit information, indicating that node 12's resource unit is a multi-resource unit and that this multi-resource unit is the starting resource position. Node 8 stores the identification of scheduling site 2 and its multi-resource unit information, indicating that node 8's resource unit is a multi-resource unit and that this multi-resource unit is the ending resource position. Node 9 stores the identification of scheduling site 3 and its multi-resource unit information, indicating that node 9's resource unit is not a multi-resource unit.

[0035] Next, based on (e.g., by merging) the full binary tree, the node operation circuit 310 generates the minimum full binary tree (e.g., Figure 6 The method by which the node operation circuit 310 generates the minimum full binary tree can be found in the related application (Application No.: 109115384, Application Date: 2020 / 05 / 08, Publication No.: TW I739418B). Based on the minimum full binary tree and the load balancing function, the load balancing circuit 320 generates the number of user fields corresponding to multiple content channels. In this example with a bandwidth of 20MHz, there is only a "single" content channel. Therefore, the load balancing circuit 320 does not need to perform "load balancing" on the "multiple" content channels to generate the number of user fields corresponding to multiple content channels. That is, the load balancing circuit 320 can generate the number of user fields corresponding to only the "single" content channel, and this number of user fields is the final length of the content channel. In other words, load balancing is used to optimize for bandwidths greater than 20MHz (e.g., bandwidths of 40MHz, 80MHz, 160MHz, or 320MHz).

[0036] The following embodiment illustrates how the load balancing circuit 320 generates the number of user fields corresponding to a "single" content channel. The number of user fields for node 9 can be 1 (N9 = 1). Nodes 8 and 12 belong to the same scheduling station and have the same number of user fields, which can both be 1 (N8 = 1, N...). 12 =1), and nodes 5 and 14 belong to the same scheduling site and have the same user field, and the number of each can be 1 (N5=1, N 14 =1), that is, the total number of user fields for nodes 9, 8 (or 12), and 5 (or 14) is 3. Therefore, the load balancing circuit 320 can generate a number of user fields corresponding to a "single" content channel of 3, that is, the length of the content channel is 3. The number of user fields for nodes 9, 8 (or 12), and 5 (or 14) mentioned above is only for illustrating this embodiment and is not intended to limit the invention.

[0037] Furthermore, according to the search algorithm, the merging circuit 350 generates the search result of the minimum full binary tree. The search result of the merging circuit 350 for the minimum full binary tree is node 14, node 5, node 12, node 8, node 9, node 13, node 15 and node 16, where the search order of the leaf nodes is node 14, node 5, node 12, node 8 and node 9. According to the search order of the leaf nodes, the merging circuit 350 generates the merged search result. In detail, according to the identification of the scheduling station 3 stored in node 9 and the multi-resource unit information indicating that the resource unit of node 9 is not a multi-resource unit, the merging circuit 350 generates the resource unit

[26] . According to the identification of the scheduling station 2 stored in nodes 8 and 12, the multi-resource unit information indicating that node 12 is the start of a multi-resource unit and the multi-resource unit information indicating that node 8 is the end of a multi-resource unit, the merging circuit 350 merges nodes 8 and 12 to generate a multi-resource unit [52+26]. Based on the identification of scheduling station 1 stored in nodes 5 and 14, the multi-resource unit information indicating that node 14 is the start of a multi-resource unit, and the multi-resource unit information indicating that node 5 is the end of a multi-resource unit, merging circuit 350 merges nodes 14 and 5 to generate multi-resource unit [106+26]. Merging circuit 350 merges resource unit

[26] , resource unit [52+26], and resource unit [106+26] to generate merged access result {[106+26][52+26]

[26] }.

[0038] Based on the merged search results {[106+26][52+26]

[26] }, the common fields generate the circuit 360 query resource configuration table (e.g., Figure 7Based on the merged search results and the comparison results of the resource configuration table, the common field generation circuit 360 finds that the merged search result {[106+26][52+26]

[26] } ​​and the resource configuration indicator 49 (000110001) correspond to a set of resource units {[106+26][52+26]

[26] } ​​that are the same (or most similar). Therefore, the common field generation circuit 360 generates the resource configuration indicator 49 (000110001). In this way, the resource unit configuration subfield in the common field can be generated.

[0039] The following is based on Figures 4-7 The following example illustrates how the content channel generation device 30 generates the content channel 200. Based on the aforementioned leaf node visit order (i.e., node 14, node 5, node 12, node 8, and node 9), the user field generation circuit 330 generates user fields for the scheduling stations corresponding to nodes 14, 5, 12, 8, and 9, respectively. When generating user fields for the scheduling stations corresponding to nodes 8 and 12, since the identification of scheduling station 2 stored in node 8 is the same as that stored in node 12, the multi-resource unit information stored in node 8 indicates that the resource unit of node 8 is a multi-resource unit and that the multi-resource unit is the end resource position, and the multi-resource unit information stored in node 12 indicates that the resource unit of node 12 is a multi-resource unit and that the multi-resource unit is the start resource position, the user field generation circuit 330 retains node 12 and deletes node 8, and generates the user field for the scheduling station corresponding to node 12. Similarly, when generating user fields for scheduling sites corresponding to nodes 5 and 14, since the identification of scheduling site 1 stored in node 5 is the same as that stored in node 14, the multi-resource unit information stored in node 5 indicates that the resource unit of node 5 is a multi-resource unit and that the multi-resource unit is the end resource position, and the multi-resource unit information stored in node 14 indicates that the resource unit of node 14 is a multi-resource unit and that the multi-resource unit is the start resource position, the user field generation circuit 330 retains node 14 and deletes node 5, and generates user fields for scheduling sites corresponding to node 14. When the number of user fields for the aforementioned leaf nodes is 3, a corresponding number of 3 user-specific fields 220 can be generated. Therefore, the content channel used to describe this 20MHz can carry a common field 210 containing the resource configuration indicator 49 (000110001) and user-specific fields 220 containing the user fields of nodes 14, 12, and 9.

[0040] Figure 8This is a schematic diagram of a minimum full binary tree 80 generated from multiple resource units in a 320MHz bandwidth according to an embodiment of the present invention. Due to space limitations, the minimum full binary tree 80 only shows eight 242-frequency resource units, four 484-frequency resource units, and two 996-frequency resource units corresponding to a 160MHz bandwidth. The following is based on... Figure 8 This example illustrates how the content channel generation device 30 generates the common field 210 and the content channel 200. First, the receiving circuit receives multiple resource configurations (e.g., {106-[106+26], [484+242], [996x2+484], [106+26][52+26]

[26] }) from multiple upper-layer scheduling stations (e.g., {(1,2), (3,4,5), (6,7,8,9), (10,11,12)}). The scheduling station {(10,11,12)} and its resource configuration [106+26][52+26]

[26] can correspond to... Figures 4-7 The aforementioned scheduling sites {1, 2, 3} and their resource configurations [106+26][52+26]

[26] can be determined according to... Figures 4-7 The described embodiment generates the number of user fields. Based on (e.g., by segmentation) multiple resource configurations, the segmentation circuit 340 generates multiple resource units. Based on the multiple resource units, the resource unit configuration circuit 300 generates a full binary tree. Multiple nodes store multiple scheduling site identifications and multiple resource unit information. Based on (e.g., by merging) the full binary tree, the node operation circuit 310 generates a minimum full binary tree (e.g., ...). Figure 8 The minimum full binary tree 800 and minimum full binary tree 802). The method by which the node operation circuit 310 generates the minimum full binary tree is described in the related case and will not be repeated here. Next, based on the minimum full binary tree and the load balancing function, the load balancing circuit 320 generates the number of user fields corresponding to multiple content channels. In this example with a bandwidth of 320MHz, the load balancing circuit 320 generates the number of user fields corresponding to multiple content channels in units of 80MHz. Therefore, the minimum full binary tree 80 can be considered as four minimum full binary trees ( Figure 8 Only the two full binary trees corresponding to the first 80MHz and the second 80MHz are shown, namely the minimum full binary tree 800 and the minimum full binary tree 802.

[0041] The following example illustrates how to determine the configuration of multiple user fields of a node in a full binary tree of 800 to multiple content channels based on a load balancing function. (The following N...) i Let be the number of user fields for the scheduling station corresponding to node i. First, node 257 corresponds to scheduling station (1, 2), and the number of user fields can be 2(N). 257=2). Nodes 258 and 274 correspond to scheduling sites (3, 4, 5), and the number of user fields can be 3 (N). 258,274 =3), meaning the total number of user fields for nodes 257, 258, and 274 is 5. According to the load balancing function, with a configuration where the first content channel carries 3 user fields and the second content channel carries 2 user fields (for example, the user field of node 257 and one user field of nodes 258 and 274 correspond to the first content channel, and the other two user fields of nodes 258 and 274 correspond to the second content channel), the load balancing function can produce (for example, calculate) a minimum value of 3.

[0042] Next, in the full binary tree 802, node 275 corresponds to the scheduling station (6, 7, 8, 9), and the maximum number of user fields can be 4 (N). 275 =4). Node 264 corresponds to scheduling site (10, 11, 12), and the number of user fields can be 3 (N). 264 =3), meaning the total number of user fields for nodes 275 and 264 can be at most 7. It's worth noting that the nodes corresponding to the scheduled sites (6, 7, 8, 9) are node 275 and the third 80MHz 996-band resource unit (not shown) (e.g., Figure 4 Node 283) and the fourth 80MHz 996-band resource unit (e.g. Figure 4 (Node 284), the number of user fields (e.g., at most) can be 4 (N) 275 +N 283 +N 284 =4). According to the load balancing function, with the first content channel carrying 1 user field and the second content channel carrying 3 user fields (e.g., one user field in node 275 corresponds to the first content channel, and a user field in node 264 corresponds to the second content channel), the load balancing function can produce (e.g., calculate) a minimum value of 3. It should be noted that when node 275 corresponds to a multi-resource unit, other user fields (e.g., not mapped to a content channel) can be located on other 80MHz channels (e.g.,...). Figure 8Load balancing is performed on the other two sub-minimum full binary trees (corresponding to 80MHz, not shown). For example, in another full binary tree, according to the load balancing function, the minimum value of 2 can be generated (e.g., calculated) by the load balancing function when the number of other user fields carried by the first content channel is 2 and the number of other user fields carried by the second content channel is 1. Because the length of the content channel is in 80MHz units and is based on the content channel carrying more user fields, in this example with a bandwidth of 320MHz, the minimum value of 3 user fields can be generated by the load balancing function based on the number of user fields in the first 80MHz, the minimum value of 3 user fields can be generated by the load balancing function for the first 80MHz, the minimum value of 2 user fields can be generated by the load balancing function for the third 80MHz, or the minimum value of 2 user fields can be generated by the load balancing function for the fourth 80MHz, resulting in the shortest content channel length with 3 user fields. In short, the above operation of generating multiple user field numbers corresponding to multiple content channels based on the minimum full binary tree 80 and the load balancing function can be used to balance the number of user fields carried by each content channel, and may include at least the following operations: (1) In each 80MHz, the number of user fields carried by the two content channels is balanced according to the load balancing function to ensure that the number of user fields carried by the two content channels is the same or similar. (2) In the total bandwidth (e.g., the above) Figure 8 In a 320MHz network (including four 80MHz channels), the number of user fields carried by multiple content channels is balanced according to a load balancing function to ensure that the number of user fields carried by multiple content channels is the same or similar. The multiple scheduling sites, various resource configurations, and the number of user fields mentioned above are only for illustrating this embodiment and are not intended to limit the invention.

[0043] Further, according to the tracing algorithm, the merging circuit 350 generates the tracing result of the minimum full binary tree 80. The merging circuit 350 generates the tracing result of the minimum full binary tree in units of 20MHz (e.g., node 257 and its subtrees). According to the tracing order of the leaf nodes of node 257 and its subtrees, the merging circuit 350 generates the merged tracing result, which is {

[106] [106+26]}. Based on the merged tracing result {

[106] [106+26]}, the common field generation circuit 360 queries the resource configuration table (e.g., ... Figure 7Based on the merged search results and the comparison results of the resource configuration table, the common field generation circuit 360 finds that the merged search result {

[106] [106+26]} is the same as a set of resource units {

[106] [106+26]} corresponding to the resource configuration indicator 50 (000110010). Therefore, the common field generation circuit 360 generates the resource configuration indicator 50 (000110010), and thus the resource unit configuration subfield in the common field 210 can be generated.

[0044] Similarly, based on the traversal order of the leaf nodes of node 258 and its subtrees, merging circuit 350 generates a merged traversal result of {[]

[242]

[484] }. Based on the merged traversal result {[]

[242]

[484] }, common field generation circuit 360 queries the resource configuration table (e.g., ...). Figure 7 Based on the merged search results and the comparison results of the resource configuration table, the common field generation circuit 360 finds that the merged search result {[]

[242]

[484] } is the same as a set of resource units {[]-242-484]} corresponding to the resource configuration indicator 96-103 (0001100y2y1y0). Considering that the number of user fields of node 258 is 2, the common field generation circuit 360 generates resource configuration indicator 97 (0001100001). In this way, the resource unit configuration subfield in the common field 210 can be generated.

[0045] The following is based on Figure 8The following example illustrates how the content channel generation device 30 generates content channel 200. Given that the total number of user fields for nodes 257, 258, and 274 is 5, according to the load balancing function, the first content channel can carry the user fields of node 257 (e.g., the number of multiple scheduled sites (1, 2) and multiple resource configurations 106-[106+26]) and one user field from nodes 258 and 274, and the second content channel can carry two other user fields from nodes 258 and 274. Therefore, the first content channel can carry a common field 210 containing resource configuration indicator 50 (000110010) and a user-specific field 220 containing the user field of node 257, and can carry a common field 210 containing resource configuration indicator 96 (0001100000) and a user-specific field 220 containing one user field from nodes 258 and 274. The second content channel can carry a common field 210 containing resource configuration indicator 97 (0001100001) and a user-specific field 220 containing two other user fields from nodes 258 and 274, and can also carry a common field 210 containing resource configuration indicator 29 (000011101). Note that for resource units with a size of 242-frequency or larger (e.g., 242-frequency, 484-frequency, 996-frequency, 996x2-frequency, or 996x4-frequency), when the resource configuration indicator corresponds to an empty scheduling site, the user field may not be carried. For details on the common fields, user fields, and the number of user fields generated by full binary tree 800 or full binary tree 802, and which content channel they correspond to, please refer to [the relevant documentation / references]. Figure 8 Content channel 810 or content channel 812.

[0046] The operation of the aforementioned content channel generating device 30 can be summarized as follows: Figure 9 The process 90 includes the following steps:

[0047] Step 900: Begin.

[0048] Step 902: Generate multiple resource units based on various resource configurations.

[0049] Step 904: Generate a full binary tree based on the multiple resource units.

[0050] Step 906: Based on the full binary tree, generate a minimum full binary tree.

[0051] Step 908: Based on the minimum full binary tree and a load balancing function, generate the number of multiple user fields corresponding to multiple content channels.

[0052] Step 910: Based on a search algorithm, generate a search result for the minimum full binary tree, and based on the search result, generate a merged search result.

[0053] Step 912: Based on the merged search results, generate a resource configuration indicator to generate a common field.

[0054] Step 914: End.

[0055] Process 90 is used to illustrate the content channel generation method of the content channel generation device 30. Detailed explanations and variations can be found above and will not be repeated here. The content channel generation device 30 (and its circuitry) can be implemented in many ways; for example, the circuitry can be integrated into one or more circuits. Furthermore, the content channel generation device 30 can be implemented using hardware (e.g., circuitry), software, firmware (a combination of hardware devices and computer instructions and data, where the computer instructions and data are read-only software on the hardware device), electronic systems, or combinations of the aforementioned circuitry, but is not limited to these methods.

[0056] In summary, the present invention provides an apparatus and method for generating content channels. Through the apparatus and method for generating content channels, common fields and the shortest user fields can be generated efficiently to generate the shortest content channels, thereby generating the shortest EHT-SIG fields.

[0057] The above description is only a preferred embodiment of the present invention. All equivalent changes and modifications made in accordance with the claims of the present invention shall be covered by the present invention.

[0058] [Symbol Explanation]

[0059] TX: Transmitter

[0060] RX: Receiver

[0061] 10: Communication System

[0062] 20, 210, 2100, 220, 2200: Fields

[0063] 200, 810, 812: Content Channels

[0064] 2202: Fill value

[0065] 30: Content channel generation device

[0066] 300, 310, 320, 330, 340, 350, 360: Circuits

[0067] 40, 50, 60, 80, 800, 802, 401, 416: Full binary tree

[0068] 70: Table

[0069] 90: Process

[0070] 900, 902, 904, 906, 908, 910, 912, 914: Steps.

Claims

1. A content channel generating apparatus, comprising: A partitioning circuit is used to generate multiple resource units based on various resource configurations; A resource unit configuration circuit, coupled to the partitioning circuit, is used to generate a full binary tree based on a plurality of said resource units; A node operation circuit, coupled to the resource unit configuration circuit, is used to generate a minimum full binary tree based on the full binary tree. A load balancing circuit, coupled to the node's computational circuit, is used to generate the number of multiple user fields corresponding to multiple content channels based on the minimum full binary tree and a load balancing function. A merging circuit, coupled to the load balancing circuit, is used to generate a search result of the minimum full binary tree according to a search algorithm, and to generate a merged search result according to the search result, wherein the search result includes a plurality of leaf nodes, and the operation of the merging circuit to generate the merged search result according to the search result includes: merging the at least one leaf node when at least one of the plurality of leaf nodes stores at least one first scheduling station that is identified as the same, to generate the merged search result; as well as A common field generation circuit, coupled to the merging circuit, is used to generate a resource configuration indicator based on the merging access result, thereby generating a common field.

2. The content channel generating apparatus according to claim 1, further comprising: A receiving circuit, coupled to the split circuit, is used to receive various resource configurations from multiple scheduling stations.

3. The content channel generating apparatus according to claim 1, wherein, Based on the results of this merged search, the operation of the common field generation circuit to generate the resource configuration indicator includes: Based on the results of this merge search, query a resource configuration table; and Based on the results of the merged search and a comparison of the resource configuration table, the resource configuration indicator is generated.

4. The content channel generating apparatus according to claim 1, further comprising: A user field generation circuit, coupled to the merging circuit, is used to generate multiple user fields corresponding to multiple content channels based on the access result.

5. The content channel generating apparatus according to claim 4, wherein, The search result contains multiple leaf nodes, and the operation of the user field generation circuit to generate multiple user fields based on the search result includes: Based on the multiple scheduling site identifications and multiple resource unit information stored in the multiple leaf nodes, a first leaf node of the multiple leaf nodes is retained, and multiple user fields are generated based on the first leaf node.

6. The content channel generating apparatus according to claim 5, wherein, Based on the search results, the operation of the user field generation circuit to generate multiple user fields further includes: Based on the multiple scheduling site identifications and multiple multi-resource unit information stored in the multiple leaf nodes, at least one second leaf node among the multiple leaf nodes is deleted.

7. The content channel generating apparatus according to claim 5, wherein, Each of the multiple multi-resource unit information contains a multi-resource unit flag.

8. The content channel generating apparatus according to claim 1, wherein, This search algorithm includes a binary tree preorder search algorithm.

9. A method for generating a content channel, comprising: Multiple resource units are generated based on various resource configurations; Based on the multiple resource units, a full binary tree is generated; Based on this full binary tree, generate a minimum full binary tree; Based on the minimum full binary tree and a load balancing function, the number of multiple user fields corresponding to multiple content channels is generated; According to a search algorithm, a search result of the minimum full binary tree is generated, and a merged search result is generated according to the search result, wherein the search result contains multiple leaf nodes, and the operation of generating the merged search result according to the search result includes: when at least one of the multiple leaf nodes stores at least one first scheduling station that is identified as the same, the at least one leaf node is merged to generate the merged search result; as well as Based on the results of the merged search, a resource configuration indicator is generated to produce a common field.

Images