CN112702068B - Method, device, equipment and storage medium for processing coded data - Google Patents

Method, device, equipment and storage medium for processing coded data Download PDF

Info

Publication number
CN112702068B
CN112702068B CN202011566437.3A CN202011566437A CN112702068B CN 112702068 B CN112702068 B CN 112702068B CN 202011566437 A CN202011566437 A CN 202011566437A CN 112702068 B CN112702068 B CN 112702068B
Authority
CN
China
Prior art keywords
data
nrz
code
return
bit
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202011566437.3A
Other languages
Chinese (zh)
Other versions
CN112702068A (en
Inventor
刘均
郭黎
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Launch Technology Co Ltd
Original Assignee
Shenzhen Launch Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Launch Technology Co Ltd filed Critical Shenzhen Launch Technology Co Ltd
Priority to CN202011566437.3A priority Critical patent/CN112702068B/en
Publication of CN112702068A publication Critical patent/CN112702068A/en
Application granted granted Critical
Publication of CN112702068B publication Critical patent/CN112702068B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13Linear codes
    • H03M13/19Single error correction without using particular properties of the cyclic codes, e.g. Hamming codes, extended or generalised Hamming codes

Landscapes

  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Dc Digital Transmission (AREA)

Abstract

The method comprises the steps of analyzing first leading data and effective coding data from non-return-to-zero NRZ coding data after determining that the acquired non-return-to-zero NRZ coding data is effective signals, and converting the effective coding data into differential Mannich data based on the first leading data and a preset data conversion rule; and further, the differential Mannich data can be acquired through a serial port, so that the signal state change rule can be more intuitively reflected in the data acquisition process. The encoded data can be directly compared for convenient application.

Description

Method, device, equipment and storage medium for processing coded data
Technical Field
The present application belongs to the field of communications technologies, and in particular, relates to a method, an apparatus, a device, and a storage medium for processing coded data.
Background
At present, common data coding modes comprise an NRZ coding mode without return to zero, and data obtained by coding in the NRZ coding mode can only be collected through a logic analyzer, so that NRZ coding data cannot be directly compared in some application scenes, and a data rule can be conveniently found and effectively utilized.
Therefore, the prior art has the problem of inconvenient application caused by the fact that NRZ encoded data cannot be directly compared.
Disclosure of Invention
The invention aims to provide a coded data processing method, device, equipment and storage medium, and aims to solve the problem of inconvenient application caused by incapability of directly comparing NRZ coded data in the prior art.
A first aspect of an embodiment of the present application provides a method for processing encoded data, including:
acquiring non-return-to-zero NRZ encoded data;
judging whether the non-return-to-zero NRZ encoded data is a valid signal or not;
if yes, analyzing first leading data and effective coding data from the non-return-to-zero NRZ coding data;
and converting the effective coding data into differential Mancode data according to the first leading data and a preset data conversion rule.
In an optional implementation manner, the determining whether the NRZ encoded data is a valid signal specifically includes:
and determining whether the non-return-to-zero NRZ encoded data is a valid signal according to a preset second preamble data and the first preamble data in the non-return-to-zero NRZ encoded data.
In an optional implementation manner, the determining whether the non-return-to-zero NRZ encoded data is a valid signal according to a preset second preamble data and the first preamble data in the non-return-to-zero NRZ encoded data includes:
judging whether the first leading data and the second leading data are the same or not;
if yes, determining the non-return-to-zero NRZ encoded data as a valid signal;
if not, determining that the non-return-to-zero NRZ encoded data is an invalid signal.
In an optional implementation manner, the converting the valid code data into the differential mann code data according to the first preamble data and a preset data conversion rule includes:
according to the arrangement sequence of NRZ codes in the effective coding data, respectively and sequentially acquiring every two NRZ codes;
and sequentially converting the obtained NRZ codes of every two bits into differential Mannich code data according to the first preamble data.
In an optional implementation manner, the sequentially converting the obtained NRZ codes of every two bits into differential mann code data according to the first preamble data respectively includes:
comparing a first bit NRZ code in the arbitrary two-bit NRZ code with a last bit NRZ code in the first preamble data aiming at the selected arbitrary two-bit NRZ code;
and determining to convert the random two-bit NRZ code into differential Mancode data with corresponding level according to the comparison result.
In an alternative implementation, determining, according to the comparison result, the differential Mannich code data for converting the arbitrary two-bit NRZ code into the corresponding level includes:
judging that the first bit NRZ code and the last bit NRZ code in the arbitrary two-bit NRZ code are the same;
if the two bit NRZ codes are the same, determining to convert the arbitrary two bit NRZ codes into high-level differential Mancode data;
if not, determining to convert the arbitrary two-bit NRZ code into low-level differential Mancode data.
In an alternative implementation, the last bit NRZ encoding of the first preamble data includes a high level or a low level.
A second aspect of an embodiment of the present application provides an encoded data processing apparatus, including:
the acquisition module is used for acquiring non-return-to-zero NRZ encoded data;
the judging module is used for judging whether the non-return-to-zero NRZ encoded data is a valid signal or not;
the analysis module is used for analyzing the first leading data and the effective coding data from the non-return-to-zero NRZ coding data when the non-return-to-zero NRZ coding data is an effective signal;
and the conversion module is used for converting the effective coding data into differential Mancode data according to the first leading data and a preset data conversion rule.
In an optional implementation manner, the judging module is specifically configured to:
and determining whether the non-return-to-zero NRZ encoded data is a valid signal according to a preset second preamble data and the first preamble data in the non-return-to-zero NRZ encoded data.
In an alternative implementation manner, the judging module includes:
a first judging unit configured to judge whether the first preamble data and the second preamble data are identical;
a first determining unit, configured to determine that the non-return-to-zero NRZ encoded data is a valid signal when the first preamble data and the second preamble data are the same;
and the second determining unit is used for determining that the non-return-to-zero NRZ encoded data is an invalid signal when the first leading data is different from the second leading data.
In an alternative implementation, the conversion module includes:
an obtaining unit, configured to obtain NRZ codes of every two bits in sequence according to an arrangement sequence of NRZ codes in the valid code data;
and the conversion unit is used for sequentially converting the obtained NRZ codes of every two bits into differential Mannich data according to the first leading data.
In an alternative implementation, the conversion unit includes:
a comparing subunit, configured to compare, for a selected arbitrary two-bit NRZ code, a first-bit NRZ code in the arbitrary two-bit NRZ code with a last-bit NRZ code in the first preamble data;
and the first determining subunit is used for determining the difference Mancode data for converting the random two-bit NRZ code into the corresponding level according to the comparison result.
In an alternative implementation, the determining subunit includes:
a judging subunit, configured to judge whether the first bit NRZ code and the last bit NRZ code in the arbitrary two-bit NRZ code are the same;
a second determining subunit, configured to determine, when the first bit NRZ code and the last bit NRZ code in the arbitrary two-bit NRZ code are the same, to convert the arbitrary two-bit NRZ code into high-level differential man code data;
and a third determining subunit, configured to determine, when the first-bit NRZ code and the last-bit NRZ code in the arbitrary two-bit NRZ code are different, to convert the arbitrary two-bit NRZ code into low-level differential man code data.
In an alternative implementation, the last bit NRZ encoding of the first preamble data includes a high level or a low level.
A third aspect of the present application provides an encoded data processing apparatus comprising:
a memory for storing a coded data conversion program;
a processor for implementing the coded data processing method according to the first aspect as described above when executing the coded data conversion program.
A fourth aspect of the present application proposes a computer readable storage medium storing a computer program which, when executed by a processor, implements the encoded data processing method according to the first aspect described above.
Compared with the prior art, the beneficial effect that exists of this application first aspect is: after the obtained non-return-to-zero NRZ encoded data are determined to be effective signals, analyzing first leading data and effective encoded data from the non-return-to-zero NRZ encoded data, and converting the effective encoded data into differential Mannich data based on the first leading data and a preset data conversion rule; and further, the differential Mannich data can be acquired through a serial port, so that the signal state change rule can be more intuitively reflected in the data acquisition process. The encoded data can be directly compared for convenient application.
It will be appreciated that the advantages of the second to fourth aspects of the present application compared to the prior art are the same as those of the first aspect of the present application compared to the prior art, and will not be described here again.
Drawings
Fig. 1 is a schematic flow chart of an implementation of a method for converting encoded data according to a first embodiment of the present application;
fig. 2 is a schematic structural diagram of a coded data conversion device according to a second embodiment of the present application;
fig. 3 is a schematic structural diagram of a coded data conversion device according to a third embodiment of the present application.
Detailed Description
In order to make the technical problems, technical schemes and beneficial effects to be solved by the present application more clear, the present application is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application.
It should be understood that in the description of this application and the claims that follow, the terms "first," "second," "third," and the like are used merely to distinguish between descriptions and should not be construed as indicating or implying relative importance.
It should also be appreciated that references to "one embodiment" or "some embodiments" or the like described in this specification mean that a particular feature, structure, or characteristic described in connection with the embodiment is included in one or more embodiments of the present application. It should be further noted that, for convenience of description, only some, but not all of the matters related to the present invention are shown in the accompanying drawings. Before discussing exemplary embodiments in more detail, it should be mentioned that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although a flowchart depicts operations (or steps) as a sequential process, many of the operations can be performed in parallel, concurrently, or at the same time. Furthermore, the order of the operations may be rearranged. The process may be terminated when its operations are completed, but may have additional steps not included in the figures. The processes may correspond to methods, functions, procedures, subroutines, and the like.
Fig. 1 is a schematic flow chart of an implementation of a method for converting encoded data according to a first embodiment of the present application. The coded data conversion method provided by the present embodiment may be performed by a coded data conversion apparatus. The coded data conversion device may include, but is not limited to, a stand-alone server, a cloud server cluster, or a data analysis device in various application scenarios. The details are as follows:
s101, non-return-to-zero NRZ encoded data is acquired.
In an embodiment of the present application, the non-return-to-zero NRZ encoded data includes first preamble data and NRZ encoded data. The first front-end data is used for judging whether the non-return-to-zero NRZ encoded data is a valid signal or an invalid signal, and the non-return-to-zero NRZ encoded data comprises the valid signal or the invalid signal.
For example, the first preamble data is 0b0110011001100101, if the first preamble data is the same as the preset second preamble data, the NRZ encoded data is determined to be a valid signal, and if the first preamble data is not the same as the preset second preamble data, the NRZ encoded data is determined to be an invalid signal.
S102, judging whether the non-return-to-zero NRZ encoded data is a valid signal.
Specifically, in the embodiment of the present application, if the non-return-to-zero NRZ encoded data is a valid signal, the first preamble data and the valid encoded data are parsed from the non-return-to-zero NRZ encoded data.
Illustratively, determining whether the non-return-to-zero NRZ encoded data is a valid signal may include: and determining whether the non-return-to-zero NRZ encoded data is a valid signal according to a preset second preamble data and the first preamble data in the non-return-to-zero NRZ encoded data.
Specifically, whether the first leading data and the second leading data are identical or not is judged, if the first leading data and the second leading data are identical, the non-return-to-zero NRZ encoded data are determined to be effective signals, and the non-return-to-zero NRZ encoded data are analyzed to obtain the first leading data and the effective encoded data. The valid encoded data is NRZ encoded data following the first preamble data. And if the first leading data is different from the second leading data, determining that the non-return-to-zero NRZ encoded data is an invalid signal, and when the non-return-to-zero NRZ encoded data is the invalid signal, analyzing the non-return-to-zero NRZ encoded data is not needed.
S103, converting the effective coding data into differential Mannich data according to the first leading data and a preset data conversion rule.
Illustratively, the last bit NRZ encoding of the first preamble data includes a high level or a low level. In this embodiment, the converting the valid encoded data into the differential mann code data according to the first preamble data and a preset data conversion rule may include: according to the arrangement sequence of NRZ codes in the effective coding data, respectively and sequentially acquiring every two NRZ codes; and sequentially converting the obtained NRZ codes of every two bits into differential Mannich code data according to the first preamble data.
Specifically, the sequentially converting the obtained NRZ codes of every two bits into differential mann code data according to the first preamble data may include: comparing a first bit NRZ code in the arbitrary two-bit NRZ code with a last bit NRZ code in the first preamble data aiming at the selected arbitrary two-bit NRZ code; and determining to convert the random two-bit NRZ code into differential Mancode data with corresponding level according to the comparison result.
Further, determining differential Mannich data for converting the arbitrary two-bit NRZ code into corresponding levels according to the comparison result may include: if the first bit NRZ code and the last bit NRZ code are the same in the arbitrary two-bit NRZ code, determining to convert the arbitrary two-bit NRZ code into high-level differential Mancode data; if the first microNRZ code is different from the last bit NRZ code in the arbitrary two-bit NRZ code, determining that the arbitrary two-bit NRZ code is converted into low-level differential Mancode data.
For example, if the last NRZ code of the first preamble data is high level 1 and the first NRZ code of any two-bit NRZ codes is high level 1, the any two-bit NRZ codes are converted into high-level differential code data 1; and if the last bit NRZ code of the first leading data is high level 1 and the first bit NRZ code of any two bits NRZ codes is low level 0, converting the any two bits NRZ code into low level differential code data 0.
As can be seen from the above analysis, in the method for processing encoded data according to the embodiment of the present application, after determining that the obtained NRZ encoded data with non-return to zero is an effective signal, the first preamble data and the effective encoded data are parsed from the NRZ encoded data with non-return to zero, and the effective encoded data are converted into differential mann code data based on the first preamble data and a preset data conversion rule; and further, the differential Mannich data can be acquired through a serial port, so that the signal state change rule can be more intuitively reflected in the data acquisition process. The encoded data can be directly compared for convenient application.
It should be understood that the sequence number of each step in the foregoing embodiment does not mean that the execution sequence of each process should be determined by the function and the internal logic of each process, and should not limit the implementation process of the embodiment of the present application in any way.
Based on the method for converting encoded data provided by the above embodiment, the embodiment of the present invention further provides an embodiment of a device for implementing the above method embodiment.
Fig. 2 is a schematic diagram of an encoded data processing apparatus according to a second embodiment of the present application, as shown in fig. 2. The modules included are for performing the steps in the embodiment of fig. 1. Refer specifically to the description of the corresponding embodiment in fig. 1. For convenience of explanation, only the portions related to the present embodiment are shown. Referring to fig. 2, the coded data processing apparatus 200 includes:
an acquisition module 201, configured to acquire NRZ encoded data that is not return to zero;
a judging module 202, configured to judge whether the NRZ encoded data is a valid signal;
a parsing module 203, configured to parse the first preamble data and the valid encoded data from the non-return-to-zero NRZ encoded data when the non-return-to-zero NRZ encoded data is a valid signal;
the conversion module 204 is configured to convert the valid encoded data into differential mann code data according to the first preamble data and a preset data conversion rule.
In an alternative implementation, the determining module 202 is specifically configured to:
and determining whether the non-return-to-zero NRZ encoded data is a valid signal according to a preset second preamble data and the first preamble data in the non-return-to-zero NRZ encoded data.
In an alternative implementation manner, the judging module includes:
a first judging unit configured to judge whether the first preamble data and the second preamble data are identical;
a first determining unit, configured to determine that the non-return-to-zero NRZ encoded data is a valid signal when the first preamble data and the second preamble data are the same;
and the second determining unit is used for determining that the non-return-to-zero NRZ encoded data is an invalid signal when the first leading data is different from the second leading data.
In an alternative implementation, the conversion module 204 includes:
an obtaining unit, configured to obtain NRZ codes of every two bits in sequence according to an arrangement sequence of NRZ codes in the valid code data;
and the conversion unit is used for sequentially converting the obtained NRZ codes of every two bits into differential Mannich data according to the first leading data.
In an alternative implementation, the conversion unit includes:
a comparing subunit, configured to compare, for a selected arbitrary two-bit NRZ code, a first-bit NRZ code in the arbitrary two-bit NRZ code with a last-bit NRZ code in the first preamble data;
and the first determining subunit is used for determining the difference Mancode data for converting the random two-bit NRZ code into the corresponding level according to the comparison result.
In an alternative implementation, the determining subunit includes:
a judging subunit, configured to judge that the first bit NRZ code and the last bit NRZ code in the arbitrary two-bit NRZ code are the same, and determine to convert the arbitrary two-bit NRZ code into high-level differential man code data;
a second determining subunit, configured to determine, when the first bit NRZ code and the last bit NRZ code in the arbitrary two-bit NRZ code are the same, to convert the arbitrary two-bit NRZ code into high-level differential man code data;
and a third determining subunit, configured to determine, when the first-bit NRZ code and the last-bit NRZ code in the arbitrary two-bit NRZ code are different, to convert the arbitrary two-bit NRZ code into low-level differential man code data.
In an alternative implementation, the last bit NRZ encoding of the first preamble data includes a high level or a low level.
It should be noted that, because the content of information interaction and execution process between the modules is based on the same concept as the method embodiment shown in fig. 1 of the present application, specific functions and technical effects thereof may be found in the method embodiment section, and details are not repeated here.
Fig. 3 is a schematic diagram of an encoded data processing apparatus according to a fourth embodiment of the present application. As shown in fig. 3, the coded data processing apparatus 3 of this embodiment includes: a processor 30, a memory 31 and a computer program 32, such as an encoded data processing program, stored in the memory 31 and executable on the processor 30. The steps of the method embodiment described above with respect to fig. 1 are implemented by the processor 30 when executing the computer program 32. Alternatively, the processor 30 may execute the computer program 32 by performing the functions of the modules 201 to 204 described above with respect to fig. 2.
By way of example, the computer program 32 may be partitioned into one or more modules/units that are stored in the memory 31 and executed by the processor 30 to complete the present application. The one or more modules/units may be a series of computer program instruction segments capable of performing the specified functions for describing the execution of the computer program 32 in the coded data processing device 3. For example, the computer program 32 may be divided into an acquisition module, a judgment module, an analysis module, and a conversion module (module in the virtual device), each of which specifically functions as follows:
the acquisition module is used for acquiring non-return-to-zero NRZ encoded data;
the judging module is used for judging whether the non-return-to-zero NRZ encoded data is a valid signal or not;
the analysis module is used for analyzing the first leading data and the effective coding data from the non-return-to-zero NRZ coding data when the non-return-to-zero NRZ coding data is an effective signal;
and the conversion module is used for converting the effective coding data into differential Mancode data according to the first leading data and a preset data conversion rule.
The coded data processing device 3 may include, but is not limited to, a processor 30, a memory 31. It will be appreciated by those skilled in the art that fig. 3 is merely an example of the coded data processing device 3 and does not constitute a limitation of the coded data processing device 3, and may include more or less components than illustrated, or may combine certain components, or different components, e.g. the vehicle may further include input and output devices, network access devices, buses, etc.
The processor 30 may be a central processing unit (Central Processing Unit, CPU), but may also be other general purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), off-the-shelf programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory 31 may be an internal storage unit of the encoding data processing apparatus 3, for example a hard disk or a memory of the encoding data processing apparatus 3. The memory 31 may also be an external storage device of the coded data processing device 3, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card) or the like, which are provided on the coded data processing device 3. Further, the memory 31 may also include both an internal storage unit and an external storage device of the coded data processing device 3. The memory 31 is used for storing the computer program and other programs and data required by the coded data processing device 3. The memory 31 may also be used for temporarily storing data that has been output or is to be output.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-described division of the functional units and modules is illustrated, and in practical application, the above-described functional distribution may be performed by different functional units and modules according to needs, i.e. the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-described functions. The functional units and modules in the embodiment can be integrated in one processing unit, or each unit can exist alone physically, or two or more units can be integrated in one unit, and the integrated units can be realized in a form of hardware or a form of a software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working process of the units and modules in the above system may refer to the corresponding process in the foregoing method embodiment, which is not described herein again.
In the foregoing embodiments, the descriptions of the embodiments are emphasized, and in part, not described or illustrated in any particular embodiment, reference is made to the related descriptions of other embodiments.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus/terminal device and method may be implemented in other manners. For example, the apparatus/terminal device embodiments described above are merely illustrative, e.g., the division of the modules or units is merely a logical function division, and there may be additional divisions in actual implementation, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection via interfaces, devices or units, which may be in electrical, mechanical or other forms.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated modules/units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the present application may implement all or part of the flow of the method of the above embodiment, or may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, and when the computer program is executed by a processor, the computer program may implement the steps of each method embodiment described above. . Wherein the computer program comprises computer program code which may be in source code form, object code form, executable file or some intermediate form etc. The computer readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), an electrical carrier signal, a telecommunications signal, a software distribution medium, and so forth. It should be noted that the computer readable medium contains content that can be appropriately scaled according to the requirements of jurisdictions in which such content is subject to legislation and patent practice, such as in certain jurisdictions in which such content is subject to legislation and patent practice, the computer readable medium does not include electrical carrier signals and telecommunication signals.
The above embodiments are only for illustrating the technical solution of the present application, and are not limiting; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application, and are intended to be included in the scope of the present application.

