Scene information determination method and device, electronic equipment, storage medium and chip

By using the first codebook and the second codebook for decoding in wireless broadband communication, the problem of resource occupation and inefficiency caused by hash search is solved, and more efficient and accurate scenario information determination is achieved.

CN120378044APending Publication Date: 2025-07-25BEIJING X RING TECHNOLOGY CO LTD
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202410302511.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-03-15
Publication Date
2025-07-25

AI Technical Summary

Technical Problem

In wireless broadband communication, the prior art requires a problem of searching scene information based on hash values, resulting in a large resource occupancy and low efficiency.

Method used

By obtaining the target codeword, the first codebook is used to decode the keywords for the first time, and the second codebook is used to decode the second time, the scene information is directly determined, the hash value is reduced to find storage resources, and the probability of conflict is reduced.

Benefits of technology

It improves the efficiency and accuracy of scene information determination, reduces resource usage and determination time.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120378044A_ABST
    Figure CN120378044A_ABST
Patent Text Reader

Abstract

The invention provides a scene information determination method and device, electronic equipment, a storage medium and a chip, and the method comprises the steps: obtaining a target code word; according to a first codebook, performing first decoding on the target codeword to obtain a keyword corresponding to the target codeword; and decoding the target code word for the second time according to a second codebook and the keyword to obtain scene information corresponding to the target code word. The scene information determination efficiency and accuracy can be improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of communication technologies, and in particular, to a method, an apparatus, an electronic device, a storage medium, and a chip for determining scenario information. Background Art

[0002] With the development of communication technologies, wireless broadband communication has emerged. Wireless broadband communication can be, for example, a new technology for high-capacity and high-rate wireless transmission based on standard protocols. With the rapid development of the information industry and the strong demand in the information market, wireless broadband communication is developing towards a broadband trend, and its application scope will also become wider and wider. Summary of the Invention

[0003] The present disclosure aims to at least partly solve one of the technical problems in the related art.

[0004] To this end, the first object of the present disclosure is to propose a method for determining scenario information to improve the efficiency and accuracy of determining scenario information.

[0005] The second object of the present disclosure is to propose a device for determining scenario information.

[0006] The third object of the present disclosure is to propose an electronic device.

[0007] The fourth object of the present disclosure is to propose a computer-readable storage medium.

[0008] The fifth object of the present disclosure is to propose a computer program product.

[0009] To achieve the above object, an embodiment of the first aspect of the present disclosure provides a method for determining scenario information, including:

[0010] Obtaining a target codeword;

[0011] Performing a first decoding on the target codeword according to a first codebook to obtain a keyword corresponding to the target codeword;

[0012] Performing a second decoding on the target codeword according to a second codebook and the keyword to obtain scenario information corresponding to the target codeword.

[0013] Optionally, the performing a first decoding on the target codeword according to a first codebook to obtain a keyword corresponding to the target codeword includes:

[0014] Performing a cyclic redundancy check (CRC) on the target codeword by using a check method corresponding to any header in the first codebook to obtain a target header that meets the check requirements;

[0015] Determining a keyword corresponding to the target codeword according to the element information corresponding to the target header.

[0016] Optionally, determining the keyword corresponding to the target codeword according to the element information corresponding to the target header includes:

[0017] When the element information corresponding to the target header is one piece of element information, using the keyword corresponding to the element information as the keyword corresponding to the target codeword.

[0018] Optionally, determining the keyword corresponding to the target codeword according to the element information corresponding to the target header includes:

[0019] When the element information corresponding to the target header is at least two pieces of element information, sequentially accessing the at least two pieces of element information to determine the target element information that meets the keyword requirements among the at least two pieces of element information;

[0020] Using the keyword corresponding to the target element information as the keyword corresponding to the target codeword.

[0021] Optionally, secondarily decoding the target codeword according to the second codebook and the keyword to obtain the scene information corresponding to the target codeword includes:

[0022] Obtaining a second codebook;

[0023] Obtaining the first binary information corresponding to the keyword;

[0024] Searching in the second codebook according to the first binary information to obtain the second binary information corresponding to the keyword;

[0025] Decoding the second binary information to obtain the scene information corresponding to the target codeword.

[0026] Optionally, the method further includes:

[0027] Obtaining a scene information set and the probability corresponding to any scene information in the scene information set;

[0028] Performing first encoding according to the scene information set and the probability corresponding to any scene information to generate the second codebook;

[0029] Using the encoded numbers in the second codebook as keywords to perform second encoding to generate the first codebook.

[0030] Optionally, using the encoded numbers in the second codebook as keywords to perform second encoding to generate the first codebook includes:

[0031] Obtain the first quantity of the header corresponding to the first codebook, where the third quantity is the same as the second quantity corresponding to the at least one scenario information, and the third quantity is the cumulative sum of the first quantity and the linked list length corresponding to any header;

[0032] Determine the cyclic redundancy check code generation polynomial of the first quantity;

[0033] Use the cyclic redundancy check code generation polynomial corresponding to any header to perform binomial calculation on the keyword corresponding to any header, generate the header number corresponding to any header, and store the header number in any header to obtain the first codebook.

[0034] Optionally, the obtaining the set of scenario information and the probability corresponding to any scenario information in the set of scenario information includes:

[0035] Obtain the probability corresponding to any first scenario information in the set of scenario information, where the first scenario information is the scenario information determined according to the dimension information;

[0036] Merge the first scenario information corresponding to the first probability and the first scenario information corresponding to the second probability in ascending order of the probability corresponding to any first scenario information to obtain the second scenario information, and add the second scenario information to the set of scenario information;

[0037] Obtain the third probability corresponding to the second scenario information;

[0038] Repeat the process of obtaining the third probability corresponding to the second scenario information until all scenario information in the set of scenario information is merged.

[0039] To achieve the above object, an embodiment of the second aspect of the present disclosure proposes a scenario information determination device, including:

[0040] A codeword acquisition unit, configured to acquire a target codeword;

[0041] A keyword acquisition unit, configured to perform a first decoding on the target codeword according to the first codebook to obtain the keyword corresponding to the target codeword;

[0042] A scenario information acquisition unit, configured to perform a second decoding on the target codeword according to the second codebook and the keyword to obtain the scenario information corresponding to the target codeword.

[0043] Optionally, when the keyword acquisition unit is configured to perform a first decoding on the target codeword according to the first codebook to obtain the keyword corresponding to the target codeword, it is specifically configured to:

[0044] Perform cyclic redundancy check (CRC) on the target codeword using the check method corresponding to any header in the first codebook to obtain a target header that meets the check requirements.

[0045] Determine the keyword corresponding to the target codeword according to the element information corresponding to the target header.

[0046] Optionally, when the keyword acquisition unit is used to determine the keyword corresponding to the target codeword according to the element information corresponding to the target header, it is specifically used for:

[0047] In the case where the element information corresponding to the target header is one piece of element information, use the keyword corresponding to the element information as the keyword corresponding to the target codeword.

[0048] Optionally, when the keyword acquisition unit is used to determine the keyword corresponding to the target codeword according to the element information corresponding to the target header, it is specifically used for:

[0049] In the case where the element information corresponding to the target header is at least two pieces of element information, sequentially access the at least two pieces of element information to determine the target element information that meets the keyword requirements among the at least two pieces of element information;

[0050] Use the keyword corresponding to the target element information as the keyword corresponding to the target codeword.

[0051] Optionally, when the scenario information acquisition unit is used to perform a second decoding on the target codeword according to the second codebook and the keyword to obtain the scenario information corresponding to the target codeword, it is specifically used for:

[0052] Obtain the second codebook;

[0053] Obtain the first binary information corresponding to the keyword;

[0054] According to the first binary information, perform a search in the second codebook to obtain the second binary information corresponding to the keyword;

[0055] Decode the second binary information to obtain the scenario information corresponding to the target codeword.

[0056] Optionally, the scenario information acquisition unit is further used for:

[0057] Obtain a scenario information set and the probability corresponding to any scenario information in the scenario information set;

[0058] Perform a first encoding according to the scenario information set and the probability corresponding to the any scenario information to generate the second codebook;

[0059] Use the encoded numbers in the second codebook as keywords for a second encoding to generate the first codebook.

[0060] Optionally, when the scenario information acquisition unit uses the encoded numbers in the second codebook as keywords for a second encoding to generate the first codebook, it specifically:

[0061] Obtain the first quantity of the header corresponding to the first codebook, where the third quantity is the same as the second quantity corresponding to the at least one scenario information, and the third quantity is the cumulative sum of the first quantity and the linked list length corresponding to any header;

[0062] Determine the cyclic redundancy check code generation polynomial for the first quantity;

[0063] Use the cyclic redundancy check code generation polynomial corresponding to any header to perform binomial calculation on the keyword corresponding to any header to generate the header number corresponding to any header, and store the header number in any header to obtain the first codebook.

[0064] Optionally, when the scenario information acquisition unit is used to obtain the scenario information set and the probability corresponding to any scenario information in the scenario information set, it specifically:

[0065] Obtain the probability corresponding to any first scenario information in the scenario information set, where the first scenario information is the scenario information determined according to the dimension information;

[0066] Merge the first scenario information corresponding to the first probability and the first scenario information corresponding to the second probability in ascending order of the probability corresponding to any first scenario information to obtain the second scenario information, and add the second scenario information to the scenario information set;

[0067] Obtain the third probability corresponding to the second scenario information;

[0068] Repeat the process of obtaining the third probability corresponding to the second scenario information until all scenario information in the scenario information set is merged.

[0069] To achieve the above object, an embodiment of the third aspect of the present disclosure provides an electronic device, including: a processor, and a memory communicatively connected to the processor;

[0070] The memory stores computer execution instructions;

[0071] To achieve the above object, an embodiment of the fourth aspect of the present disclosure provides a chip, including: a processor and an interface; the processor is used to read instructions to execute the method according to any one of the first aspect described above.

[0072] To achieve the above object, an embodiment of the fifth aspect of the present disclosure provides a computer-readable storage medium, characterized in that computer-executable instructions are stored in the computer-readable storage medium, and when the computer-executable instructions are executed by a processor, they are used to implement the method according to any one of the above first aspect.

[0073] To achieve the above object, an embodiment of the sixth aspect of the present disclosure provides a computer program product, including a computer program, and when the computer program is executed by a processor, it implements the method according to any one of the above first aspect.

[0074] The method for determining scenario information, apparatus, electronic device, and storage medium provided by the present disclosure obtains a target codeword; performs a first decoding on the target codeword according to a first codebook to obtain a keyword corresponding to the target codeword; and performs a second decoding on the target codeword according to a second codebook and the keyword to obtain scenario information corresponding to the target codeword, which solves the problem that a large amount of resources are occupied when searching for scenarios according to a hash value Hash and the efficiency of determining scenario information is low. Since the scenario information can be directly determined by the first codebook and the second codebook, the resources required for storing a large amount of communication scenario information when searching using the hash value Hash are reduced, and the first codebook can reduce the conflict situation during scenario determination, which can reduce the duration of determining scenario information and improve the efficiency and accuracy of determining scenario information.

[0075] Additional aspects and advantages of the present disclosure will be given in part in the following description, become apparent in part from the following description, or be understood through the practice of the present disclosure. Description of the Drawings

