Device and method for executing content channel generation

By configuring the scheduling site with full binary tree structure and related algorithms, the problems of user field length change and high complexity in the communication system are solved, and the generation of user fields and content channels with low complexity is realized, and bandwidth usage efficiency and real-time performance are improved.

CN113672773BActive Publication Date: 2024-11-19REALTEK SEMICON CORP
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202010416643.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2020-05-15
Publication Date
2024-11-19
Estimated Expiration
2040-05-15

AI Technical Summary

Technical Problem

In communication systems, existing sorting algorithms and linked lists are difficult to implement in embedded systems, resulting in changes in user field lengths, reducing bandwidth usage efficiency, and being highly complex, making it difficult to meet real-time needs.

Method used

Using a full binary tree structure and related algorithms, the scheduling site is configured through search algorithms, minimum binary tree calculation algorithms, load balancing functions and traversal algorithms, and the number of user fields and channel lengths are determined, and the shortest user fields and content channels are generated.

Benefits of technology

It realizes low-complexity user fields and content channels generation, improves bandwidth usage efficiency, meets real-time requirements, and reduces the complexity and running time of the algorithm.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113672773B_ABST
    Figure CN113672773B_ABST
Patent Text Reader

Abstract

The present disclosure relates to an apparatus and method for executing content channel generation. The content channel generation apparatus comprises: a resource unit configuration circuit, which is used to configure a scheduling site as a node in a full binary tree according to a search algorithm; a node operation circuit, which is used to determine first connection information of the full binary tree, and second connection information of a minimum full binary tree including a minimum binary tree calculation algorithm; a load balancing circuit, which is used to determine the number of multiple user fields corresponding to multiple content channels according to a load balancing function and the second connection information; and a user field generation circuit, which is used to generate a traversal result of the minimum full binary tree according to a traversal algorithm and the second connection information, and generate multiple user fields corresponding to the multiple content channels according to the traversal result, and generate the multiple content channels.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to a communication device and method for a communication system, and more particularly to a device and method for executing content channel generation. Background Art

[0002] In a communication system, a transmitting end uses a sorting algorithm and a linked list to obtain a user field for configuring user resources. However, the sorting algorithm and the linked list have high complexity (e.g., time complexity), which makes it difficult for the sorting algorithm and the linked list to be implemented in an embedded system. In addition, the user field obtained according to the sorting algorithm and the linked list has a variable length. However, an overly long user field reduces the efficiency of bandwidth use. Therefore, how to design a low-complexity algorithm to obtain the shortest user field and generate the shortest content channel is a problem to be solved. Summary of the invention

[0003] The present invention provides a method and a communication device thereof for executing content channel generation to solve the above-mentioned problem.

[0004] The present invention discloses a content channel generating device, comprising a resource unit assignment circuit, used to assign at least one scheduled station to at least one node in a full binary tree according to a search algorithm; a node computing circuit, coupled to the resource unit assignment circuit, used to determine first connection information of the full binary tree, and comprising a minimum binary tree calculation algorithm, used to determine second connection information of a minimum full binary tree according to the minimum binary tree calculation algorithm and the first connection information; a load balancing circuit, coupled to the node computing circuit, used to determine the number of multiple user fields corresponding to multiple content channels according to a load balancing function and the second connection information; and a user field generating circuit, coupled to the load balancing circuit and the node computing circuit, used to generate a user field according to a traversal algorithm. algorithm) and the second connection information, generate a traversal result of the minimum full binary tree, and generate a plurality of user fields corresponding to the plurality of content channels according to the traversal result, and generate the plurality of content channels.

[0005] The present invention also discloses a content channel generation method for a content channel generation device, comprising configuring at least one scheduled station as at least one node in a full binary tree according to a search algorithm; determining first connection information of the full binary tree, and determining second connection information of a minimum full binary tree according to a minimum binary tree calculation algorithm and the first connection information; determining the number of multiple user fields corresponding to multiple content channels according to a load balancing function and the second connection information; and generating a traversal result of the minimum full binary tree according to a traversal algorithm and the second connection information, and generating multiple user fields corresponding to the multiple content channels and the multiple content channels according to the traversal result. BRIEF DESCRIPTION OF THE DRAWINGS

[0006] Figure 1 FIG. 1 is a schematic diagram of a communication system according to an embodiment of the present invention.