Claims (5)

1. A method of processing encoded data, comprising:
acquiring non-return-to-zero NRZ encoded data;
judging whether the non-return-to-zero NRZ encoded data is a valid signal or not;
if yes, analyzing first leading data and effective coding data from the non-return-to-zero NRZ coding data;
converting the effective coding data into differential Mannich data according to the first leading data and a preset data conversion rule;
the judging whether the non-return-to-zero NRZ encoded data is a valid signal specifically comprises:
determining whether the non-return-to-zero NRZ encoded data is a valid signal according to a preset second preamble data and the first preamble data in the non-return-to-zero NRZ encoded data;
the determining whether the non-return-to-zero NRZ encoded data is a valid signal according to a preset second preamble data and the first preamble data in the non-return-to-zero NRZ encoded data includes:
judging whether the first leading data and the second leading data are the same or not;
if yes, determining the non-return-to-zero NRZ encoded data as a valid signal;
if not, determining that the non-return-to-zero NRZ encoded data is an invalid signal;
the effective coding data is converted into differential Mannich data according to the first leading data and a preset data conversion rule, and the method comprises the following steps:
according to the arrangement sequence of NRZ codes in the effective coding data, respectively and sequentially acquiring every two NRZ codes;
sequentially converting the obtained NRZ codes of every two bits into differential Mannich data according to the first preamble data;
according to the first preamble data, sequentially converting the obtained NRZ codes of every two bits into differential Mannich data respectively, wherein the method comprises the following steps:
comparing a first bit NRZ code in the arbitrary two-bit NRZ code with a last bit NRZ code in the first preamble data aiming at the selected arbitrary two-bit NRZ code;
according to the comparison result, determining to convert the random two-bit NRZ code into differential Mancode data with corresponding level;
according to the comparison result, determining the differential Mancode data for converting the random two-bit NRZ code into the corresponding level, comprising:
judging whether the first bit NRZ code and the last bit NRZ code in the arbitrary two-bit NRZ code are the same or not;
if the two bit NRZ codes are the same, determining to convert the arbitrary two bit NRZ codes into high-level differential Mancode data;
if not, determining to convert the arbitrary two-bit NRZ code into low-level differential Mancode data.
2. The method of claim 1, wherein the last bit NRZ encoding of the first preamble data comprises a high level or a low level.
3. An encoded data processing apparatus, comprising:
the acquisition module is used for acquiring non-return-to-zero NRZ encoded data;
the judging module is used for judging whether the non-return-to-zero NRZ encoded data is a valid signal or not;
the analysis module is used for analyzing the first leading data and the effective coding data from the non-return-to-zero NRZ coding data when the non-return-to-zero NRZ coding data is an effective signal;
the conversion module is used for converting the effective coding data into differential Mannich data according to the first leading data and a preset data conversion rule;
the judging module is specifically configured to:
determining whether the non-return-to-zero NRZ encoded data is a valid signal according to a preset second preamble data and the first preamble data in the non-return-to-zero NRZ encoded data;
the judging module comprises:
a first judging unit configured to judge whether the first preamble data and the second preamble data are identical;
a first determining unit, configured to determine that the non-return-to-zero NRZ encoded data is a valid signal when the first preamble data and the second preamble data are the same;
a second determining unit configured to determine that the non-return-to-zero NRZ encoded data is an invalid signal if the first preamble data is not identical to the second preamble data;
the conversion module comprises:
an obtaining unit, configured to obtain NRZ codes of every two bits in sequence according to an arrangement sequence of NRZ codes in the valid code data;
the conversion unit is used for sequentially converting the obtained NRZ codes of every two bits into differential Mannich code data according to the first preamble data;
the conversion unit includes:
a comparing subunit, configured to compare, for a selected arbitrary two-bit NRZ code, a first-bit NRZ code in the arbitrary two-bit NRZ code with a last-bit NRZ code in the first preamble data;
the first determining subunit is used for determining that the random two-bit NRZ codes are converted into differential Mancode data with corresponding levels according to the comparison result;
the determining subunit includes:
a judging subunit, configured to judge that the first bit NRZ code and the last bit NRZ code in the arbitrary two-bit NRZ code are the same, and determine to convert the arbitrary two-bit NRZ code into high-level differential man code data;
a second determining subunit, configured to determine, when the first bit NRZ code and the last bit NRZ code in the arbitrary two-bit NRZ code are the same, to convert the arbitrary two-bit NRZ code into high-level differential man code data;
and a third determining subunit, configured to determine, when the first-bit NRZ code and the last-bit NRZ code in the arbitrary two-bit NRZ code are different, to convert the arbitrary two-bit NRZ code into low-level differential man code data.
4. A coded data conversion device, comprising:
a memory for storing a coded data conversion program;
a processor for implementing the coded data conversion method according to claim 1 or 2 when executing the coded data conversion program.
5. A computer readable storage medium storing a computer program, characterized in that the computer program when executed by a processor implements the coded data conversion method according to claim 1 or 2.
CN202011566437.3A 2020-12-25 2020-12-25 Method, device, equipment and storage medium for processing coded data Active CN112702068B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011566437.3A CN112702068B (en) 2020-12-25 2020-12-25 Method, device, equipment and storage medium for processing coded data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011566437.3A CN112702068B (en) 2020-12-25 2020-12-25 Method, device, equipment and storage medium for processing coded data

