Starting point positioning method and system for coding mapping relation identification

Abstract

The invention provides a starting point positioning method and system for coding mapping relation identification. The method belongs to the field of coding mapping, and comprises the following steps: acquiring Coquelet-80 audio data; the method comprises the following steps of: demodulating the Coquelet-80 audio data to obtain bit stream data; verifying the mapping relationship in the bit stream data through a preset algorithm, marking the data matched with the mapping relationship as the data conforming to the mapping relationship, adjusting the initial position of the data not matched with the mapping relationship, and re-verifying the mapping relationship through the preset algorithm until the mapping relationship is matched; and extracting part of data conforming to the mapping relation from the two groups of data conforming to the mapping relation, and decoding according to the code table. The system comprises an acquisition module, a demodulation module, a verification mapping module and a decoding module, and can quickly and reversely deduce an original number or confirm whether a mapping relation is established or not.

Description

Technical Field

[0001] The present application relates to the field of code mapping, and more specifically, to a method and system for locating a starting point for identifying a code mapping relationship. Background Art

[0002] In existing coding systems (such as the COQUELET-80 architecture), data numbers are typically generated using a set of mapping logic, for example, deriving a pair of numbers (c, d) from an original number (a, b), forming a specific digital mapping structure. These mapping logics often involve nonlinear operations, making it difficult to infer the original number or confirm the mapping relationship through simple calculations.

[0003] Specifically, if the input is a pair of original numbers (a, b), a pair of result numbers (c, d) is generated through a certain mapping rule. For example: original number (a=2, b=5) → after mapping → result number (c=17, d=3). This generation rule usually involves nonlinear operations, such as multiplication, power operation (such as c=a 2 +b), modular operations (such as d = (a + b) mod 10), and hash functions (such as c = Hash (a||b)).

[0004] However, nonlinear operations (such as multiplication and hashing) usually cannot be reversed to derive the original value through simple algebraic operations. For example: if c = a × b, and c = 12 is known, there may be multiple solutions: (a = 3, b = 4), (a = 2, b = 6), etc. Some systems may use black box logic (such as table lookup or random keys) and do not disclose specific rules, resulting in the inability to directly reverse the calculation. If only the result number (c, d) is known, traditional mathematical methods (such as solving equations) cannot uniquely determine the original (a, b) because nonlinear operations may introduce uncertainty or information loss. Therefore, to determine whether a pair (c, d) is generated by a certain (a, b), it may be necessary to traverse all possible original numbers for forward calculation and comparison, which is extremely inefficient. For example, the mapping rule of a certain coding system is: c = a 2 +b, d=(a×b)mod10. Forward generation: If the original number is (a=3,b=4), the resulting number is c=3 2 +4=13,d=(3×4)mod10=2,that is (13,2). Difficulty of reverse cracking: If the result (c=13,d=2) is known, we need to find (a,b) that meets the following conditions: a 2 +b=13, (a×b)mod10=2. Possible solutions include (3,4), (-3,4), etc., which need to be verified by exhaustive enumeration or conjecture and cannot be directly deduced. Summary of the Invention

[0005] The purpose of this application is to provide a starting point positioning method and system for identifying coding mapping relationships, which can quickly infer the original number or confirm whether the mapping relationship is established.

[0006] This application is implemented as follows:

[0007] In a first aspect, the present application provides a method for locating a starting point for identifying a coding mapping relationship, comprising the following steps:

[0008] S1: Get Coquelet-80 audio data;

[0009] S2: Demodulate the Coquelet-80 audio data to obtain bit stream data;

[0010] S3: Verify the mapping relationship in the bitstream data using a preset algorithm, mark the data that matches the mapping relationship as data that meets the mapping relationship, adjust the starting position of the data that does not match the mapping relationship, and re-verify the mapping relationship using the preset algorithm until the mapping relationship matches;

[0011] S4: extracting part of the data that meets the mapping relationship from the two groups of data that meet the mapping relationship, and decoding them according to the code table.

[0012] In a second aspect, the present application provides a starting point positioning system for identifying a coding mapping relationship, comprising:

[0013] Acquisition module: used to obtain Coquelet-80 audio data;

[0014] Demodulation module: used to demodulate Coquelet-80 audio data to obtain bit stream data;

[0015] Verification mapping module: used to verify the mapping relationship in the bit stream data through a preset algorithm, mark the data with a matching mapping relationship as data that meets the mapping relationship, adjust the data starting position for the data with a mismatched mapping relationship, and re-verify the mapping relationship through a preset algorithm until the mapping relationship matches;

