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

Abstract

The present disclosure provides a scene information determination method and device, electronic equipment, storage medium and chip. The scene information determination method comprises: obtaining a target codeword; performing first decoding on the target codeword according to a first codebook to obtain a key corresponding to the target codeword; and performing second decoding on the target codeword according to a second codebook and the key to obtain scene information corresponding to the target codeword. The present disclosure can improve the determination efficiency and accuracy of scene information.

Description

Technical Field

[0001] This disclosure relates to the field of communication technology, and in particular to a method, apparatus, electronic device, storage medium, and chip for determining scene information. Background Technology

[0002] With the development of communication technology, wireless broadband communication applications have emerged. Wireless broadband communication can be a high-capacity, high-speed wireless transmission technology based on standard protocols. With the rapid development of the information industry and the strong demand of the information market, wireless broadband communication is developing towards broadband, and its application scope will become increasingly wide. Summary of the Invention

[0003] This disclosure aims to at least partially address one of the technical problems in the related art.

[0004] Therefore, the first objective of this disclosure is to propose a method for determining scene information in order to improve the efficiency and accuracy of scene information determination.

[0005] The second objective of this disclosure is to provide a scene information determination device.

[0006] The third objective of this disclosure is to propose an electronic device.

[0007] The fourth objective of this disclosure is to provide a computer-readable storage medium.

[0008] The fifth objective of this disclosure is to provide a computer program product.

[0009] To achieve the above objectives, a method for determining scene information is proposed in the first aspect of this disclosure, comprising:

[0010] Obtain the target codeword;

[0011] Based on the first codebook, the target codeword is decoded for the first time to obtain the keyword corresponding to the target codeword;

[0012] Based on the second codebook and the keyword, the target codeword is decoded a second time to obtain the scene information corresponding to the target codeword.

[0013] Optionally, the step of decoding the target codeword for the first time according to the first codebook to obtain the keyword corresponding to the target codeword includes:

[0014] Using the verification method corresponding to any header in the first codebook, perform cyclic redundancy check (CRC) verification on the target codeword to obtain the target header that meets the verification requirements.

[0015] Based on the element information corresponding to the target header, determine the keyword corresponding to the target codeword.

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

[0017] If the element information corresponding to the target header is a single element, the keyword corresponding to that element information shall be used as the keyword corresponding to the target codeword.

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

[0019] If the element information corresponding to the target header is at least two elements, the at least two elements are accessed sequentially to determine the target element information that meets the keyword requirements among the at least two elements.

[0020] The keyword corresponding to the target element information is used as the keyword corresponding to the target codeword.

[0021] Optionally, the step of performing a second decoding on the target codeword based on the second codebook and the keyword to obtain scene information corresponding to the target codeword includes:

[0022] Obtain the second codebook;

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

[0024] Based on the first binary information, a search is performed in the second codebook to obtain the second binary information corresponding to the keyword;

[0025] The second binary information is decoded to obtain the scene information corresponding to the target codeword.

[0026] Optionally, the method further includes:

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

[0028] The first encoding is performed based on the set of scene information and the probability corresponding to any scene information to generate the second codebook;

[0029] The encoded numbers in the second codebook are used as keywords for a second encoding to generate the first codebook.

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

[0031] Obtain the first number of the table head corresponding to the first codebook, wherein the third number is the same as the second number corresponding to the at least one scene information, and the third number is the cumulative sum of the first number and the linked list length corresponding to any table head;

[0032] Determine the first number of cyclic redundancy check code generator polynomials;

[0033] Using the cyclic redundancy check code generator polynomial corresponding to any of the table headers, perform binomial calculation on the key corresponding to any of the table headers to generate the table header number corresponding to any of the table headers, and store the table header number in any of the table headers to obtain the first codebook.

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

[0035] Obtain the probability corresponding to any first scene information in the scene information set, where the first scene information is the scene information determined based on the dimension information;

[0036] According to the order of probability from smallest to largest corresponding to any first scene information, the first scene information corresponding to the first probability and the first scene information corresponding to the second probability are merged to obtain the second scene information, and the second scene information is added to the scene information set.

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

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

[0039] To achieve the above objectives, a second aspect of this disclosure provides a scene information determination device, comprising:

[0040] The codeword acquisition unit is used to acquire the target codeword;

[0041] The keyword acquisition unit is used to perform a first decoding on the target codeword according to the first codebook to obtain the keyword corresponding to the target codeword;

[0042] The scene information acquisition unit is used to perform a second decoding on the target codeword based on the second codebook and the keyword to obtain scene information corresponding to the target codeword.