Publications (2)

Publication Number Publication Date
CN112702068A CN112702068A (en) 2021-04-23
CN112702068B true CN112702068B (en) 2024-04-02

Family

ID=75510844

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011566437.3A Active CN112702068B (en) 2020-12-25 2020-12-25 Method, device, equipment and storage medium for processing coded data

Country Status (1)

Country Link
CN (1) CN112702068B (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6320900B1 (en) * 1998-10-30 2001-11-20 Compaq Computer Corporation Methods and arrangements for transmitting high speed data over reduced bandwidth communication resources
WO2004111718A1 (en) * 2003-06-16 2004-12-23 Danmarks Tekniske Universitet Mach-zehnder electro-optical modulator configured to perform xor operation
JP2006262454A (en) * 2005-02-18 2006-09-28 Matsushita Electric Ind Co Ltd Clock reproducing method and manchester decoding method
JP2011061525A (en) * 2009-09-10 2011-03-24 Renesas Electronics Corp Receiver and semiconductor device based on asynchronous communication using manchester code
CN201839287U (en) * 2010-10-18 2011-05-18 天津光电通信技术有限公司 Remote transmission circuit for asynchronous serial data
CN102394655A (en) * 2011-10-31 2012-03-28 中国兵器工业集团第二一四研究所苏州研发中心 Manchester code converting method on MIC bus
CN105389865A (en) * 2014-09-05 2016-03-09 深圳光启智能光子技术有限公司 Digital signal sending method capable of shortening sending time, digital signal receiving method and mobile terminal
CN107302361A (en) * 2014-03-06 2017-10-27 深圳市道通科技股份有限公司 General TPMS data encoding formaies conversion method and device

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011041059A (en) * 2009-08-12 2011-02-24 Sony Corp Encoding device, information processing device, encoding method, and data transmission method
US9031413B2 (en) * 2012-07-12 2015-05-12 Massachusetts Institute Of Technology Underwater optical communication system

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6320900B1 (en) * 1998-10-30 2001-11-20 Compaq Computer Corporation Methods and arrangements for transmitting high speed data over reduced bandwidth communication resources
WO2004111718A1 (en) * 2003-06-16 2004-12-23 Danmarks Tekniske Universitet Mach-zehnder electro-optical modulator configured to perform xor operation
JP2006262454A (en) * 2005-02-18 2006-09-28 Matsushita Electric Ind Co Ltd Clock reproducing method and manchester decoding method
JP2011061525A (en) * 2009-09-10 2011-03-24 Renesas Electronics Corp Receiver and semiconductor device based on asynchronous communication using manchester code
CN201839287U (en) * 2010-10-18 2011-05-18 天津光电通信技术有限公司 Remote transmission circuit for asynchronous serial data
CN102394655A (en) * 2011-10-31 2012-03-28 中国兵器工业集团第二一四研究所苏州研发中心 Manchester code converting method on MIC bus
CN107302361A (en) * 2014-03-06 2017-10-27 深圳市道通科技股份有限公司 General TPMS data encoding formaies conversion method and device
CN105389865A (en) * 2014-09-05 2016-03-09 深圳光启智能光子技术有限公司 Digital signal sending method capable of shortening sending time, digital signal receiving method and mobile terminal

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
Investigation of XOR operation in all-optical system with NRZ, RZ and Manchestermodulation formats;Lingzhi Ge;《2009 Asia Communications and Photonics conference and Exhibition (ACP)》;第1-6页 *
基于CPLD的曼彻斯特编码技术;王奇;《微型机与应用》;第39-42页 *
张向文,王飞跃著.《智能轮胎》.机械工业出版社,2019,第466-481页. *

Also Published As

Publication number Publication date
CN112702068A (en) 2021-04-23

Similar Documents

Publication Publication Date Title
CN110609693B (en) Code updating method and device based on data standardization and terminal equipment
CN109814524B (en) Vehicle diagnosis method, device and system
CN113127338A (en) Firmware testing method, server and computer readable storage medium
CN110474711B (en) Encoding method, apparatus and readable storage medium
CN110474709B (en) Encoding method, apparatus and readable storage medium
CN108768587B (en) Encoding method, apparatus and readable storage medium
CN112147983B (en) Vehicle diagnosis method and device, electronic equipment and storage medium
CN112346775B (en) Index data general processing method, electronic device and storage medium
CN112702068B (en) Method, device, equipment and storage medium for processing coded data
CN111460098A (en) Text matching method and device and terminal equipment
CN110474710B (en) Encoding method, apparatus and readable storage medium
CN112732982A (en) Fault code storage method and device, terminal equipment and readable storage medium
CN111143092B (en) Fault recording data processing method, system and terminal equipment
CN1364341A (en) Arithmetic decoding of arithmeticlaly encoded information signal
CN112712610B (en) Vehicle diagnosis log processing method and device, terminal equipment and readable storage medium
CN113395327B (en) Data processing method, device, electronic equipment and medium
CN112711584A (en) Data checking method, checking device, terminal equipment and readable storage medium
CN109309548B (en) Encoding method, apparatus and readable storage medium
CN110797082A (en) Method and system for storing and reading gene sequencing data
CN117221049B (en) Gateway data intelligent acquisition method and system
CN112486885B (en) Data frame generation method, storage medium and computer equipment
CN113918095B (en) Hybrid cross storage method and device for data and electronic equipment
CN109597813B (en) Vehicle data processing method and device
CN114302425B (en) Equipment network distribution method and device, storage medium and electronic equipment
CN116156442A (en) Automatic auditing and completing method and system for ultralong ticket

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant