Bit field effective information retrieval method, storage medium and device

Abstract

The invention discloses a bit field effective information retrieval method, a storage medium and a device, and the method comprises the following steps: S1, carrying out bit streaming on digital field receiving information, and unifying the digital field receiving information into a binary bit stream; s2, obtaining convolution feature values of the first array and the synchronous code array; s3, acquiring a synchronous code of digital domain receiving information from the binary bit stream, performing self-correlation processing to obtain a self-correlation value, and generating a second array; s4, multiplying the second array by the first array bit by bit, counting an accumulation result, and comparing the accumulation result with the convolution characteristic value of the synchronous code array; s5, determining the position of a synchronization head; and S6, acquiring effective information of the bit field from the position of the synchronization head. According to the method, bit domain processing can be carried out on the digital domain synchronization head, feature code calculation is carried out through the bit domain, then full-bit-domain searching is carried out through the feature code, condition judgment of accurate judgment is achieved, the retrieval efficiency is improved, and the misjudgment probability is reduced.

Description

Technical Field

[0001] This invention relates to bit-domain information retrieval, and in particular to a method, storage medium, and apparatus for retrieving effective bit-domain information. Background Technology

[0002] Currently, most methods for digit field information retrieval employ feature value retrieval, judging information by analyzing digit field feature values ​​at corresponding positions. This method is typically used for dummy block detection or valid value retrieval. While efficient, this approach has a relatively high false negative rate. When detecting dummy blocks, judging continuous digit field information carries a small probability of missing crucial information. For example, if valid information is at the very end of a dummy block, using continuous information for judgment has significant limitations.

[0003] According to the internal requirements of the protocol, the protocol specifies the data packet synchronization codeword and corresponding valid information, and also determines whether dummy blocks exist based on the valid information. The determination method can judge whether there is service in a time slot, or whether it consists entirely of dummy blocks, based on whether consecutive byte content is dummy. The consecutive byte determination method is simple and effective, but it has a probability of missing detections when processing data streams.

[0004] When receiving data stream information from the FPGA, there is a high probability that a service content synchronization header will be added at the end of the time slot for packet unpacking. At this time, judging by whether consecutive adjacent bytes are dummy will likely ignore the synchronization header, thus leading to missed detection. Summary of the Invention

[0005] The purpose of this invention is to overcome the shortcomings of the prior art and provide a method, storage medium, and apparatus for effective information retrieval in the bit field. This invention enables accurate conditional judgment by bit-domaining the digital field synchronization header, calculating feature codes in the bit field, and then performing a full bit field search using the feature codes. This improves retrieval efficiency and reduces the probability of misjudgment.

[0006] The objective of this invention is achieved through the following technical solution: a method for retrieving effective information in a bit field, comprising the following steps: S1. Convert the received information in the digital domain into a bitstream to obtain digital domain bitstream data, and then unify the digital domain bitstream data into a binary bitstream; S2. Obtain the hexadecimal synchronization code sequence array, convert it into a binary bit synchronization code sequence array, perform convolution processing to obtain the first array, and obtain the convolution feature values ​​of the synchronization code array; S3. Obtain the synchronization code of the received digital field information from the binary bit stream, perform autocorrelation processing to obtain the autocorrelation value, and generate the second array; S4. Multiply the second array bit by bit with the first array and accumulate the results. Compare the accumulated results with the convolution feature values ​​of the synchronization code array. S5. If the accumulated result in step S4 is equal to the convolution feature value of the synchronization code array, determine the position of the synchronization header in the binary bit stream and proceed to step S6; otherwise, repeat steps S3 to S5. S6. Obtain valid bit field information starting from the synchronization header position.

[0007] A storage medium storing a computer program thereon, wherein the computer program, when executed, performs the steps of the method for retrieving valid bit field information.

[0008] An apparatus includes a memory and one or more processors, the memory storing a computer program that runs on the processors, the processors executing the steps of the method for retrieving valid bit field information when running the computer program.

[0009] The beneficial effects of this invention are: by converting the digital domain synchronization header into a bit domain, calculating the feature code through the bit domain, and then performing a full bit domain search through the feature code, this invention achieves accurate conditional judgment, improves retrieval efficiency, and reduces the probability of misjudgment. Attached Figure Description

[0010] Figure 1 This is a flowchart of the method of the present invention. Detailed Implementation

[0011] The technical solution of the present invention will be further described in detail below with reference to the accompanying drawings, but the scope of protection of the present invention is not limited to the following description.

[0012] like Figure 1 As shown, a method for retrieving effective information in a bit field includes the following steps: S1. Convert the received information in the digital domain into a bitstream to obtain digital domain bitstream data, and then unify the digital domain bitstream data into a binary bitstream; Upon receiving the signal, it is demodulated by the corresponding demodulation module. The constellation diagram and EVM of the signal are then checked to ensure they conform to the protocol requirements. For correctly demodulated signals, decoding is performed, and the CRC is verified. If the CRC is correct, the decoded bitstream data is the digital bitstream data of the received signal. The decoded binary-to-hexadecimal data is then converted using a hexadecimal-to-binary conversion formula to obtain the corresponding signal's data bitstream, which is then processed in the next step.

[0013] S2. Obtain the hexadecimal synchronization code sequence array, convert it into a binary bit synchronization code sequence array, perform convolution processing to obtain the first array, and obtain the convolution feature values ​​of the synchronization code array; Step 2.1: According to the requirements of the protocol, obtain the hexadecimal signature of the synchronization header and convert it into an array of binary bits of the synchronization code sequence; Step 2.2: Convolve the synchronization codes in the synchronization code sequence array to obtain the first array. In the embodiments of this application, the first array mask = sync(1 : end-1) .* sync(2 : end). The .* symbol indicates that corresponding elements in the two sequences are multiplied pairwise. sync(1 : end-1) and sync(2 : end) are two adjacent synchronization code sequences in the synchronization code sequence array; Step 2.3: Find the number of non-zero numbers (len_spread) in the mask array used for convolution calculation, and use it as the synchronization code convolution feature value.

[0014] S3. Obtain the synchronization code of the received digital field information from the binary bit stream, perform autocorrelation processing to obtain the autocorrelation value, and generate the second array; Step 3.1: Create a zero-filled array bits_hard (the second array) with the same length as the mask array, as the storage space for the sliding comparison array.

[0015] Step 3.2: Obtain the synchronization code of the digital domain received information from the binary bit stream. Perform multiplication and conjugation operations on each pair of data in the synchronization code of the digital domain received information to obtain the autocorrelation value of the synchronization code of the digital domain received information. Specifically, in the embodiments of this application, adjacent data in the synchronization code are sequentially obtained, and autocorrelation processing is performed on the data to obtain the autocorrelation value diff = conj(sig(i)) .* (sig(i + 1)), where Conj represents the conjugate operation. The .* symbol indicates that corresponding elements in the two sequences are multiplied pairwise. sig(i) represents the first data in two adjacent data in the synchronization code, and sig(i+1) represents the second data in two adjacent data in the synchronization code; Step 3.3: Save the obtained autocorrelation value in bits_hard, erase the first data in bits_hard, fill the autocorrelation value into the end of the array to generate a new array, and at the same time ensure that the length of the new array is consistent with that of bits_hard; S4. Multiply the second array bit by bit with the first array and accumulate the results. Compare the accumulated results with the convolution feature values ​​of the synchronization code array to realize the synchronization header decision. In other words, the newly generated array bits_hard is multiplied bit by bit with the mask array and the results are accumulated to obtain the accumulated result despread_sym, which is then compared with len_spread.

[0016] S5. If the accumulated result in step S4 is equal to the convolution feature value of the synchronization code array, determine the position of the synchronization header in the binary bit stream and proceed to step S6; otherwise, repeat steps S3 to S5. If the accumulated result in step S4 is equal to the convolution feature value of the synchronization code array, then the position in the binary bit stream where the corresponding position in the second array is minus the length of the first array is determined to be the synchronization header position (when despread_sym is equal to len_spread, the decision is successful, and the position point minus the length of the mask array is the location of the synchronization header), proceed to step S6. Otherwise, repeat steps S3 to S5 until the accumulated result in step S4 is equal to the convolution feature value of the synchronization code array, and the synchronization header position is obtained.

[0017] S6. Obtain valid bit field information starting from the synchronization header position.

[0018] In the embodiments of this application, after finding the synchronization header, if data jump is required according to the parsed data, the data is shifted according to the parsed tbs length, and the decision operation continues from that position.

[0019] In the embodiments of this application, the device may include, but is not limited to, devices such as mobile phones, laptops, PDAs (personal digital assistants), and PADs (tablet computers); more specific examples of the storage medium of the present invention may include, but are not limited to: electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing. In the embodiments of the application, the above-mentioned computer storage medium may be included in the above-mentioned device; or it may exist separately and not assembled into the device.

[0020] The foregoing description illustrates and describes a preferred embodiment of the present invention. However, as previously stated, it should be understood that the present invention is not limited to the forms disclosed herein and should not be construed as excluding other embodiments. It can be used in various other combinations, modifications, and environments, and can be altered within the scope of the inventive concept described herein through the foregoing teachings or techniques or knowledge in related fields. Any modifications and variations made by those skilled in the art that do not depart from the spirit and scope of the present invention should be within the protection scope of the appended claims.

Claims

1. A method for retrieving effective information in a bit field, characterized in that: Includes the following steps: S1. Convert the received information in the digital domain into a bitstream to obtain digital domain bitstream data, and unify the digital domain bitstream data into a binary bitstream; S2. Obtain the hexadecimal synchronization code sequence array, convert it into a binary bit synchronization code sequence array, perform convolution processing to obtain the first array, and obtain the convolution feature values ​​of the synchronization code array; S3. Obtain the synchronization code of the received digital field information from the binary bit stream, perform autocorrelation processing to obtain the autocorrelation value, and generate the second array; S4. Multiply the second array bit by bit with the first array and accumulate the results. Compare the accumulated results with the convolution feature values ​​of the synchronization code array. S5. If the accumulated result in step S4 is equal to the convolution feature value of the synchronization code array, determine the position of the synchronization header in the binary bit stream and proceed to step S6; otherwise, repeat steps S3 to S5. S6. Obtain valid bit field information starting from the synchronization header position.

2. The method for retrieving effective bit field information according to claim 1, characterized in that: Step S1 includes: After demodulating and decoding the received information in the digital domain, digital domain bitstream data is obtained; If the digital field bitstream data is a binary bitstream, proceed directly to step S2; if the digital field bitstream data is a hexadecimal bitstream, convert it to a binary bitstream and then proceed to step S2.

3. The method for retrieving effective bit field information according to claim 1, characterized in that: Step S2 includes: According to the communication protocol for receiving information in the digital field, obtain the hexadecimal synchronization code sequence array; Convert the hexadecimal synchronization code sequence array into a binary bit synchronization code sequence array; The synchronization codes in the synchronization code sequence array are convolved to obtain a first array, and the convolution feature value of the synchronization code sequence array is determined based on the first array: the convolution feature value refers to the number of values ​​greater than 0 in the first array.

4. The method for retrieving effective bit field information according to claim 1, characterized in that: Step S3 includes: The synchronization code of the digital domain received information is obtained from the binary bit stream. The data in the synchronization code of the digital domain received information are multiplied and conjugately operated in pairs to obtain the autocorrelation value of the synchronization code of the digital domain received information. Create a second array with the same length as the first array and all values ​​are 0. Fill the calculated autocorrelation values ​​into the second array sequentially. Each time the second array is filled, it needs to be updated. That is, erase the first value in the second array, then shift each value in the second array one position forward, and fill the last position of the second array with the updated autocorrelation value.

5. The method for retrieving effective bit field information according to claim 1, characterized in that: Step S4 includes: for each updated second array, multiplying it bit by bit with the first array and accumulating the result, and comparing the accumulated result with the convolution feature value of the synchronization code array.

6. The method for retrieving effective bit field information according to claim 1, characterized in that: Step S5 includes: if the accumulated result in step S4 is equal to the convolution feature value of the synchronization code array, determine that the position in the second array minus the length of the first array in the binary bit stream is the synchronization header position, and proceed to step S6; otherwise, repeat steps S3 to S5 until the accumulated result in step S4 is equal to the convolution feature value of the synchronization code array and the synchronization header position is obtained.

7. A storage medium having a computer program stored thereon, characterized in that: When the computer program is run, it performs the steps of a method for retrieving valid bit field information as described in any one of claims 1 to 6.

8. An apparatus comprising a memory and one or more processors, characterized in that, The memory stores a computer program that runs on the processor, and when the processor runs the computer program, it performs the steps of a method for retrieving valid bit field information according to any one of claims 1 to 6.

Images