[0043] Optionally, when the keyword acquisition unit performs a first decoding of the target codeword according to the first codebook to obtain the keyword corresponding to the target codeword, it is specifically used for:

[0044] Using the verification method corresponding to any header in the first codebook, perform cyclic redundancy check (CRC) verification on the target codeword to obtain the target header that meets the verification requirements.

[0045] Based on the element information corresponding to the target header, determine the keyword corresponding to the target codeword.

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

[0047] If the element information corresponding to the target header is a single element, the keyword corresponding to that element information shall be used as the keyword corresponding to the target codeword.

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

[0049] If the element information corresponding to the target header is at least two elements, the at least two elements are accessed sequentially to determine the target element information that meets the keyword requirements among the at least two elements.

[0050] The keyword corresponding to the target element information is used as the keyword corresponding to the target codeword.

[0051] Optionally, when the scene information acquisition unit performs a second decoding on the target codeword based on the second codebook and the keyword to obtain scene 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] Based on the first binary information, a search is performed in the second codebook to obtain the second binary information corresponding to the keyword;

[0055] The second binary information is decoded to obtain the scene information corresponding to the target codeword.

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

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

[0058] The first encoding is performed based on the set of scene information and the probability corresponding to any scene information to generate the second codebook;

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

[0060] Optionally, the scene information acquisition unit is used to use the encoded numbers in the second codebook as keywords for a second encoding to generate the first codebook, specifically for:

[0061] Obtain the first number of the table head corresponding to the first codebook, wherein the third number is the same as the second number corresponding to the at least one scene information, and the third number is the cumulative sum of the first number and the linked list length corresponding to any table head;

[0062] Determine the first number of cyclic redundancy check code generator polynomials;

[0063] Using the cyclic redundancy check code generator polynomial corresponding to any of the table headers, perform binomial calculation on the key corresponding to any of the table headers to generate the table header number corresponding to any of the table headers, and store the table header number in any of the table headers to obtain the first codebook.

[0064] Optionally, the scene information acquisition unit, when acquiring the scene information set and the probability corresponding to any scene information in the scene information set, is specifically used for:

[0065] Obtain the probability corresponding to any first scene information in the scene information set, where the first scene information is the scene information determined based on the dimension information;

[0066] According to the order of probability from smallest to largest corresponding to any first scene information, the first scene information corresponding to the first probability and the first scene information corresponding to the second probability are merged to obtain the second scene information, and the second scene information is added to the scene 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 scene information until all scene information in the scene information set is merged.

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

[0070] The memory stores computer-executed instructions;

[0071] To achieve the above objectives, a fourth aspect of this disclosure provides a chip comprising: a processor and an interface; the processor being configured to read instructions to execute any of the methods described in the first aspect above.

[0072] To achieve the above objectives, a fifth aspect of this disclosure provides a computer-readable storage medium, characterized in that the computer-readable storage medium stores computer-executable instructions, which, when executed by a processor, are used to implement the method as described in any of the first aspects above.

[0073] To achieve the above objectives, a sixth aspect of this disclosure provides a computer program product including a computer program that, when executed by a processor, implements the method as described in any of the first aspects above.

[0074] The method, apparatus, electronic device, and storage medium for determining scene information disclosed herein involve obtaining a target codeword; decoding the target codeword for the first time according to a first codebook to obtain a keyword corresponding to the target codeword; and decoding the target codeword for the second time according to a second codebook and the keyword to obtain scene information corresponding to the target codeword. This method solves the problem that searching for scenes using hash values ​​results in high resource consumption and low efficiency in determining scene information. Since scene information can be determined directly using the first and second codebooks, the resources required to store a large amount of communication scene information when searching using hash values ​​are reduced. Furthermore, using the first codebook can reduce conflicts during scene determination, thereby reducing the time required to determine scene information and improving the efficiency and accuracy of scene information determination.

[0075] Additional aspects and advantages of this disclosure will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of this disclosure. Attached Figure Description

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

[0077] Figure 1 This is a background diagram illustrating a method for determining scene information provided in an embodiment of this disclosure;

[0078] Figure 2 A flowchart illustrating a method for determining scene information provided in an embodiment of this disclosure;

[0079] Figure 3 A flowchart illustrating a method for determining scene information provided in an embodiment of this disclosure;

[0080] Figure 4 A flowchart illustrating a method for determining scene information provided in an embodiment of this disclosure;

[0081] Figure 5 This is a schematic diagram illustrating an example of an internal table provided in an embodiment of this disclosure;

[0082] Figure 6 A schematic diagram illustrating an example of an external appearance provided in an embodiment of this disclosure;