[0007] Figure 2 Schematic diagram of a content channel generating device according to an embodiment of the present invention.

[0008] Figure 3 It is a schematic diagram of the correspondence between a resource unit and a node of a full binary tree according to an embodiment of the present invention.

[0009] Figure 4 It is a schematic diagram of the correspondence between a resource unit and a node of a full binary tree according to an embodiment of the present invention.

[0010] Figure 5 It is a schematic diagram of a corresponding table 50 of a browsing order, a browsing result and multiple content channels according to an embodiment of the present invention.

[0011] Figure 6 It is a schematic diagram of generating a user field according to a traversal result and multiple content channels according to an embodiment of the present invention.

[0012] Figure 7 The figure is a flow chart of a process of an embodiment of the present invention. DETAILED DESCRIPTION

[0013] Figure 1FIG. 1 is a schematic diagram of a communication system 10 according to an embodiment of the present invention. The communication system 10 may be any communication system using orthogonal frequency-division multiplexing (OFDM) technology (or discrete multi-tone modulation (DMT) technology), and is simply composed of a transmitting end TX and a receiving end RX. Figure 1 In the figure, the transmitter TX and the receiver RX are used to illustrate the architecture of the communication system 10. For example, the communication system 10 may be a wired communication system such as an asymmetric digital subscriber line (ADSL) system, a power line communication (PLC) system, an Ethernet over coax (EOC) system, etc. Alternatively, the communication system 10 may be a wireless local area network (WLAN), a digital video broadcasting (DVB) system, a long term evolution (LTE) system, an advanced long term evolution (LTE-advanced, LTE-A) system, a fifth generation (5G) system, etc. A wireless communication system. For example, the transmitter TX may be an access point (AP) in the local wireless network. In addition, the transmitter TX and the receiver RX may be set in devices such as mobile phones and laptop computers, but are not limited thereto.

[0014] In one embodiment, the transmitter TX and the receiver RX may support the Institute of Electrical and Electronics Engineers (IEEE) 802.11 standard (e.g., IEEE802.11AX). In one embodiment, the 802.11 standard may support Orthogonal Frequency Division Multiple Access (OFDMA) and / or Multi-User Multiple-Input Multiple-Output (MU-MIMO). In order to efficiently notify the receiver RX of the transmission information of all scheduled stations (scheduled STAs), the IEEE802.11 standard defines a field (e.g., HE-SIG-B field) of a high efficiency wireless technology multi-user physical layer protocol data unit (HE-MUPPDU). In one embodiment, the HE-SIG-B field may include at least one content channel, and each content channel may include multiple common fields to notify all scheduled stations of the resource unit assignment of all data bandwidths at present. In one embodiment, each content channel may include at least one user field, and each user field carries the transmission information of a specific station. In one embodiment, in the IEEE802.11 standard, each resource unit less than 242-tone may (for example, need to) be configured with at least one station, so for an empty resource unit, the HE-SIG-B field may be configured with an empty station with a station identifier (STA identity, STA ID) of "2046". For resource units greater than or equal to 242-tone, the HE-SIG-B field may configure the user field to multiple content channels to ensure that the number of user fields carried by multiple content channels (i.e., the length (e.g., size) of the content channel) is the same or similar. In one embodiment, load balancing may be used to balance the length of the content channel. The length of the HE-SIG-B field may be changed according to the result of resource unit configuration and the result of load balancing.In one embodiment, a too long HE-SIG-B field may cause the Physical Layer Convergence Procedure (PLCP) to be too long, thereby resulting in a decrease in throughput.

[0015] In one embodiment, resource unit configuration can search for the best resource unit configuration combination by evenly dividing the data bandwidth. Evenly dividing the data bandwidth can obtain the lowest complexity, which can generate more empty resource units, making the user field (such as the user-specific field) longer, thereby causing the output rate to decrease. In one embodiment, resource unit configuration can search for the best resource unit configuration combination by exhaustive search. The exhaustive search can obtain the best resource unit configuration combination, which can be increased according to the increase of data bandwidth and the increase of search space, so that the complexity and running time of the algorithm are greatly increased, thereby causing the real-time requirements in practical applications to be unable to be met. In one embodiment, in the program for generating the user field, according to the spectrum position of the data unit to which it is configured, the order of the user field can (for example, need to) be arranged in the order of the most negative frequency to the most positive frequency. Therefore, a common implementation method is to use a linked list combined with a sorting algorithm to achieve it. However, the linked list and the sorting algorithm have high complexity, so for embedded systems (such as access points), a long running time is required, which is difficult to meet the real-time requirements in practical applications.

