CN1943154A - Error treatment during data transmission via a communication system - Google Patents
Error treatment during data transmission via a communication system Download PDFInfo
- Publication number
- CN1943154A CN1943154A CN 200580012103 CN200580012103A CN1943154A CN 1943154 A CN1943154 A CN 1943154A CN 200580012103 CN200580012103 CN 200580012103 CN 200580012103 A CN200580012103 A CN 200580012103A CN 1943154 A CN1943154 A CN 1943154A
- Authority
- CN
- China
- Prior art keywords
- code
- word
- data
- data word
- distance
- 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.)
- Pending
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 59
- 238000004891 communication Methods 0.000 title claims abstract description 23
- 238000000034 method Methods 0.000 claims abstract description 24
- 230000009182 swimming Effects 0.000 claims description 34
- 108091029480 NONCODE Proteins 0.000 claims description 31
- 238000012937 correction Methods 0.000 claims description 24
- 238000012545 processing Methods 0.000 claims description 11
- 230000033228 biological regulation Effects 0.000 claims description 7
- 238000004590 computer program Methods 0.000 claims description 7
- 239000012141 concentrate Substances 0.000 claims description 2
- 230000001965 increasing effect Effects 0.000 description 20
- 230000008859 change Effects 0.000 description 16
- 230000003247 decreasing effect Effects 0.000 description 13
- 238000006243 chemical reaction Methods 0.000 description 9
- 230000001360 synchronised effect Effects 0.000 description 9
- 230000002349 favourable effect Effects 0.000 description 8
- 101000909637 Homo sapiens Transcription factor COE1 Proteins 0.000 description 7
- 102100024207 Transcription factor COE1 Human genes 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 238000011084 recovery Methods 0.000 description 5
- 238000001228 spectrum Methods 0.000 description 4
- 238000012546 transfer Methods 0.000 description 4
- 230000007704 transition Effects 0.000 description 4
- 101000909641 Homo sapiens Transcription factor COE2 Proteins 0.000 description 3
- 102100024204 Transcription factor COE2 Human genes 0.000 description 3
- 230000008901 benefit Effects 0.000 description 3
- 230000003111 delayed effect Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000009897 systematic effect Effects 0.000 description 3
- 230000003044 adaptive effect Effects 0.000 description 2
- 230000006399 behavior Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000005611 electricity Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000011664 signaling Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000010355 oscillation Effects 0.000 description 1
- 230000005855 radiation Effects 0.000 description 1
- 238000012958 reprocessing Methods 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 230000005236 sound signal Effects 0.000 description 1
Images
Landscapes
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
Disclosed is a method and device for carrying out error treatment during transmission of coded data in the form of at least one data word via a communication system (900, 901, 902). According to the invention, a code word is selected for the at least one data word using a predetermined coding rule. The data are represented as bits that can take two different values, namely one or zero. At least one current digital sum is produced in such a manner that a summed up difference (907) of the total of ones and the total of zeros is produced at least for the code data word and that this current digital sum (901) is transmitted, the current digital sum for the subsequent code data word is determined and compared with the subsequent transmitted current digital sum, and an error is detected if there is a deviation.
Description
Technical field
The present invention from according to the preamble of claim, be used for carrying out the method and apparatus of fault processing and corresponding user and the corresponding computer programs and the computer program of this communication system at least when having the coded data of two at least one data word forms of user's communications system transmissions.
Background technology
The code that is used for by communication system, the particularly transfer of data by universal serial bus differs from one another according to the requirement and the EMV characteristic value of transmission medium, bit rate and clock recovery.For with the highest 25Mbits/s transmission data, for example in the MOST system, be provided with optical transmission, so that guarantee the EMV compatibility.Yet electrical to optical converter is very expensive in the case, and employed plastic fiber has specific (special) requirements to the wiring in the vehicle body.For this purpose, signal is encoded according to two-phase marc sign indicating number (dual-frequency code) in the MOST bus.At this, each information bit is represented by two code bits.If two code bits have identical value, then this is corresponding to the value 0 of information bit.Different value by code bit represents 1.In addition, do not rely on the value of information and always carry out the level switching according to two code bits:
Code bit 00 10 10 11 00 11 01 01 ..
Information bit 01100011 ...
At this, code is compared with useful position has 100% redundancy.If but by the such code sequence of circuit transmission, then because the high EMV radiation corresponding to bit rate (under a plurality of 0 situation preferably) and double bit rate (under a plurality of 1 situation preferably) appears in the change of frequent level.Transition between 1 and 0 also obtains other frequency values, but two main frequencies is obviously decayed in frequency spectrum.This realizes thus, because because coding rule boundary on the throne always requires level to switch.If do not having under the redundant situation, promptly transmitting data, for example can represent yet (0x0 corresponding to Binary Zero 000 and 0xF corresponding to binary one 111) with hexadecimal code with binary coding with value 1,2,4,8 or the like, then has such shortcoming, promptly must unnecessarily exist level to switch (being 0x0 or 0xF constantly) on the one hand, perhaps as long as continue to send 0x5 or 0xA, these data are just to occur to top frequency similar under the situation of each.Yet because in this nonexistent code redundancy, but all positions all are information bits, so transmission frequency can be reduced to the value of half.Yet this thus employed code can not be no direct current, and the possibility by PLL (phase-locked loop) recovered clock is not provided simultaneously, because there is not the maximum number of digits of being scheduled to that does not have level to switch.All n bit synchronization (Einsynchronisierung) needs level to switch to PLL in order to make at least.Thus, this code demonstrates the shortcoming that some are not expected as described just now.
These shortcomings can be partly as for example in " the A new 8B10B Blockcode for HighSpeed Data Transmission Over Unshielded Twisted PairChannels " that shown by Alistair Coles that in October, 1996, Hewlett Packard published by using known block code to avoid.In the case, code redundancy is 25%, because replace 10 code bits of 8 information bit transmission.This code on average is no direct current because according to compare with 01 the number that transmitted (distance of swimming numeral and-RDS), code word is transmitted with counter-rotating or nonreversible mode.The maximum number (maximum run length MRL) of identical code place value is 17.Can also connect the PLL that is used for clock recovery in principle thus, yet wherein become significantly longer in this stability high requirement and starting of oscillation time of proposition to PLL.
The particular disadvantages of block code is that it is not systematic code and does not have coding rule thus as for example under the situation with the heuristicimal code that distributes according to the value of its position the respective code position.
This particularly works in the realization of incrementor or comparator, because at first particularly under the situation of incrementor, must receive whole code word, code value must be definite by decoding by form, and at the code value that increases by 1, generate corresponding code word by form, this code word just can be issued again under by synchronous situation by at least one trigger subsequently.At above mentioned block code, produce the delay of at least 11 beats thus; In synchronous RAM under the situation of storage code table even the delay that produces at least 13 beats.
All do not demonstrating best characteristic aspect each as described just now, mentioned prior art.
Summary of the invention
The summation of following feature particularly, be that employed code should be no direct current, and because required clock recovery, should comprise common edge, and the possibility that increases progressively continuously should be provided, so that the simple increment by specific control byte produces the network site of node and transmits under the situation that does not have big delay.At this, what be worth expectation especially is, finds a kind of electricity solution, and it has obviously littler cost, promptly just particularly needn't shield and can be used in the scope of EMV compatibility.
At this, the code that the intensity of should be according to intensity, particularly correcting possibility is used in fault processing, promptly be used for wrong identification and/or error correcting is equipped with different code redundancies, and this code redundancy makes it possible to code word and non-code word or non-code data block are separated.So, the code word that non-code word is so just, this code word is encoded less than the coding rule according to the coding that is set for data and can separates with these data fields.Little Hamming distance from, be the non-code word that received or non-code data word with the situation of the mistake distance of what a code data word just under, different code redundancies makes it possible to infer and relates to relevant code data word that this code data word is for example being made mistakes in a position in span line.The prerequisite of correcting possibility is, if should identify single-bit error, then all code words have each other be at least 2 Hamming distance from, and if should correct single-bit error, then have be at least 3 Hamming distance from.At this, if having a plurality of codifiabilities for a data word, promptly condition or this or the other code data word according to other is sent out, and it is more and more difficult then to observe this condition.
Under constant code redundancy situation, when using a plurality of code data word, Hamming distance is from correspondingly becoming littler.When for example code must on average be no direct current, as already mentioned, need alternately send different code words.This is essential under the situation of transmitting possibility by the difference of different transmission mediums (electricity, light) for example and is possible.Allow subsequently at this, in order to realize not having direct current, just at the code data word that sends the counter-rotating of real code data word conditionally by data being expressed as position (1 or 0) during balanced better 1 and 0 the number that is sent so far.In the situation of the code that does not have direct current fully, 1 and 0 the number that is sent should be assigned to respectively 50%.When the place value that sent so far of record poor, when promptly particularly forming the distance of swimming and (laufende Summe), this on average utilizes according to the code word that replaces of the present invention, particularly utilize code word 1 and realize with respect to the code word 2 of its counter-rotating.If sent more 1 so far, then select to have more 0 code data word, perhaps opposite.
Now in order to realize having the code identification of code corrects subsequently, two need at least between the code data word arbitrarily be 3 Hamming distance from.Its prerequisite is, in code space, has 2n non-code data word available for n (n among the N) possible code word.If should transmit m data word (m among the N) now, then n must equal 2m at least, selects so that can realize the code that substitutes.Therefore 2m code data word and a 2 * 2m non-code data word must be set in code space equally, 6m code data word and non-code data word promptly are set like this, make always to guarantee that two Hamming distances between the code data word are from 3.If now for the coding of data word, promptly for produce have the k position (k among the N) the code data word and additionally 3 positions are used for coding, then obtain such possibility in theory, promptly 2
(k+3)Satisfy these conditions in the code space.Therefore, for having 4 data word, need 75% code redundancy (3) at least.
Yet in the enforcement of reality, often because additional at coding, as for example failing at the boundary condition of the coding that meets the EMV requirement that in the code data word or on code data word boundary, has the least possible position switchings/level switching.Can also improve code redundancy thus.Also the control routine word will be increased in the code data word in case of necessity, these control routine words are carried out special function and are not allowed to obscure with the code data word.Therefore, particularly under the situation of short data word, the code with 100% code redundancy is employed equally.
Shortcoming that elaborate subsequently, that continue this idea, can avoid above mentioned prior art according to solution of the present invention, and a part that is at least data at the same time under the situation of obviously littler expense simultaneously provides desired characteristic, promptly particularly realize desired can be given in advance Hamming distance from.
For average no direct current ground transmits, exist according to rule of the present invention, this rule predetermining is in transmitter, the particularly selection of the code data word in first user.When receiver, when particularly second user advantageously has the information identical with transmitter, it also can judge whether must carry out the counter-rotating of code data word.For this reason, only need notify receiver according to the present invention, transmitter has carried out this coding under which condition.If starting point is that because receiver has been lost a part of data under the situation that just connected afterwards under the situation of transmission continuously or disturbing, so receiver does not receive all data of transmitter, then the recipient will not have this information.
Therefore core of the present invention is particularly to transmit the possibility of this information except these data by non-code data word.
Usually need so non-code data word, so that for example identify the beginning of transmission or the type of differentiation data subsequently, and the synchronous possibility of receiver that under the situation of transmission continuously, also can realize making new interpolation.Therefore for example there is such bus system, i.e. communication system, wherein data are organized in so-called frame, and these frames begin with preamble (Praeambel).These preambles must be different with the code data word.When coding standard when being known for receiver, this receiver no longer needs all code data words are all included in the wrong identification of necessity or error correcting, but only also needs half.Can reasonably between the code word that stays, follow better thus desired Hamming distance from, and need not to improve code redundancy.
Thus, the present invention is advantageously from being used in the method for carrying out fault processing at least when having the coded data of two at least one data word forms of user's communications system transmissions, wherein at least one data word, according to selecting the code data word by coding rule given in advance, wherein these data are represented as and a plurality ofly can get two different values, i.e. 1 and 0 position.Meet the destination, this form like this distance of swimming numeral and, be so-called running digitalsum RDS, make that at least to form the accumulative total of sum of 1 sum and 0 by this code data word poor and this distance of swimming numeral and RDS transferred to second user from first user, wherein second user determine first user code data word subsequently distance of swimming numeral and, and with the distance of swimming transmitted subsequently numeral with compare, wherein under situation devious, identify mistake.The distance of swimming numeral of being transmitted is in addition upgraded with being stored in the receiver and with the data word that each was received, promptly based on former distance of swimming numeral and and 1 and 0 number of the data word that received just now, according to each data word recomputate distance of swimming numeral and.As long as in transmission, do not make a mistake, then in receiver, on each position of data word, now all just in time there is identical information, wherein transmitter has this information when this data word is encoded according to coding rule.Can check each code data word now, the selection of this code word is reasonably, perhaps whether needn't use the code data word of counter-rotating under existence conditions.In order to check reasonability, not only consider the digital distance of swimming and, but also consider, whether should carry out level according to coding rule at the section start of the code word that is received and switch (PV) and whether carry out this level and switch (PE) at the code word of equilibrium.Promptly advantageously current code data word is decision making according to current distance of swimming numeral and rds and coding rule.By transmission and the renewal that continues, this RDS value is for receiver, promptly particularly second user is known, in this way, so the selection of possible code data word can be restricted to only about half of.Therefore regulation is advantageously particularly periodically transmitted RDS, and in receiver, promptly particularly in second user, further calculate, up to upgrade next time based on this RDS.According to the present invention, subsequently can be by the correctness that the RDS value of new reception is confirmed code data word so far or the data of having carried out are corrected, perhaps identification error under situation devious in case of necessity.
Reasonably, except coded data, at least one non-code data word of transmission between first user and at least the second user also, this non-code data word be according to can being encoded by coding rule given in advance, and distance of swimming numeral and being transmitted as the part of non-code data word at least.
At this, reasonably, as already mentioned above, select to correspond respectively to first or the code word or the code data word of second code data word according to coding rule that can be given in advance, this first or the second code data word be the code data word that relative to each other reverses.
Advantageously, according to coding rule that can be given in advance from a plurality of, promptly at least two different code data words are concentrated and are selected these code data words.
Advantageously, generate user's rub-out signal when identifying mistake, this user has identified this mistake and this rub-out signal is transferred to such user at least, and this mistake is transmitted from this user.
Reasonably, when identifying mistake, abandon vicious data, and the user of transmitting these data receives the request signal that resends these data as wrong reaction.
In addition advantageously, at least one non-code data word of transmission between first user and at least the second user also except coded data, this non-code data word are according to can coding rule given in advance being encoded and distance of swimming numeral and also forming by non-code data word.
Reasonably carry out wrong correction in addition in the following manner according to the present invention, promptly according to distance of swimming numeral and, be that RDS redefines RDS subsequently, and replace vicious data in view of the above.
Advantageously the strategy that is used for fault processing according to the number of mistake is predesignated.At this, except error correcting, strategy can also be stipulated, under prerequisite that can be given in advance, do not carry out error correcting or carry out wrong correction in the following manner like this, be that vicious data word uses the data word of the defined of determining to substitute, perhaps from the possible correction of data word that under considering the situation of RDS, satisfies coding rule, be to select the correction of data word determined the set of data word, this correction of data word replaces being identified as the vicious data word that receives subsequently and is used further.
Particularly advantageously be, in the computer program of the program code on having the data medium of being stored in or the scope of computer program the method according to this invention is described, wherein when program was performed in the communication system of computer support as mentioned above, this method was implemented.At this,, can use any possible data medium, for example ROM, CD-ROM, EPROM, EEPROM, Flash-EPROM, PROM, DVD, floppy disk, RAM or the like as the data medium of computer program.The selection that is data medium depends on computer system, and wherein this method should be moved in this computer system, but the present invention is not had fully the effect of restriction.
Additional advantage and favourable expansion scheme draw from specification and in the feature of claim.
Description of drawings
Set forth the present invention in more detail by figure shown in the accompanying drawing and form below.Wherein:
Fig. 1 illustrates has the user's communications system.
Fig. 1 a illustrates a kind of according to the assigned code maker that has according to regular 1b of the present invention.
The schematically illustrated input code of Fig. 2 b is by the conversion of the code generator that is constructed to demultiplier to output code.
Fig. 3 a illustrate equally by demultiplier at this particularly according to the conversion of regular 5b.
Fig. 2,2a, 3 and 4 and the schematically illustrated input code of 4a by code generator (Fig. 2), decoder-" opposite " with the direction of arrow, be EC2a corresponding to AC2 and AC2a corresponding to EC2 (Fig. 2 a), incrementor (Fig. 3) or comparator (Fig. 4) and have comparator and (Fig. 4 is a) to the conversion of output code in the ruling unit of adapter unit.
Figure 5 illustrates according to continuous incrementor of the present invention.
Fig. 6 illustrates according to continuous comparator of the present invention.
Fig. 7 illustrates as the interface of communication system or leads to the serial transmitter of the interface of communication system.
Figure 8 illustrates corresponding serial receiver.
Fig. 9 once more the code generator that has code data word alternately shown in Fig. 9 a and the 9b and code data word by span line transmission and have decoder and from RDS, regain the respective receiver of additional information.
Figure 10 illustrates the example of the frame of the present invention with different preambles.
Figure 11 illustrates the decoder that has according to the error correcting of strategy that can be given in advance and matching capacity at last once more.
Table 12 illustrates the example that is used in the code corrects rule of the situation lower part of little code redundancy correction.
Set forth the present invention in more detail by embodiment below.
Embodiment
At this, Fig. 1 illustrate have input interface 110,108 and 112, be receiver or receiver module and have output interface 109,107,111, be communicating by letter or bus system 100 of transmitter or sending module.Utilize these transmitters and receiver, user 101,102 and 103 is connected to each other by communication system 100.Show a processing unit with 106, the function of this processing unit run time version generation and/or decoding and/or increasing or decreasing and/or comparison or ruling according to the present invention.Show in the unit of communication system 100 outsides with 104, this unit unidirectional or two-wayly by interface 105 with the user, particularly be connected this user 101.Other equipment, unit or the element of these external unit 104 representatives passes through the connection to each user of interface or bus or communication system.
In the case now should by universal serial bus, promptly particularly particularly increase progressively according to the transmission of the dotted line under the transfer encoding data conditions arrow during communication system 100 transmission data or ruling, also compare.But equally also can data be inputed to user 101 and subsequently these data are encoded by the user 104 of outside, for example be transmitted to user 103 according to dotted arrow again, perhaps receive the user 104 that user 102 gives user 101 coded data and subsequently these data is transmitted to the outside in the mode of decoding at this.Yet especially should be just with increase progressively, successively decrease or situation that comparison or ruling are included under on communication system 100, at this for example from user 102 to the user 101 and carry out the forwarding of coded data to user 103 subsequently.
Under the situation that dual-frequency code is used to encode, if for example at first transmit data word the minimum position, be LSB (least significant bit), then in order to increase progressively the delay that only needs 2 beats continuously.At this, only need know which value the code place value of current reception and former code place value have, so that determine the value of corresponding positions that will send, that promptly will transmit.
Propose according to the present invention now, carry out the coding (rule 1) of two information bits in the following manner with three code bits:
Information bit code place value is distributed (decimal system/hexadecimal)
00 000 0
01 100 1
10 110 2
11 111 3
Here realize that with 50% code redundancy code word 010 and 101 is avoided thus, reduce the influence of the high spectrum part in the code word thus.Value 2
1Or 2
0Be assigned to the information bit on the left side, and the weight of all code bits all is 2
0In order to distinguish each position in the code, use nomenclature 2 from left to right according to rule 2,3 and 4 subsequently here
0 (3), 2
0 (2)Or 2
0 (1)Provide a kind of coding rule of system thus, this rule also works from any other code.If for example have one-hot coding, then 4 code words 0001,0010,0100 and 1000 equally can the value of being assigned to 0,1,2 and 3, as under the situation of Gray code 00,01,11 and 10.
Therefore, always can realize that by code generator 200CG the code of output code word or output data word AC2 generates by input code word or Input Data word EC2 clearly according to Fig. 2.Similarly, in Fig. 2 a, illustrated data word EC2a has been decoded as data word AC2a by decoder DC 201.This also is suitable for carrying out continuous increasing progressively now according to code of the present invention, as this following also to set forth.According to (subsequently) rule 2,3 and 4, the single position of these in the code can be from left to right according to nomenclature 2 now
0 (3), 2
0 (2)Or 2
0 (1)Distinguish, wherein provided increment value and correspondingly produce carry or overflow OF.This carry that generates or overflow OF and when continuous programming code, be used, as rule subsequently 5 like that or such as shown in Fig. 5.
Be used for 2
0 (1)Generation
0
00 0 0
1
00 0 0
1
10 1 0
1
11 0 1
Rule 3
Be used for 2
0 (2)Generation
000 0 0
100 1 0
110 1 0
111 0 1
Rule 4
Be used for 20
(3)Generation
000 1 0
100 1 0
110 1 0
111 0 1
Therefore generate output sequence AC3s by input bit sequence row or Input Data word or input code word EC3 by incrementor INC 300 according to Fig. 3.This also can be according to Fig. 4 in the scope that compares by comparator C OMP 400, particularly realize when being output data word AC4 according to Fig. 4 by input code sequence or Input Data word EC4 ruling.
At this, when direction is transferred, following carrying out or rather from being incremented to the switching of ruling, be LSB, also be that least significant bit, minimum position are at first analyzed, as this for increase progressively be essential, perhaps when sending direction switches highest significant position MSB, also the peak position is at first analyzed, and causes comparison, particularly ruling thus.This also will set forth after a while intuitively.Therefore, the distribution that code generator CG 200 among Fig. 2 carries out according to rule 1, carry out distribution according to the incrementor of Fig. 3 according to rule 2,3 and 4, wherein in Fig. 2 by input code EC2 produce generated according to output code AC2 of the present invention, and in Fig. 3 by the input code EC3 that has been encoded generate increase progressively according to output code AC3 of the present invention.
Set forth in more detail according to rule 5 with corresponding value c or u, x, y, z, w by Fig. 5 now and increase progressively continuously:
Rule 5
C or u y x z w
0 0 0 0 0
0 1 0 0 0
0 1 1 1 0
0 0 1 1 0
1 0 0 0 1
1 1 0 1 0
1 1 1 0 1
1 0 1 0 1
Fig. 5 illustrates the incrementor 300 that increases progressively module 306 INC, increases progressively device 301 and comprise the feedback branch of trigger 305 according to having of Fig. 3.Other trigger illustrates with 302,303 and 304.These triggers can be realized by the memory element that is subjected to clock control arbitrarily.In this incrementor 300, promptly have the increasing progressively in the device 301 of feedback, introducing as illustrated now on the one hand is corresponding to data word or have the input bit sequence row EBF of the Frame of a plurality of, at least two data words, consider as directed carry simultaneously, promptly overflow OF, and be converted to according to the carry-out bit sequence ABF that increases progressively of the present invention or output data word or output data frame.When with least significant bit LSB, be that the minimum position of bit sequence is when beginning to transmit, for increasing progressively continuously of code, for generating code position x always need be about the information of back to back code bit y.Therefore, this code must be delayed at least one beat and transmit.Data bit sequence that receive in order to make and that will send is synchronous, advantageously inserts trigger, promptly 302 and 304 at input and output respectively.At carry-out bit z and the middle carry w that generated, according to rule 5 at input carry or overflow OF c, middle carry u, input position x and y and increase progressively.Can repeatedly utilize the part that is respectively code word under rule 1 the situation to form bigger code word thus now where necessary, perhaps directly insert do not have the part of other coding, be the information bit in the rule 1 just, as more elaborating in the rule 6.
Rule 6:
Information bit code place value is distributed (hexadecimal)
00 00 000 000 0
00 01 000 100 1
00 10 000 110 2
00 11 000 111 3
01 00 100 000 4
01 01 100 100 5
01 10 100 110 6
01 11 100 111 7
10 00 110 000 8
10 01 110 100 9
10 10 110 110 A
10 11 110 111 B
11 00 111 000 C
11 01 111 100 D
11 10 111 110 E
11 11 111 111 F
With respect to the increasing progressively of block code (this increases progressively and can not carry out continuously like that as has been shown), the delay that utilizes the device according to Fig. 5 also always only to produce 3 beats under the situation of rule 6 is because two code sections are one after the other handled.Rule 6 code process is as the nybble of information word, i.e. four information bit=1 Nibbel.Code redundancy is 50%.Yet in the case disadvantageously, can produce by being connected to each other of value O or F that not have bigger piece that level switches and this code be not no direct current.
In order to eliminate this point, when accepting source code a part of without change, at first select only to have the code of 25% code redundancy according to rule 7.
Rule 7:
Information bit code place value is distributed (hexadecimal)
00 00 000 00 0
00 01 000 01 1
00 10 000 10 2
00 11 000 11 3
01 00 100 00 4
01 01 100 01 5
01 10 100 10 6
01 11 100 11 7
10 00 110 00 8
10 01 110 01 9
10 10 110 10 A
10 11 110 11 B
11 00 111 00 C
11 01 111 01 D
11 10 111 10 E
11 11 111 11 F
In order to make up code according to rule 7 no direct current ground, also to insert at least significant bit, after being the minimum position and to reverse, this counter-rotating at first has value 0.The counter-rotating of whole code word (promptly comprise counter-rotating position) does not then cause the variation that is worth.Thus, exist two to have code word identical value, that begin with different place values.Under the situation of sequence, can alternately send code word 000000 and 111111 subsequently 0.Thus, obtain the full remuneration of direct current component, promptly respectively 1 of the similar number after two code words and 0.In addition, all exist level to switch when code word begins at every turn at this, this level switches the clock recovery that can be used to by PLL.Obtain rule as follows 8 thus now.
Rule 8:
Information bit code bit counter-rotating place value is distributed (hexadecimal)
00 00 000 00 0 0
00 01 000 01 0 1
00 10 000 10 0 2
00 11 000 11 0 3
01 00 100 00 0 4
01 01 100 01 0 5
01 10 100 10 0 6
01 11 100 11 0 7
10 00 110 00 0 8
10 01 110 01 0 9
10 10 110 10 0 A
10 11 110 11 0 B
11 00 111 00 0 C
11 01 111 01 0 D
11 10 111 10 0 E
11 11 111 11 0 F
Now, following rule 9 illustrates all code words with two kinds of possible modification.
Regular 9 (being used for LSB transmission formerly)
Information bit code word 1 code word 2 values are distributed (hexadecimal)
00 00 000 000 111 111 0
00 01 000 010 111 101 1
00 10 000 100 111 011 2
00 11 000 110 111 001 3
01 00 100 000 011 111 4
01 01 100 010 011 101 5
01 10 100 100 011 011 6
01 11 100 110 011 001 7
10 00 110 000 001 111 8
10 01 110 010 001 101 9
10 10 110 100 001 011 A
10 11 110 110 001 001 B
11 00 111 000 000 111 C
11 01 111 010 000 101 D
11 10 111 100 000 011 E
11 11 111 110 000 001 F
Rule 9 is a kind of preferred embodiments that LSB formerly sends code.If in transmission 1 number be increased constantly and thus 0 number be reduced, then obtain RDS, be distance of swimming numeral and, it provides about whether transmitting more 1 or 0 explanation.Utilization comprises 1 and 0 code word of different numbers, and RDS can be influenced by the selection between code word 1 and code word 2 thus.Advantageously, attempt reaching value RDS=0 and on average do not have direct current ground thus making up code.If yet in the case for example owing to clock recovery, be that PLL wishes to force between code word level to switch, perhaps for example because frequency spectrum when wishing to avoid the level switching, little deviation that should rule also is possible and can imagines.
If the input code radical increases progressively continuously, promptly begins to be changed from this value according to rule 9, then can cause variation with respect to the RDS value of data value original value, that basis increases progressively in incrementor.At this, for the data word that increases progressively that will send, there is not the possibility of the code word of selecting counter-rotating, because before receiving whole code word, must send the counter-rotating position.At this, when under the identical situation of implication with regard to frame identification, allowing from a plurality of values, to select, can realize correcting by initial non-data code word subsequently, for example identification data frame with different RDS values.
According to increasing progressively of rule 2,3,4 and 5 only at describing according to the code word 1 of rule 9.For code word 2, all zero (0) should replace and 1 should replace with 0 on the contrary with one (1).So, identical application of rules.
Be particularly suitable for increasing progressively continuously (at LSB formerly the time) according to rule 9 described codes in the paragraph in front or be suitable for ruling (at MSB formerly the time).For successively decreasing, this code is not too suitable, because there is not the rule corresponding to rule 5 subsequently for this code, this rule does not rely on the position in code and determines new (will send) code bit according to importing position x and y and carry digit c and u.Therefore, particularly use the create-rule 1.b of following replacement rule 1 at successively decreasing:
Digital coding rule 1.b value (hexadecimal)
00 000 0
01 001 1
10 011 2
11 111 3
Replace rule-based 1 the rule that is used to increase progressively 2,3 and 4, obtain following regular 2b, the 3b and the 4b that are used to successively decrease based on code 1.b:
(regular 2b):
Be used for 2
0 'Generation
0
00 1 1
0
01 0 0
0
11 1 1
1
11 1 1
(regular 3b):
Be used for 2
0 "Generation
000 1 1
001 0 0
011 0 0
111 1 1
(regular 4b)
Be used for 2
0 Generation
000 1 1
001 0 0
011 0 0
111 0 0
The carry that is generated is used (referring to regular 5b) when continuous programming code.The advantage of this code is that output valve is identical under the situation of successively decreasing with carry and otherwise carry is 0.
For successively decreasing continuously of code, (when LSB begins to transmit) always need be about the information of back to back code bit y for generating code position x.Therefore, as also under situation about increasing progressively continuously, code must be delayed at least one beat and transmit.The data bit sequence that receives in order to make He will send is synchronous, advantageously inserts trigger at input and output respectively.At carry-out bit z and the middle carry w that generated, according to regular 5b at input carry c, middle carry u, input position x and y successively decrease (Fig. 3 a):
Rule 5b
C or u y x z w
0 0 0 0 0
0 0 1 1 0
0 1 0 0 0
0 1 1 1 0
1 0 0 1 1
1 0 1 0 0
1 1 0 1 1
1 1 1 1 1
But, also can be used for ruling purpose, i.e. purpose relatively according to code of the present invention.Therefore, described code, the particularly code according to rule 9 also can be used to the ruling purpose with variable priority.Essential for this reason is, such as previously mentioned with the peak position, be that the transmission of highest significant position begins, and for increasing progressively, with least significant bit, be that LSB, minimum position begin.Yet the counter-rotating position also at first is transmitted (rule 10) subsequently.
Be used for rule 10 with MSB transmission formerly:
Information bit code word 1 code word 2 values are distributed (hexadecimal)
00 00 0 000 00 1 111 11 0
00 01 0 000 01 1 111 10 1
00 10 0 000 10 1 111 01 2
00 11 0 000 11 1 111 00 3
01 00 0 100 00 1 011 11 4
01 01 0 100 01 1 011 10 5
01 10 0 100 10 1 011 01 6
01 11 0 100 11 1 011 00 7
10 00 0 110 00 1 001 11 8
10 01 0 110 01 1 001 10 9
10 10 0 110 10 1 001 01 A
10 11 0 110 11 1 001 00 B
11 00 0 111 00 1 000 11 C
11 01 0 111 01 1 000 10 D
11 10 0 111 10 1 000 01 E
11 11 0 111 11 1 000 00 F
Show the circuit that is used for this comparison or ruling with comparator 400 according to Fig. 6 and Fig. 6 a.Wherein show comparator module 401 or 408 with real comparator 405 or 409COMP, wherein only need respectively here to be used for the delay of two input bit sequence row that will compare and synchronous two triggers 402,403 or 412,413, these triggers also can illustrate by the memory element that is subjected to clock control arbitrarily here.For the ruling of code, in order to judge the transmission of code bit x or r, in the ordinary course of things again need be in Fig. 6 or among Fig. 6 a about the information of back to back code bit y or s.At this, when with MSB, be that highest significant position is when beginning to transmit.Therefore also must be delayed at least one beat and transmit at this code.Received synchronous in order to make with data bit sequence that will send, also advantageously insert trigger 402 or 412 and 404 at input and output respectively at this.According to rule according to the present invention, in the case now by input position x and y or r and s execution carry-out bit z, and carry out the selection of input bit sequence row EBF or EBF1 or EBF2 thus and in the scope of ruling, carry out input bit sequence row EBF or EBF1 or EBF2 conversion to carry-out bit sequence ABF.At this, the comparator judgement still is stored in Fig. 6 a in the memory element 406, is reset by control unit 407 up to judging.The comparator judgement of once making also can be used in the subsequent process of transfer of data, so that on purpose carry out two other conversions between the input bit sequences row.For this reason, the current comparator judgement of making is transferred to control unit 407 and is stored there.By this information, memory element 406 can at random be provided with and resets by 407.Be provided with switch or adapter unit S2 in Fig. 6 a in addition, this switch can be in the switching that is implemented under the situation that other sequence is arranged between input bit sequence row EBF1 and the EBF2, as just now at Fig. 6 and 6a described.
Fig. 4 a illustrates this switching, by two the Input Data word EC4 and the switch of EC5 and output data word AC4 or the sort circuit of converting unit S1 that are used for according to the comparator 401 of Fig. 4.
Increasing or decreasing and ruling repel each other in data word simultaneously.Yet in the scope of the situation of must ruling or must increasing or decreasing, can carry out the switching of transmission sequence or sending order.According to sending direction, obtain LSB just and formerly and thus obtain increasing progressively flexible program at rule 9, preferred embodiment now, perhaps utilize rule 10 to obtain MSB and formerly and thus obtain the ruling flexible program.At this, now two of data are converted to tri-bit encoding according to two, and other two, be that 3 and 4 of data are accepted with the form that is not encoded.Simultaneously, counter-rotating position, promptly show the modification that whether relates to counter-rotating or not counter-rotating the position according to rule 9 as least significant bit, promptly be added in code word 1 and the code word 2 at rightmost.Be similarly now with regard to the MSB side, so two of data are encoded as three respectively in three of centre, and last two positions 3 and 4 of accepting data simply of code word 1 or 2.Yet in the case, show counter-rotating the position as the peak position, be that MSB is added in the code word 1 of MSB flexible program and the left side of code word 2 respectively.
As an example, also be suitable for illustrating, wherein, wherein can carry out the switching of transmission sequence or sending direction according to frame (Frame) position as being transmitted in the frame of data in regular length under the situation of MOST bus in this bus.If for example the transmission of control frame information decides in the following manner according to priority arrangement (Priorisierung), the priority that is about to receive compares with the priority of oneself, then advantageously, at first sends MSB.Thus, can as shown in Fig. 6 a, directly transfer.Should be transferred to next node if should determine network site and while (not having under the situation of buffer memory) in contrast, then must formerly send the control corresponding byte by LSB, so that can increase progressively (according to Fig. 5) continuously.Because the control frame information with the necessity that is used for ruling always at Frame, be that the fixed position (being always the 61st and the 62nd byte under the situation at MOST) of frame is transmitted, so this advantageously according to the word counter in the Frame or byte or digit counter, be that counter is changed into MSB formerly with transmission sequence.On increasing or decreasing may be all byte locations in the necessary frame, transmission sequence was switched back to LSB formerly.Neither needing by a plurality of relatively come ruling, also do not need on the position of increasing or decreasing, transmission sequence is inessential and can freely selects according to other standard.
At this, in principle, promptly not only be noted that at the MOST situation position of reversing according to the present invention always at first is sent out, promptly do not rely on whether to begin with LSB or MSB.
At above-mentioned, be that the favourable system that two information bits is encoded to three code bits according to the present invention solves the rule 1 of flexible program with regard to the EMV characteristic, but also can imagine and the following flexible program of implementation rule 1:
Digital coding rule 1.b coding rule 1.c value (hexadecimal)
00 000 000 0
01 001 010 1
10 011 110 2
11 111 111 3
Digital coding rule 1.d coding rule 1.e value (hexadecimal)
00 000 000 0
01 100 011 1
10 110 110 2
11 011 111 3
At this, compare with the rule 1 that is used to increase progressively, have identical advantage according to the coding rule that is used to the situation of successively decreasing of 1b.Also have systematic code at this, wherein each code bit all can the value of being assigned with 2
0Yet should at first further set forth situation about increasing progressively at this.
According to developing the rule 9 that and 10 preferred enforcement flexible program, can describe special transmission and receiver module now, be transmitter and receiver according to Fig. 7 and Fig. 8 according to rule 1 or by it.Fig. 7 illustrates a kind of serial transmitter, and wherein parallel data is imported PDI, promptly for example is introduced in to the n parallel-by-bit in register and the code generator 705.In this example, n is preferably 4.By the shift register 704 that can hold the k position,, wherein be preferably 6 at this k so can export carry-out bit sequence ABF to communication system 100.At this, sending module 700 comprises the element 701 to 703 that optionally also will be set forth now.If for example LSB and MSB formerly between, promptly increasing progressively and ruling between change transmission sequence according to word counter or counter during conversion, then this counter 701 is essential.Need control circuit 703 simultaneously, this control circuit is according to particularly control inversion control of rule 9 or 10, i.e. given in advance corresponding to the counter-rotating position of LSB and MSB.Simultaneously, the monitoring of RDS value or given in advance can being undertaken by this circuit 703.Piece 702 is used to insert non-data word, and this piece also will be set forth in the back.The same function that also can implement D control in piece 703, this also will be set forth in the back in more detail.
Corresponding to sending module 700, Fig. 8 illustrates receiver module or serial receiver with 800.In this embodiment, input bit sequence row EBF is fed to the shift register 804 with k position, at this also k=6 preferably.Show the corresponding decoder module of register that particularly has with 803.In order to export parallel bit sequence according to the present invention, to be the n position of PDO, for example n=4, utilize conversion once more and for example change transmission sequence according to word counter, also use this counter 801 alternatively at this.Piece 802 is used for the identification of non-data word, promptly is used for the decoding of non-data word, can carry out the part set of counter thus, as this also will set forth in the back.Promptly can encode completely according to the present invention or decode according to transmitter and the receiver of Fig. 7 and Fig. 8.
Now the non-data word that binding member 702 and 802 is mentioned more elaborates.The code space of 6 code bits allows 2
6=64 kinds of different possibilities are wherein distributed 32 data code words according to 9 of rules.For some applicable cases, meaningfully, make some non-data code words or non-data word and other information, particularly harmonious to be used to control purpose with control information.For example can identify the beginning of transmission thus or cause other controlled function, for example carry out the transition in the another kind of mode of operation, and the transmission of introducing special order information.These non-data code words for example can be piece preamble or Frame preamble, be the frame preamble.The only beginning of identification frames of this frame preamble.If allow a plurality of different frame preambles, then can transmit different additional informations by the selection of variable.This additional information can be the RDS value, has carried out current coding with this RDS value.Its example provides in table 1, and wherein this table is not finished.
Table 1:
| Control | Code word | 1 | |
| The piece preamble | 101 010 | 010 101 | |
| Frame preamble (rds before code word is 0) | 101 110 | 010 001 | |
| The frame preamble (rds before code word is-2/+2) | 011 110 | 100 001 | |
| The frame preamble (rds before code word is+4/-4) | 011 000 | 100 111 | |
| The frame preamble (rds before code word is+6/-6) | 101 000 | 010 111 | |
| The frame preamble (rds before code word is+8/-8) | 010 010 | 101 101 | |
Under the situation of non-data code word, bit sequence 010101 or reversally 101010 play special effect.This bit sequence is used to synchronously and should is not by mistake, also the continuous combination by two data words forms.When LSB begins to transmit, under the situation that does not have additional condition, for example be connected 4,5,6 or 7 (from code words 1) by data word D (code word 1) according to rule 9 and form sequence afterwards: 111010 100xx0, wherein the switching of the level between these two data words is stipulated by the RDS rule.When managing not carry out the level switching in the transmission always under the situation of ignoring the RDS rule, avoid generating this bit pattern (Bitmuster) by the combination of data code word at D.In the superincumbent example, obtain bit sequence 000101 100xx0 thus, and selected bit sequence can not form according to rule 9.This may be able to temporarily cause the increase of direct current component.Yet got rid of, the transmission of D repeatedly cause continuing to increase of RDS continuously because always between code word 1 and code word 2, switch just subsequently according to rule 9.If manage in addition, in all code words of 0 and 1 after value D, that have balanced number (7,9, A, C and non-data code word), always carry out level and switch (as long as unbalanced code word is not broken this rule), even then RDS under the situation that data value D is sent out subsequently once more also by accumulative total because subsequently the other code word of D can with and also be forced to use according to above-mentioned rule.The transmission of specific control unit control data word D in the transmitter, as among Fig. 7 enforceable in the piece 703.Another rule is, increases the RDS value when RDS=0, makes RDS not become negative after 0 and provides monambiguity thus.
Under these boundary conditions, the transmission of special code word 010101 and its counter-rotating allows to trigger special control signal in receiver, and these control signals cause selected system mode.This for example can be the set of the counter in the receiver, for example passes through the set of piece 802 in the counter among Fig. 8 801.If only allow non-data code word or non-data word at time point clocklike, because they for example label the beginning of the Frame of constant length is arranged, then also meaningfully, only allow all other non-data word on the known location between two in these special code words.So these code words and data word can not obscured, perhaps for not obscuring that form and consistent with the bit sequence of the non-data code word pattern of in succession data word each other with this special control signal by two.Thus, also can realize the limited possibility of wrong identification.Except shown in have the code modification according to rule 9 or 10 advantageous variant, equally repeatedly the other assembly of implementation rule 1 or composition, promptly should rule and the repeatedly application of straight binary coding.The code of preferred embodiment is avoided the dominant frequency spectrum of two-phase marc coding.When not considering that afterwards the data of passing through increasing or decreasing change, this code on average be no direct current and (according to coding rule) have 13 or 14 maximum run length.But this data change can compensate by non-data code word subsequently again.Preferably, non-data code word is for example corresponding to table 101010,001110,001100,011110,011100 and with respect to the value of its counter-rotating, yet also can use all other non-data word in principle.
Being used for forming coded data word by the embodiment according to rule 9 avoids the rule of bit sequence 101010 correspondingly to be mated in the conversion that increases progressively with ruling:
If formerly switch to MSB formerly, then except in the rule that reduces on the value not produce the RDS value about counter-rotating from LSB.
Between two MSB value formerly, must avoid in hexadecimal value " A " the level switching of (rather than before) afterwards at " D ".
For in " A " all balanced code words afterwards, there is not any rule at this, because " A " itself is balanced (follow A not have the RDS value to change, need not rule thus for indirect " A " in succession).
For from MSB transition formerly be LSB formerly, as long as last 3 is alternately (according to 2,6, A, D), should prevent that generally level from switching.
For " D " subsequently, identical as usual condition is suitable for, and does not promptly have level to switch.
For coding by the data word of forming more than 2, decidable in addition, whether according to rule 1 or 1b to all positions to encoding or which is not accepted is right coding.In rule 9,2 LSB of 4 bit data word are encoded according to rule 1, and 2 MSB are directly accepted.Can realize the opposite method according to regular 9a, wherein LSB is directly accepted and MSB 1 is encoded according to rule just the samely:
Rule 9a:(is encoding according to rule 1 at first and is exchanging preferred embodiment under the situation of order of coded data bit)
Formerly MSB is formerly for LSB
Information bit code word 1 code word 2 values are distributed (hexadecimal)
00 00 00 000 0 11 111 1 0 0 00 000 1 11 111
01 00 00 100 0 11 011 1 1 0 00 100 1 11 011
10 00 00 110 0 11 001 1 2 0 00 110 1 11 001
11 00 00 111 0 11 000 1 3 0 00 111 1 11 000
00 01 01 000 0 10 111 1 4 0 01 000 1 10 111
01 01 01 100 0 10 011 1 5 0 01 100 1 10 011
10 01 01 110 0 10 001 1 6 0 01 110 1 10 001
11 01 01 111 0 10 000 1 7 0 01 111 1 10 000
00 10 10 000 0 01 111 1 8 0 10 000 1 01 111
01 10 10 100 0 01 011 1 9 0 10 100 1 01 011
10 10 10 110 0 01 001 1 A 0 10 110 1 01 001
11 10 10 111 0 01 000 1 B 0 10 111 1 01 000
00 11 11 000 0 00 111 1 C 0 11 000 1 00 111
01 11 11 100 0 00 011 1 D 0 11 100 1 00 011
10 11 11 110 0 00 001 1 E 0 11 110 1 00 001
11 11 11 111 0 11 000 1 F 0 11 111 1 00 000
←------←------sending direction------→------→
Equally, particularly when selecting to successively decrease possibility, can realize other coding rule (regular 9b and 9c):
Rule 9b:(have uncoded data bit order exchange and according to the coding of regular 1.b)
Formerly MSB is formerly for LSB
Information bit code word 1 code word 2 values are distributed (hexadecimal)
00 00 00 000 0 11 111 1 0 0 00 000 1 11 111
01 00 00 001 0 11 110 1 1 0 00 001 1 11 110
10 00 00 011 0 11 100 1 2 0 00 011 1 11 100
11 00 00 111 0 11 000 1 3 0 00 111 1 11 000
00 01 01 000 0 10 111 1 4 0 01 000 1 10 111
01 01 01 001 0 10 110 1 5 0 01 001 1 10 110
10 01 01 011 0 10 100 1 6 0 01 011 1 10 100
11 01 01 111 0 10 000 1 7 0 01 111 1 10 000
00 10 10 000 0 01 111 1 8 0 10 000 1 01 111
01 10 10 001 0 01 110 1 9 0 10 001 1 01 110
10 10 10 011 0 01 100 1 A 0 10 011 1 01 100
11 10 10 111 0 01 000 1 B 0 10 111 1 01 000
00 11 11 000 0 00 111 1 C 0 11 000 1 00 111
01 11 11 001 0 00 110 1 D 0 11 001 1 00 110
10 11 11 011 0 00 100 1 E 0 11 011 1 00 100
11 11 11 111 0 11 000 1 F 0 11 111 1 00 000
←------←------sending direction------→------→
Rule 9c:(do not have uncoded data bit order exchange and according to the coding of regular 1b)
Formerly MSB is formerly for LSB
00 00 000 000 111 111 0 0 000 00 1 111 11
00 01 000 010 111 101 1 0 000 01 1 111 10
00 10 000 100 111 011 2 0 000 10 1 111 01
00 11 000 110 111 001 3 0 000 11 1 111 00
01 00 001 000 110 111 4 0 001 00 1 110 11
01 01 001 010 110 101 5 0 001 01 1 110 10
01 10 001 100 110 011 6 0 001 10 1 110 01
01 11 001 110 110 001 7 0 001 11 1 110 00
10 00 011 000 100 111 8 0 011 00 1 100 11
10 01 011 010 100 101 9 0 011 01 1 100 10
10 10 011 100 100 011 A 0 011 10 1 100 01
10 11 011 110 100 001 B 0 011 11 1 100 00
11 00 111 000 000 111 C 0 111 00 1 000 11
11 01 111 010 000 101 D 0 111 01 1 000 10
11 10 111 100 000 011 E 0 111 10 1 000 01
11 11 111 110 000 001 F 0 111 11 1 000 00
←------←------sending direction------→------→
Rule 9b is for more favourable simply the successively decreasing when formerly transmitting with LSB, because here for fear of non-data code word 010101 or 101010 and always must avoid level to switch afterwards in " 6 ".
For the selection of code, following now general provision is suitable for:
1., then should formerly send with LSB if should increasing or decreasing.
2. according to rule 9 or 9.a, increase progressively more favourable.
3. according to regular 9.b or 9.c, it is more favourable to successively decrease.
4., then should formerly send with MSB if should ruling.
5. according to rule 9 or 9.a, ruling is more favourable.
6., then can switch type of coding arbitrarily if knownly which position to use what code in.
For fear of code word 010101 or 101010, must observe the regulation in the tabulation down:
| Function | Direction | Coding rule | Regulation: no level switches | The order regulation: the level of balanced code word switches |
| Increase progressively | LSB formerly | 9 | At " D " before | Must be after D |
| Increase progressively | LSB formerly | 9.a | In " 9 " afterwards | |
| Successively decrease | LSB formerly | 9.b | In " 6 " afterwards |
| Successively decrease | LSB formerly | 9.c | At " D " before | Must be after D |
| Ruling | MSB formerly | 9 | At " A " afterwards |
In order to carry out wrong identification and error correcting, depend on current running digital sum RDS now according to the present invention, be distance of swimming numeral and carry out the judgement of current code data word in conjunction with the code create-rule.If this value is known for receiver, particularly second user, then can be as described like that with the selectional restriction of possible code data word in only about half of.Therefore the regulation according to the present invention is particularly periodically transmitted RDS and based on this RDS this RDS is further calculated in receiver, up to upgrade next time.Also can utilize the RDS value that newly receives to confirm so far data and/or the data correctness of correcting subsequently, perhaps generation error signal in case of necessity, this rub-out signal is to the correctness statement into question of the data of front.These are identified as vicious data subsequently and can be checked once more subsequently, perhaps also can be along with to transmitter, the i.e. particularly requirement that sends once more of first user's data and being dropped.If for example with the code that is used for the electrical transmission that EMV reduces, for example the code described in the rule of having mentioned 9 is as the basis, then produce information bit, code word 1, code word 2 and value and distribute the possibility of (hexadecimal), as at rule 9 described.Rule this code of 9 has 50% code redundancy, and can not correct a mistake under the situation of not additional information about RDS.On the contrary, single-bit error may cause other code word at this.If for example get code word 1 with hexadecimal value C of 111000 and only last position make mistakes, then obtain having the code word 2 of 111001 hexadecimal value 3.Correspondingly obtain the following proximity relations between the code data word here:
111 000 / 111 001 C/3
111 010 / 111 011 D/2
111 100 / 111 101 E/1
111 110 / 111 111 F/0
This causes, when just last code bit is made mistakes, if do not guarantee additional information according to transmission of the present invention, huge change that then must the value of considering, and do not have the wrong identification possibility.
Yet Fig. 9 a symbolically has the code generator of different non-code data words having alternately code word and little code redundancy shown in the frame 900 once more.Show the span line that does not have additional resource (circuit/data) with 901: information is transmitted by the selection of alternative control word.Frame 902 illustrates the receiver with decoder at last, this receiver particularly regains information from non-code data word or control word, promptly about the RDS of code generator criterion, can from the subclass of whole code data word, carry out the code data word select thus and select, so that execution error identification and error correcting.
In Fig. 9 b, this is illustrated once more in more detail.Wherein show code generator with 900 once more, show receiver and show span line with 902 with 901 with decoder, the different code word data set 903-905 that substitutes wherein additionally has been shown in code generator 900, and these code word data set representative code data word collection 1,2 are to n.Show real encoder with 906, and show with frame 907 be used for additional information, be exactly the analysis or the generation unit of RDS value, can select the code data word collection determined and by selecting module 908 therefrom to select definite code data word by this RDS value subsequently.
Similarly, set up receiver 902 now with decoder, wherein show alternative code data word collection 1,2 to n with 909,910 and 911 equally, and by analyzing or regain module 912 according to RDS value, particularly determine additional information according to non-code data word, and thus particularly in order to correct a mistake by selecting module 913 to concentrate the correct code data word of selection from the corresponding code data word.Real decoder illustrates with 914.
If now data by span line at frame according to Figure 10 and 10a, be to be transmitted in the frame of every i byte, wherein i for example is 1,2,4,8,16,32 and preferably 64,128,256 or the like, and each frame begins with preamble FP, this preamble FP especially is non-code data word, then obtain following possibility: when supposing that always j frame forms data block, the distinctive especially preamble that after a fixed number j frame, replaces the frame preamble to be sent out for example, be that piece preamble BP has following task, i.e. first synchronous with frame system, and therefore do not allow connection by data word to occur as the part bit pattern of this combination or realize by the combination of data in other mode.The preamble of this reservation for example has code 101010 or 010101.Because this preamble causes high EMV behavior with its place value that continues switching when electrical transmission, so this preamble advantageously is not to be used to each frame especially yet, but for example just after the frame of fixed number, for example by the BOB(beginning of block) of j frame F1, F2, Fj (j for example is 1,2,4,8, preferably 16,32,64 or the like) formation the time, be used.Have only when this preamble is in a single day identified, the internal counter in the receiver is adjusted like this, makes accurately to learn, when a frame and a BOB(beginning of block).When piece preamble BP begins, must avoid the position to switch, so that guarantee synchronous accurately.Because it is known after synchronously first, when new frame begins, so the frame preamble FP of next and all frames subsequently expected and can correspondingly be decoded, and can not obscure with data word or with the combination of the part of two data words that send in succession.Therefore, the frame preamble does not need to satisfy such requirement, does not promptly appear in the data pattern.Therefore, as the frame preamble, at first advise following code: 101110 and/or 010001.When RDS equals 0 or when equaling 0 before preamble sends, so this value should be sent out as preamble just.Because in the RDS value is always to make every effort to positive RDS value according to the coding rule that also will set forth after a while at 0 o'clock, so more properly should use bit sequence 101110; Bit sequence 010001 can alternatively be used to other transmission of Information, when timing so approximately in coding rule.Because top data code word has the bits number (being 6 at this particularly) for even number, so along with each transmission of data word increases by 0,2,4 or 6 to the RDS value, perhaps the RDS value is reduced this value.Can expect that in normal faultless work value 8 (+/-8) can appear in maximum, and the RDS value can be to become even number under the situation of even number at the number of the code bit of each word.These standards also can be used to check the reasonability of the data that received.Other frame preamble explanation, what kind of the RDS value of transmitter is before the transmission of preamble:
101 110 (010 001) rds is 0 (seeing above) (rds becomes+2/ (2) subsequently)
011 110 100 001 rds are-2/+2 (rds becomes 0 subsequently)
011 000 100 111 rds are+4/-4 (subsequently rds become+2/-2)
101 000 010 111 rds are+6/-6 (subsequently rds become+4/-4)
010 010 101 101 rds are+8/-8 (subsequently rds become+6/-6)
All preambles with RDS information all should have each other be at least 2 Hamming distance from so that can discern single-bit error in the preamble.This is necessary, because the mistake in the transmission of RDS value can influence correction subsequently.In addition, under the situation of RDS=0, for example should always follow positive RDS or 0, wherein this this corresponding to the coding rule of the example of realizing as uniqueness arbitrarily.Can use other preamble in addition, for example:
011 010 100 101 do not have the frame preamble of rds information
001 100 110 011 are used to control the preamble that does not have rds information of purpose
010 100 101 011 are used to control the preamble that does not have rds information of purpose
If now the RDS counter is set and in data word subsequently, finds non-code data word based on RDS information, then can easily determine according to coding rule whether it must be code word 1 or code word 2, promptly determine least significant bit LSB according to rule 9.Alternatively, this similarly works to rule 10 naturally, therefore determines highest significant position MSB subsequently.Promptly like the method natural kind of rule 9 descriptions, rule 10 is worked, and do not describe clearly once more for the reason of expense.
Under the situation that increases the expense that will spend, can realize further improvement according to the present invention now, even because when carrying out mentioned error correction information transmission by RDS, but single-bit error that now for example for example neither be all in the code of rule 9 can be taken into account.Outside situation about having described, always wrong possibility.Therefore for example for some code words, when the difference of two data words only was a position, promptly Hamming distance was from being 1 o'clock, and mistake can not be discerned.This for example is exactly the situation that position 1 or 2 changes.Therefore, according to rule 9, for example owing to the mistake in the position 2 of code word 1, data value 0 becomes data value 2.
To correct possibility completely in order providing, then code redundancy must to be improved so far, make all data words have Hamming distance each other at least from 3.Should under the situation of the corresponding raising of frequency, transmit a plurality of code bits for this reason, identical information content be arranged so that guarantee each chronomere.Because more disadvantageous EMV characteristic, this is not recommended.
Therefore in the scope that further develops, seek such possibility now, promptly under the situation that does not improve code redundancy, discern reliably or even correct.At this,, also can carry out and indefinite correction according to application.Under the situation of a plurality of possible correction word, should be according to judging by strategy given in advance, select in the possible code word which, perhaps whether for example also find such trading off, promptly do not select any one in the possible code word, but the arithmetic mean of the value of all possible code word of use that replaces.Indefinite under the correction situation is distributed in this and must signals, and the part of strategy also is can prevent to correct.This can be undertaken by the selection of option, perhaps also can carry out automatically when having carried out too many correction so far.
Thus, according to the present invention, should in the scope that further develops, handle wrong identification discriminatively in addition, and exactly handle wrong identification with a plurality of grades:
(0) there is not mistake or can not identify mistake at least.
(1) can realize wrong identification and be corrected as clear and definite value (according to Hamming).
(2) have a plurality of code words, these code words just with the bit pattern that is received have 1 different and satisfy condition simultaneously about RDS and mentioned level switching.Under this situation (2), correct, for example according to selectable strategy
The minimum value of-possible code word
The maximum of-possible code word
The arithmetic average of-possible code word (result needn't be inevitable relevant with the bit pattern that is received)
The interpolation of-data value (being associated) with the value that has before received
-pulse suppresses (for example by lowpass function the interference in the bit pattern being faded out)
-the edge that has respectively more than the bit pattern of a constant place value moves (low pass of span line or the equilibrium of high pass characteristic)
-generate as the pulse of the equilibrium of the low-pass characteristic of span line
-do not correct, but signal mistake and send fixing data value given in advance, for example 0.
(3) do not correct the wrong identification of possibility, for example a plurality of bit-errors (be different from case of necessity at the 2nd and signal mistake) and send data value given in advance (for example 0) or such value, this value is being ignored under the situation that RDS value or level change rule near the value that is received.
In point (0), there is not mistake, perhaps wrong, for example single or multiple bit-errors can not be discerned, because form other data code word.
In point (1), identify a mistake, and a code word is arranged just, this code word is owing to the change of a position in the word that is received forms (having only a code word at Hamming distance in 1).
In point (2), have a plurality of data code words, these data code words all corresponding to the Hamming distance of the word that is received from 1.From should concentrating of possible code word, find out a value according to selectable strategy.Be noted that for example interpolation: for example meaningfully, know the signal characteristic of signal and for example under the situation of sensor signal or audio signal, know, can only in limited scope, change from sensor values to sensor values or from sampled value to sampled value according to limiting frequency.
For this reason, the storage of current decode condition is significant under error situation, and can according to Figure 11 on controller for example by the reprocessing of interrupting implementation value.The number and the type of correcting also should be stored, and in case of necessity surpass such correction can be given in advance the number situation under do not carry out further correction according to point (2).In case new RDS information is transmitted, this error memory just can completely or partially be deleted, have only in case of necessity when determining not have deviation or not having big deviation at least under the situation about comparing in RDS information and the new value that receives with internal calculation, this error memory is just completely or partially deleted.Error correcting can have adaptive feature thus.But the change of strategy also can be different arbitrarily, and can influence by the user.Therefore for example also can in learning phase, under the environmental condition that gears to actual circumstances, oneself determine best correction possibility.
When occur one or even during a plurality of bit-errors, strategy should particularly be changed to signaling mistake.The RDS value that can no longer trust in receiver subsequently to be calculated.Error correcting according to point (2) can be stopped subsequently, at least just up to receiving new current RDS value again and not detecting new multiple mistake.
The unidentified single-bit error that goes out in three higher positions causes that the value of the maximum 25% of codomain changes.The change of LSB can cause from 1 to F value completely and change.When additional information, be that RDS can use and when having respective coding condition, i.e. error correction information transmission by the RDS transmission, this is excluded for decoding.In conjunction with described RDS transmission, also can judge in some cases on which direction, to correct.Can cause clear and definite correction thus.
Following basis has single-bit error quilt under the situation of non-code data word of transmission direction LSB rule 9 formerly and determines reliably and be repairable:
-as long as position 4 is effectively, the mistake among 5 (MSB) of position.
-as long as position 5 is not effectively, the mistake in 4 (second highest orders) of position.
-as long as position 4 is not effectively, the mistake in 3 (the 3rd highest orders) of position.
In the case, effectively mean " 1 " and " 0 " in the code word 2 in the code word 1.
When only considering a code word, all other single position changes and all can not be found or correct.If yet hypothesis, the code create-rule just in time is known, also can correct in conjunction with RDS information according to the information of switching about the level on word boundary.At this, when sending balanced code word, must always after data word D, carry out level and switch according to coding rule.When the data word of a plurality of equilibriums was right after after D, this also was suitable for.Prevent that in this way RDS is owing to a plurality of (indirect or indirect) continuous data word D adds up.Under the situation of all other data words, level switches to be controlled by RDS information.
When RDS=0, do not allow to form the negative value of RDS by this code word, but form minimum as far as possible on the occasion of.Though code redundancy is little, can under the single-bit error situation, realize thus further correcting or prompting to changing.Effective code word is being corrected as under the situation of another code word, additionally transmitting fault information at every turn.Utilize additional options can stop the correction that interrelates therewith.So only export information about mistake.All correction cause the highest 25% change of the codomain of data word.
Under the situation of multiple mistake, for example send fixing value given in advance (and interruption).Under the situation of the possibility of decisioing making in a plurality of data words, this strategy is judged.Can come the switching of implementation strategy by the error counter among Figure 11.Correct so also stop in case of necessity, promptly do not correct, but adopt fixing value.Counter among Figure 11 is reset by the renewal of RDS value.Figure 11 illustrates receiver 902 and the span line 901 with decoder 914 with symbolistic diagrammatic sketch with running in addition once more.
At first particularly from non-code data word (or control word), extract RDS information.RDS compares by piece 915 and 916 (corresponding to the piece among Fig. 9 b 912) and determined RDS information.Carry out incremented/decremented constantly at this.The regular update that then has comparison (piece 916).Do not have mistake (piece 917) if comprise the data word of RDS, then export this data word.Otherwise arrive error correcting 918, data word after correcting by this error correcting generation or fixing data word (also referring to table 12).Under situation about can not correct, particularly interrupt (interrupting 919) with such signaling, promptly can not correct and wrong the demonstration.Under the more vicious situation of RDS, same generation particularly has the wrong interruption (920) that shows.Can in piece 922, realize that according to having the coupling or the application of adaptive possibility described strategy predesignates by error counter 921 subsequently.At last, when RDS upgraded, error counter 921 is reset (reset), and was such as described above.
For this reason, the code corrects rule of the last example of in table 12, correcting in the situation lower part of little code redundancy as flexible program 1a description conduct.At this, from according to the rule 9 with LSB transmission formerly.In addition at this example hypothesis, (under/PV) the situation, only otherwise need other coding rule, just should not carry out the level switching there being specified level to switch at the code word of subsequently equilibrium (similar number 0 and 1) yet.This is the favourable flexible program of EMV, because switch than the level that averages in other coding rule still less.It is 14 maximum run length (MRL) that this coding flexible program has.
This:
MF: mean the multi-bit error (but mistake be identified, usually do not correct possibility) of existence according to point (3)
OK: meaning does not have mistake can discern (point (0))
PV: mean at the code word specified level of equilibrium and switch (directly or indirectly after D)
/ PV: mean not enable level switching of code word at equilibrium
PE: mean to exist level to switch: current LSB is not equal to last place value (last bitvalue)
/ PE: mean that not carrying out level switches (the last place value of the code word that current LSB=is last)
X.1: mean data word X code word 1 (for example D D.1, C C.1,5 5.1 or the like)
X.2: mean data word X code word 2 (for example F F.2, E E.2,6 6.2 or the like)
N.d.: meaning does not have the data code word, promptly non-code data word: special condition is suitable on the position of preamble
Under the situation of some place values, wrong in one of value is possible (correcting according to point (2) or point (1))
Below with the row in the description list 12:
The 1st row: all code words
The 2nd row: as the meaning of data word (code data word) or non-data word (non-code data word)
The 3rd row: condition is rds＜=0 here, has stipulated level switching (PV) at the code word of equilibrium, exists level to switch (PE), be corrected as given code word possibility (perhaps OK, MF)
The 4th row: condition is rds＜=0 here, has stipulated level switching (PV) at the code word of equilibrium, do not exist level switch (/PE), be corrected as given code word possibility (perhaps OK, MF)
The 5th row: condition is rds＜=0 here, at the code word of equilibrium do not have specified level switch (/PV), and also should not carry out level at this code word according to selected coding rule here switches, exist level to switch (PE), be corrected as given code word possibility (perhaps OK, MF)
The 6th row: condition is rds＜=0 here, at the code word of equilibrium do not have specified level switch (/PV), and should not carry out level yet and switch (seeing above), do not exist level switch (/PE), be corrected as given code word possibility (perhaps OK, MF)
The 7th row: condition is rds＞0 here, has stipulated level switching (PV) at the code word of equilibrium, exists level to switch (PE), be corrected as given code word possibility (perhaps OK, MF)
The 8th row: condition is rds＞0 here, has stipulated level switching (PV) at the code word of equilibrium, do not exist level switch (/PE), be corrected as given code word possibility (perhaps OK, MF)
The 9th row: condition is rds＞0 here, at the code word of equilibrium do not have specified level switch (/PV) and also should not carry out level switches (seeing above), exists level to switch (PE), be corrected as given code word possibility (perhaps OK, MF)
The 10th row: condition is rds＞0 here, at the code word of equilibrium do not have specified level switch (/PV) and also should not carry out level switches (seeing above), do not exist level switch (/PE), be corrected as given code word possibility (perhaps OK, MF)
Has flexible program
Flexible program 1b LSB formerly
This coding flexible program is similar to described in flexible program 1a: according to the coding and the LSB transmission direction formerly of rule 9.Difference only is such rule, and promptly short of other regulation opposes therewith, and just the code word at equilibrium forces the level switching.Utilize this coding rule to be embodied as 13 maximum run length (MRL), this is more favourable for PLL.The EMV characteristic value is poorer slightly for this reason.Code corrects table subsequently is slightly different with the code corrects table described in the table 12.
Legend:
MF: have multi-bit error (mistake is identified, but does not correct possibility usually) according to 3
OK: do not have mistake can discern (point 0)
PV: the code word specified level at equilibrium is switched (directly or indirectly after D)
/ PV: the code word at equilibrium does not have specified level to switch (directly or indirectly after D), but different here: switch at the code word specified level of equilibrium in addition
PE: exist level to switch: current LSB ≠ last place value
/ PE: do not exist level to switch (place value that current LSB=is last)
X.1: the code word 1 of data word X
X.2: the code word 2 of data word X
N.d.: do not have the data code word: special condition is suitable on the position of preamble
The runic place value: having mistake (according to the correction of point 2 or 1) in one of these values, is with good conditionsi in case of necessity
Table 1: as the code corrects rule of the example of correcting in little code redundancy situation lower part at flexible program b): (not corresponding) with original table 1
| Code word | Data word | rds＜＝0 | rds＞0 | ||||||
| PV and PE:(begin to locate the condition that level switches at word) | |||||||||
| PV PE | PV /PE | /PV PE | /PV /PE | PV PE | PV /PE | /PV PE | /PV /PE | ||
| 00000 0 | 0.1 | MF | OK | ||||||
| 00000 1 | F.2 | ||||||||
| 00001 0 | 1.1 | ||||||||
| 00001 1 | E.2 | C.2， A.2 | MF | C.2， A.2 | MF | ||||
| 00010 0 | 2.1 | MF | |||||||
| 00010 1 | D.2 | C.2， 9.2 | OK | C.2， 9.2 | OK | 2.1， 9.2， C.2， F.2 | OK | 2.1， 9.2， C.2， F.2 | OK |
| 00011 0 | 3.1 | 7.1 | C.2 | 7，1 | C.2 | OK | |||
| 00011 1 | C.2 | OK | 8.2 | OK | 8.2 | OK | D.2， 3.1， E.2 | OK | D.2， 3.1， E.2 |
| 00100 0 | n.d. | MF | B.2，0.1 | ||||||
| 00100 1 | B.2 | 9.2， A.2 | MF | 9.2， A.2 | MF | OK | |||
| 00101 0 | n.d. | MF | A.2 | MF | A.2 | 1.1 | A.2， 1.1 | 1.1 | A.2， 1.1 |
| 00101 1 | A.2 | OK | 6.2， 8.2 | OK | 6.2， 8.2 | OK | B.2， E.2 | OK | B.2， E.2 |
| 00110 0 | n.d. | MF | 9.2 | MF | 9.2 | 2.1 | 2.1， 9.2 | 2.1 | 2.1， 9.2 |
| 00110 1 | 9.2 | OK | 5.2， 8.2， D.2 | OK | 5.2， 8.2， D.2 | OK | B.2， D.2 | OK | B.2， D.2 |
| 00111 0 | n.d. | 8.2 | 3.1 | ||||||
| 00111 1 | 8.2 | OK | 9.2， A.2， C.2 | MF | 9.2， A.2， C.2 | MF | |||
| 01000 0 | n.d. | MF | 0.1，8.1 | ||||||
| 01000 1 | n.d. | 7.2 | MF | 7.2 | MF | 7.2， F.2 | F.2 | 7.2， F.2 | F.2 |
| 01001 0 | n.d. | 9.1 | MF | 9.1 | MF | 1.1， 9.1 | 1.1 | 1.1， 9.1 | 1.1 |
| 01001 1 | n.d. | 6.2 | E.2 | ||||||
| 01010 0 | n.d. | A.1 | MF | A.1 | MF | 2.1， A.1 | 2.1 | 2.1， A.1 | 2.1 |
| 01010 1 | n.d. | 5.2 | D.2， 5.2 | 5.2 | D.2， 5.2 | MF | D.2 | MF | D.2 |
| 01011 0 | n.d. | B.1 | 3.1 | ||||||
| 01011 1 | n.d. | 4.2， C.2 | 4.2 | 4.2， C.2 | 4.2 | C.2 | MF | C.2 | MF |
| 01100 0 | n.d. | C.1 | 7.2 | C.1 | 7.2 | C.1 | 7.2 | C.1 | 7.2 |
| 01100 1 | 7.2 | OK | 5.2， 6.2 | OK | 5.2， 6.2 | OK | B.2 | OK | B.2 |
| 01101 0 | n.d. | 6.2 | D.1， 6.2 | 6.2 | D.1， 6.2 | MF | D.1 | MF | D.1 |
| 01101 1 | 6.2 | OK | 7.2， A.2 | MF | 7.2， A.2 | MF | |||
| 01110 0 | n.d. | 5.2，E.1 | MF | ||||||
| 01110 1 | 5.2 | OK | 7.2， 9.2 | MF | 7.2， 9.2 | MF | |||
| 01111 0 | n.d. | 4.2，F.1 | MF | ||||||
| 01111 1 | 4.2 | OK | MF | ||||||
| 10000 0 | 4.1 | MF | OK | ||||||
| 10000 1 | n.d. | MF | 4.1，F.2 | ||||||
| 10001 0 | 5.1 | 7.1， 9.1 | MF | 7.1， 9.1 | MF | OK | |||
| 10001 1 | n.d. | MF | 5.1，E.2 | ||||||
| 10010 0 | 6.1 | 7.1， A.1 | MF | 7.1， A.1 | MF | OK | |||
| 10010 1 | n.d. | MF | D.2 | MF | D.2 | 6.1 | 6.1， D.2 | 6.1 | 6.1， D.2 |
| 10011 0 | 7.1 | OK | B.1 | OK | B.1 | OK | 5.1， 6.1 | OK | 5.1， 6.1 |
| 10011 1 | n.d. | C.2 | 7.1 | C.2 | 7.1 | C.2 | 7.1 | C.2 | 7.1 |
| 10100 0 | n.d. | C.1 | MF | C.1 | MF | 4.1， C.1 | 4.1 | 4.1， C.1 | 4.1 |
| 10100 1 | n.d. | 3.2 | B.2 | ||||||
| 10101 0 | n.d. | MF | D.1 | MF | D.1 | 5.1 | D.1， 5.1 | 5.1 | D.1， 5.1 |
| 10101 1 | n.d. | 2.2， A.2 | 2.2 | 2.2， A.2 | 2.2 | A.2 | MF | A.2 | MF |
| 10110 0 | n.d. | E.1 | 6.1 | |||||||
| 10110 1 | n.d. | 1.2， 9.2 | 1.2 | 1.2， 9.2 | 1.2 | 9.2 | MF | 9.2 | MF | |
| 10111 0 | n.d. | 7.1， F.1 | F.1 | 7.1， F.1 | F.1 | 7.1 | MF | 7.1 | MF | |
| 10111 1 | n.d. | 0.2，8.2 | MF | |||||||
| 11000 0 | 8.1 | 9.1， A.1， C.1 | MF | 9.1， A.1， C.1 | MF | OK | ||||
| 11000 1 | n.d. | 3.2 | ||||||||
| 11001 0 | 9.1 | OK | B.1， D.1 | OK | B.1， D.1 | OK | 5.1， 8.1， D.1 | OK | 5.1， 8.1， D.1 | |
| 11001 1 | n.d. | 2.2 | 2.2， 9.1 | 2.2 | 2.2， 9.1 | MF | 9.1 | MF | 9.1 | |
| 11010 0 | A.1 | OK | B.1， E.1 | OK | B.1， E.1 | OK | 6.1， 8.1 | OK | 6.1， 8.1 | |
| 11010 1 | n.d. | 1.2 | A.1， 1.2 | 1.2 | A.1， 1.2 | MF | A.1 | | A1 | |
| 11011 0 | B.1 | OK | 9.1， A.1 | MF | 9.1， A.1 | |
||||
| 11011 1 | n.d. | 0.2，B.1 | MF | |||||||
| 11100 0 | C.1 | 0K | 3.2， D.1， E.1 | OK | 3.2， D.1， E.1 | OK | 8.1 | 0K | 8.1 | |
| 11100 1 | 3.2 | OK | 7.2 | C.1 | 7.2 | C.1 | ||||
| 11101 0 | D.1 | F.1， 2.2， C.1， 9.1 | OK | F.1， 2.2， C.1， 9.1 | OK | C.1， 9.1 | OK | C.1， 9.1 | OK | |
| 11101 1 | 2.2 | OK | MF | |||||||
| 11110 0 | E.1 | C.1， A.1 | MF | C.1， A.1 | MF | |||||
| 11110 1 | 1.2 | MF | ||||||||
| 11111 0 | F.1 | |||||||||
| 11111 1 | 0.2 | |||||||||
The note of table:
Row 1: all 2
6Individual code word
Row 2: as the meaning of data word or non-data word
Row 3: condition is rds＜=0 here, has stipulated level switching (PV) at the code word of equilibrium, exists level to switch (PE), be corrected as given code word possibility (perhaps OK, MF)
Row 4: condition is rds＜=0 here, has stipulated level switching (PV) at the code word of equilibrium, do not exist level switch (/PE), be corrected as given code word possibility (perhaps OK, MF)
Row 5: condition is rds＜=0 here, at the code word of equilibrium do not have specified level switch (/PV), switch but should carry out level according to the PLL condition, exist level to switch (PE), be corrected as given code word possibility (perhaps OK, MF)
Row 6: condition is rds＜=0 here, at the code word of equilibrium do not have specified level switch (/PV), switch but should carry out level according to the PLL condition, do not exist level switch (/PE), be corrected as given code word possibility (perhaps OK, MF)
Row 7: condition is rds＞0 here, has stipulated level switching (PV) at the code word of equilibrium, exists level to switch (PE), be corrected as given code word possibility (perhaps OK, MF)
As what describe in front the embodiment, code be applicable to according to rule 10 with MSB transmission formerly, but have following difference:
Must be noted that, always at first send counter-rotating position (do not rely on and whether begin) with LSB or MSB.According to the embodiment of regular 9LSB be used for avoid the rule of bit sequence 101010 correspondingly to be mated by forming coded data word:
1., then except reducing the RDS value, do not produce any rule about counter-rotating if formerly switch to MSB formerly from LSB.
2. between two MSB value formerly, must avoid (0110101 or 100101) under the MSB situation formerly hexadecimal value " a " afterwards the level of (replace under LSB situation formerly before) at " d " switch.
3. for all code words, there is not rule, because " a " itself is balanced (follow a not have the rds value to change, do not need rule thus for indirect " a " in succession) at this in " a " equilibrium afterwards.
For from MSB transition formerly be LSB formerly, as long as last 3 is alternately (2,6, a is after the d), must prevent generally that then level from switching.
5. at LSB subsequently " d " formerly the time, identical as usual condition is suitable for (not having level to switch).
For MSB formerly, having according to rule 10 coding is 12 maximum run length (MRL), whether meets EMV and requires or meet PLL to require to be encoded and rely on.
Here in table, exemplarily list two kinds of flexible programs.A kind of more accurate coding rule is not requiring that (/GV sees below) causes clearer and more definite correction under the identical situation of level.
Legend:
MF: have multi-bit error (mistake is identified, but does not correct possibility usually) according to 3
OK: do not have mistake can discern (point 0)
GV: the code word at equilibrium is stipulated identical level (after A): enable level is switched!
/ GV: under the situation of the code word of equilibrium, do not require that level is identical; Should
A) level keeps identical (EMV reduces, definition)
B) switch level (PLL behavior, definition)
G: have identical signal level: the place value (not having level to switch) that current LSB=is last
/ G: exist level to switch: current LSB ≠ last place value
X.1: the code word 1 of data word X
X.2: the code word 2 of data word X
N.d.: do not have the data code word: special condition is suitable on the position of preamble
The runic place value: having mistake (according to the correction of point 2 or 1) in one of these values, is with good conditionsi in case of necessity
Table 2: do not consider precedence under the situation of the code word of the having of equilibrium/GV as the code corrects rule of the example of correcting in little code redundancy situation lower part.
For flexible program a), usually should following correspondingly replacement value under/GV situation:
Row/GV and G: as same column GV and/G
Row/GV and/G: as same column GV and G
For flexible program b), usually should following correspondingly replacement value under/GV situation:
Row/GV and G: as same column GV and G
Row/GV and/G: as same column GV and G
These are replaced and correspondingly are applicable to rds＜=0 and rds＞0 respectively.
| Code word | Data word | rds＜＝0 | rds＞0 | ||||||
| GV and PE:(begin to locate the condition that level switches at word) | |||||||||
| GV G | GV /G | /GV G | /GV /G | GV G | GV /G | /GV G | /GV /G | ||
| 00000 0 | 0.1 | MF | OK | ||||||
| 00000 1 | 1.1 | ||||||||
| 00001 0 | 2.1 | ||||||||
| 00001 1 | 3.1 | 7.1 | C.2 | 7.1，C.2 | |||||
| 00010 0 | n.d. | MF | 0.1，B.2 | ||||||
| 00010 1 | n.d. | MF | A.2 | 1.1，A.2 | |||||
| 00011 0 | n.d. | MF | 9.2 | 2.1，9.2 | |||||
| 00011 1 | n.d. | 8.2 | 3.1 | ||||||
| 00100 0 | n.d. | MF | 0.1 | ||||||
| 00100 1 | n.d. | 1.1 | |||||||
| 00101 0 | n.d. | 3.1 | |||||||
| 00101 1 | n.d. | 3.1 | |||||||
| 00110 0 | n.d. | C.1 | 7.2 | 7.2，C.1 | C.1 | 7.2 | 7.2，C.1 | ||
| 00110 1 | n.d. | 6.2，D.1 | MF | ||||||
| 00111 0 | n.d. | 5.2，E.1 | |||||||
| 00111 1 | n.d. | 4.2，F.1 | |||||||
| 01000 0 | 4.1 | MF | OK | ||||||
| 01000 1 | 5.1 | 7.1， 9.1 | MF | 7.1，9.1 | |||||
| 01001 0 | 6.1 | 7.1， A.1 | |||||||
| 01001 1 | 7.1 | B.1 | 3.1，5.1，6.1 | ||||||
| 01010 0 | n.d. | C.1 | MF | C.1 | 4.1， C.1 | 4.1 | 4.1，C.1 | ||
| 01010 1 | n.d. | D.1 | 5.1 | ||||||
| 01011 0 | n.d. | E.1 | 6.1 | ||||||
| 01011 1 | n.d. | F.1 | 7.1 | MF | 7.1 | ||||
| 01100 0 | 8.1 | 9.1， A.1， C.1 | MF | 9.1.A.1， C.1 | OK | |||
| 01100 1 | 9.1 | OK | MF | OK | OK | MF | OK | |
| 01101 0 | A.1 | OK | MF | OK | OK | MF | OK | |
| 01101 1 | B.1 | OK | 7.1， 9.1， A.1 | MF | 7.1，9.1，A.1 | |||
| 01110 0 | C.1 | OK | 3.2， D.1， E.1 | OK | OK | 3.2， D.1， E.1 | ||
| 01110 1 | D.1 | OK MF | 9.1， C.1 | MF | 9.1，C.1 | |||
| 01111 0 | E.1 | A.1， C.1 | MF | A.1，C.1 | ||||
| 01111 1 | F.1 | MF OK | ||||||
| 10000 0 | F.2 | |||||||
| 10000 1 | E.2 | A.2， C.2 | MF | A.2，C.2 | ||||
| 10001 0 | D.2 | 9.2， C.2 | 9.2，C.2 | |||||
| 10001 1 | C.2 | OK | MF | OK | OK | MF | OK | |
| 10010 0 | B.2 | 7.1， 9.1， A.1 | MF | 7.1，9.1，A.1 | OK | |||
| 10010 1 | A.2 | OK | MF | OK | OK | MF | OK | |
| 10011 0 | 9.2 | OK | MF | OK | OK | MF | OK | |
| 10011 1 | 8.2 | OK | 9.2， A.2， C.2 | MF | 9.2，A.2， C.2 | |||
| 10100 0 | n.d. | 7.2 | MF | 7.2 | 7.2 | 7.2， F.2 | F.2 | 7.2，F.2 |
| 10100 1 | n.d. | 6.2 | E.2 | |||||
| 10101 0 | n.d. | 5.2 | D.2 | |||||
| 10101 1 | n.d. | 4.2 | C.2 | MF | C.2 | |||
| 10110 0 | 7.2 | OK | 3.2 | OK | OK | B.2 | OK | |
| 10110 1 | 6.2 | OK | A.2， 7.2 | MF | A.2，7.2 | |||
| 10111 0 | 5.2 | OK | 9.2， 7.2 | MF | 9.2，7.2 | |||
| 10111 1 | 4.2 | OK | MF | |||||
| 11000 0 | n.d. | MF | 4.1，F.2 | |||||
| 11000 1 | n.d. | MF | 5.1，E.2 | ||||
| 11001 0 | n.d. | MF | 6.1，D.2 | ||||
| 11001 1 | n.d. | C.2 | 7.1 | 7.1，C.2 | C.2 | 7.1 | 7.1，C.2 |
| 11010 0 | n.d. | 3.2 | B.2 | ||||
| 11010 1 | n.d. | 2.2， A.2 | 2.2 | 2.2，A.2 | A.2 | MF | A.2 |
| 11011 0 | n.d. | 1.2， 9.2 | 1.2 | 1.2，9.2 | 9.2 | MF | 9.2 |
| 11011 1 | n.d. | 0.2，8.2 | MF | ||||
| 11100 0 | n.d. | 3.2 | 8.1 | ||||
| 11100 1 | n.d. | 2.2 | 9.1 | MF | 9.1 | ||
| 11101 0 | n.d. | 1.2 | A.1 | MF | A.1 | ||
| 11101 1 | n.d. | 0.2，B.1 | MF | ||||
| 11110 0 | 3.2 | OK | 7.2 | C.1 | 7.2，C.1 | ||
| 11110 1 | 2.2 | MF | |||||
| 11111 0 | 1.2 | ||||||
| 11111 1 | 0.2 | ||||||
The note of table:
Row 1: all 2
6Individual code word
Row 2: as the meaning of data word or non-data word
Row 3: condition is rds＜=0 here, has stipulated level switching (PV) at the code word of equilibrium, exists level to switch (PE), be corrected as given code word possibility (perhaps OK, MF)
Row 4: condition is rds＜=0 here, has stipulated level switching (PV) at the code word of equilibrium, do not exist level switch (/PE), be corrected as given code word possibility (perhaps OK, MF)
Row 5: condition is rds＜=0 here, at the code word of equilibrium do not have specified level switch (/PV), exist level to switch (PE), should under the situation of the code word of equilibrium, carry out level according to coding rule (a) meeting that EMV requires or meet PLL according to flexible program b requires) and switch according to flexible program; When condition not when given in advance, be corrected as given code word possibility (perhaps OK, MF), otherwise according to row 4 or row 3 in the flexible program b possibility that be corrected as respective code of flexible program in a)
Row 6: condition is rds＜=0 here, at the code word of equilibrium do not have specified level switch (/PV), do not exist level switch (/PE), should under the situation of the code word of equilibrium, carry out level according to coding rule (a) meeting that EMV requires or meet PLL according to flexible program b requires) and switch according to flexible program; When condition not when given in advance, be corrected as given code word possibility (perhaps OK, MF), otherwise according to row 3 or row 4 in the flexible program b possibility that be corrected as respective code of flexible program in a)
Row 7: condition is rds＞0 here, has stipulated level switching (PV) at the code word of equilibrium, exists level to switch (PE), be corrected as given code word possibility (perhaps OK, MF)
Additional embodiments:
The method according to this invention is not limited to systematic code.Especially, when always in the concentrated selection code word of considering under the situation of RDS from the code word of the equivalence that replaces, (as in the document of for example mentioning in front) coding rule arbitrarily of block code can be handled in an identical manner.In the ordinary course of things, can adopt clear and definite arbitrarily coding rule, binary code word all uses 0 to replenish, and under these comprise the situation of all bit reversals of code word of the place value 0 of being replenished identical data value is distributed to resulting code word.Select first generation code word or amended code word by the RDS value then.
Claims (16)
1. be used for when the coded data by at least one data word form of communication system transmits, carrying out the method for fault processing, wherein at described at least one data word, according to selecting the code data word by coding rule given in advance, wherein said data are represented as a plurality ofly can get two different values, i.e. 1 and 0 position, it is characterized in that, form like this at least one distance of swimming numeral and, make at least by this code data word form the accumulative total of sum of 1 sum and 0 poor and transmit this distance of swimming numeral and, this distance of swimming numeral and influential to the coding rule of described data word, wherein under the situation that comprises all code data words subsequently, determine described distance of swimming numeral and and check the coding rule of each single code data word thus, wherein under situation devious, identify mistake.
2. according to the method for claim 1, it is characterized in that, except described coded data, between first user and the second user, also transmit at least one non-code data word at least, described non-code data word can not be encoded by coding rule given in advance according to described, and described distance of swimming numeral and being transmitted as the part of described non-code data word at least.
3. according to the method for claim 1, it is characterized in that, correspond respectively to first or second generation code word according to the described selected code word of coding rule that can be given in advance, this first or second generation code word be the code word of relative to each other reversing.
4. according to the method for claim 1, it is characterized in that, can concentrate selection from least two different code words according to described coding rule according to the described selected code word of coding rule that can be given in advance.
5. according to the method for claim 1, it is characterized in that, by a plurality of code data words form described distance of swimming numeral and, and check, described distance of swimming numeral and whether surpass can be given in advance maximum magnitude, identification error subsequently wherein.
6. according to the method for claim 1, it is characterized in that identifying the rub-out signal that generates first user under the wrong situation, wherein said first user has identified this mistake and described rub-out signal is transferred to second user at least.
7. according to the method for claim 1, it is characterized in that, identifying under the wrong situation, vicious data are abandoned and the user of transmitting these data obtains resending the request signal of these data.
8. according to the method for claim 1, it is characterized in that, except described coded data, between first user and the second user, also transmit at least one non-code data word at least, described non-code data word can not be encoded by coding rule given in advance according to described, and by described non-code data word form described distance of swimming numeral and.
9. according to the method for claim 1, it is characterized in that, carry out wrong correction in the following manner, promptly according to described distance of swimming numeral and redefine subsequently distance of swimming numeral and, and replace vicious data in view of the above.
10. according to the method for claim 1, it is characterized in that the strategy that is used for fault processing according to the number of mistake is predesignated.
11. the method according to claim 1 is characterized in that, the strategy regulation is not carried out error correcting under prerequisite that can be given in advance.
12. the method according to claim 1 is characterized in that, carries out wrong correction in the following manner, promptly vicious data word is replaced with the data word of the defined of determining.
13. be used for when the coded data by at least one data word form of communication system transmits, carrying out the device of fault processing, wherein at described at least one data word, according to selecting the code data word by coding rule given in advance, wherein said data are represented as a plurality ofly can get two different values, i.e. 1 and 0 position, it is characterized in that, form like this at least one distance of swimming numeral and, make at least by this code data word form the accumulative total of sum of 1 sum and 0 poor and transmit this distance of swimming numeral and, wherein determine code data word subsequently distance of swimming numeral and and with the distance of swimming numeral of transmission subsequently with compare, wherein under situation devious, identify mistake.
14. have the user who is used for when the coded data by at least one data word form of communication system transmits, carrying out the device of fault processing, wherein at described at least one data word, according to selecting the code data word by coding rule given in advance, wherein said data are represented as a plurality ofly can get two different values, i.e. 1 and 0 position, it is characterized in that, form like this at least one distance of swimming numeral and, make at least by this code data word form the accumulative total of sum of 1 sum and 0 poor and transmit this distance of swimming numeral and, wherein determine code data word subsequently distance of swimming numeral and and with the distance of swimming numeral of transmission subsequently with compare, wherein under situation devious, identify mistake.
15. have the computer program of the program code on the data medium of being stored in, be used for when the communication system of computer support is performed, implementing method according to one of claim 1 to 10 when program.
16. have the computer program of program code, be used for when described program when the communication system of computer support is performed, implement according to one of claim 1 to 10 the institute in steps.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| DE102004018082.2 | 2004-04-08 | ||
| DE102004018082 | 2004-04-08 | ||
| DE102004061803.8 | 2004-12-22 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1943154A true CN1943154A (en) | 2007-04-04 |
Family
ID=37959888
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200580012103 Pending CN1943154A (en) | 2004-04-08 | 2005-04-07 | Error treatment during data transmission via a communication system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1943154A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111713074A (en) * | 2017-12-22 | 2020-09-25 | 罗伯特·博世有限公司 | Subscriber station for a serial bus system and method for signaling errors for messages received in a serial bus system |
-
2005
- 2005-04-07 CN CN 200580012103 patent/CN1943154A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111713074A (en) * | 2017-12-22 | 2020-09-25 | 罗伯特·博世有限公司 | Subscriber station for a serial bus system and method for signaling errors for messages received in a serial bus system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1208920C (en) | Data transmission method, data transmission system, sending device and receiving device | |
| CN1292201A (en) | Image decoder and image encoder | |
| CN1294540C (en) | Coding-decoding coordinate interpolating symbol key-work data and key-value data apparatus and medium thereof | |
| CN1178460C (en) | Picture encoder, picture decoder, picture encoding and decoding method, and medium | |
| CN101069356A (en) | Decoding device and communication device | |
| CN1582578A (en) | Mapping system for transmission and reception of multiple data types | |
| CN1751516A (en) | Robust system for transmitting and receiving map data | |
| CN1640142A (en) | Method and apparatus for coding of wavelet transformed coefficients | |
| CN1487748A (en) | Direct modo motion vector calculating method for image B | |
| CN1320769C (en) | Coder, decoder and data transfer systems | |
| CN1545813A (en) | Image encoding device, image decoding device, image encoding method, image decoding method, image encoding program, and image decoding program | |
| CN1196856A (en) | Picture encoder, picture decoder, picture encoding method, picture decoding method, picture encoding program recording medium and picture decoding program recording medium | |
| CN1647139A (en) | Data conversion device and data conversion method | |
| CN101064563A (en) | Communication system, communication method for the same and mobile station and base station used for the same | |
| CN1650561A (en) | Audio data code conversion transmission method and code conversion reception method, device, system, and program | |
| CN1287529C (en) | A/d converter bias current circuit | |
| CN1262072C (en) | Encoding/decoding appts. and method in CDMA mobile communication system | |
| CN1232323A (en) | Interlacer, coding device, permutation method, coding method, decoding device and method and systems using them | |
| CN1196268C (en) | Parallel turbo coder implementation | |
| CN1933336A (en) | Construction of LDPC (low density parity check) codes using GRS (generalized reed-solomon) code | |
| CN1667998A (en) | Data detector and multi-channel data detector | |
| CN1578211A (en) | Clock signal switching device, clock signal switching method, data bus switching device, and data bus switching method | |
| CN100350433C (en) | Method for computing path error and extracting path break point | |
| CN1943154A (en) | Error treatment during data transmission via a communication system | |
| CN1545683A (en) | Data converting device and method, learning device and method, and program and recording medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20070404 |