[0076] The above and / or additional aspects and advantages of the present disclosure will become apparent and be readily understood from the following description of the embodiments in conjunction with the drawings, where:

[0077] Figure 1 is a background schematic diagram of a method for determining scenario information provided by an embodiment of the present disclosure;

[0078] Figure 2 is a flowchart of a method for determining scenario information provided by an embodiment of the present disclosure;

[0079] Figure 3 is a flowchart of a method for determining scenario information provided by an embodiment of the present disclosure;

[0080] Figure 4 is a flowchart of a method for determining scenario information provided by an embodiment of the present disclosure;

[0081] Figure 5 is an exemplary schematic diagram of an internal table provided by an embodiment of the present disclosure;

[0082] Figure 6 An example schematic diagram of an appearance provided by an embodiment of the present disclosure;

[0083] Figure 7 An example schematic diagram of a method for determining scene information provided by an embodiment of the present disclosure;

[0084] Figure 8 A structural schematic diagram of a device for determining scene information provided by an embodiment of the present disclosure;

[0085] Figure 9 A schematic block diagram of an electronic device provided by an embodiment of the present disclosure;

[0086] Figure 10 A block diagram of a chip provided by an embodiment of the present disclosure. Detailed implementation manners

[0087] The embodiments of the present disclosure will be described in detail below. Examples of the embodiments are shown in the accompanying drawings, where the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to explain the present disclosure and should not be construed as a limitation of the present disclosure.

[0088] With the increasing development of communication technologies and the complexity of wireless broadband communication, the types such as mapped subcarrier spacing, number of antennas, number of carriers, and broadband bandwidth in communication technologies are also more diverse, making the combination of multiple scenarios more complex. Therefore, improving the convenience and accuracy of scene search has become the focus of user attention.

[0089] In some embodiments, Figure 1 A background schematic diagram of a method for determining scene information provided by an embodiment of the present disclosure. As Figure 1As shown, for example, lookup can be performed based on the hash value Hash. For example, the stored information can be subjected to a Hash calculation, and the corresponding table entry can be found in the Hash table according to the operation result. The operation result of the stored information can be stored in this table entry, and a pointer to this table can be set in the Hash table. Specifically, for example, it can include: Step 101, perform a hash operation on the stored information, and use the result of the operation to difference the linked list head; Step 102, determine whether the linked list head is empty; Step 103, if the linked list head is empty, store the operation result of the stored information in the linked list head; Step 104, if the linked list head is not empty, determine whether the content stored in the linked list head is the same as the operation result of the information to be stored; Step 105, if the content stored in the linked list head is the same as the operation result of the information to be stored, no processing is performed on the operation result of the stored information; Step 106, if the content stored in the linked list head is not the same as the operation result of the information to be stored, determine whether the linked list head has a pointer to the next address; Step 107, if the linked list head has a pointer to the next address, find the next table entry, determine whether the content in the table entry is the same as the operation result of the stored information, and if the content in the table entry is the same as the operation result of the stored information, go to Step 105; Step 108, determine whether there is a pointer in this table entry; Step 109, if there is a pointer in this table entry, continue to search until there is no stored information in the found table entry and there is no pointer, apply for a free address to store the operation result of the information, and set the pointer; Step 110, if there is no pointer in this table entry, directly apply for an address to store the operation result of the information, and set the pointer; Step 111, apply for an address to store the operation result of the information, and set a pointer in the linked list head. Since there is a large amount of communication scenario information, it will occupy more resources when stored in an electronic device, and frequent access to the double data rate synchronous dynamic random access memory DDR will result in waste of time and hardware resources.

[0090] The following describes the method and apparatus for determining scenario information according to embodiments of the present disclosure with reference to the accompanying drawings.

[0091] Figure 2 It is a flowchart of a method for determining scenario information provided by an embodiment of the present disclosure.

[0092] To address this problem, embodiments of the present disclosure provide a method for determining scenario information to improve the efficiency and accuracy of determining scenario information, such as Figure 2 As shown, the method for determining scenario information includes the following steps:

[0093] Step 201, obtain a target codeword;

[0094] Among them, in an embodiment of the present disclosure, the embodiments of the present disclosure can be applied to scenarios such as wireless broadband communication scenario matching and fast lookup. Among them, for example, it can be a lookup scenario involving frequent large data access to hardware storage. For example, it can be a scenario of frequent access to DDR.

[0095] Among them, in an embodiment of the present disclosure, the embodiments of the present disclosure can be applied to, for example, electronic devices, base stations, etc. Among them, the electronic device can be, for example, in wireless broadband communication, and can also be, for example, a test electronic device. The name of the electronic device is not limited. For example, the electronic device can also be called a terminal, a user equipment, etc.

[0096] Optionally, in an embodiment of the present disclosure, the embodiments of the present disclosure can be used, for example, in a search scenario for frequent large data access to hardware storage.

[0097] Optionally, a code word can be, for example, an encoded signal. The target code word of the present disclosure can be, for example, a code word for which the corresponding scenario is to be determined. The target code word does not specifically refer to a certain fixed code word. For example, when the dimension information corresponding to the target code word changes, the target code word can also change accordingly. For example, when the time point at which the target code word is received changes, the target code word can also change accordingly.

[0098] Optionally, the target code word can be obtained, for example.

[0099] Step 202: Perform a first decoding on the target code word according to the first codebook to obtain the keyword corresponding to the target code word;

[0100] Optionally, in an embodiment of the present disclosure, the first codebook can be, for example, the codebook used for the first decoding. The "first" in the first codebook is only used to distinguish it from other codebooks and does not specifically refer to a certain fixed codebook. The first codebook can be, for example, an outer codebook. Among them, the outer surface can be, for example, relative to the inner surface. For example, when the number of keywords corresponding to the first codebook changes, the first codebook can also change accordingly.

[0101] In some embodiments, the first decoding can be, for example, a process of performing the first decoding on the target codebook, and the first decoding can be, for example, to obtain the keyword.

[0102] Optionally, in an embodiment of the present disclosure, the keyword can be, for example, the keyword corresponding to the target codebook, where different keywords can correspond to different scenario information.

[0103] In some embodiments, when the target codebook is obtained, the target code word can be, for example, decoded for the first time according to the first codebook to obtain the keyword corresponding to the target code word.

[0104] Step 203: Perform a second decoding on the target code word according to the second codebook and the keyword to obtain the scenario information corresponding to the target code word.

[0105] Optionally, in an embodiment of the present disclosure, the second codebook may be, for example, the codebook used for the second decoding of the target codeword. The second codebook may use the inner table as the codebook for example. The "second" in the second codebook is only used to distinguish it from other codebooks.

[0106] In some embodiments, the second decoding may be, for example, the process of the second decoding of the target codebook, specifically, it may be the process of searching for scene information according to the second codebook and keywords. The "second" in the second decoding is used to distinguish it from the first decoding.

[0107] Optionally, in an embodiment of the present disclosure, the scene information may refer to the scene corresponding to the target codeword. Among them, different codewords may correspond to different scene information. The scene information may include scene information of at least one dimension for example. The at least one dimension includes but is not limited to carrier spacing, number of carriers, bandwidth, antenna, and modulation method. Among them, each dimension may include at least one parameter for example. The embodiments of the present disclosure do not limit the dimension, nor do they limit the number of parameters corresponding to a certain dimension.

[0108] The scene information determination method provided by the present disclosure solves the problems that a large amount of resources are occupied when searching for scenes according to the hash value Hash and the efficiency of determining scene information is low by obtaining the target codeword; performing the first decoding on the target codeword according to the first codebook to obtain the keyword corresponding to the target codeword; performing the second decoding on the target codeword according to the second codebook and the keyword to obtain the scene information corresponding to the target codeword. Since the scene information can be directly determined by the first codebook and the second codebook, the resources required for storing a large amount of communication scene information when searching using the hash value Hash are reduced, and the first codebook can reduce the conflict situation during scene determination, which can reduce the scene information determination duration and improve the determination efficiency and accuracy of scene information.

[0109] This embodiment provides another scene information determination method. Figure 3 It is a flowchart of a scene information determination method provided by an embodiment of the present disclosure.

[0110] As Figure 3 shown, the scene information determination method may include the following steps:

[0111] Step 301, obtain the target codeword;

[0112] The specific process is as described above and will not be elaborated here.

[0113] In some embodiments, Figure 4 It is a flowchart of a scene information determination method provided by an embodiment of the present disclosure. As Figure 4As shown, the solution includes an initial rule generation process and a service search process. Among them, the initial rule generation may include, for example, encoding multiple pieces of information to generate a first codebook and a second codebook, specifically including:

[0114] Optionally, the method further includes:

[0115] Obtain a set of scenario information and the probability corresponding to any piece of scenario information in the set of scenario information;

[0116] Perform a first encoding based on the set of scenario information and the probability corresponding to any piece of scenario information to generate a second codebook;

[0117] Use the encoded numbers in the second codebook as keywords to perform a second encoding to generate a first codebook. Therefore, the first codebook and the second codebook can be generated in advance, which can reduce the search time for scenario information and improve the determination efficiency of scenario information.

[0118] In some embodiments, the set of scenario information may refer to a collective formed by at least one piece of scenario information. The set of scenario information does not specifically refer to a certain fixed set. For example, when the number of scenario information corresponding to the set of scenario information changes, the set of scenario information can also change accordingly. For example, when the dimension corresponding to a piece of scenario information in the set of scenario information changes, the set of scenario information can also change accordingly.

[0119] Optionally, the scenario information may correspond to different dimensions. Tables 1 to 5 may be examples for illustrating the dimensions, and the embodiments of the present disclosure do not limit this. Among them, the explanations of each term are as follows: Quadrature Phase Shift Keying (QPSK); Quadrature Amplitude Modulation (QAM).

[0120] Table 1

[0121] Carrier spacing 15K 30K 60K 120K

[0122] Table 2

[0123] Number of carriers 1 2 3 4

[0124] Table 3

[0125] Bandwidth 1.4M 3M 5M 10M 15M 30M 40M 50M 60M 80M 100M

[0126] Table 4

[0127] Antenna 1 2 4 8 16 64

[0128] Table 5

[0129] Modulation method QPSK 16QAM 32QAM 64QAM 256QAM

[0130] In some embodiments, obtaining a set of scene information and the probability corresponding to any scene information in the set of scene information includes:

[0131] Obtaining the probability corresponding to any first scene information in the set of scene information, where the first scene information is the scene information determined according to the dimension information;

[0132] According to the order of the probabilities corresponding to any first scene information from small to large, merge the first scene information corresponding to the first probability and the first scene information corresponding to the second probability to obtain the second scene information, and add the second scene information to the set of scene information;

[0133] Obtaining the third probability corresponding to the second scene information;

[0134] Repeat the process of obtaining the third probability corresponding to the second scene information until all the scene information in the set of scene information is completed. Therefore, the accuracy of obtaining the set of scene information can be improved, and the applicable range of the scene information determination method can be improved.

[0135] Optionally, the set of scene information can be as shown in Table 6, for example:

[0136] Table 6

[0137] Scenario index 1 2 3 …… 20000 Statistical probability P1 P2 P3 P20000

[0138] For example, two scene information with the smallest probabilities in the set of scene information can be obtained. These two scene information can be 0 and 1 respectively (the scene information with the smallest probability can be 0, and the scene information with the second smallest probability can be 1), and the two probabilities are accumulated and added to the set of scene information, and all the scene information in the set of scene information is sorted according to the order of the probabilities from small to large. Before obtaining the two scene information with the smallest probabilities in the set of scene information, for example, it may further include determining the scene information with the most dimensions in the set of scene information. Based on the dimension of this scene information, the remaining scene information is dimensionally complemented, and the missing scene information can be supplemented with 0, for example. The embodiments of the present disclosure do not limit this. The second codebook in the embodiments of the present disclosure can adopt the minimum information entropy decision criterion, which can save the storage space of the electronic device.

[0139] In some embodiments, using the encoded numbers in the second codebook as keywords for secondary encoding to generate the first codebook includes:

[0140] Obtaining the first quantity of the header corresponding to the first codebook, where the third quantity is the same as the second quantity corresponding to at least one scene information, and the third quantity is the cumulative sum of the first quantity and the linked list length corresponding to any header;

[0141] Determine a first quantity of cyclic redundancy check (CRC) code generation polynomials;

[0142] Using the CRC code generation polynomial corresponding to any header, perform binomial calculation on the keyword corresponding to any header to generate the header number corresponding to any header, and store the header number in any header to obtain the first codebook. Therefore, the first codebook can be generated according to the number of headers and the CRC code generation polynomial, which can improve the accuracy of obtaining the first codebook and the accuracy of determining scene information.

[0143] Optionally, Figure 5 This is an example schematic diagram of an inner table provided by an embodiment of the present disclosure. As Figure 5 shown, the second codebook is, for example, an inner table as the codebook, and the data structure of the inner table can be, for example, a binary tree structure. Figure 5 For example, it can represent partial scene information, and this figure can be changed accordingly according to the actual scene information.

[0144] Optionally, for the sibling nodes of this binary tree, the probability of the left node is always less than or equal to that of the right node. The small probability growth is represented by 0, and the large probability growth is represented by 1. The cumulative probability of the final parent node is 1. Encode the Key value according to the above rules.

[0145] Optionally, the first codebook can be, for example, an outer table as the codebook. For example, the encoded numbers of the inner table can be used as the Key value for secondary encoding to generate the outer table. Among them, the number of headers of the outer table is N1, and the length of each header's respective linked list is N2, where the cumulative number of N1 N2s is consistent with the number of scenes. For example, the Key value can be divided into N1 groups, each group with a length of N2. Select N1 CRC generation polynomials. The header number is the result of binomial calculation for different Key values in each group, and the calculation result is stored in the header.

[0146] Step 302, perform cyclic redundancy check (CRC) on the target codeword using the check method corresponding to any header in the first codebook to obtain the target header that meets the check requirements;

[0147] In some embodiments, different headers can correspond to different check methods. The check method can be, for example, a generation polynomial, and the generation polynomial can be, for example, a CRC generation polynomial. Among them, Figure 6 This is an example schematic diagram of an outer table provided by an embodiment of the present disclosure. Among them, each header in the outer table can be, for example, a single linked list. Figure 6 The shown constraint relationship can include Table(Key1)=Table(Key2); Table(Key3)=Table(Key4)=Table(Key5)=Table(Key6); Table(Key7).

[0148] Optionally, when the target codeword is obtained, CRC check can be performed according to the check method corresponding to any header to find the header that meets the check requirements. Among them, the check requirements can be, for example, the requirements for obtaining the target header, and this check requirement does not specifically refer to a certain fixed requirement. For example, when a modification instruction for this check requirement is received, the check requirement can be modified.

[0149] Step 303: Determine the keyword corresponding to the target codeword according to the element information corresponding to the target header.

[0150] In some embodiments, for example, the keyword corresponding to the target codeword can be determined according to the element information corresponding to the target header.

[0151] Optionally, determining the keyword corresponding to the target codeword according to the element information corresponding to the target header includes:

[0152] When the element information corresponding to the target header is one piece of element information, use the keyword corresponding to the element information as the keyword corresponding to the target codeword.

[0153] Optionally, determining the keyword corresponding to the target codeword according to the element information corresponding to the target header includes:

[0154] When the element information corresponding to the target header is at least two pieces of element information, sequentially access the at least two pieces of element information to determine the target element information that meets the keyword requirements among the at least two pieces of element information.

[0155] Use the keyword corresponding to the target element information as the keyword corresponding to the target codeword. Therefore, the keyword can be determined according to the number of element information corresponding to the target header, which can improve the accuracy of keyword acquisition and the accuracy of scenario information determination.

[0156] In some embodiments, for example, when the determined target header is Table(Key7), the keyword Key7 can be directly determined. For example, when the determined target header is Table(Key3) and a conflict occurs, in the linked list with the conflict, sequentially access the element information in the table until the corresponding element information is found, the conflict is resolved, the front pointer of the linked list points to the address of the subsequent table of this table, and this table is deleted. Therefore, the access duration of DDR can be reduced, the access efficiency can be improved, and the memory overhead can be reduced.

[0157] Step 304: Perform a second decoding on the target codeword according to the second codebook and the keyword to obtain the scenario information corresponding to the target codeword.

[0158] The specific process is as described above and will not be elaborated here.

[0159] Optionally, according to the second codebook and the keyword, perform a second decoding on the target codeword to obtain the scene information corresponding to the target codeword, including:

[0160] Obtain the second codebook;

[0161] Obtain the first binary information corresponding to the keyword;

[0162] According to the first binary information, search in the second codebook to obtain the second binary information corresponding to the keyword;

[0163] Decode the second binary information, which is the scene information corresponding to the target codeword. Therefore, the scene information can be determined based on the binary information, improving the accuracy of scene information determination.

[0164] Optionally, the embodiments of the present disclosure may not be limited to binary information. For example, it may also be quaternary information, or octal information, etc.

[0165] In some embodiments, Figure 7 is an example schematic diagram of a method for determining scene information provided by the embodiments of the present disclosure. As Figure 7 shown, the second codebook can be obtained, and the keyword corresponding to the target codeword can be converted into binary to obtain the first binary information. According to the first binary information, extract the information in the second codebook, and start from the root node to search along the binary tree in the extracted information. When reaching the leaf node, output the second binary information, and the second binary information can be decoded to obtain the scene information.

[0166] Optionally, when the second binary information is found, it can return to the root node so that when the next codeword is obtained, the search can be directly performed, improving the accuracy of scene information determination.

[0167] The method for determining scene information provided by the present disclosure performs a cyclic redundancy check code (CRC) check on the target codeword by adopting the check method corresponding to any header in the first codebook to obtain the target header that meets the check requirements; according to the element information corresponding to the target header, determine the keyword corresponding to the target codeword, and the keyword can be determined by generating a polynomial, which can improve the accuracy of keyword determination and the accuracy of scene information determination.

[0168] To implement the above embodiments, the present disclosure also proposes a device for determining scene information.

[0169] Figure 8 is a structural schematic diagram of a device for determining scene information provided by the embodiments of the present disclosure.

[0170] As Figure 8 shown, the device for determining scene information includes:

[0171] The codeword acquisition unit 801 is configured to acquire a target codeword;

[0172] The keyword acquisition unit 802 is configured to perform a first decoding on the target codeword according to a first codebook to acquire a keyword corresponding to the target codeword;

[0173] The scene information acquisition unit 803 is configured to perform a second decoding on the target codeword according to a second codebook and the keyword to acquire scene information corresponding to the target codeword.

[0174] Optionally, when the keyword acquisition unit 802 is configured to perform a first decoding on the target codeword according to a first codebook to acquire a keyword corresponding to the target codeword, it is specifically configured to:

[0175] Perform a cyclic redundancy check (CRC) on the target codeword by using the check method corresponding to any table header in the first codebook to acquire a target table header that meets the check requirements;

[0176] Determine the keyword corresponding to the target codeword according to the element information corresponding to the target table header.

[0177] Optionally, when the keyword acquisition unit 802 is configured to determine the keyword corresponding to the target codeword according to the element information corresponding to the target table header, it is specifically configured to:

[0178] In the case where the element information corresponding to the target table header is one piece of element information, use the keyword corresponding to the element information as the keyword corresponding to the target codeword.

[0179] Optionally, when the keyword acquisition unit 802 is configured to determine the keyword corresponding to the target codeword according to the element information corresponding to the target table header, it is specifically configured to:

[0180] In the case where the element information corresponding to the target table header is at least two pieces of element information, sequentially access the at least two pieces of element information to determine target element information that meets the keyword requirements among the at least two pieces of element information;

[0181] Use the keyword corresponding to the target element information as the keyword corresponding to the target codeword.

[0182] Optionally, when the scene information acquisition unit 803 is configured to perform a second decoding on the target codeword according to a second codebook and the keyword to acquire scene information corresponding to the target codeword, it is specifically configured to:

[0183] Acquire the second codebook;

[0184] Acquire first binary information corresponding to the keyword;

[0185] Perform a search in the second codebook according to the first binary information to acquire second binary information corresponding to the keyword;

[0186] Decode the second binary information, which is the scene information corresponding to the target codeword.

[0187] Optionally, the scene information acquisition unit 803 is further configured to:

[0188] Obtain a set of scene information and the probability corresponding to any scene information in the set of scene information;

[0189] Perform a first encoding based on the set of scene information and the probability corresponding to any scene information to generate a second codebook;

[0190] Use the encoded numbers in the second codebook as keywords to perform a second encoding to generate a first codebook.

[0191] Optionally, when the scene information acquisition unit 803 uses the encoded numbers in the second codebook as keywords to perform a second encoding to generate a first codebook, it is specifically configured to:

[0192] Obtain the first quantity of the header corresponding to the first codebook. Among them, the third quantity is the same as the second quantity corresponding to at least one scene information, and the third quantity is the cumulative sum of the first quantity and the linked list length corresponding to any header;

[0193] Determine the cyclic redundancy check code generation polynomial of the first quantity;

[0194] Use the cyclic redundancy check code generation polynomial corresponding to any header to perform a binomial calculation on the keyword corresponding to any header to generate the header number corresponding to any header, and store the header number in any header to obtain the first codebook.

[0195] Optionally, when the scene information acquisition unit 803 is used to obtain a set of scene information and the probability corresponding to any scene information in the set of scene information, it is specifically configured to:

[0196] Obtain the probability corresponding to any first scene information in the set of scene information, where the first scene information is the scene information determined according to the dimension information;

[0197] Merge the first scene information corresponding to the first probability and the first scene information corresponding to the second probability in ascending order of the probability corresponding to any first scene information to obtain a second scene information, and add the second scene information to the set of scene information;

[0198] Obtain the third probability corresponding to the second scene information;

[0199] Repeat the process of obtaining the third probability corresponding to the second scene information until all the scene information in the set of scene information is merged.

[0200] The scene information determination device provided by the present disclosure includes a codeword acquisition unit configured to acquire a target codeword, a keyword acquisition unit configured to perform a first decoding on the target codeword according to a first codebook to acquire a keyword corresponding to the target codeword, and a scene information acquisition unit configured to perform a second decoding on the target codeword according to a second codebook and the keyword to acquire scene information corresponding to the target codeword. This solves the problems of high resource consumption and low efficiency in determining scene information when searching for scenes based on a hash value (Hash). Since the scene information can be directly determined through the first codebook and the second codebook, the resources required for storing a large amount of communication scene information during the search using the hash value (Hash) can be reduced. Moreover, using the first codebook can reduce the conflicts during scene determination, thereby reducing the scene information determination duration and improving the efficiency and accuracy of scene information determination.

[0201] Figure 9 FIG. shows a schematic block diagram of an exemplary electronic device 900 that can be used to implement the embodiments of the present disclosure. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processors, cellular phones, smart phones, wearable electronic devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely exemplary and are not intended to limit the implementation of the present disclosure described and / or claimed herein.

[0202] As Figure 9 shown, the electronic device 900 includes a computing unit 901 that can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 902 or a computer program loaded from a storage unit 908 into a random access memory (RAM) 903. In the RAM 903, various programs and data required for the operation of the electronic device 900 can also be stored. The computing unit 901, the ROM 902, and the RAM 903 are connected to each other through a bus 904. An input / output (I / O) interface 905 is also connected to the bus 904.

[0203] A plurality of components in the electronic device 900 are connected to the I / O interface 905, including: an input unit 906, such as a keyboard, a mouse, etc.; an output unit 907, such as various types of displays, speakers, etc.; a storage unit 908, such as a magnetic disk, an optical disc, etc.; and a communication unit 909, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 909 allows the electronic device 900 to exchange information / data with other electronic devices through a computer network such as the Internet and / or various telecommunication networks.

[0204] The computing unit 901 can be various general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of the computing unit 901 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 901 executes the various methods and processes described above, such as the scene information determination method. For example, in some embodiments, the scene information determination method can be implemented as a computer software program tangibly embodied in a machine-readable medium, such as the storage unit 908. In some embodiments, part or all of the computer program can be loaded and / or installed onto the electronic device 900 via the ROM 902 and / or the communication unit 909. When the computer program is loaded into the RAM 903 and executed by the computing unit 901, one or more steps of the scene information determination method described above can be executed. Alternatively, in other embodiments, the computing unit 901 can be configured to execute the scene information determination method in any other suitable manner (e.g., by means of firmware).

[0205] Please refer to Figure 10 is a block diagram of a chip shown according to an exemplary embodiment. As Figure 10 shown, the chip 1000 includes a processor 1001 and an interface 1002. Optionally, a memory 1003 may also be included. Among them, the number of processors 1001 can be one or more, and the number of interfaces 1002 can be multiple.

[0206] To implement the above embodiments, the present disclosure also proposes a computer-readable storage medium storing computer-executable instructions, which are used to implement the methods provided in the foregoing embodiments when executed by a processor.

[0207] To implement the above embodiments, the present disclosure also proposes a computer program product including a computer program, which implements the methods provided in the foregoing embodiments when executed by a processor.

[0208] The collection, storage, use, processing, transmission, provision, and disclosure of the user's personal information involved in the present disclosure all comply with the provisions of relevant laws and regulations and do not violate public order and good customs.

[0209] It should be noted that personal information from users should be collected for legal and reasonable purposes and not shared or sold outside of such legal uses. In addition, such collection / sharing should be carried out after obtaining the informed consent of the users, including but not limited to notifying the users to read the user agreement / user notice and sign an agreement / authorization including authorizing the relevant user information before the users use the function. In addition, any necessary steps should be taken to safeguard and protect access to such personal information data and ensure that others with access to the personal information data comply with their privacy policies and procedures.

[0210] The present disclosure anticipates embodiments that may provide users with the option to block the use or access of personal information data. That is, the present disclosure anticipates providing hardware and / or software to prevent or block access to such personal information data. Once the personal information data is no longer needed, the risk can be minimized by restricting data collection and deleting the data. In addition, when applicable, personal identifiers are removed from such personal information to protect the privacy of the users.

[0211] In the foregoing descriptions of the embodiments, the descriptions with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples", etc. mean that the specific features, structures, materials, or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of the present disclosure. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials, or characteristics described can be combined in any one or more embodiments or examples in a suitable manner. In addition, without contradiction, those skilled in the art can combine and combine the different embodiments or examples described in this specification and the features of the different embodiments or examples.

[0212] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly indicating the quantity of the indicated technical features. Thus, the features defined with "first" and "second" may explicitly or implicitly include at least one of such features. In the description of the present disclosure, "a plurality" means at least two, such as two, three, etc., unless otherwise specifically defined.

[0213] Any process or method description shown in the flowchart or described in other ways herein can be understood to represent a module, segment, or part of code including one or more executable instructions for implementing a customized logical function or process, and the scope of the preferred embodiments of the present disclosure includes additional implementations, where the functions may be executed in a manner that is not shown or discussed, including in a substantially simultaneous manner according to the functions involved or in a reverse order, which should be understood by those skilled in the art to which the embodiments of the present disclosure pertain.

[0214] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as a definite sequence list of executable instructions for implementing logical functions, which can be specifically implemented in any computer-readable medium for use by an instruction execution system, apparatus, or device (such as a computer-based system, a system including a processor, or other systems that can fetch and execute instructions from the instruction execution system, apparatus, or device), or used in combination with these instruction execution systems, apparatus, or devices. For the purposes of this specification, a "computer-readable medium" can be any device that can contain, store, communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. More specific examples (non-exhaustive list) of computer-readable media include the following: an electrical connection part (electronic device) having one or more wirings, a portable computer diskette (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium can even be paper or other suitable media on which the program can be printed, since the program can be obtained electronically, for example, by optically scanning the paper or other media, followed by editing, interpretation, or otherwise processing as appropriate, and then storing it in a computer memory.

[0215] It should be understood that various parts of the present disclosure can be implemented by hardware, software, firmware, or a combination thereof. In the above embodiments, multiple steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or a combination of the following techniques well known in the art can be used: discrete logic circuits having logic gate circuits for implementing logical functions on data signals, application-specific integrated circuits having appropriate combinational logic gate circuits, programmable gate arrays (PGAs), field programmable gate arrays (FPGAs), etc.

[0216] Those of ordinary skill in the art of this technology can understand that all or part of the steps carried by the methods of the above embodiments can be completed by instructing relevant hardware through a program, and the program can be stored in a computer-readable storage medium. When the program is executed, it includes one or a combination of the steps of the method embodiments.

[0217] In addition, in various embodiments of the present disclosure, each functional unit may be integrated into a processing module, or each unit may exist physically alone, or two or more units may be integrated into one module. The above-mentioned integrated module may be implemented in the form of hardware or in the form of a software functional module. When the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it may also be stored in a computer-readable storage medium.

[0218] The above-mentioned storage medium may be a read-only memory, a magnetic disk, an optical disc, etc. Although the embodiments of the present disclosure have been shown and described above, it can be understood that the above embodiments are exemplary and should not be construed as limiting the present disclosure. Those of ordinary skill in the art can make changes, modifications, substitutions, and variations to the above embodiments within the scope of the present disclosure.

Claims

1. A method for determining scene information, characterized in that Including: Obtain a target codeword; Perform a first decoding on the target codeword according to a first codebook to obtain a keyword corresponding to the target codeword; Perform a second decoding on the target codeword according to a second codebook and the keyword to obtain scene information corresponding to the target codeword.

2. The method according to claim 1, characterized in that, The performing a first decoding on the target codeword according to the first codebook to obtain a keyword corresponding to the target codeword includes: Perform a cyclic redundancy check (CRC) on the target codeword using the check method corresponding to any header in the first codebook to obtain a target header that meets the check requirements; Determine the keyword corresponding to the target codeword according to the element information corresponding to the target header.

3. The method according to claim 2, wherein The determining the keyword corresponding to the target codeword according to the element information corresponding to the target header includes: When the element information corresponding to the target header is one piece of element information, use the keyword corresponding to the element information as the keyword corresponding to the target codeword.

4. The method according to claim 2, wherein The determining the keyword corresponding to the target codeword according to the element information corresponding to the target header includes: When the element information corresponding to the target header is at least two pieces of element information, sequentially access the at least two pieces of element information to determine a target element information that meets the keyword requirements among the at least two pieces of element information; Use the keyword corresponding to the target element information as the keyword corresponding to the target codeword.

5. The method according to claim 1, wherein The performing a second decoding on the target codeword according to the second codebook and the keyword to obtain scene information corresponding to the target codeword includes: Obtain the second codebook; Obtain the first binary information corresponding to the keyword; Perform a search in the second codebook according to the first binary information to obtain the second binary information corresponding to the keyword; Decode the second binary information to obtain the scene information corresponding to the target codeword.

6. The method according to claim 1, wherein The method further includes: Obtain a set of scene information and the probability corresponding to any scene information in the set of scene information; Perform a first encoding according to the set of scene information and the probability corresponding to any scene information in the set to generate the second codebook; Use the encoded numbers in the second codebook as keywords to perform a second encoding to generate the first codebook.

7. The method according to claim 6, wherein The using the encoded numbers in the second codebook as keywords to perform a second encoding to generate the first codebook includes: Obtain the first quantity of the headers corresponding to the first codebook, where the third quantity is the same as the second quantity corresponding to the at least one piece of scene information, and the third quantity is the cumulative sum of the first quantity and the linked list length corresponding to any header; Determine the cyclic redundancy check code generation polynomial of the first quantity; Perform a binomial calculation on the keyword corresponding to any header using the cyclic redundancy check code generation polynomial corresponding to any header to generate the header number corresponding to any header, and store the header number in any header to obtain the first codebook.

8. The method according to claim 6, wherein The obtaining a set of scene information and the probability corresponding to any scene information in the set of scene information includes: Obtain the probability corresponding to any first scene information in the set of scene information, where the first scene information is the scene information determined according to the dimension information; Merge the first scene information corresponding to the first probability and the first scene information corresponding to the second probability in ascending order of the probability corresponding to any first scene information, obtain the second scene information, and add the second scene information to the set of scene information; Obtain the third probability corresponding to the second scene information; Repeat the process of obtaining the third probability corresponding to the second scene information until all the scene information in the set of scene information is merged.

9. A scene information determination device, characterized in that, Comprising: A codeword acquisition unit, configured to acquire a target codeword; A keyword acquisition unit, configured to perform a first decoding on the target codeword according to a first codebook to acquire the keyword corresponding to the target codeword; A scene information acquisition unit, configured to perform a second decoding on the target codeword according to a second codebook and the keyword to acquire the scene information corresponding to the target codeword.

10. An electronic device, characterized in that, Comprising: A processor, and a memory communicatively connected to the processor; The memory stores computer-executable instructions; The processor executes the computer-executable instructions stored in the memory to implement the method according to any one of claims 1-8.

11. A computer-readable storage medium, characterized in that, Computer-executable instructions are stored in the computer-readable storage medium, and when the computer-executable instructions are executed by a processor, they are used to implement the method according to any one of claims 1-8.

12. A chip, characterized in that, Comprising a processor and an interface; the processor is configured to read instructions to execute the method according to any one of claims 1-8.

13. A computer program product, characterized in that, Comprising a computer program, which when executed by a processor, implements the method according to any one of claims 1-8.

Citation Information

Patent Citations

  • Information feedback device and information feedback method

    CN103297180A

  • Wave beam searching method in millimeter wave communication

    CN104935366A

  • Method and device for transmitting indication information

    CN107113849A

  • Data processing method, device and system based on two-dimensional code

    CN109598171A

  • Method and apparatus for acquiring channel state information, terminal, electronic device, and computer-readable storage medium

    WO2023061221A1