[0016] Figure 2 Schematic diagram of a content channel generating device 20 according to an embodiment of the present invention, which can be used for Figure 1In the transmitting end TX, it can be used to generate a user field and a content channel. In one embodiment, the content channel can be included in the HE-SIG-B field. In one embodiment, the HE-SIG-B field can include multiple content channels. In one embodiment, the multiple content channels can include at least one first content channel and at least one second content channel. In one embodiment, each content channel can include at least one common field and / or at least one user field. In one embodiment, the common field can be used to notify the client of the configuration of the resource unit in the current spectrum. In one embodiment, the user field can be used to notify the client or station of its configured resources. In one embodiment, if the resource unit of the smallest size is determined as a leaf node and the adjacent resource unit is determined as a sibling node, according to the rule that the resource unit size of the child node is not greater than the resource unit size of the parent node, the content channel generating device 20 (for example, a node computing circuit (node ​​computing) 210 therein) establishes (for example, determines, generates) a binary tree, and each resource unit can correspond to a node of the binary tree. In one embodiment, the node may correspond to at least one user field. That is, each resource unit may correspond to one or more user fields.

[0017] The content channel generating device 20 may include a resource unit configuration circuit 200, a node operation circuit 210, a load balancing circuit 220 and a user field generating circuit 230. In detail, the resource unit configuration circuit 200 may be used to configure (e.g. locate) at least one scheduling site as at least one node in a full binary tree according to a search algorithm. The node operation circuit 210, coupled to the resource unit configuration circuit 200, may include a node pool, which may be used to determine (e.g. record) first node connection information in the full binary tree (e.g., currently existing nodes). The node operation circuit 210 may also include a minimum binary tree calculation algorithm, which may determine (e.g., calculate or update) second node connection information of a minimum full binary tree (e.g., non-empty nodes in the node pool (i.e., non-empty nodes in the full binary tree)) according to the minimum binary tree calculation algorithm and the first connection information. The load balancing circuit 220 is coupled to the node operation circuit 210 and can be used to determine (e.g., calculate) the number of multiple user fields corresponding to the multiple content channels (e.g., the number of user fields that each content channel can (e.g., will) carry) according to the load balancing function and the second node connection information. The user field generation circuit 230 is coupled to the load balancing circuit 220 and the node operation circuit 210 and can be used to generate a traversal result of a minimum full binary tree according to a traversal algorithm and the second node connection information, and to generate (e.g., form) multiple user fields corresponding to the multiple content channels according to the traversal result, and to generate (e.g., form) multiple content channels. In one embodiment, a number of the multiple user fields is a number of user fields.

[0018] In one embodiment, the node pool may include a memory unit (e.g., static random access memory (SRAM) or a register file) for storing node connection information. In one embodiment, the minimum binary tree calculation algorithm may include a merging algorithm. Based on the first node connection information in the node pool, the merging algorithm may determine (e.g., calculate) a minimum full binary tree including all nodes.

[0019] In one embodiment, the search algorithm may include a binary tree search algorithm (e.g., a depth first search algorithm). In one embodiment, at least one node includes (e.g., is) at least one non-empty node. In one embodiment, based on the search algorithm and the at least one non-empty node, the resource unit configuration circuit 200 may configure a plurality of empty STAs into a plurality of empty leaf nodes in a full binary tree, so that the nodes in the node pool may constitute a full binary tree. In one embodiment, if the parent node (parentnode) connected to the first empty leaf node of at least one empty leaf node is at least one non-empty node, the node operation circuit 210 may merge the first empty leaf node into the at least one non-empty node. In one embodiment, if the parent node connected to the second empty leaf node of at least one empty leaf node is not at least one non-empty node and the parent node is not connected to at least one non-empty node, the node operation circuit 210 may merge the second empty leaf node into the parent node, and determine the parent node as an empty node of the first configuration. In one embodiment, if the parent node connected to the third empty leaf node of at least one empty leaf node is not at least one non-empty node and the parent node is connected to at least one non-empty node, the node operation circuit 210 may determine the third empty leaf node as an empty node of the second configuration. In one embodiment, the node operation circuit 210 may determine a minimum full binary tree (store connection information of the minimum full binary tree) based on at least one non-empty node and at least one empty node of the configuration (e.g., an empty node of the first configuration and / or an empty node of the second configuration), the node operation circuit 210 may determine (e.g., store) a minimum full binary tree and its connection information based on at least one non-empty node and at least one empty node of the configuration (e.g., an empty node of the first configuration and / or an empty node of the second configuration).