[0016] Decoding module: used to extract part of the data that meets the mapping relationship from two groups of data that meet the mapping relationship and decode them according to the code table.

[0017] In a third aspect, the present application provides an electronic device, comprising:

[0018] a memory for storing one or more programs;

[0019] processor;

[0020] When the one or more programs are executed by the processor, the above method is implemented.

[0021] In a fourth aspect, the present application provides a computer-readable storage medium having a computer program stored thereon, which implements the above-mentioned method when executed by a processor.

[0022] Compared with the prior art, this application has at least the following advantages or beneficial effects:

[0023] 1. Rapidly identify mapping relationships: By using a preset algorithm to verify mapping relationships in bitstream data, it is possible to quickly determine whether any set of number pairs satisfies a specific mapping relationship under known rules, avoiding the inefficiency of traditional brute-force matching.

[0024] 2. Accurately locate the data starting point: Through the preset algorithm, the starting point of the data sequence with coding mapping characteristics can be quickly tracked, and the coding starting point can be quickly locked in the data stream or data block, providing a basis for subsequent data analysis, synchronization or restoration.

[0025] 3. Support for nonlinear mapping rules: Different from the linear redundancy method commonly used in existing FEC technology, the present invention is applicable to more complex number mapping logic (such as modular operation, cyclic increase and decrease, etc.), and has stronger adaptability and extensiveness.

[0026] 4. Improve processing efficiency and accuracy: The preset algorithm has a clear structure and limited calculation steps, making it suitable for use in embedded devices, communication terminals or back-end decoding systems, and significantly improving processing efficiency without increasing the hardware burden.

[0027] 5. Applicable to various application scenarios: This technology is not only suitable for coding starting point positioning under specific protocols, but can also be widely used in multiple fields such as communication data synchronization, signal sequence recognition, numbering rule analysis, reverse restoration, etc., with strong versatility and scalability. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the following is a brief introduction to the drawings required for use in the embodiments. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other relevant drawings can be obtained based on these drawings without creative work.

[0029] Figure 1 This is a flowchart of an embodiment of a method for locating a starting point for identifying a coding mapping relationship according to the present application;

[0030] Figure 2 This is a flowchart of another embodiment of a method for locating a starting point for identifying a coding mapping relationship according to the present application;

[0031] Figure 3This is a structural diagram of a starting point positioning system for identifying coding mapping relationships in this application;

[0032] Figure 4 This is a structural diagram of an electronic device in this application.

[0033] icon:

[0034] 1. Acquisition module; 2. Demodulation module; 3. Verification mapping module; 4. Decoding module; 5. Processor; 6. Memory; 7. Communication interface. DETAILED DESCRIPTION

[0035] To make the objectives, technical solutions, and advantages of the embodiments of the present application more clear, the technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the accompanying drawings of the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Generally, the components of the embodiments of the present application described and shown in the drawings herein can be arranged and designed in various different configurations.

[0036] The following describes some embodiments of the present application in detail with reference to the accompanying drawings. In the absence of conflict, the following embodiments and features thereof may be combined with each other.

[0037] Example

[0038] The embodiment of the present application provides a starting point positioning method for identifying a coding mapping relationship, which can quickly infer the original number or confirm whether the mapping relationship is established.

[0039] Please refer to Figure 1-2 The method for locating a starting point for identifying a coding mapping relationship comprises the following steps:

[0040] S1: Get Coquelet-80 audio data;

[0041] Specifically, Coquelet-80 is a communication protocol used for low-power devices such as the Internet of Things. Audio data is typically transmitted in a modulated form. Coquelet-80 audio data is received by wireless communication devices. Coquelet-80 audio data is an analog signal transmitted over a wireless channel. Coquelet-80 audio data carries a modulated signal, which is converted from digital information into an analog audio signal using modulation techniques such as frequency shift keying and amplitude modulation.

[0042] S2: Demodulate the Coquelet-80 audio data to obtain bit stream data;

[0043] Specifically, the receiving end performs frequency demodulation on the audio analog signal to restore the baseband frequency of the signal; the received Coquelet-80 audio signal is essentially an analog waveform signal generated by modulation technology (such as waveforms of modulation methods such as FSK and ASK). By restoring the original digital bit stream (binary sequence) from the analog signal, the terminal information recovery of digital communication is achieved. During the modulation process, the binary state (0 / 1) of the digital signal is converted into an analog waveform of different frequencies or amplitudes (such as 0 corresponds to low frequency and 1 corresponds to high frequency in FSK). During demodulation, the analog signal must be restored to the baseband frequency range through frequency detection or amplitude discrimination. A phase-locked loop (PLL) or filter group can be used to track signal frequency changes and match the preset modulation frequency characteristics. For example, the Coquelet-80 audio signal distinguishes high and low frequency bands by setting a threshold, and extracts the frequency state corresponding to each time slice.

[0044] The received modulated signal is converted into a bit stream using a corresponding decoding algorithm. For example, if a high-frequency pulse is detected within a certain time period, it is decoded as a 1; a low-frequency pulse is decoded as a 0, ultimately generating a bit stream sequence such as 01001101. The binary data stream generated by demodulation can be directly used for subsequent processing in digital communications.

[0045] S3: Verify the mapping relationship in the bitstream data using a preset algorithm, mark the data that matches the mapping relationship as data that meets the mapping relationship, adjust the starting position of the data that does not match the mapping relationship, and re-verify the mapping relationship using the preset algorithm until the mapping relationship matches;

[0046] The specific steps include:

[0047] S3-1: Define input parameters (a, b) and output results (c, d):

[0048] (ab) is the main part of the original number, which is an integer and has an initial value range of 1-8; (c, d) is the mapped number pair, with a numerical range of 1-8; and (c, d) can be merged, and the merged digital identifier is cd;

[0049] Example:

[0050] Input: a=1, b=7

[0051] Execution result: c = 7, d = 3

[0052] The output number pair is: 73

[0053] S3-2: Calculate the intermediate value c;

[0054] The formula used is: c=a+4; if c>8, then c=c-8; specifically, if the result of c exceeds 8, then 8 is subtracted in a loop until it is less than or equal to 8, which is used to offset the original number a to the new numerical space to prepare for subsequent loop operations; example: when a=5, c=5+4=9, 9>8, then c=9-8=1.

[0055] S3-3: Assignment: d = c; Continuing with the previous example, this time c = 1, then assign d = 1.

[0056] S3-4: loop processing;

[0057] Number of loops: b-5 times, the minimum value of b must be ≥5, otherwise the loop will not be executed;

[0058] Each round of operation:

[0059] d increases by 7: d = d + 7;

[0060] Threshold judgment: if d == 8, then c = c + 1;

[0061] If d>8, then d=d-8 and c=c+1;

[0062] Example: When b=7, the loop is executed twice:

[0063] Initial state: c = 1, d = 1;

[0064] First loop:

[0065] d=1+7=8, d==8 then c=1+1=2;

[0066] The second cycle: d = 8 + 7 = 15, d>8, then d = 15-8 = 7, and it can be deduced that c = 2 + 1 = 3.

[0067] S3-5: Final c-value correction;

[0068] Quadratic modular operation: If c>8 after the loop, correct it to c=c-8; if c=9 after the loop, then c=9-8=1.

[0069] S3-6: Output results;

[0070] Format: Map number pair (c, d) or merge value cd. Final example output: c = 3, d = 7, then cd = 37.

[0071] By verifying the mapping relationship in the bit stream data through a preset algorithm, it is possible to quickly determine whether any set of number pairs satisfies a specific mapping relationship under known rules, thereby avoiding the inefficiency of traditional brute force matching. In addition, the preset algorithm can quickly track the starting point of a data sequence with coding mapping characteristics, quickly lock the coding starting point in the data stream or data block, and provide a basis for subsequent data parsing, synchronization or restoration. Unlike the linear redundancy method commonly used in existing FEC technology, the present invention is suitable for more complex number mapping logic (such as modular operations, cyclic increase and decrease, etc.), and has greater adaptability and extensiveness. The preset algorithm has a clear structure and limited calculation steps. It is suitable for use in embedded devices, communication terminals or back-end decoding systems, and significantly improves processing efficiency without increasing the hardware burden.

[0072] S4: extracting part of the data that meets the mapping relationship from the two groups of data that meet the mapping relationship, and decoding them according to the code table.

[0073] Specifically, the data that matches the mapping relationship is extracted. Decoding process: Data that has verified the mapping relationship is decoded according to a predefined code table. A code table is a mapping table that defines how bit stream data is converted into final valid information. For example, in the Coquelet-80 protocol, each specific bit stream may correspond to a character. The decoding process converts the bit stream into understandable symbols, numbers, or other data based on the code table. Output: Decoded valid data, usually data that can be directly used by the application.

[0074] Through such a setting, this technology is not only suitable for coding starting point positioning under specific protocols, but can also be widely used in multiple fields such as communication data synchronization, signal sequence recognition, numbering rule analysis, reverse restoration, etc., with strong versatility and scalability.

[0075] Please refer to Figure 3 This embodiment further provides a starting point positioning system for identifying a coding mapping relationship, including:

[0076] Acquisition module 1: used to acquire Coquelet-80 audio data; demodulation module 2: used to demodulate Coquelet-80 audio data to obtain bitstream data; verification mapping module 3: used to verify the mapping relationship in the bitstream data using a preset algorithm, mark the data with a matching mapping relationship as data that meets the mapping relationship, adjust the starting position of the data for the data with a mismatched mapping relationship, and re-verify the mapping relationship using a preset algorithm until the mapping relationship matches; decoding module 4: used to extract some data that meets the mapping relationship from two groups of data that meet the mapping relationship and decode it according to the code table.

[0077] Among them, the demodulation module 2 includes a demodulation submodule: used for the receiving end to perform frequency demodulation on the audio analog signal and restore the baseband frequency of the signal; a conversion submodule: used to use the corresponding decoding algorithm to convert the received modulated signal into bit stream data. The verification mapping module 3 includes a definition submodule: used to define the input parameters (a, b) and the output results (c, d); specifically, (ab) is the main part of the original number, which is an integer, and the initial value range is 1-8; (c, d) is the mapped number pair, the numerical range is 1-8; and (c, d) can be merged, and the merged digital identifier is cd; the calculation intermediate value submodule: used to calculate the intermediate value c; specifically, it includes the formula: c=a+4; if c>8, then c=c-8; specifically, if the result of c exceeds 8, then 8 is subtracted cyclically until it is less than or equal to 8, which is used to offset the original number a to the new numerical space The submodule is used to prepare for the subsequent loop operation; the assignment submodule is used to assign the value d=c; the loop processing submodule is used for loop processing; specifically, the number of loops is b-5 times, and the minimum value of b must be ≥5, otherwise the loop will not be executed; each round of operations includes increasing d by 7: d=d+7; threshold judgment: if d==8, then c=c+1; if d>8, then d=d-8 and c=c+1; the correction submodule is used to correct the final c value; specifically, the quadratic modulo operation: if c>8 after the loop, it is corrected to c=c-8; the output submodule is used to output the result; specifically, the output format is a mapping number pair (c,d) or a merged value cd.

[0078] Specifically, the specific implementation of the starting point positioning system for identifying a coding mapping relationship can be referred to the specific implementation of the starting point positioning method for identifying a coding mapping relationship, which will not be described in detail here.

[0079] Please refer to Figure 4 This embodiment further provides an electronic device, including:

[0080] Memory 6, for storing one or more programs;

[0081] Processor 5; processor 5 and memory 6 are connected via a communication interface 7;

[0082] When the one or more programs are executed by the processor 5 , all or part of the above methods are implemented.

[0083] This embodiment further provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed by the processor 5 , all or part of the above method is implemented.

[0084] It will be apparent to those skilled in the art that the present application is not limited to the details of the exemplary embodiments described above and that the present application can be implemented in other specific forms without departing from the spirit or essential characteristics of the present application. Therefore, the embodiments should be considered in all respects as illustrative and non-restrictive, and the scope of the present application is defined by the appended claims, not the foregoing description, and all variations within the meaning and range of equivalents of the claims are intended to be included therein. Any reference sign in a claim should not be construed as limiting the claim to which it relates.

Claims

1. A starting point positioning method for identifying coding mapping relationships, characterized in that: The following steps are involved: S1: Get Coquelet-80 audio data; S2: Demodulate the Coquelet-80 audio data to obtain bit stream data; S3: Verify the mapping relationship in the bitstream data using a preset algorithm, mark the data that matches the mapping relationship as data that meets the mapping relationship, adjust the starting position of the data that does not match the mapping relationship, and re-verify the mapping relationship using the preset algorithm until the mapping relationship matches; S4: extracting part of the data that meets the mapping relationship from the two groups of data that meet the mapping relationship, and decoding them according to the code table.

2. A starting point positioning method for coding mapping relationship identification according to claim 1, characterized in that: The steps to obtain Coquelet-80 audio data include: Coquelet-80 audio data is received via a wireless communication device. The Coquelet-80 audio data is an analog signal transmitted via a wireless channel. The Coquelet-80 audio data carries a modulated signal, which is a modulation technique used to convert digital information into an audio analog signal.

3. A starting point positioning method for identifying coding mapping relationships according to claim 2, characterized in that: The steps of demodulating Coquelet-80 audio data to obtain bit stream data include: The receiving end demodulates the audio analog signal and restores the baseband frequency of the signal; The received modulated signal is converted into bit stream data using the corresponding decoding algorithm.

4. A method for locating a starting point for identifying a coding mapping relationship according to claim 3, characterized in that: The step of verifying the mapping relationship in the bitstream data using a preset algorithm specifically includes: S3-1: Define input parameters (a, b) and output results (c, d): (ab) is the main part of the original number, which is an integer and has an initial value range of 1-8; (c, d) is the mapped number pair, with a numerical range of 1-8; and (c, d) can be merged, and the merged digital identifier is cd; S3-2: Calculate the intermediate value c; The formula is: c = a + 4; if c > 8, then c = c - 8; specifically, if the result of c exceeds 8, 8 is subtracted repeatedly until it is less than or equal to 8, which is used to offset the original number a to the new value space in preparation for subsequent loop operations; S3-3: Assignment: d = c; S3-4: loop processing; Number of loops: b-5 times, the minimum value of b must be ≥5, otherwise the loop will not be executed; Each round of operation: d increases by 7: d = d + 7; Threshold judgment: if d == 8, then c = c + 1; If d>8, then d=d-8 and c=c+1; S3-5: Final c-value correction; Secondary modular operation: If c>8 after the loop, correct it to c=c-8; S3-6: Output results; Format: mapping number pair (c,d) or merge value cd.

5. A starting point positioning system for identifying coding mapping relationships, characterized in that: include: Acquisition module: used to obtain Coquelet-80 audio data; Demodulation module: used to demodulate Coquelet-80 audio data to obtain bit stream data; Verification mapping module: used to verify the mapping relationship in the bit stream data through a preset algorithm, mark the data with a matching mapping relationship as data that meets the mapping relationship, adjust the data starting position for the data with a mismatched mapping relationship, and re-verify the mapping relationship through a preset algorithm until the mapping relationship matches; Decoding module: used to extract part of the data that meets the mapping relationship from two groups of data that meet the mapping relationship and decode them according to the code table.

6. A starting point positioning system for identifying coding mapping relationships according to claim 5, characterized in that: The demodulation module includes: Demodulation submodule: used to demodulate the audio analog signal at the receiving end and restore the baseband frequency of the signal; Conversion submodule: used to convert the received modulated signal into bit stream data using the corresponding decoding algorithm.

7. A starting point positioning system for identifying coding mapping relationships according to claim 6, characterized in that: The verification mapping module includes: Definition submodule: used to define input parameters (a, b) and output results (c, d); specifically, (ab) is the main part of the original number, which is an integer and has an initial value range of 1-8; (c, d) is the mapped number pair, with a value range of 1-8; and (c, d) can be merged, and the merged digital identifier is cd; The intermediate value calculation submodule is used to calculate the intermediate value c. Specifically, the formula is: c = a + 4; if c > 8, then c = c - 8. Specifically, if the result of c exceeds 8, 8 is subtracted repeatedly until it is less than or equal to 8, which is used to offset the original number a to the new value space in preparation for subsequent loop operations. Assignment submodule: used to assign: d = c; Loop processing submodule: used for loop processing; specifically, the number of loops: b-5 times, the minimum value of b must be ≥5, otherwise the loop will not be executed; each round of operations includes increasing d by 7: d=d+7; threshold judgment: if d==8, then c=c+1; if d>8, then d=d-8 and c=c+1; Correction submodule: used to correct the final c value; specifically includes quadratic modular operation: if c>8 after the loop, correct it to c=c-8; Output submodule: used to output results; specifically, the output format is a mapping number pair (c, d) or a merged value cd.

8. An electronic device, characterized in that: include: a memory for storing one or more programs; processor; When the one or more programs are executed by the processor, the method according to any one of claims 1 to 4 is implemented.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 4 is implemented.

Images