[0083] Figure 7 This is an example schematic diagram illustrating a method for determining scene information provided in an embodiment of this disclosure;

[0084] Figure 8 This is a schematic diagram of the structure of a scene information determination device provided in an embodiment of the present disclosure;

[0085] Figure 9 A schematic block diagram of an electronic device provided in an embodiment of this disclosure;

[0086] Figure 10 This is a block diagram of a chip provided in an embodiment of the present disclosure. Detailed Implementation

[0087] Embodiments of this disclosure are described in detail below, examples of which are illustrated in the accompanying drawings, wherein 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 intended to explain this disclosure, and should not be construed as limiting this disclosure.

[0088] With the continuous development of communication technology and the increasing complexity of wireless broadband communication, the types of mapping subcarrier spacing, number of antennas, number of carriers, and broadband bandwidth in communication technology have become more diverse, making the combination of multiple scenarios increasingly complex. Therefore, improving the convenience and accuracy of scenario search has become the focus of users' attention.

[0089] In some embodiments, Figure 1 This is a background diagram illustrating a scene information determination method provided in an embodiment of this disclosure. Figure 1As shown, for example, a lookup can be performed based on a hash value. For instance, the stored information can be hashed, and the corresponding entry in the hash table can be found based on the hash result. The hash result can then be stored in that entry, and a pointer to that entry can be set in the hash table. Specifically, this could include: Step 101, performing a hash operation on the stored information and subtracting the linked list head from the hash result; Step 102, determining if the linked list head is empty; Step 103, determining if the linked list head is empty and storing the hash result of the stored information in the linked list head; Step 104, determining if the linked list head is not empty and checking if the content stored in the linked list head is the same as the hash result of the information to be stored; Step 105, determining if the content stored in the linked list head is the same as the hash result of the information to be stored and not processing the hash result of the stored information; Step 106, determining if the content stored in the linked list head is not the same as the hash result of the information to be stored and checking if the linked list head has a pointer to the next address; Step 10... 7. Determine if the head of the linked list has a pointer to the next address, find the next entry, and check if the content of the entry is the same as the result of the operation on the stored information. If the content of the entry is the same as the result of the operation on the stored information, proceed to step 105; Step 108. Determine if the entry contains a pointer; Step 109. If the entry contains a pointer, continue searching until the found entry does not contain stored information. If there is no pointer, request a free address to store the result of the operation on the stored information and set the pointer; Step 110. If the entry does not contain a pointer, directly request the result of the operation on the address to store the information and set the pointer; Step 111. Request the result of the operation on the address to store the information and set the pointer at the head of the linked list. Because communication scenarios involve a large amount of information, storing it in electronic devices will consume a lot of resources, and frequent access to Double Data Rate Synchronous Dynamic Random Access Memory (DDR) will lead to a waste of time and hardware resources.

[0090] The method and apparatus for determining scene information according to embodiments of this disclosure are described below with reference to the accompanying drawings.

[0091] Figure 2 This is a flowchart illustrating a method for determining scene information provided in an embodiment of this disclosure.

[0092] To address this issue, embodiments of this disclosure provide a method for determining scene information, thereby improving the efficiency and accuracy of scene information determination, such as... Figure 2 As shown, the method for determining scene information includes the following steps:

[0093] Step 201, obtain the target codeword;

[0094] In one embodiment of this disclosure, the embodiment can be applied to scenarios involving wireless broadband communication scene matching and rapid lookup. For example, this could be a lookup scenario involving frequent large data access to hardware storage, such as a scenario involving frequent DDR access.

[0095] In one embodiment of this disclosure, the embodiment can be applied to electronic devices, base stations, etc. The electronic device can be, for example, used in wireless broadband communication, or as a test electronic device. The name of the electronic device is not limited; for example, the electronic device can also be a terminal, user equipment, etc.

[0096] Optionally, in one embodiment of this disclosure, this embodiment can be used, for example, for search scenarios involving frequent access to hardware storage for large amounts of data.

[0097] Optionally, the codeword can be, for example, an encoded signal. The target codeword disclosed herein can be, for example, a codeword corresponding to a scenario to be determined. This target codeword does not specifically refer to a fixed codeword. For example, when the dimensional information corresponding to the target codeword changes, the target codeword can also change accordingly. For example, when the time point at which the target codeword is received changes, the target codeword can also change accordingly.

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

[0099] Step 202: Based on the first codebook, perform the first decoding on the target codeword to obtain the keyword corresponding to the target codeword;

