Source: https://patents.google.com/patent/US3668632?oq=6%2C183%2C366
Timestamp: 2018-03-22 23:51:13
Document Index: 279787756

Matched Legal Cases: ['ART 3', 'art 2', 'arts 1', 'art 1', 'art 1', 'art 1', 'art 314']

US3668632A - Fast decode character error detection and correction system - Google Patents
Fast decode character error detection and correction system Download PDF
US3668632A
US3668632A US3668632DA US3668632A US 3668632 A US3668632 A US 3668632A US 3668632D A US3668632D A US 3668632DA US 3668632 A US3668632 A US 3668632A
Ira B Oldham
Apparatus for detecting and correcting errors in a digital computer storage system is disclosed. Data is encoded using a generalized Reed-Solomon encoder. Error detection circuitry including power sum calculating devices are used for detection of data in error. The error correction portion of the invention includes an improved decoding scheme for determining the location and magnitudes of errors within the data and has a very low average correction time. Means are provided for determining the starting area of a data block in the presence of errors in the starting area. Further means are provided for detecting a cyclic shift in a data character which, under normal conditions, would appear as an acceptable code word even though in error.
United States Patent Oldham, m
[54] FAST DECODE CHARACTER ERROR DETECTION AND CORRECTION SYSTEM [72] Inventor: Ira B. Oldham, III, Saratoga, Calif.
[73] Assignee: International Business Machlns Corporation, Armonk, NY.
[22] Filed: Feb. 13, 1969 [2!] Appl. No.: 798,976
[52] US. Cl.. ..340/l46.l
[ 1 June6, 1972 3,491,338 [[1970 Malloy ....340/l46.1
Attomey-Peter R. Leal and Hanifin & Jancin [57] ABSTRACT Apparatus for detecting and correcting errors in a digital computer storage system is disclosed. Data is encoded using a generalized Reed-Solomon encoder. Error detection circuitry including power sum calculating devices are used for detection of data in error. The error correction portion of the invention includes an improved decoding scheme for determining the location and magnitudes of errors within the data and has a very low average correction time. Means are provided for determining the starting area of a data block in the presence of errors in the starting area. Further means are provided for detecting a cyclic shift in a data character which, under normal conditions, would appear as an acceptable code word even though in error.
14 Claims, 25 Drawing Figures 51 CONTROLLER I ERROR 55 35 oumrcnon mm mm man H mm 'i fi sum 9 BUFFER 2V m l @1115 5 as t LINE 25 NUMBER 5 mam PATENTEOJUH 61972 3.668 ,632
sum U3UF11 DECPDE S L J 242 R r 209\ DECODE J 25 L 242 gg 2270 30 g $2 ZEROS Z1 R COUNTER A 2m DECODE T OFF gg 227b 259 DECODE G J M 220 DECODE 38 s WRITE DECODE G TRIGGER OFF an 245 CLOCK 245 FIG. 5
T0 DATA BUFFER DATA A17] CORRECT A25 51 429 FIG. 6
J23 NOT -01 EQUAL EQUAL ZERO ZERO LINE POWER T R CALCSEAIURS T0 ERROR as CORRECTION N0 START FOUND 5; Aos- SLT'XFET START DESERIAUZER 402 END DETECT DETECTOR B 319 0 L FROM FIG so V403 A30 489* 31 S 25 v sum 1 READ DATA usofig j REGISTER PATENIEDJUH 6 I972 3,668,632
SHEET sum 11 NO START FOUND FF QQ READfLOOK 579 CF25 I60 I COUNTER l l R F -ADVANCE 350 04 HALF 2 1 ADDER SI IOI 25 3 A c2 7 HALF 4 B ADDER s2 SI 7 255 265 5 CI 02' c' 7 HALF e ADDER $1 213 HALF 8 ADDER 82 E HALF I0 ADDER SI E 259 2H H c2 7 c4" f c" A F I2 B 52 SI" 5" HALF I4 ADDER 52 L E FIG. 7
as I I I I I I I -5 -4 -a -2 -4 o I 2 L I I I I I I I I I19 I25 L ZERO .L, 55 ZERO DETECT NOT ZERO m H m FIG. 6A
PATENTEDJUH 8 I972 3,668,632
SHEET 08 [1F 11 TABLE LOOK-UP 1 L06 TABLE FLOGASO FLOGQSA MODULO-63 SUBTRACTOR R ADDRESS TRANSLATOR VERROR LOCATION ERRoR MAGNITUDE CORRECTION F|G.8A-A
FROM F\G 6 CORRECT ER EDC START 3A4 m V ERRoR ,REREAo L 4E0 L84 To CORRECTION F\G.8A 34 75 RECHECK ERROR ,NO START FOUND Q DETECTION CORRECTED DATA 72 FlG.8B-A
PATENTEnJun 6l972 3,668,632
SHEET 10 0F 11 552 59s 5Q4 511 I J I 501 i F FIRST OUTPUT ROW ADDRESS 505 MFIRST OUTPUT coumu ADDRESS sscoun OUTPUT ROW ADDR. 5oe\ SECOND OUTPUT COLUMN ADDRESS FiRST INPUT ROW ADDRESS 5015.5: MEMORY --FIRST INPUT coumw ADDRESS SECOND INPUT ROW ADDR. 512 WsEcoNu INPUT comm ADDRESS FIRST OUTPUT 505 515 SECOND INPUT SECOND OUTPUT 509 -rr 5 mm NPUT l 516 H ,540 TEMPORARY REG. 544 KEY ROW 1 ADDRESS '541 RESET REGISTER -542 INCR. l1l545 524 ADDRESS 551 RESET CONTROL REGlSTER :552 INCR. 527A SUBTRACT 528} ,560
55 v 555 -mm RE I TER 552 INCR. 55v 565 5741 'Q; '571 RESET 550 582 RE TER *512 INCR. 551 *svs 583 535 n 575 5 LENGTH 555* V515 PATENTEDJUH 6 I972 3,668,632
SHEET 1]. HF 11 4000 MULTIPLIER v v-l v-2 v-3 0 4009 {OH} 1043 4045 m 1007 0001050 39 o fig "3 '0 0000000 ADVANCE V 61;] 4022 +024 ADDER #4041 ZERO #1020 DETECT +022 +021 POLYNOMIAL r DIVIDER +025 REGISTERS REGISTER 0000050 4 4045 00100000 N0 $001000 SOLVER $001000 NO 1 n0e R M 40440 00 REC 0 000050000 50 H 1 ERROR 40701 0500050 MAGNITUDES 0% LOCATION I 4055 LOG 4055Q 1049 052 FIG. 10
FAST DECODE CHARACTER ERROR DETECTION AND CORRECTION SYSTEM RELATED APPLICATIONS This application is related to application serial number 798,975 filed Feb. 13, 1969, and assigned to the common assignee.
BACKGROUND OF THE INVENTION 1. Field of the Invention This invention relates to apparatus for the detection and correction of errors in a digital computer storage system.
2. Description of Prior Art The complexities of modern life have generated the need for the electronic processing of vast amounts of data. This need has triggered the development of large-scale, fast electronic digital computers which have on line large amounts of bulk or mass storage. Data is processed and then stored in mass storage to be retrieved as needed. During the storage and retrieval of this data, data error rates are sometimes encountered which, depending upon the system involved, can be high and, in fact, intolerable.
In the past, simple error detection and correction systems have been built to correct errors generated in the storage and retrieval of data. However, these systems cannot perform powerful error correction procedures. For example, they can correct a small number of independent single bit errors or can correct a number of bits which are all in one burst, but cannot correct multiple bursts as the Reed-Solomon type codes can. Also although Reed-Solomon codes theoretically could be implemented, such implementation would take an inordinately long period of time for correction in any practical system. Further, these systems have suffered from the inability to overcome problems involved with loss of synchronization in data clocking. Furthermore, in prior art systems using cyclic codes, a cyclic shift of a character would result in an incorrect character which would appear to the system to be correct. This is because a cyclic shift of a code appears to be a correct code, and therefore and error could go undetected.
Accordingly, it is the general object of this invention to provide a new and improved system for error detection and correction.
A more particular object of this invention is to provide a system for error detection and correction which has a fast average correction time.
Still another object of this invention is to provide an error detection and correction system which can detect a cyclic character shift.
It is yet another object of this invention to provide a new and improved decoding scheme in an error detection and correction system.
It is still another objective of this invention to provide a new and improved scheme with direct correction of double errors.
SUMMARY OF THE INVENTION A new and improved error detection and correction system for use in a digital computer storage system is disclosed. A generalized Reed-Solomon encoder is used for encoding redundancy to be appended to blocks of data. The encoder also includes means for inverting certain bits within the redundancy to enable one to detect, and therefore correct, cyclic shifts within a data character. Data is then formatted, including the appending of a data block start pattern which allows the detection of the start of a data block by majority logic, even in the presence of a number of errors at the beginning of the data block. Data is written on a storage medium, the type of which may vary according to the requirements of a storage system. As the data is read from the storage system, the start pattern is detected and a given data block is sent to power sum calculators to determine the presence or absence of an error. Apparatus is also provided for detecting the identifier of a given data block to insure that the desired block of data is being read and detected. If errors are detected in the data, attempts are made to correct those errors by means of scheduling apparatus which allows the performance of optimized error recovery procedures.
BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a representation of the error detection and correction system of the present example embodied in a generalized digital computer storage system.
FIG. 2 is a representation of one storage medium to which the system of the present invention can be applied.
FIG. 2A is an illustration of how data can be recorded on the medium of FIG. 2.
FIG. 2B is an illustration of one manner of how data can be formatted for use in the invention.
FIG. 2C is an illustration of one way in which the identifier fields and start pattern of the data format of FIG. 28 can be configured.
FIG. 3 is a diagram of encoder of the invention.
FIGS. 4A 4D are diagrams of typical Galois field multipliers used in the invention.
FIG. 5 is a diagram of apparatus for generating the start pattern for a data block.
FIG. 6 is a representation of the error detection facility of the invention.
FIG. 6A is a representation of the power sum calculator group used in the invention.
FIG. 6B is a representation of a typical power sum calculator.
FIG. 7 is a representation of apparatus for detecting the beginning of a data block.
FIG. 8 is a representation of how FIGS. 8A-8C should be placed relative to each other.
FIGS. 8A-8C are a representation of the parameter and correction schedulers in the error correction facility of the invention.
FIG. 8A-A is a representation of the apparatus for performing single error correction.
FIG. 8A-B is a representation of the single error correction portion of the 1 EDC facility of the invention.
FIG. 8B-A is a representation of the EDC facility of our invention.
FIG. 8B-B is an example of the 3 EDC facility of our invention.
FIG. 8C-A is a representation of part of the parameter variation apparatus of our invention. I
FIG. 9 is a representation of the error correction decoder of our invention.
FIG. 10 is a representation of apparatus used in our invention to determine error location numbers and error magnitudes when multiple error correction is being performed.
DESCRIPTION OF PREFERRED EMBODIMENT STRUCTURE The structure of one embodiment of the invention is seen generally in FIG. 1. In that figure, a data utilization system 1, which may be, for example, a digital computer, is connected via Buses 3 and 5 to input buffer 7. Input buffer 7 is connected via line 9 to encoder 1 1. Line number generator 13 is also provided. Encoder 11 is connected via bus 15 to data buffer 17. Bus 19 connects data buffer 17 to format generator 21. The storage system, including a write and a read facility, is connected to format generator 21 by Bus 23 which is an input to the write facility of the storage system. The read facility of the storage system is connected via Bus 25 to error detection facility 27 which is connected to error correction facility 29 via lines 31 and 31a and also to data buffer 17 via Busses 33 and 34. Error correction facility 29 is connected to data buffer 17 by Bus 35. Also provided is controller 37 which controls and sequences operation within the system.
It is to be emphasized that the various features of the invention can be applied to many different types of storage systems.
One type storage system to which it can be applied is a photodigital storage system described generally in the article, Dynamic Recovery Techniques Guarantee System Reliability," by D. P. Gustlin and D. D. Prentice, I968, AFIPS Conference Proceedings, Vol. 33, Part 2, pages 1,389 1,397. In that system, data is stored by high-density recording in two dimensions on silver-halide photographic film chips, a number of chips being stored in a container or cell. The cells are brought to the reader under automatic control in response to main processor commands. Writing is accomplished with an electron beam and reading with a cathode ray flying-spot scanner. An electron beam recorder suitable for use in such a system can be found in the paper, An Electron-Beam System For Digital Recording, by K. H. Loeffler, IEEE 9th Annual Symposium on the Electron Ion and Laser Beam Technology, May 1967.
Another pertinent reference on a photo-digital storage system in which the invention could find use is the paper A Photo-Digital Mass Storage System, by J. D. Kuehler and H. R. Kerby, Proc. F..I.C.C., 1966, Page 753.
With reference now to FIG. 2, there is seen the layout of a photographic film chip which would be used if the present invention were embodied in a photo-digital system such as the one described in the above-cited publications. Each square, reading downwardly in a given column, is a frame. There are eight frames per column, F R-F and 492 data blocks called data lines. With reference to FIG. 2A, there is seen a representation of the manner in which data can be recorded on the photographic chip of FIG. 2. The digital code depicted in FIG. 2A uses two marks, one clear and one opaque, to represent one binary bit. A combination of one clear and one opaque spot corresponds to a binary zero; and its opposite, an opaque followed by a clear, represents a binary one. Lines are recorded in pairs, for example, the pairs 1,2 and 3,4 on FIG. 2A. Reading, utilizing a recording system such as that described in the paper by Loefiler, cited above, proceeds in the fashion indicated by the arrow in FIG. 2A. The manner in which the line turns are performed and the manner of tracking and line switching are described in detail in the patent application entitled Photographic Information Storage Optical Tracking and Switching System, Ser. Number 509,080, filed Nov. 22, 1965, now U.S. Pat. No. 3,480,919, and assigned to the assignee of the present invention.
Referring now to FIG. 28, there is seen one manner in which a data block may be encoded for use in the invention. As seen in that figure, each data block has a number of leading ls for clock synchronization. A start pattern is appended thereafter. Fifty six-bit data characters are thereafter appended, followed by two identification characters. After the identification characters eleven six-bit redundancy characters, R through R are appended by the encoder and are followed by a number of trailing is This totals 63 six-bit characters per data block, exclusive of start patterns and leading and trailing ls.
Seen in FIG. 2C is the start pattern and the two identifier fields in the data format of FIG. 2B. It is seen that the start pattern is in the form 00001000100101. For a preceding pattern for all ls, it can be shown that there is a minimum Hamming distance of 7 between this starting pattern and any correct preceding pattern of all ls.
Similarly, the pattern 00101 has a minimal Hamming distance of 3, the pattern 000100101 has a minimal Hamming distance of 5, etc.
Also seen in FIG. 2C are the identifier characters. The three F bits indicate the frame number of a given column, while all the eight L bits designate the desired line pair within a frame.
ERROR ENCODING The invention uses a powerful independent character error detection and correction coding technique. To facilitate this, information bits in each line are arbitrarily divided into six-bit characters. The code employed can correct errors in any five characters in a line of 378 bits. Further, it will detect almost all lines with more than five characters in error.
The code used is a generalized Reed-Solomon l l-character redundancy code over the Galois field (2). Using this code, the 52 information characters in a line are used to calculate l l redundancy characters which are appended for a total of 378 bits in the encoded line. Fifty of the information characters are data; the other two contain a line identification number. In addition to the 378 encoded bits, there are 42 other bits used for line header, line start pattern and line trailer.
The appropriate redundancy characters are produced prior to recording and appended to the line. The characters in a line are treated as coefficients of a polynomial with the first character understood as the coefficient of x the second of x,the 52nd of x (which is the last information character). The coefficients of x through x are zero before encoding and will contain the redundancy characters when the line has been encoded. The redundancy character generator divides this data polynomial" by a generator polynomial. The remainder obtained is subtracted from the data polynomial to produce a coded line polynomial which is, therefore, divisible by the generator polynomial with a zero remainder.
The generator polynomial is:
where a is a primitive root of the polynomial x +x+l which generates the Galois Field (2) from the Galois Field (2). A coded line polynomial is divisible by each of the 1 1 factors of the generator polynomial; thus, the coded line polynomial is zero when x=a' for 5 s i s +5.
When a line is read, it is checked in the following manner. Eleven check sum calculating circuits substitute the eleven values x a for -5 s i s +5 into the coded line polynomial. If all 1 1 check sums are zero, the line is considered correct; otherwise, there is an error and the eleven check sums can be used by error correction means to try to correct the errors.
When five or fewer characters are in error, the check sums are not zero. The magnitude and location of the errors can be calculated from these sums. The magnitude is that pattern of bits in error in a character. The location indicates the character in the line in which the bits should be changed. When there are six or more characters in error, it is impossible to solve correctly for the locations and magnitudes. In this case, the errors can usually be detected but can never be corrected.
The principle involved in correction can briefly be explained as follows:
If there is a single character error, the line polynomial would be:
a x +a x (a +Y)x +a x where the a,, for 62 a i a 0, are the correct data; Y is the magnitude of the error; and L is the power of x at the error location. This polynomial is the sarne as the error-free polynomial with the exception of the added term YX".
The check sums for the correct line would all be zero if there were no error. With the error they are S, X' Y because only the error causes them to be non-zero. One special case is:
S.,= a =Ya= Y 1 Therefore, in the case of a single error, S is the magnitude of the error. The location of the single error is computed using 5,.
S, Ya"- 5,18 Y a'-/Y= 0:-
L=Log,,,$,/S 3 The computations use logarithms with the base a, so the equation manipulated is:
L=(Log,,S -Log S Mod 63 (4) New and improved decoding apparatus allow correction of more than one error by the solution of simultaneous equations. Each additional error provides two more unknowns: the magnitude and the location. Thus, two additional check sums are required for each additional error. Five errors can be found from ten check sums. The eleventh check sum is pro vided to help detect the presence of other errors, which are not correctable.
In the error correction process, a strategy is employed which minimizes the average amount of time spent in error correction. In a series of steps, single error correction can be tried, followed by rereading and double error correction, and so forth, up to five-character error correction. Singlecharacter error correction is very fast. Therefore, singlecharacter error correction can be tried many times along with subsequent rereads in less total time than going to the next level of correction. Furthermore, most lines in error have only a single character error. The correction process proceeds up an hierarchy of error correction levels and other read recovery functions before giving up on a line.
Addition, Subtraction, and Multiplication by a Constant in the Galois Field (2 We will use six-bit characters. If we are to use six-bit characters only, we must use an arithmetic which operates with sixbit characters only. It would not do to use an arithmetic in which the sum of two six-bit characters is a seven-bit character.
An arithmetic which uses only six-bit characters is arithmetic in the Galois field (2). We can define this arithmetic in an arbitrary manner and then look at the addition and multiplication tables to verify that it works.
Characters. All six-bit patterns are characters in GP (2 There are 64 in all. For convenience we will call some of them by special names as follows:
000000 is called zero (or 000001 is called the unity element 000010 is called a, the primitive element This is a positional notation; that is, the position as well as the number of l 's affects the value of the character.
Addition. We wish to define some kind of addition. The operation which we will define as addition is to exclusive-or the corresponding positions of the two characters. Examples:
110101+10l000=0l1l0l (l) Ol1000+10000l=lllOOl (2) lll00l+l0000l=0ll000 (3) 100100 +0O0000= 100100 (4) l00l00+l00l00=000000 (5) Subtraction can be defined as the addition of an inverse; but, if each character is its own inverse, this means subtraction is the same as addition, i.e., b-a=b+a orb+a=c;c+a=b (see examples 2 and 3 above. Now we have finite characters, addition, and subtraction.
Multiplication. Multiplication will be described piece by piece until we have a complete statement of the rules of mu]- tiplication.
1. Multiplication by zero produces zero.
2. Multiplication by the unity element produces no change.
3. Multiplication by a, the primitive element, causes a shift left one.
0101 1l 0000l0=101l10 4. Multiplication which shifts a bit off the left causes it to be carried around and be added into the two rightmost positions:
100000 0000I0=00O01 1 Note in the last example the bit carried around to the second position added to the bit shifted to the second position to produce a zero in the second position.
5. Multiplication by a character which has one one bit causes a shift left (and carry around). The number of positions shifted is the same as the number of positions to the right of the one" bit.
6. a(b c) ab ac in a field. Using this we can perform multiplication by characters which have more than one onebit.
In the invention we will use logarithms except in the encoder and error sum calculator where we will make the connections to perform the shifting and exclusive-or functions.
Check Bit Generator The check bit generator of FIG. 3 comprises 11 storage registers, multipliers to implement division by a fixed division, and exclusive-OR circuits to perform addition in the Galois Field (2).
Redundancy character generation is similar in principle to polynomial division by a fixed divisor. The data polynomial contains 63 powers of x. The original data, positioned into 50 six-bit characters, are the coefficients of the first 5O powers of x, (x to x). The line number field is the coefficient of x and x and coefficients of x to x are zero. After division by a fixed divisor, the remainder is stored in the 11 check bit registers, R11 to R1. The contents of these registers are the coefficients of x to x in the encoded data line stored in the device buffer.
The fixed divisor used for redundancy character generator is:
Note that the coefiicient of x is unity, as required by the circuits. There are no inverters because every character is its own inverse in the Galois Field (2). The memory elements, R1 to R11, store six bits each. All lines are six-bit parallel. The adder consists of exclusive-OR circuits and the multipliers are implemented by combinations of multiplication by powers of a, typical examples of which are seen in FIGS. 4A-4D.
With reference to FIG. 3, redundancy characters are generated by partitioning the data into 52 six-bit characters and applying each, in turn, to the half adder 200. The adder exclusive ORs the data and Register 11 contents. Adder output is then multiplied by the indicated powers of a and then applied to each register inputs. Each register input consists of a multiplier output added to the contents of the lower-order register. Input to register 1 is actually the sum of the input data character and register 11 contents because multiplication by 04 is multiplication by unity. After 52 characters have been applied, the registers contain the redundancy characters. These are then transferred to the device buffer to complete the encoded data line.
Cyclic Shift Detector An undetected error may occur if a line is started six bits late. To protect against this, three errors are introduced prior to writing a line. These same three errors are removed during reading by re-inverting them before the line is tested for error. If the line is started at other than the correct bit time, six errors will occur, the three introduced before writing and three more when reading. This makes the line uncorrectable.
The inverted bits are in three of the redundancy characters and include character 54 bit 2, character 57 bit 3, and character 60 bit 4.
Referring back to FIG. 3, there is seen circuit 47 which enables cyclic character shift detection. After a data block is encoded, the eleven redundancy characters R R remain in the registers as indicated. They are then read out over line 49 to circuit 47. This can be done either character by character or in serial, depending upon the designers choice. Circuit 47 is set up for serial reading of the redundancy character to the buffer after the reading of the data characters to the buffer. It is the function of circuit 47 to invert three bits in the redundancy characters.
Line 49 is connected to AND gates 51, 53, 55, 57. Bit timing is generated by generator 59 which is connected to binary counter 61 and also to the above mentioned AND gates by line 63. Binary counter 61 is connected to comparison means 65, 67, 69 by Bus 71. Constantnumber generators 73, 75, 77 are connected to the respective comparison circuits as shown. Upon equal comparison a signal is emitted over lines 79, 81, 83. These lines are connected respectively to the above mentioned AND gates and also to inversion means 85, 87, and 89. These inversion means are, in turn, connected to OR gate 91 which is connected to AND gate 51. The outputs of AND gates 53, 55, and 57 are connected to OR gate 93, which in turn is connected to inverter 95. Inverter 95 and the output of AND gate 51 are connected to OR gate 97. The output of OR gate 97 is line 15 to data bufier 17 of FIG. 1. Circuit 47 will invert bit 8, 27, and 46 in the redundancy added to the data block. In operation, data enters the encoder of the line 9 and is encoded, proceeds over line 9 to the data buffer over line 15. After encoding, the eleven redundancy characters reside in registers R R They are then read out, in the present example serially, over line 49. Each pulse from the bit-timing generator 59 steps binary counter 61 one count. As the seventh bit is read out of the feedback shift register, comparison circuit 65 will activate line 79. The eighth bit coming down line 49 will therefore pass through activated AND gate 53 which has all of its conditions fulfilled at that time. The eighth data bit will pass through OR gate 93 and be inverted in inverter 95 and pass through OR gate 97 onto the data buffer over line 15. If the redundancy bit is not number 8, 26 or 47, that is character 54 bit 2, character 5 7 bit 3, and character 60 bit 4, respectively, it will then pass through AND gate 51, OR gate 97, and then over line to the data buffer in its noninverted condition. This is so inasmuch as none of lines 79, 81 or 83 will be active thereby causing inverters 85, 87, and 89 to activate AND gate 91, thus fulfilling the third condition to AND gate 51.
Alternatively, the inversion of the above bits can be accomplished by taking them from the off side of the triggers which can comprise the redundancy registers.
Format Generator The format generator seen generally at 21 in FIG. 1 is seen in detail in FIG. 5. It is the function of the format generator to write the start pattern 00001000100101 in the position shown in FIG. 28. With reference to FIG. 5, there is seen bit clock 201 which is connected byline 203 to binary counter 205. Binary counter 250 is connected by Bus 207 to decoders 208, 209, 21 1,-,225 Each decoder decodes the binary sequence indicated by the number within the box representative thereof. Each decoder 209 221 is connected to OR gate 227, the output of which serves as a gating input to gated write zeroes trigger 229. The on output 231 of trigger 229 conditions AND 218 to allow zeroes to be written on the recording medium, in a manner well-known to those skilled in the art, during the particular bit times under consideration. The off output 233 is connected as an input to AND gate 235. Decoders 223 and 225 are connected to OR gate 237. The output of OR gate 237 serves as gating inputs to the on and 01f sides of gated write data trigger 239. The 0N output 241 of trigger 239 conditions AND 220 to allow data from the data buffer to be written on the recording medium over line 23 in a manner well-known to those skilled in the art, during the bit time under consideration. The off output 243 is connected as an input to AND gate 235. Bit clock 201 is also connected by line 245 as set and reset inputs to both triggers 229 and 239, and also as an input to AND gates 212, 218, 235, 220. Decode 208 sets latch 210 to condition AND 212 to allow the writing of ones during each bit time under consideration.
In operation, when the time comes to write the encoded data from the data buffer onto the storage medium, bit clock 201 is started. Bit clock 201 increments binary counter once each bit time. The output of binary counter 205 is sent over Bus 207 to each of the decoders. On the first bit time, decode l, 208 sets latch 210 to provide an enabling input to AND gate 212. Timing is such that the first timing pulse from bit clock 201 proceeds over line 245 as the second input to AND GATE 212, thus causing activation of line 214 to write a 1 on the recording medium. It is desirable to write 24 leading 1's to begin a record. Therefore, latch 210 keeps AND gate 212 conditioned to write a I once each bit time up to and including the 24th bit time. At bit time 25, Bus 207 is decoded by decoder 209 which resets latch 210, thus deconditioning AND 212. The output of decode 25 on line 216 is transmitted via OR gate 227. Assuming the trigger 229 is initially off, the arrival of a pulse from OR gate 227 concurrently with a 25th bit clock pulse over line 245 acts as a set pulse over line S to turn the write zeroes trigger 229 on, thus enabling a zero to be written byline 234. For the next three clock pulses (pulses 26, 27, and 28), no decode outputs. will be enabled; and, therefore, write zeroes trigger 229 will remain on, thus conditioning AND gate 218 during each of those clock pulses to write a zero. Thus, the first four zeroes of the start pattern are written. On clock pulse 29, decoder 211 will cause OR gate 227b to condition the off side of write zeroes trigger 229 and as that clock pulse comes along over line 245, it will turn write zeroes trigger 229 off over the reset line R, thus activating line 233. It is assumed that originally write data trigger 239 is otf so that line 243 conditions AND gate 235. During this same period, the 29th clock pulse is also conditioning AND gate 235 so that all of its inputs are fulfilled and a one is written on the storage medium. It will be apparent to those skilled in the art that sufficient delay will be necessary in line 245 to insure that each bit clock pulse arrives at AND gates 212, 218, 235 concurrently with the proper enabling signals as described.
Thus far there have been written 24 l's, four zeroes, and a subsequent l on the storage medium. On the 30th clock pulse, decode 213 will gate the on side of trigger 229; and the set pulse over line 245 will turn write zeroes trigger on to enable gate 218 so that a zero can be written on a storage medium. AND gate 218 will also be enabled during clock pulses 31 and 32, thus enabling a total of three more zeroes to be written on the storage medium. Thus far, there have been written 24 Is, followed by the pattern 00001000. On bit clock pulse 33, decode 215 will turn off trigger 229 via OR gate 227b with the co-action of the clock bit pulse over line 245 acting as a reset pulse. This will activate line 233. Since 243 is already assumed activated, the 33rd bit clock pulse will cause a l to be written via AND gate 235. On the 34 th clock pulse decode 217 will enable the on side of trigger 229 which will then be turned on by the 34th clock pulse. This enables a zero to be written during timing period 34 and 35. During clock pulse 36, decode 219 will cause, with the co-action of the 36th bit clock pulse, trigger 229 to be turned off, thus enabling AND gate 235 to write a l on the storage medium. Similar action continues with bit clock pulse 37 writing a zero and bit clock pulse 38 writing a l on the storage medium in an action similar to that described above.
Thus far there have been written on the storage medium 24 ls followed by the pattern 00001000100101. On the 39th bit clock pulse, decoder 223 via OR gate 237 will condition the on side of write data trigger 239 and the 39th bit clock pulse, via line 245, will set write data trigger 239 to its on condition so that the 39th bit clock pulse and all subsequent bit clock pulses up to the last bit clock pulse for a given data block will cause right data control line 23 to be activated, each bit clock pulse to write bits of the data message of the data block on the storage medium. The last bit clock pulse of a data block will cause decode 225 to condition write data trigger 239 to its off condition so that the last bit clock pulse will turn off the write data trigger.
ERROR DETECTION FACILITY Moving on to FIG. 6, there is seen a diagram of the error detection facility of the invention. Read data enters the error detection facility over line 25, as mentioned previously with regard to FIG. 1. Line 25 is connected to shift register 101 which, in turn, is connected via line 103 to line start detector 105, line 25 also being connected to deserializer 107. Line start detector 105 is connected via line 109 to deserializer 107 which, in turn, is connected via bus 33 to line number detector 11 1 and power sum calculators 113, and also to data bufier 17 of FIG. 1. Deserializer 107 may be any type well-known in the art. Line number detector 11 1 and power sum calculators 1 13 are connected via lines 117 and 119, respectively, to AND gate 121, the output 33a of which serves as an indication to data buffer 17 that the data is correct. The line number detector and power sum calculators are also connected via lines 123 and 125, respectively, to OR gate 127, the output of which forms one input to AND gate 129. The other input to AND gate 129 is line 131, over which a pulse is transmitted when the end of a data block is detected. End detection pulses for data blocks are detected in many ways well-known to those skilled in the art and will not be discussed further here. AND gate 129 is connected via line 31, originally seen with respect to F IG. 1, to the error correction facility.
In operation, read data is transmitted bit by bit to shift register 101 which transmits 14-bit characters over Bus 103 to line start detector 105, which will be described in detail subsequently. When a line start is detected, start line 109 activates deserializer to transmit the data block characters to the line number detector 111, the power sum calculators 113, which will be described in detail subsequently, and to the data buffer via line 33. If the line number is detected as correct and the power sums are all zero, gate 121 will be activated to send a pulse over data correct line 35a to the data buffer to indicate that the data block which is read is correct and can then be sent back to the data utilization system. If the line number detector indicates that the line number is in error or if the power sum calculators indicate that the power sum is not zero, AND gate 129 is activated by way of OR gate 127 and end detection pulse over line 131 to send a signal to the error correction facility over line 31 to indicate the error correction procedures must be brought into play to correct the data block which is now in data buffer 17.
Line number detector 111 is merely a comparison unit which compares the identifier characters seen in FIGS. 2C with the desired data line number, and will not be discussed further here. The power sum calculators are seen generally in FIG. 6A. When reading, data progresses along data line 33 and the eleven power sums are calculated. A generalized power sum calculator is seen in FIG. 6B. In that figure, line 33, seen also in FIG. 6A, is connected to exclusive OR gate 133. The exclusive OR gate is connected to a six position register 135 which will hold the power sum after calculation. Register 135 is connected to multiplier 137 which is configured in the same manner as the multipliers seen originally in FIGS. 4A4D. The coefficients 5 to +5 are individually used for the literal i for the power sum calculators. Multiplier 137 is connected back to exclusive OR gate 133.
Line Start Detector Because of the nature of the start pattern, the line start detector detects the line start pattern if 1 l or more of the 14 bits of the line start pattern are correct. The pattern sought for is 00001000100101. It will be recalled from FIG. 6 that read data is inserted into shift register 101. The line start detector is essentially an adder. It counts the number of bits not corresponding to the line start pattern. When this count equals four or more, an error is indicated. Bits 5, 9, 12 and 14 from the shift register (the one bits in the pattern) are inverted so that the input to the line start detector will be 14 lines at zero level when the pattern is correct.
In FIG. 7, blocks 249, 251, 253, 255, 257, 259, 261 are halfadders. The two inputs to each are added with one exclusive OR and one AND circuit. The output of the AND is the carry C and the output of the exclusive OR is the sum S. A bit on the sum line is indicated by (1), while a bit on a carry line is indicated by (2). The logic equations for each half-adder are given below:
A B where edenotes a logical EXCLUSIVE OR denotes a logical AND.
Also, denotes a logical OR in Equations (B) (G) below.
For adders 249, 253, 257, these sum and carry terms are denoted S1, C1. For adder 259, these terms are denoted S2, C2. For adder 261, these terms are denoted S2", C2". But in each case, they are formed according to the generalized eq uations (A).
Blocks 263, 265, 267, 269, 271 add their respective two input pairs and generate an error if the sum exceeds three. If the sum does not exceed three, the sum is placed on the S and C outputs of the block. The final block, 273, merely checks for a sum in excess of three. A signal is sent out of the E line if this is the case, and no line start is detected. The logic equations for blocks 263, 265, and 267 are:
It will be noted from equations (B) through (G) that there are eleven possible signal terms comprising the E signal outputs for the various adders (one each for adders 263, 265, 267; three for adder 269; two for adder 271; three for adder 273). Each of the E terms in FIG. 7 are Ored together in OR gate 158. If any of these eleven composite terms are active, one of the E signals will activate the OR gate to cause the output of the following inverter 159 to be inactive. A clocking pulse which can be developed, for example, from the read clock of the reading facility advances shift register 101 via the advance line and presents a new 14 bit pattern to the line start detector each clock time. The advance line is also connected through delay 160 as an enabling input to AND gate 161. The output of AND 161 is connected to the set side of latch 162. The output of latch 162 is the line start signal 109 originally seen in FIG. 6 and is also connected via an inverter to AND 163. The other input to AND 163 is a signal from the counter which is activated at the end of the 23rd clock time. If at the end of 23 read clock periods, a start has not been found, this is taken to indicate that a start cannot be found and line 36, no start found, also seen in FIG. 6, is activated.
In operation, at a certain period of time into the data line, which can be specified by a clock synchronization pulse developed in a manner well-known in the digital recording arts, the reader clock advances counter which advances the shift register 101 to present a 14 bit pattern to the line start detector. A delay D is required for the new pattern to ripple through the detector and stabilize its output. If no error has been found, the output of inverter 159 will be activated at the time the sampling pulse arrives via delay 160, and the output of AND gate 161 will set latch 162 to generate a signal on LINE START line 109. This happens each clock period until a successful line start is found or until the 23rd clock period is detected at which time AND 163 is sampled. lfline 109 is not then active, the output of AND 163 will activate the NO START FOUND line 36.
It is to be noted that the disclosed start pattern is not limited to 00001000100101 but can be any start pattern preceded by a number of sync bits, where the sync and start pattern is one of the form where X is a data representation, X is the complement of X,
n is the number of times X is repeated and m is at least the number of X bits necessary for clock synchronization. In general, the line start pattern detector will count the number of bits not corresponding to the line start pattern. When this count equals n or more, an error is indicated. That is to say, a start pattern of the type disclosed will allow the detection of the start of the line even in the presence of up to n-l errors in the start pattern.
In an extended line start pattern detector, the inputs from the one bits of the start pattern will be inverted as was explained for the line start detector of FIG. 7. Logic equations (A) (G) can be extended to count n-l errors.
Power Sum Calculators Error detection circuits monitor data from the reader by character. Each six-bit character is applied in parallel to 11 check sum calculating circuits of FIG. 6A. After 63 characters have been received, the check sum registers are tested for error. Zero register content (zero check sums) indicates the data line is free of error. Non-zero check sums indicate one or more errors. Check sum values indicate magnitude and location of an error or errors. The sums are transferred to the error correction facility for analysis.
The line of data is held in the device buffer while error analysis and correction takes place. After correction is complete, the revised line of data is read out of the bufier l7 and applied to the check sum calculating circuits. Zero sums indicate successful correction and reading continues with the next line. Non-zero sums cause the same line to be read again.
ERROR CORRECTION FACILITY The error correction facility includes an error correction decoder which has facilities for use in two, three, four and five error correction. Single error correction is done utilizing a fast table look-up scheme. Data recovery is done using a statistically optimized scheduler which schedules parameter variation in the storage facility to allow a possibly better read upon rereading of the data, if the first reading of the data has been in error and uncorrectable.
Referring first to FIG. 8, there is seen the manner in which FIGS. 8A 8C should be placed relative to each other in order to better understand the parameter scheduler and EDC schedulers of the invention.
It will be recalled from the theory of Reed-Solomon codes that for the code used in the present example, there are eleven single-character results of root substitution containing information as to location and magnitude of the errors. The error detection decoder of the present invention solves up to ten equations and ten unknowns. The ten unknowns are the five locations and the five error magnitudes to allow correction of five errors. The eleventh resulting character can be used as error detection.
Usually there is only one error, and its correction is referred to as l-EDC (Error Detection and Correction). In this case it is necessary only to solve two equations and two unknowns, that is, the error location and the error magnitude. A special single error apparatus using table look-up is tried immediately upon first detecting an error. The results become available, the correction is made in the buffer 17, and the repaired line is read out of the buffer and rechecked for error. If a Photo- Digital Storage System such as the one described previously is the vehicle within which the present invention is embodied, the repaired line can be rechecked for error in less time than it takes the scanning spot to loop around to where it is about to start reading the line again. If the correction is successful, the line can be passed over and the following line can be read. If not, the line is reread and checked again according to the EDC schedules to be discussed subsequently. If the line is still incorrect after the I-EDC schedule, the schedulers will attempt 2-EDC, 3-EDC, 4-EDC and S-EDC respectively, with reader parameter variation as will be discussed.
Error Recovery Procedures If a line is read in error, and cannot be corrected after a given number of attempts with an EDC scheduler, physical parameters in the reading facility are varied with a parameter scheduler; and correction is tried again according to an EDC scheduler. Several parameter variations will now be described.
Line Jump Line jump is a feature of the invention which makes use of the fact fliat line numbers of adjacent line pairs are numerically consecutive. A line in the vicinity of the desired line is read, and corrected if necessary. The numeric difierence between this corrected lines number and the desired lines number is computed. This difference provides a relative distance and direction information to help find the desired line. The process varies for executing the line jump. A line from which to base a direct jump may already be available; that is, a line may already be read and corrected, but may be of the wrong line number. If so, the method of line jump begins at step 6 below. if not, an arbitrary line jump is used to gain such a line. Specifically, steps 1 5 below are executed for an arbitrary line jump and followed by steps 6 10 for a direct line jump.
l. The reader is forced to loop on an opaque pair, independent of line-number compare results.
2. One scan-tum is then forced to be opposite to the normal forced looping turn; the reader resumes looping, but on a pair adjacent to the first. This is one step in a jump.
3. Three such steps, for example, are taken in one arbitrary direction.
4. A special command is issued to read the line in the same sweep direction as the desired line, no matter what its number is.
5. If the line so read is not correct or correctable, steps 3 and 4 are repeated.
6. If the line read is correct or corrected, its line number is used to compute D, the number of line pairs distant it is from the pair containing the desired line number.
7. D steps are then taken toward the desired line.
8. Assuming the reader is not looping on the desired line, a
special read command is again issued to read the line, regardless of its line number.
9. If, in either steps 4 or 8, the line is not only correct or corrected, but also of the desired line number, it is sent to the utilization system.
10. The reader is forced on to the next desired line because the line number of the line just corrected may not be reliable enough. Then, reading resumes to obtain the next line.
Hardened Clock Synchronization If the invention is embodied in a Photo-Digital System such as that described above, emulsion shifts on the recording medium can cause an apparent sudden shift in the data rate. If this is severe, the clock transition tracking servo utilized in reading may not follow the shift, and synchronism is lost. Occasionally, a difficult line can be read by reducing the clock servo damping factor to make the servo more aggressive so that it will track more extreme clock frequency shifts. This is called hardened clock sync, and can be commanded by the scheduler to be described subsequently.
Ofiset Scanning In a Photo-Digital System, the scanning spot normally travels along the data line so that its geometric center moves parallel and halfway between a transparent base line and an opaque base line. This is done by a line servo such as that described in the above co-pending application. Any divergence from this path is generally accompanied by a notable increase in single error correction activity. However, some marginal lines can be read only if the spot is offset high or low from the center position. This can be done by forcing a DC bias into the voltage controlling the offset of the scanning spot. One reason for using offset scanning in a Photo-Digital System is that a particular flaw looks slightly different at the offset position. Another reason is that very dark or very transparent flaws tend to steer the spot off course somewhat before the effect is electronically detected. This can be compensated for by the high or low ofiset in the opposite direction.
Extend Coasting In a photo-digital system there may often be an optical hole in the recording medium. An optical hole is a situation in which extreme light or extreme dark is detected by the optically sensitive reader. It will be recalled that both a line following servo and a clock tracking servo are used in a photo-digital read facility. Extended coasting essentially takes a guess at the average hole size in the recording medium. In other words, when a hole is detected, an order can be given to the clock servo to cease following the clock transition, and to the line following servo to cease following the line. This is done for a fixed length of time. At the end of that time, the servos are turned on again in an attempt to follow the line and the clock. The result may be successful and allow correct of the line. One manner of implementing extended coasting is to allow the detection of extreme light or extreme darkness in the reader for a given period, say two bit times, to fire a single-shot, the output of which will hold the two servos off for the time period of the single shot. The desired time period of the single shot can be empirically optimized. At the end of that period the servos can be turned back on to try to read and correct the line.
Auxiliary Line Start Auxiliary Line Start (ALS) is of two types, normal auxiliary line start for the case where a line start pattern was not detected where it should have been detected, and forced auxiliary line start, used later on in the recovery procedure to be described subsequently. Auxiliary line start logic is provided which searches for the beginning of the data field when a normal line start cannot be found. Search strategy includes the counting of a certain number of clock pulses, beginning at a clock synchronization point, which should bracket the expected position of the start pattern. This position can be determined empirically from the turn characteristics of the reader. Data is read immediately after this. The number of clock pulses counted after clock sync varied over a range of 33 to 39 which, for one embodiment, bracketed the beginning of the encoded data. When one of the reads then indicates a correct or correctable line, probability is very high that the data is good and the line is therefore accepted.
EDC SCHEDULES In the present embodiment there are assumed to be four EDC schedules A, B, C and C1. These schedules optimally schedule l-EDC through -EDC. One example of these schedules is shown in Table A below.
For example, EDC scheduler A schedules five attempts? single error correction. Likewise, EDC scheduler B schedules four attempts at 2 error correction followed by three attempts at 3 error correction followed by one attempt each at 4 and 5 error correction. Schedulers C and C1 are similar to the above. If any of these attempts result in a corrected data line the process is concluded. The error-correction schedules of Table A can be used in a parameter-scheduling scheme such as that seen in Table B.
TABLE B tended Ofl'set Offset Reread Action coast- Hard ride ride Line with EDC number ALS ing sync high low jump schedule 1 A 2 A 3 B 4- B 5 B 6 x B 7 x B 8 x B 9 x x B 10 x x B 11 x x B 12 x x B 13 x x x B 14 x x x B 15 x x x B 16 x x x B 17 x x x C 18 x x x C 19 x x x C 20 x x x C 21 x x x x C 22 x x x x C 23 x x x x C 24- x x x x C 25 x x x x C 26 x x x x C 27 x x x x C 28 x x x x C 29 x x x x Cl 30 x x x x C1 31 x x x x Cl 32 x x x x C1 33 x x x C1 34- x x x Cl 35 x x x C1 36 x x x Cl 37 (8 times, do mechanical motion and repeat actions 1-36) As can be seen, when an error is detected, the first action is to immediately perform 1-EDC with EDC Schedule A. If no correction is obtained after that schedule, the second action is to retry EDC Schedule A. Actions 3, 4 and 5 do the same thing with Schedule B. If after these five actions the line is not found to be correct, then EDC Schedule B is tried with a line jump. That is, a line jump is tried, as explained above. After line jump is successfully performed, the line is re-read while trying to correct any errors which occur, using EDC Schedule B. This continues through action 8. Beginning with action 9, a line jump with offset ride low is performed in the reader; when these are complete a re-read is performed and EDC Schedule B is performed. The ensuing actions proceed similarly, as can be seen by reading down the table. A re-read follows the beginning of each action after the indicated parameter variation is performed, and correction proceeds using the indicated EDC schedule.
EDC SCHEDULERS Turning now to FIG. 8A, there are seen the three EDC schedulers 301, 303, 305. Lines 319, 353, 363 act as set lines to A latch 317, B latch 350, and C latch 360, respectively. Each of the last-named lines are ORd in OR gate 366 to act as a start line to binary counter 300. Each above-named latch selects its respective EDC scheduler by way of AND facilities 306, 332, 362, the other input to each being counter 300.
EDC SCHEDULER A The output of AND 306 is Bus 326 which is connected to decoders 304 and 313. Decode l (304) supplies an output pulse when the sequence 1 is received from the counter.
Decode S (313) supplies an output pulse when the sequence is received from the counter. The output of decode 304 is a set line to latch 308. The output of decoder 313 is a reset line to latch 308, and also to latch 317 to deselect EDC Scheduler A. The output of latch 308 is the EDC START line which is gated with line 485b in AND 310, the output of which AND is 1- EDC START line 314. Line 485b is the complement of line 4850. If line 485a is active, it is an indication that Auxiliary Line Start is going to override every EDC Schedule selection. Consequently, 485b if inactive will block all EDC selection but if active will enable normal EDC selection. This will be treated in more detail subsequently. Line 310, from the error correction facility of FIG. 6 is activated the first time an error is detected and immediately starts 1- EDC. Line 31, originally from the above error detection facility is gated in each EDC facility with the respective EDC START line to begin the respective EDC activity, as will be subsequently explained in detail. Line 31 will be effective to begin activity on every EDC try after the first try of Action 1, since on that first try line 310 will immediately start 1-EDC without waiting for the EDC Scheduler circuitry to settle, in order to enhance speed. Line 31a will normally only be active on the first error detection as can be seen from FIG. 6 where AND 129a fires trigger 130 which sends a pulse out on 31a, but is immediately extinguished by latch 131, which thereafter holds trigger 130 ofi until either line 379 indicates the data line in error is corrected or the data line is determined unreadable.
As seen from Table A, single error correction is tried five times. That is, the first error indication will cause line 31a of FIG. 8A to immediately start 1-EDC on the incorrect data line in the buffer. A correction will be tried on the line in the buffer by sending the computed correction over the l-EDC correction bus seen in FIG. 8A, said correction being passed through OR 70 and over bus 35 to the buffer so that the correction can be attempted. After an attempt is made to repair the line, it is sent back over line 34 to be rechecked through error detection circuitry again. If the repair is proper and the data is correct, the correct line emanating from l-EDC 316 and serving as an input to OR gate 325 in FIG. 8A will activate line 35a, originally seen in FIG. I, to indicate to the buffer that the repaired line is indeed correct and should be sent to the utilization system. Concurrently, line 379 will reset all counters in the system to reset it to its initial condition ready to read the next line. If the attempted correction resulted in the repaired line still being incorrect, the reread line RRl will request a re-read from the storage facility and the ERROR line emanating from 1-EDC 316 and connected as an input to OR gate 323 of FIG. 8A will be active causing ERROR line 318 to advance binary counter 300 to try 1-EDC the second time according to EDC schedule A. This continues until after the fifth try binary counter 300 is advanced to 5 and the output of decode 313 resets latch 308 to end EDC Schedule A, resets counter 300 over line 315 via OR gate 365, resets A latch 317 to deselect the EDC scheduler A, and also advances binary counter 401 of FIG. 8B via OR gate 464 over line 315A. This steps the parameter scheduler to its second action noted in Table B.
EDC Scheduler B EDC Scheduler B is structured similarly to EDC Scheduler A. For example, in FIG. 8A, 353 is a set input to B latch 350, the output of which is an enabling input to AND 332. The other input to AND facility 332 is output bus of counter 300. The output of AND 332 is connected to decoders 331, 337, 343, 345 and 347 which decode counter sequences 1, 5, 8, 9 and 10, respectively. The output of decoder 331 is connected as a set line to latch 387, the output of which is gated with line 4851: in AND 486. The output of AND 486 is EDC Start line 336 for Z-EDC. The output of decoder 337 is a reset line to latch 387 and a set line to latch 389. The output of latch 389 is gated with line 4851: to form EDC Start line 342 for 3-EDC. The output of decoder 343 is a reset to latch 389 and also is gated with 48511 to form EDC Start line 346 for 4-EDC. The output of decoder 345 is gated with line 485!) to form EDC Start line 350 for S-EDC. The output of decoder 347 is line 349 which resets B latch 350 and also resets binary counter 300 via OR 365. Operation of EDC Scheduler B is in accordance with EDC Scheduler B in Table B.
EDC Scheduler C EDC Scheduler C, seen at 305 in FIG. 8A, is similar to EDC Scheduler B. C latch 360 selects AND 362 to gate the output of counter 301 to decoders 367, 371 and 375 which respectively decode sequences 1, 7 and 10. The outputs of decoders 367 and 371 set and reset latches 369 and 391 as shown which form gated EDC Start lines to 4-EDC and 5-EDC as shown. Operation is in accordance with Schedule C of Table B.
l-EDC Facility A typical EDC facility is seen in FIG. 8B-A for IEDC. Bus 34 is connected to AND 72, the other input of which is a line from the l-EC (Error Correction) which indicates a correction has been tried. This line could be the output of a latch set by the transmission of a correction and reset by the receipt of a data correct signal, for example. The output of AND 72 is an input to Error Detection circuitry 74. Error Detection circuitry 74 can be the same type circuitry as in FIG. 6 and, in fact, can be same physical circuitry in the system with proper gating well-known to those skilled in the art. Line 84 is an error line which both indicates an error and also requests a reread of data by line RR]. Data Correct line 76 is connected from error detection circuitry 74. Line 31a from FIG. 6 is connected to line 82 to immediately start 1 error correction the first time an error is detected. Line 31 from the error detection facility of FIG. 6 is connected as a gating input to AND along with EDC Start 314 originally seen in FIG. 8A.
In operation, the first time the error correction facility of FIG. 6 detects an error, line 31a immediately starts l-error correction in the 1-EC facility seen generally in FIG. SB-A. A correction is determined by l-EC and sent via the Correction bus to OR 70 of FIG. 8A which sends the correction to the data line in the buffer via bus 35. A correction indication also enables AND 72 over line 75. An attempted correction is made in the buffer and the corrected data is sent over simplex bus 34 to all EDC facilities seen in FIG. 8A. Since l-EC has just been tried, line 75 in FIG. 8BFA will gate the corrected data to error detection circuitry 74 for a recheck, since we are using less than the maximum power of the code, and there may have been more than one error. If the data is correct, correct line 76 will be activated to activate OR 325 in FIG. 8A to send a data correct indication to bufler 17 via line 35a to allow the corrected data line to be sent to the buffer.
If the recheck indicates the data line is still in error, error line 84 in FIG. 8B-A activates OR 323 of FIG. 8A to activate line 318 to advance counter 300 to its second sequence. EDC START line 314 in FIG. 8A remains active. Error line 84 in FIG. 8B-A also causes line RR1 of FIG. 8A to request a reread by setting latch 1103 through OR 1101 to try l-EDC a second time. If line 1107 in FIG. 8A is active indicating all parameters in the reader are settled (to be discussed subsequently) then latch 1103 output will be gated through AND 1105 to start the re-read. The re-read data will be passed through the Error Detection facility of FIG. 6. If the data line is still in error, line 31 will be active (line 31a will be held off by trigger and will gate EDC Start line 314 of FIG. 8B-A to start l-error correction. The process continues until the data line in rechecked correct or until decode 313 of FIG. 8A indicates the EDC Schedule A is complete, at which point the next action in the parameter schedule is initiated.
Turning now to FIG. 8A-A there is seen the apparatus for performing single error correction, seen generally at 73 in FIG. 8B-A. In FIG. 8A-A are seen power sum calculators S and S, from the group of power sum calculators originally seen in FIG. 6A. Line 82, seen originally in FIG. SB-A, gates the
1. In an error detection and correction system, the combination of: means for encoding data blocks by adding redundancy according to a non-random code, each said data block having an identifier near the end thereof; means for decoding said encoded data blocks and providing an indication of any error detected therein;.
2. The combination of claim 1 wherein said indication comprises a component contributed by an error in said identifier and a component contributed by an error syndrome generated by said code.
2. actuating control connections in a decoder to segregate Nu sets of first signals from combinations of components of said error syndrome, said Nu sets of first signals representative of elementary symmetric functions sigma i, and Nu being a selected integral value less than or equal to the maximum number of errors correctable by said code;
3. actuating apparatus for determining each of the non-zero elements of the Galois Field of qM elements which force the polynomial to be zero; and
3. In an error detection and correction system, the combination of: means for encoding characters with a non-random code to form an encoded data block comprising characters having a number of bits, said encoding means including means for inverting at least one bit of said encoded data block; means for checking errors in said encoded data block; and, means for re-inverting said at least one inverted bit prior to the operation of said error checking means on said at least one inverted bit.
4. The combination of claim 3 wherein the number of bits inverted encoder is equal to at least N/2 where N is a number greater than the maximum error correction capability of said code.
4. actuating control connections in a decoder to segregate Nu sets of second signals from a combination of components of said error syndrome and said non-zero elements of step (3), said Nu sets of second signals indicative of error magnitudes.
5. The combination of claim 3 wherein said inverted bits are in the redundancy added according to said code.
6. The method of providing error correction of data comprising the steps of: a. encoding characters of information to form an encoded information block having redundancy, by using a generator polynomial having Alpha 0 as a factor thereof, where Alpha 0 is the identity element of the Galois Field of qM elements; and b. decoding said encoded information block by forming check sums such that the magnitude of the error for single error correction is obtained directly as one of said check sums.
7. In a data error detection and correction system, a data encoder comprising shift register means having as components thereof symmetrical multiplication means, each of which is connected to modulo-two adders in said shift register, for encoding information blocks in a generalized Reed-Solomon code having Alpha 0 as a factor of its generator polynomial.
8. The method of recording a pattern XnXX(n-1)X-XX2XX1X where X is the logical complement of X, and n is the number of times X is repeated, including the steps of: decoding n sequences of clock pulses, each of said sequences being of length j, where j successively varies from n to ((n+ 1)-(n- 1)) ; and recording for each sequence decoded, a number of bits of a first logical state followed by a single bit of the complement logical state to said first logical state, said number of bits of said first logical state being of length equal to one less than the length of said decoded sequence.
9. In a data error detection and correction system, wherein data is encoded in a non-random code, the combInation of: a plurality of power sum calculating means for computing a residue from encoded data; means for determining the error magnitude and error location for single error correction, said last-named means including apparatus for performing Galois Field arithmetic to obtain the error location, and means for obtaining the error magnitude as the direct output of one of said power sum calculators.
10. The combination of claim 9 wherein said apparatus for performing Galois Field arithmetic includes: means for determining the logarithm to the base Alpha of specified power sums; means for providing an output indicative of the difference modulo qM between said logarithms where qM is the number of elements in said Galois Field and Alpha is the primitive element of said field; and means for translating said output to a physical storage address which contains said single error.
11. In a data error detection and correction system wherein data is encoded according to a non-random code and decoded to obtain a residue from said encoded data, the combination of: decoding means for obtaining elementary symmetric functions from particular components of said residue; detection means for determining the elements of the Galois Field of qM elements which force to zero the function where Nu is the number of elementary symmetric functions, sigma i are the elementary symmetric functions, X are elements of the Galois Field qM, and Nu -i is greater than 2 polynomial divider means for reducing the polynomial by each of said elements of said Galois Field; means for detecting that said polynomial has been reduced to a quadratic function; means for solving said quadratic function and providing an indication that solutions have been reached or that no solutions are possible; means for storing said solutions and said elements.
12. The combination of claim 11 further including decoding means for accepting said solutions and said elements and providing error magnitudes; and means for providing error location numbers from said solutions and said elements.
13. The combination of claim 12 further including detection means for providing an indication that there are insufficient elements in said Galois Field to reduce said polynomial to a quadratic; and gating means for supplying said last-named indication or said indication of no solution as a signal indicative of the fact that error correction is not possible.
14. In a data error detection and correction system wherein data is encoded in a non-random code, the process of determining error magnitudes and error locations including the steps of:
US3668632A 1969-02-13 1969-02-13 Fast decode character error detection and correction system Expired - Lifetime US3668632A (en)
US79897669 true 1969-02-13 1969-02-13
US3668632A true US3668632A (en) 1972-06-06
ID=25174735
US3668632A Expired - Lifetime US3668632A (en) 1969-02-13 1969-02-13 Fast decode character error detection and correction system
US (1) US3668632A (en)
US4870646A (en) * 1986-10-09 1989-09-26 Nec Corporation Word synchronizer
FR2400801A1 (en) * 1977-08-15 1979-03-16 Ibm detection system and error correction using the reed-solomon codes
EP0157867B1 (en) * 1983-09-27 1989-09-06 Cyclotomics, Inc. Error correction for algebraic block codes
WO1996024134A1 (en) * 1995-02-02 1996-08-08 Quantum Corporation A method and apparatus for protecting data from mis-synchronization errors