[0020] In one embodiment, the plurality of content channels may include at least one first content channel and at least one second content channel. In one embodiment, the at least one first content channel may include at least one first user field of the plurality of user fields, and the at least one second content channel may include at least one second user field of the plurality of user fields. In one embodiment, the at least one first content channel or the at least one second content channel may not include a user field. In one embodiment, the plurality of nodes may correspond to a plurality of resource units. In one embodiment, a resource unit among the plurality of resource units may correspond to at least one user field. That is, each resource unit may correspond to (e.g., signaling) one or more user fields.

[0021] In one embodiment, the traversal algorithm may include a binary tree pre-order traversal algorithm. In one embodiment, the traversal algorithm may include a binary tree mirrored pre-order traversal algorithm. In one embodiment, the arrangement order of the multiple frequencies corresponding to the multiple user fields may be in ascending order. That is, the arrangement order of the multiple frequencies corresponding to the multiple user fields is from the smallest frequency to the largest frequency (for example, from the most negative frequency to the most positive frequency).

[0022] Figure 3 FIG. 1 is a schematic diagram of a corresponding relationship between a resource unit and a node of a full binary tree according to an embodiment of the present invention. Figure 3 In the figure, the resource units are shown as a trapezoid. Taking the bandwidth of 160MHZ as an example, from top to bottom there are 8 242-frequency (for example, including 242 subcarriers) resource units, 4 484-frequency (for example, including 484 subcarriers) resource units, 2 996-frequency (for example, including 996 subcarriers) resource units, and 1 1992-frequency (for example, including 1992 subcarriers) resource unit. The processing procedures for resource units smaller than 242-frequency are similar and are not repeated here. A resource unit has a resource unit pointer (for example, defined in the 3rd Generation Partnership Project (3GPP) standard, determined by the transmitter TX, or defined in the WiFi standard (for example, WiFi-6)), which is shown as Figure 3 Indicators 1 to 15. In addition, Figure 3 In , the full binary tree is shown as a tree structure, which includes circles filled with diagonal stripes (hereinafter referred to as diagonal stripe circles), circles filled with grids (hereinafter referred to as grid circles), circles filled with dots (hereinafter referred to as dot circles) and the connecting lines between them. The diagonal stripe circles represent empty nodes, the grid circles represent nodes where the scheduling site is configured, and the dot circles represent reserved nodes. Figure 3 The arrows shown in represent the merging of one node into another node, and the tree structure after the nodes are merged may (for example, need to) satisfy the structure of a full binary tree. Figure 3 As shown, the correspondence between the resource units and the nodes of the full binary tree is one-to-one, that is, one resource unit corresponds to one node in the full binary tree.

[0023] Figure 4 FIG. 1 is a schematic diagram of a corresponding relationship between a resource unit and a node of a full binary tree according to an embodiment of the present invention. Figure 4 In the same way as in Figure 3 The same, no further description is given here. Figure 3 The difference is that the full binary tree includes unfilled circles, grid circles, circles filled with horizontal stripes (hereinafter referred to as horizontal stripe circles), dotted circles and connecting lines therebetween, wherein the unfilled circles represent empty leaf nodes, the grid circles represent nodes configured with scheduling sites, the horizontal stripe circles represent empty nodes configured with empty sites, and the dotted circles represent reserved nodes. Finally, after removing (e.g. deleting) the empty leaf nodes, the remaining nodes can generate a full binary tree.

[0024] The following is based on Figure 3 and Figure 4 The following is an example of how the content channel generating device 20 generates a content channel.

[0025] First, the resource unit configuration circuit 200 receives the scheduling sites 6 and 9 transmitted by the upper layer (e.g., the Media Access Control (MAC) layer). According to the search algorithm, the resource unit configuration circuit 200 configures the scheduling sites 6 and 9 as nodes corresponding to the resource unit pointers 6 and 9 in the full binary tree (i.e., Figure 3 The grid circle in the figure), wherein the connection information of the node is stored in the node pool of the node operation circuit 210. In order to simplify the description, the node corresponding to the resource unit pointer X is referred to as node X below.