[0100] Optionally, in one embodiment of this disclosure, the first codebook may 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 fixed codebook. This first codebook may, for example, be an outer codebook. The outer codebook may be relative to the inner codebook. For example, when the number of keywords corresponding to the first codebook changes, the first codebook may also change accordingly.

[0101] In some embodiments, the first decoding may be the process of decoding the target codebook for the first time, and the first decoding may be the acquisition of keywords.

[0102] Optionally, in one embodiment of this disclosure, the keywords may be, for example, keywords corresponding to the target codebook, wherein different keywords may correspond to different scenario information.

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

[0104] Step 203: Based on the second codebook and keywords, perform a second decoding of the target codeword to obtain the scene information corresponding to the target codeword.

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

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

[0107] Optionally, in one embodiment of this disclosure, the scene information may refer to the scene corresponding to the target codeword, wherein different codewords may correspond to different scene information. The scene information may include, for example, scene information of at least one dimension. At least one dimension includes, but is not limited to, carrier spacing, number of carriers, bandwidth, antenna, and modulation scheme, wherein each dimension may include, for example, at least one parameter. This disclosure does not limit the dimensions, nor does it limit the number of parameters corresponding to a particular dimension.

[0108] The scenario information determination method provided in this disclosure obtains a target codeword; decodes the target codeword for the first time according to a first codebook to obtain the keyword corresponding to the target codeword; and decodes the target codeword for the second time according to a second codebook and the keyword to obtain the scenario information corresponding to the target codeword. This solves the problem that searching for scenarios based on hash values ​​consumes a lot of resources and has low efficiency in determining scenario information. Since scenario information can be determined directly through the first and second codebooks, the resources required to store a large amount of communication scenario information when searching using hash values ​​are reduced. Furthermore, using the first codebook can reduce the possibility of conflicts during scenario determination, thereby reducing the time required to determine scenario information and improving the efficiency and accuracy of scenario information determination.

[0109] This embodiment provides another method for determining scene information. Figure 3 This is a flowchart illustrating a method for determining scene information provided in an embodiment of this disclosure.

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

[0111] Step 301, obtain the target codeword;

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

[0113] In some embodiments, Figure 4 This is a flowchart illustrating a method for determining scene information provided in an embodiment of this disclosure. Figure 4As shown, the scheme includes an initial rule generation process and a business lookup process. The initial rule generation process 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 the set of scene information and the probability corresponding to any scene information in the set of scene information;

[0116] The first encoding is performed based on the set of scene information and the probability corresponding to any scene information, and the second codebook is generated.

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

[0118] In some embodiments, the scene information set may refer to a collection of at least one scene information. This scene information set does not specifically refer to a fixed set. For example, when the number of scene information items in the scene information set changes, the scene information set may also change accordingly. For example, when the dimension corresponding to a certain scene information item in the scene information set changes, the scene information set may also change accordingly.

[0119] Optionally, the scene information may correspond to different dimensions, and Tables 1 to 5 may be examples illustrating these dimensions, which are not limited in this embodiment. The terms are explained 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 the scene information set and the probability corresponding to any scene information in the scene information set includes:

[0131] Obtain the probability corresponding to any first scene information in the scene information set, where the first scene information is the scene information determined based on the dimension information;

[0132] According to the order of probability from smallest to largest for any first scene information, the first scene information corresponding to the first probability and the first scene information corresponding to the second probability are merged to obtain the second scene information, and the second scene information is added to the scene information set.

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

[0134] The third probability process corresponding to the acquisition of the second scene information is repeated until all scene information in the scene information set is merged. Therefore, the accuracy of scene information set acquisition can be improved, and the applicability of the scene information determination method can be expanded.

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

[0136] Table 6

[0137] Statistical probability P1 P2 P3 P20000

[0138] For example, the two scene information pieces with the lowest probability in the scene information set can be obtained. These two scene information pieces can have decibel values ​​of 0 and 1 (the scene information with the lowest probability can be 0, and the scene information with the second-to-last probability can be 1). The two probabilities are accumulated and added to the scene information set. All scene information in the scene information set is then sorted in ascending order of probability. Before obtaining the two scene information pieces with the lowest probability in the scene information set, the set can be further divided into two parts. The scene information with the most dimensions can be identified, and the remaining scene information can be padded with dimensions based on the dimensions of this scene information. Missing scene information can be filled in with 0, for example. This embodiment of the present disclosure does not limit this. The second codebook of this embodiment of the present disclosure can adopt the minimum information entropy decision criterion, which can save storage space of electronic devices.

[0139] In some embodiments, the encoded numbers in the second codebook are used as keywords for a second encoding to generate the first codebook, including:

[0140] Obtain the first number of the head corresponding to the first codebook, wherein the third number is the same as the second number corresponding to at least one scene information, and the third number is the cumulative sum of the first number and the linked list length corresponding to any head;

[0141] Determine the first number of cyclic redundancy check (CRC) code generator polynomials;

[0142] By using the cyclic redundancy check (CRC) generator polynomial corresponding to any table header, a binomial calculation is performed on the key corresponding to any table header to generate a table header number. This table header number is then stored in any table header to obtain the first codebook. Therefore, the first codebook can be generated based on the number of table headers and the CRC generator polynomial, which can improve the accuracy of obtaining the first codebook and the accuracy of determining scene information.

[0143] Optional, Figure 5 This is an example schematic diagram of an internal table provided in an embodiment of the present disclosure, such as... Figure 5 As shown, the second codebook uses an internal table as its codebook, and the data structure of the internal table can be, for example, a binary tree structure. Figure 5 For example, it can represent partial scene information, and the diagram can be modified accordingly based on the actual scene information.

[0144] Optionally, in this binary tree, the probability of a sibling node to the left can always be less than or equal to that to the right. A small probability increase is represented by 0, and a large probability increase by 1. The final cumulative probability of the parent node is 1. The Key value is then encoded according to the above rules.

[0145] Optionally, the first codebook can be based on an outer table. For example, the encoded numbers of the inner table can be used as the key values, encoded twice, and the outer table generated. The outer table has N1 headers, and each header has a linked list of length N2, where the sum of N1 N2 elements matches the number of scenarios. For example, the key values ​​can be divided into N1 groups, each group of length N2. N1 CRC generator polynomials can be selected, and the header number is determined by performing a binomial calculation on each group of different key values, with the result stored in the header.

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

[0147] In some embodiments, different headers may correspond to different verification methods. This verification method may be, for example, a generator polynomial, such as a CRC generator polynomial. Figure 6 This is an example schematic diagram of an external table provided in an embodiment of the present disclosure, wherein each table header in the external table may be, for example, a single-item linked list. Figure 6 The constraints shown may include, for example, Table(Key1) = Table(Key2); Table(Key3) = Table(Key4) = Table(Key5) = Table(Key6); Table(Key7).

[0148] Optionally, upon obtaining the target codeword, a CRC check can be performed based on the check method corresponding to any header to find the header that meets the check requirements. The check requirements can be, for example, the requirements for obtaining the target header. These requirements are not specifically defined by a single fixed requirement; for instance, when a modification instruction for a specific check requirement is received, that requirement can be modified.

[0149] Step 303: Determine the keyword corresponding to the target codeword based on the element information corresponding to the target header;

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

[0151] Optionally, based on the element information corresponding to the target table header, determine the keyword corresponding to the target codeword, including:

[0152] If the element information corresponding to the target header is a single element, the keyword corresponding to the element information will be used as the keyword corresponding to the target codeword.

[0153] Optionally, based on the element information corresponding to the target header, determine the keyword corresponding to the target codeword, including:

[0154] If the element information corresponding to the target table header is at least two elements, access the at least two elements in sequence and determine the target element information that meets the keyword requirements among the at least two elements.

[0155] The keywords corresponding to the target element information are used as the keywords corresponding to the target codewords. Therefore, the keywords can be determined based on the number of elements corresponding to the target table header, which can improve the accuracy of keyword acquisition and the accuracy of scene information determination.

[0156] In some implementations, for example, when the determined target table header is Table(Key7), the key Key7 can be directly determined. For instance, when the determined target table header is Table(Key3), a conflict occurs. The elements in the conflicting linked list are accessed sequentially until the corresponding element is found. The conflict is resolved, the linked list pointer is moved to the address of the next element in the list, and the list is deleted. Therefore, DDR access time can be reduced, access efficiency improved, and memory overhead reduced.

[0157] Step 304: Based on the second codebook and the keyword, perform a second decoding of the target codeword to obtain the scene information corresponding to the target codeword.

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

[0159] Optionally, based on the second codebook and the keyword, the target codeword is decoded a second time to obtain the scene information corresponding to the target codeword, including:

[0160] Obtain the second codebook;

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

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

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

[0164] Optionally, the embodiments disclosed herein may not be limited to binary information; for example, they may also be quaternary information, octal information, etc.