[0026] According to the search algorithm and nodes 6 and 9, the resource unit configuration circuit 200 configures multiple empty sites in multiple empty leaf nodes, namely nodes 1 to 5, 7, and 8 (i.e. Figure 3 In the diagonal striped circle in the leaf nodes, the nodes in the node pool can form a full binary tree.

[0027] According to the minimum binary tree calculation algorithm, the parent node connected to nodes 1 and 2 is node 9, and the node operation circuit 210 merges nodes 1 and 2 into node 9 (i.e. Figure 3 According to the minimum binary tree calculation algorithm, the parent node connected to nodes 3 and 4 is node 10, not node 6 or node 9, and node 10 is not connected to node 6 or node 9, and the node operation circuit 210 merges nodes 3 and 4 into node 10 (i.e. Figure 3 ), and node 10 is determined to be a configured empty node (i.e. Figure 4 Similarly, according to the minimum binary tree calculation algorithm, the parent node connected to nodes 7 and 8 is node 12, not node 6 or node 9, and node 12 is not connected to node 6 or node 9, and the node operation circuit 210 merges nodes 7 and 8 into node 12 (i.e. Figure 3 ), and node 12 is determined to be a configured empty node (i.e. Figure 4 In addition, according to the minimum binary tree calculation algorithm, the parent node of node 5 is node 11, not node 6 or node 9, but node 11 is connected to node 6, and the node operation circuit 210 determines node 5 as a configured empty node (i.e. Figure 4 The horizontal stripes in the circle) satisfy the tree structure as a binary tree structure (e.g., a full binary tree structure). According to the above search algorithm, the resource unit configuration circuit 200 configures the scheduling site as nodes 6 and 9 in the full binary tree, and according to the above minimum binary tree calculation algorithm, the node operation circuit 210 merges the configured empty sites (i.e., nodes 1 to 5, 7, 8) into empty nodes 5, 10, 12. To simplify the description, nodes 6, 9 and the configured empty nodes 5, 10, 12 are referred to as configuration nodes below.

[0028] Next, according to the load balancing function, the load balancing circuit 220 determines (e.g., calculates) whether at least one user field of the configuration node corresponds to the first content channel and / or the second content channel. That is, each configuration node may correspond to (e.g., signaling) one or more user fields. First, the load balancing function may be defined as follows:

[0029]

[0030]

[0031]

[0032]

[0033] in is a resource unit index (index) whose number of frequencies (subcarriers) of a resource unit is greater than or equal to 484 (eg, 484 or 996); N i The number of user fields configured for resource unit i; x i is the number of user fields of resource unit i configured to the first content channel; i is the number of user fields of resource unit i configured to the second content channel; C1 is the number of user fields of the first content channel of resource units configured (e.g., signaled) with a frequency number less than or equal to 242 (e.g., 26, 52, 106, or 242); C2 is the number of user fields of the second content channel of resource units configured (e.g., signaled) with a frequency number less than or equal to 242 (e.g., 26, 52, 106, or 242); is a natural number.

[0034] The following is an example of how to determine the correspondence of the user fields of the configuration nodes to the first content channel and / or the second content channel according to the load balancing function (Formula 1). First, the number of user fields of configuration node 5 is 1 (N5=1), the number of user fields of configuration node 6 is 1 (N6=1), the number of user fields of configuration node 9 is 2 (N9=2), and the number of user fields of configuration node 10 is 2 (N 10 =2), and the number of user fields of configuration node 12 is 2 (N 12 =2). That is, the number of user fields of the configuration node is 8.

[0035] According to the load balancing function, when the user field of configuration node 5 corresponds to the first content channel and the user field of configuration node 6 corresponds to the second content channel, or when the user field of configuration node 5 corresponds to the second content channel and the user field of configuration node 6 corresponds to the first content channel, C1=1 and C2=1. When the user fields of configuration nodes 9, 10, and 12 all correspond to the first content channel, and When the user field of node 9 among the configuration nodes 9, 10, and 12 corresponds to the second content channel, and the other user fields all correspond to the first content channel, and When the user fields of nodes 9, 10, and 12 are configured so that the user field of node 9 and one of the user fields of node 10 correspond to the second content channel, and the other user fields all correspond to the first content channel, and When one of the user fields of node 9, node 10, and node 12 in the configuration of the user fields corresponds to the second content channel, and the other user fields all correspond to the first content channel, and When the user fields of nodes 9, 10, and 12 are configured so that the user field of node 9, one of the user fields of node 10, and one of the user fields of node 12 correspond to the second content channel, and the other user fields all correspond to the first content channel, and When the user fields of nodes 9, 10, and 12 are configured so that the user field of node 9, one of the user fields of node 10, and the user field of node 12 correspond to the second content channel, and the other user fields correspond to the first content channel, and Among the above maximum values ​​4 to 7, the minimum value is 4. Therefore, according to the load function, in the configuration where the number of user fields carried by the first content channel is 4 and the number of user fields carried by the second content channel is 4, because the length of the HE-SIG-B field is based on the content channel carrying more user fields, we can obtain the shortest HE-SIG-B field. Therefore, when the minimum value 4 has appeared, all correspondences between the user field and the first content channel and / or the second content channel are no longer stated one by one.

[0036] The corresponding manner in which the minimum value is 4 is one of the corresponding manners, but is not limited thereto. The corresponding manner in which the minimum value is 4 is when one of the user fields of node 9, node 10, and node 12 in the user fields of nodes 9, 10, and 12 corresponds to the second content channel, and the other user fields all correspond to the first content channel. The above configuration can satisfy the conditional formula of the load balancing function.

[0037] Further, according to the traversal algorithm, the user field generation circuit 230 can generate a traversal result of a full binary tree. Figure 4 , only traverse the retained nodes (i.e. Figure 4 The point circle) and configuration node (i.e. Figure 4 The grid circle and horizontal stripe circle) will be traversed, and nodes 1 to 4, 7, and 8 (i.e. Figure 4 Therefore, the traversal result of the user field generation circuit 230 traversing the full binary tree is node 15, node 13, node 9, node 10, node 14, node 11, node 5, node 6 and node 12, wherein the traversal order of the configuration nodes is node 9, node 10, node 5, node 6 and node 12.

[0038] The corresponding relationship between the above traversal order, traversal results and content channels can be summarized as follows: Figure 5 A corresponding table 50 is provided. Table 50 illustrates the configuration nodes and their corresponding first content channels and / or second content channels.

[0039] Figure 6 For the embodiment of the present invention according to Figure 5 The traversal results and their corresponding content channels generate a schematic diagram of the user field. Figure 6 In the example, the resource units and their resource unit pointers are drawn in the same way as the full binary tree. Figure 4 The same, not repeated here. Figure 6 In FIG. 1 , the thick arrow refers to the user field corresponding to (contained in) the first content channel, the thin arrow refers to the user field corresponding to (contained in) the second content channel, and “2046” refers to the user field being used for an empty (i.e., unscheduled) site. Figure 6As shown, the first content channel corresponds to (includes) a user field of node 9 (e.g., for scheduling sites), a user field of node 10, a user field of node 5, and a user field of node 12. The second content channel corresponds to (includes) another user field of node 9, another user field of node 10, a user field of node 6 (e.g., for scheduling sites), and another user field of node 12.

[0040] The content channel generation method of the content channel generation device 20 can be summarized as follows: Figure 7 A process 70. The process 70 includes the following steps:

[0041] Step 700: Start.

[0042] Step 702: According to a search algorithm, configure at least one scheduling site as at least one node in a full binary tree.

[0043] Step 704: Determine first connection information of the full binary tree, and determine second connection information of a minimum full binary tree according to a minimum binary tree calculation algorithm and the first connection information.

[0044] Step 706: Determine a plurality of user field quantities corresponding to a plurality of content channels according to a load balancing function and the second connection information.

[0045] Step 708: Generate a traversal result of the minimum full binary tree according to a traversal algorithm and the second connection information, and generate a plurality of user fields corresponding to the plurality of content channels and the plurality of content channels according to the traversal result.

[0046] Step 710: End.

[0047] The process 70 is used to illustrate the content channel generating method of the content channel generating device 20 . The detailed description and variations can be referred to above and will not be repeated here.

[0048] It should be noted that the content channel generating device 20 (and the resource unit configuration circuit 200, the node operation circuit 210, the load balancing circuit 220 and the user field generating circuit 230 therein) can be implemented in many ways. For example, the above devices can be integrated into one or more devices. In addition, the content channel generating device 20 can be implemented by hardware (such as circuits), software, firmware (a combination of hardware devices and computer instructions and data, and the computer instructions and data are read-only software on the hardware devices), electronic systems, or a combination of the above devices, but is not limited thereto.

[0049] In summary, the present invention provides a device and method for performing content channel generation. According to a search algorithm with lower complexity, a minimum binary tree calculation algorithm, a load function and a traversal algorithm, a transmitter TX can more efficiently generate the shortest user field and the shortest content channel, thereby generating the shortest HE-SIG-B field.

[0050] The above descriptions are only preferred embodiments of the present invention. All equivalent changes and modifications made within the scope of the claims of the present invention should fall within the scope of the present invention.

[0051]

Explanation of symbols

[0052] 10: Communication System

[0053] 20: Content channel generation device

[0054] 200: Resource unit configuration circuit

[0055] 210: Node operation circuit

[0056] 220: Load balancing circuit

[0057] 230: User field generation circuit

[0058] 50: Table

[0059] 70: Process

[0060] 700, 702, 704, 706, 708, 710: steps.

Claims

1. A content channel generating device, comprising: a resource unit configuration circuit, configured to configure at least one scheduling site as at least one node in a full binary tree according to a search algorithm; a node operation circuit coupled to the resource unit configuration circuit, used to determine first connection information of the full binary tree, and comprising a minimum binary tree calculation algorithm, and determining second connection information of a minimum full binary tree according to the minimum binary tree calculation algorithm and the first connection information; a load balancing circuit coupled to the node operation circuit, for determining the number of user fields corresponding to the plurality of content channels according to a load balancing function and the second connection information; and A user field generating circuit is coupled to the load balancing circuit and the node operation circuit, and is used to generate a traversal result of the minimum full binary tree according to a traversal algorithm and the second connection information, and to generate a plurality of user fields corresponding to the plurality of content channels according to the traversal result, and to generate the plurality of content channels.

2. The content channel generating device according to claim 1, wherein: The search algorithm includes a binary tree search algorithm.

3. The content channel generating device according to claim 1, wherein: The at least one node includes at least one non-empty node.

4. The content channel generating device according to claim 3, wherein: According to the search algorithm and the at least one non-empty node, the resource unit configuration circuit configures a plurality of empty sites into a plurality of empty leaf nodes in the full binary tree.

5. The content channel generating device according to claim 4, wherein: According to the minimum binary tree calculation algorithm, the node operation circuit performs the following operations: If a parent node connected to a first empty leaf node among the plurality of empty leaf nodes is the at least one non-empty node, the node operation circuit merges the first empty leaf node into the at least one non-empty node; If a parent node connected to a second empty leaf node among the plurality of empty leaf nodes is not the at least one non-empty node and the parent node is not connected to the at least one non-empty node, the node operation circuit merges the second empty leaf node into the parent node, and determines the parent node as an empty node of the first configuration; as well as If a parent node connected to a third empty leaf node among the plurality of empty leaf nodes is not the at least one non-empty node and the parent node is connected to the at least one non-empty node, the node operation circuit determines the third empty leaf node as an empty node of at least one second configuration.

6. The content channel generating device according to claim 4, wherein: The node operation circuit determines the minimum full binary tree according to the at least one non-empty node and the plurality of empty leaf nodes.

7. The content channel generating device according to claim 1, wherein: The plurality of content channels include at least one first content channel and at least one second content channel.

8. The content channel generating device according to claim 7, wherein: The at least one first content channel includes at least one first user field of the plurality of user fields, and the at least one second content channel includes at least one second user field of the plurality of user fields.

9. The content channel generating device according to claim 1, wherein: The traversal algorithm includes a binary tree pre-order traversal algorithm.

10. A content channel generation method, used in a content channel generation device, the content channel generation method comprising: According to a search algorithm, configuring at least one scheduling site as at least one node in a full binary tree; Determine first connection information of the full binary tree, and determine second connection information of a minimum full binary tree according to a minimum binary tree calculation algorithm and the first connection information; Determining a plurality of user field quantities corresponding to a plurality of content channels according to a load balancing function and the second connection information; and A traversal result of the minimum full binary tree is generated according to a traversal algorithm and the second connection information, and a plurality of user fields corresponding to the plurality of content channels and the plurality of content channels are generated according to the traversal result.