[0165] In some embodiments, Figure 7 This is an example schematic diagram illustrating a method for determining scene information provided in an embodiment of this disclosure, such as... Figure 7 As shown, a second codebook can be obtained. The keyword corresponding to the target codeword can be converted into binary to obtain the first binary information. Based on the first binary information, information in the second codebook is extracted, and the binary tree is searched from the extracted information starting from the root node. When the second binary information is reached at a leaf node, it is output. This second binary information can be decoded to obtain the scene information.

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

[0167] The scene information determination method provided in this disclosure performs cyclic redundancy check (CRC) verification on the target codeword by adopting the verification method corresponding to any table header in the first codebook, and obtains the target table header that meets the verification requirements; based on the element information corresponding to the target table header, the keyword corresponding to the target codeword is determined, and a polynomial can be generated to determine the keyword, which can improve the accuracy of keyword determination and the accuracy of scene information determination.

[0168] To achieve the above embodiments, this disclosure also proposes a scene information determination device.

[0169] Figure 8 This is a schematic diagram of the structure of a scene information determination device provided in an embodiment of the present disclosure.

[0170] like Figure 8 As shown, the scene information determination device includes:

[0171] The codeword acquisition unit 801 is used to acquire the target codeword;

[0172] Keyword acquisition unit 802 is used to perform the first decoding of the target codeword according to the first codebook to obtain the keyword corresponding to the target codeword;

[0173] The scene information acquisition unit 803 is used to perform a second decoding of the target codeword based on the second codebook and the keyword to obtain the scene information corresponding to the target codeword.

[0174] Optionally, the keyword acquisition unit 802 is used to perform the first decoding of the target codeword according to the first codebook to obtain the keyword corresponding to the target codeword. Specifically, it is used for:

[0175] Using the verification method corresponding to any head in the first codebook, perform cyclic redundancy check (CRC) verification on the target codeword to obtain the target head that meets the verification requirements.

[0176] Based on the element information corresponding to the target header, determine the keyword corresponding to the target codeword.

[0177] Optionally, the keyword acquisition unit 802 is used to determine the keyword corresponding to the target codeword based on the element information corresponding to the target table header, specifically for:

[0178] If the element information corresponding to the target header is a single element, the keyword corresponding to the element information will be used as the keyword corresponding to the target codeword.

[0179] Optionally, the keyword acquisition unit 802 is used to determine the keyword corresponding to the target codeword based on the element information corresponding to the target table header, specifically for:

[0180] If the element information corresponding to the target table header is at least two elements, access the at least two elements in sequence and determine the target element information that meets the keyword requirements among the at least two elements.

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

[0182] Optionally, the scene information acquisition unit 803 is used to perform a second decoding of the target codeword based on the second codebook and the keyword to obtain the scene information corresponding to the target codeword. Specifically, it is used for:

[0183] Obtain the second codebook;

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

[0185] Based on the first binary information, search in the second codebook to obtain the second binary information corresponding to the keyword;

[0186] Decode the second binary information to obtain the scene information corresponding to the target codeword.

[0187] Optionally, the scene information acquisition unit 803 is also used for:

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

[0189] The first encoding is performed based on the set of scene information and the probability corresponding to any scene information, and the second codebook is generated.

[0190] The encoded numbers in the second codebook are used as keywords for a second encoding to generate the first codebook.

[0191] Optionally, the scene information acquisition unit 803 is used to use the encoded numbers in the second codebook as keywords for a second encoding. Specifically, when generating the first codebook, it is used for:

[0192] Obtain the first number of the table head corresponding to the first codebook. The third number is the same as the second number corresponding to at least one scene information. The third number is the cumulative sum of the first number and the linked list length corresponding to any table head.

[0193] Determine the first number of cyclic redundancy check (CRC) code generator polynomials;

[0194] Using the cyclic redundancy check code generator polynomial corresponding to any table header, perform binomial calculation on the key corresponding to any table header to generate the table header number corresponding to any table header, and store the table header number into any table header to obtain the first codebook.

[0195] Optionally, the scene information acquisition unit 803, when acquiring the scene information set and the probability corresponding to any scene information in the scene information set, is specifically used for:

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

[0197] According to the order of probability from smallest to largest for any first scene information, the first scene information corresponding to the first probability and the first scene information corresponding to the second probability are merged to obtain the second scene information, and the second scene information is added to the scene information set.

[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 scene information in the scene information set is merged.

[0200] The scene information determination device disclosed herein comprises a codeword acquisition unit for acquiring a target codeword; a keyword acquisition unit for performing a first decoding of the target codeword based on a first codebook to acquire the keyword corresponding to the target codeword; and a scene information acquisition unit for performing a second decoding of the target codeword based on a second codebook and the keyword to acquire the scene information corresponding to the target codeword. This device solves the problem that searching for scenes using hash values ​​results in high resource consumption and low scene information determination efficiency. Since scene information can be determined directly using the first and second codebooks, the resources required to store a large amount of communication scene information when searching using hash values ​​are reduced. Furthermore, using the first codebook can reduce conflicts during scene determination, thereby reducing the scene information determination time and improving the efficiency and accuracy of scene information determination.

[0201] Figure 9 A schematic block diagram of an example electronic device 900 that can be used to implement embodiments of the present disclosure is shown. 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 may also represent various forms of mobile devices, such as personal digital processors, cellular phones, smartphones, wearable electronic devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely illustrative and are not intended to limit the implementation of the present disclosure described and / or claimed herein.

[0202] like Figure 9 As shown, the electronic device 900 includes a computing unit 901, which 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 into a random access memory (RAM) 903 from a storage unit 908. The RAM 903 may also store various programs and data required for the operation of the electronic device 900. The computing unit 901, ROM 902, and RAM 903 are interconnected via a bus 904. An input / output (I / O) interface 905 is also connected to the bus 904.

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

[0204] The computing unit 901 can be a variety of 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 special-purpose 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 performs the various methods and processes described above, such as the scene information determination method. For example, in some embodiments, the scene information determination method may be implemented as a computer software program tangibly contained in a machine-readable medium, such as storage unit 908. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 900 via ROM 902 and / or communication unit 909. When the computer program is loaded into RAM 903 and executed by the computing unit 901, one or more steps of the scene information determination method described above may be performed. Alternatively, in other embodiments, the computing unit 901 may be configured to perform the scene information determination method by any other suitable means (e.g., by means of firmware).

[0205] Please see Figure 10 This is a block diagram illustrating a chip according to an exemplary embodiment. Figure 10 The chip 1000 shown includes a processor 1001 and an interface 1002. Optionally, it may also include a memory 1003. 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, this disclosure also proposes a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, are used to implement the methods provided in the foregoing embodiments.

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

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

[0209] It should be noted that personal information collected from users should be used for legitimate and reasonable purposes and should not be shared or sold outside of these legitimate uses. Furthermore, such collection / sharing should only be conducted after receiving the user's informed consent, including but not limited to notifying the user to read the user agreement / user notice and sign an agreement / authorization that includes authorization of relevant user information before the user uses the function. In addition, any necessary steps must be taken to protect and safeguard access to such personal information data and ensure that others with access to personal information data comply with their privacy policies and procedures.

[0210] This disclosure is intended to provide implementation schemes for users to selectively prevent the use or access to their personal information data. Specifically, this disclosure is intended to provide hardware and / or software to prevent or block access to such personal information data. Once personal information data is no longer needed, risks can be minimized by restricting data collection and deleting data. Furthermore, where applicable, such personal information is de-identified to protect user privacy.

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

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

[0213] Any process or method description in the flowchart or otherwise herein can be understood as representing a module, segment, or portion of code comprising one or more executable instructions for implementing custom logic functions or processes, and the scope of preferred embodiments of this disclosure includes additional implementations in which functions may be performed not in the order shown or discussed, including substantially simultaneously or in reverse order depending on the functions involved, as will be understood by those skilled in the art to which embodiments of this disclosure pertain.

[0214] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as a sequenced list of executable instructions for implementing logical functions, and can be embodied in any computer-readable medium for use by, or in conjunction with, an instruction execution system, apparatus, or device (such as a computer-based system, a processor-included system, or other system that can fetch and execute instructions from, an instruction execution system, apparatus, or device). For the purposes of this specification, "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transmit programs for use by, or in conjunction with, an instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of computer-readable media include: an electrical connection having one or more wires (electronic device), a portable computer disk drive (magnetic device), random access memory (RAM), read-only memory (ROM), erasable and editable read-only memory (EPROM or flash memory), fiber optic devices, and portable optical disc read-only memory (CDROM). Alternatively, the computer-readable medium may 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 medium, followed by editing, interpreting, or otherwise processing as necessary, and then stored in a computer memory.

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

[0216] Those skilled in the art will understand that all or part of the steps of the methods in the above embodiments can be implemented by a program instructing related hardware. The program can be stored in a computer-readable storage medium, and when executed, the program includes one or a combination of the steps of the method embodiments.

[0217] Furthermore, the functional units in the various embodiments of this disclosure can be integrated into a processing module, or each unit can exist physically separately, or two or more units can be integrated into a module. The integrated module can be implemented in hardware or as a software functional module. If the integrated module is implemented as a software functional module and sold or used as an independent product, it can also be stored in a computer-readable storage medium.

[0218] The storage medium mentioned above can be a read-only memory, a disk, or an optical disk, etc. Although embodiments of the present disclosure have been shown and described above, it is to be understood that the above embodiments are exemplary and should not be construed as limiting the present disclosure. Those skilled 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, include: Obtain the target codeword; Based on the first codebook, the target codeword is decoded for the first time to obtain the keyword corresponding to the target codeword; Based on the second codebook and the keyword, the target codeword is decoded a second time to obtain the scene information corresponding to the target codeword; The method further includes: Obtain a set of scene information and the probability corresponding to any scene information in the set of scene information; The first encoding is performed based on the set of scene information and the probability corresponding to any scene information to generate the second codebook; The encoded numbers in the second codebook are used as keywords for a second encoding to generate the first codebook.

2. The method according to claim 1, characterized in that, The step of decoding the target codeword for the first time according to the first codebook to obtain the keyword corresponding to the target codeword includes: Using the verification method corresponding to any header in the first codebook, perform cyclic redundancy check (CRC) verification on the target codeword to obtain the target header that meets the verification requirements. Based on the element information corresponding to the target header, determine the keyword corresponding to the target codeword.

3. The method according to claim 2, characterized in that, The step of determining the keyword corresponding to the target codeword based on the element information corresponding to the target header includes: If the element information corresponding to the target header is a single element, the keyword corresponding to that element information will be used as the keyword corresponding to the target codeword.

4. The method according to claim 2, characterized in that, The step of determining the keyword corresponding to the target codeword based on the element information corresponding to the target header includes: If the element information corresponding to the target header is at least two elements, the at least two elements are accessed sequentially to determine the target element information that meets the keyword requirements among the at least two elements. The keyword corresponding to the target element information is used as the keyword corresponding to the target codeword.

5. The method according to claim 1, characterized in that, The step of decoding the target codeword a second time based on 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; Based on the first binary information, a search is performed in the second codebook to obtain the second binary information corresponding to the keyword; The second binary information is decoded to obtain the scene information corresponding to the target codeword.

6. The method according to claim 1, characterized in that, The step of using the encoded numbers in the second codebook as keywords for a second encoding to generate the first codebook includes: Obtain the first number of the table head corresponding to the first codebook, wherein the third number is the same as the second number corresponding to the at least one scene information, and the third number is the cumulative sum of the first number and the linked list length corresponding to any table head; Determine the first number of cyclic redundancy check code generator polynomials; Using the cyclic redundancy check code generator polynomial corresponding to any of the table headers, perform binomial calculation on the key corresponding to any of the table headers to generate the table header number corresponding to any of the table headers, and store the table header number in any of the table headers to obtain the first codebook.

7. The method according to claim 1, characterized in that, The acquisition of the scene information set and the probability corresponding to any scene information in the scene information set includes: Obtain the probability corresponding to any first scene information in the scene information set, where the first scene information is the scene information determined based on the dimension information; According to the order of probability from smallest to largest corresponding to any first scene information, the first scene information corresponding to the first probability and the first scene information corresponding to the second probability are merged to obtain the second scene information, and the second scene information is added to the scene information set. Obtain the third probability corresponding to the second scenario information; Repeat the process of obtaining the third probability corresponding to the second scene information until all scene information in the scene information set is merged.

8. A scene information determination device, characterized in that, include: The codeword acquisition unit is used to acquire the target codeword; The keyword acquisition unit is used to perform a first decoding on the target codeword according to the first codebook to obtain the keyword corresponding to the target codeword; The scene information acquisition unit is used to perform a second decoding on the target codeword based on the second codebook and the keyword to obtain scene information corresponding to the target codeword; The scene information acquisition unit is also used for: Obtain a set of scene information and the probability corresponding to any scene information in the set of scene information; The first encoding is performed based on the set of scene information and the probability corresponding to any scene information to generate the second codebook; The encoded numbers in the second codebook are used as keywords for a second encoding to generate the first codebook.

9. An electronic device, characterized in that, include: A processor, and a memory communicatively connected to the processor; The memory stores computer-executed instructions; The processor executes computer execution instructions stored in the memory to implement the method as described in any one of claims 1-8.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions, which, when executed by a processor, are used to implement the method as described in any one of claims 1-7.

11. A chip, characterized in that, It includes a processor and an interface; the processor is used to read instructions to execute the method of any one of claims 1-7.

12. A computer program product, characterized in that, Includes a computer program that, when executed by a processor, implements the method of any one of claims 1-7.

Images