CA1223065A - Method for uniformly encoding data occurring with different word lengths - Google Patents

Method for uniformly encoding data occurring with different word lengths

Info

Publication number
CA1223065A
CA1223065A CA000454669A CA454669A CA1223065A CA 1223065 A CA1223065 A CA 1223065A CA 000454669 A CA000454669 A CA 000454669A CA 454669 A CA454669 A CA 454669A CA 1223065 A CA1223065 A CA 1223065A
Authority
CA
Canada
Prior art keywords
data
bits
words
symbols
wnk
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.)
Expired
Application number
CA000454669A
Other languages
French (fr)
Inventor
Kentaro Odaka
Tadashi Fukami
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sony Corp
Original Assignee
Sony Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Sony Corp filed Critical Sony Corp
Application granted granted Critical
Publication of CA1223065A publication Critical patent/CA1223065A/en
Expired legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/38Synchronous or start-stop systems, e.g. for Baudot code
    • H04L25/40Transmitting circuits; Receiving circuits
    • H04L25/49Transmitting circuits; Receiving circuits using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels ; Baseband coding techniques specific to data transmission systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/76Arrangements for rearranging, permuting or selecting data according to predetermined rules, independently of the content of the data
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11BINFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B20/00Signal processing not specific to the method of recording or reproducing; Circuits therefor
    • G11B20/10Digital recording or reproducing
    • G11B20/18Error detection or correction; Testing, e.g. of drop-outs
    • G11B20/1806Pulse code modulation systems for audio signals
    • G11B20/1809Pulse code modulation systems for audio signals by interleaving
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q11/00Selecting arrangements for multiplex systems
    • H04Q11/04Selecting arrangements for multiplex systems for time-division multiplexing

Abstract

ABSTRACT

A method for uniformly encoding data occurring in words of different lengths redefines the words into units or sets having a length determined by the possible lengths of the words, but independent of the particular length of the words operated on. A first method according to the present invention forms the words into an array having two directions of adjacent words defined therein, and groups the adjacent words into units having a length equal to an integer times a least common multiple of the possible word lengths. A
second method according to the present invention groups words of input data into respective sets such that the number of bits in a set of words of a first length equals the number of bits in a set of words of a second length.

Description

~223065 TITLE OF THE INVENTION
METHOD FOR ENCODING ERROR-CORRECTION-CODE

BACKGROUND OF THE INVENTION
Field of the Invention The present invention relates to a method of transmitting data sequence which is suitable for use in, for example, an audio PAM tape recorder and, more particularly, to a method for encoding error-correction-code which is applied to record, e.g., an audio PAM signal on a magnetic tape by a rotary head.
Description of the Prior Art There is known a method for performing the error detection or encoding error correction codes in the longitudinal and lateral directions of digital information data arranged like a matrix, respectively.
As one method in case of transmitting these codes for every column and decoding them on the reception side, there is considered a method whereby the error detection is performed by a first error detection code for each column, a pointer as a result of this is produced, and the data and pointer of each column are stored in a memory, then the error correction is performed for every row by a second error correction ~2~3065 code with reference to this pointer.
On one hand, the number of quantization bits of the audio PAM signal may vary in dependence upon the objects in use of the audio PAM signal recording/reproducing apparatus, or the like. Namely, to record and reproduce the audio signal with high-quality, the sampling frequency is is set into 48 kHz and the number of quantization bits is set into sixteen bits. To record and reproduce the voice signal at a conference and the like, the sampling frequency is is set into 32 kHz and the number of non-linear quantization bits is set into twelve bits.
When the sampling frequency is low, this enables the recording and reproduction to be performed at a half speed of the standard running speed of the magnetic tape (i.e., of the standard rotational speed of the rotary head), so that it is effective to reduce an amount of magnetic tape as the recording medium to be consumed.
It is desirable that the encoder and decoder for performing the error detection and error correction as mentioned above are constituted by a common hardware regarding a plurality of number of quantization bits and that they have the similar error correcting ability even in any cases.

~2236)~S

OBJECTS AND SUMMARY F THE INVENTION
It is an object of the present invention to provide a method of transmitting data sequence, wherein in the case where the number of bits of a sampling word is switched, the error correcting ability does not deteriorate even in any bit number.
Another object of the invention is to provide a method for encoding error-correction-code which is generally used and which can cope with a plurality of number of unitization bits.
Still another object of the invention is to provide a method for encoding error-correction-code, wherein in the case where errors which exceed -the correcting ability of the error-correction-code scour, a problem such that the data is mainly lost due to a difference in number of quantization bits is not caused.
According to the present invention, the above objects are accomplished by a method of transmitting data sequence, wherein an input data sequence of which one word consists of M bits is transmitted as a trays-mission data sequence of which one word consists of N
bits; when it is assumed that the at word from a certain time in the input data sequence is We, the input dais sequence is divided into k kinds of sets ~223065 ( nil (Wink)' -I (Wnk+kj (where n: arbitrary integer); when it is assumed that the both word from a certain time in the transmission data sequence is Web, the transmission data sequence is divided into k kinds of sets consisting of (W' k I
(Wink), ..., Wink and all bits of the words n the set of (W ) are the bits of the words in nk-~m he set of (W' ).
nk~m Another feature of the invention is that there is provided a method for encoding error-correction-code, whereby the error detection or the encoding for error correction is performed for the digital information data in which a plurality of blocks each consisting of a plurality of symbols are arranged with regard to each of a plurality of directions;
and that when it is assumed that symbol lengths of the digital information data are set into a plurality I Q2~ On a length of one sequence of one encoding operation among a plurality of encoding operations is determined to a value of integer times the least common multiple of Al Q2~ On) thereby allowing the symbols in the digital information data to be included in the unit of the least common multiple of this one sequence.
The above and other objects, features and ~2306S

advantages of the present invention will be apparent from the following detailed description in conjunction with the accompanying drawings.

BRIEF DESCRIPTION OF THE DUNKS
-Figs. 1 and 2 are schematic diagrams showing code constitutions of one embodiment of the present invention;
Figs. PA to YE are schematic diagrams which are used to describe the error correcting operation of one embodiment of the invention;
Fig. 4, appearing with Figs. 1 and 2, is a schematic diagram which is used to describe the even/odd interleave;
Figs, PA - 5C are schematic diagrams which are used to describe another embodiment of the invention;
Fig. 6 is a block diagram showing a circuit arrangement of one embodiment of the invention;
Fig, 7 is a block diagram showing a constitution of an example of a bit arrangement circuit;
Figs. 8, 9, AYE, 10B, lea and lob are schematic diagrams showing more practical code constitutions of one embodiment of the invention;
Figs. AYE and 12B are schematic diagrams showing a format of a record data in one embodiment of the invention;

~223~6S

Fig. 13 is a block diagram showing a recording/
reproducing circuit in one embodiment of the present invention; and Fig. 14 is a schematic diagram which is used to describe another embodiment of the invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
One embodiment of the present invention intends to record an audio PAM signal on a magnetic tape by a rotary head. Fig. 1 shows a code constitution of the audio PAM signal and redundancy data of error correction codes which are recorded in one segment to be formed by the scanning at one time by, e.g., the rotary head.
In Fig. 1, one block consists of each row in the vertical direction and M blocks are arranged in the horizontal direction. The audio PAM signal in one block consists of N words, so that the audio PAM signal consisting of total (N x M) words is arranged. An error detection code Of is added in each block in the vertical direction of such a two-dimensional array of this audio PAM signal, while an error correction code C2 is added to its horizontal direction. A check code P of n words of this error detection code C1 is included in each block, and the error detection code Of is also encoded even with respect to a check code Q of m words of the error correction code C2.
The above error correction codes are recorded on the magnetic tape sequentially from the Thea block.
The signal reproduced from the magnetic tape is first subjected to error detection in each block by the error detection code C1 and the error detection is performed on a block unit basis. As a result of this detection, a pointer indicative of the presence/
absence of an error is generated for every block.
For example, as shown by the hatched portions in Fig. 2, the Thea and it blocks are detected as the-blocks where errors are present. The error correction by the error correction code C2 is performed in the horizontal direction using the error location indicated by this pointer.
The word number N of one block of the foregoing error detection code Of is the number in the case where the word length of the audio PAM data is Q1 bits, e.g., 16 bits. Also, even in the case where the word length of the audio PAM data is Q2 bits, e.g., 12 bits, the similar processing for error correction encoding is carried out. In this case, a size of two-dimensional plane where C1 and C2 are ~2230~ -encoded, namely, the number of all bits is made equal with respect to both word lengths of Q1 and Q2 Therefore, the data of one block as one code sequence of the error detection code C1 has a length of (N x Al) bits, while the data of one code sequence of the error correction code C2 has a length of (M x Q1) bits.
When it is assumed that the continuous PAM
data are arranged sequentially in the direction of the C2 sequence from the first row of the two-dimensional array shown in Fig. 1, a plurality of words included in one code sequence of the error detection code C1 will not become continuous words.-For instance, when the PAM data are arranged sequentially from the first row in the horizontal direction such that the 16-bit data words WOW We, We, ..., or the 12-bit data words WOO, Wow, Wow, ..., the words of (WOW, WE, WOMB, ...) are included in the Thea block in case of 16 bits, while the words of (WOO and a 1; W (4/3)M and a part of W' are included in the Thea block in case of 12 bits.
Therefore, when the Thea block is detected as an error, this error word is distributed on a word unit basis as shown in Fig. PA.
Assuming that the error detection of the ~223065 error detection code Of is performed using Al bits as a unit, when a similar error is caused, as is obvious from Figs. PA and 3B, the error is detected as the two-word error in the case where the word length is 12 bits. For example, two words of WOO and W' are detected as the error words in correspondence upon the error word of one word WOW That is, the PAM data of the number of words which is twice the number of words which cannot be used when the word length is Al bits could not have been used.
If a symbol length of the error detection code Of is changed for every word length, such a problem will not be caused, but the encoder and decoder cannot --be realized by the common constitution in such a case.
Therefore, in this invention, a length of this one block is set into a value which is integer times the least common multiple L of the word lengths Al and Q2' That is, as shown in Fig. 3C, a length of the code sequence is selected to be a value which is, e.g., three times the least common multiple L. In the cases of 16 bits and 12 bits, (L = 48 bits) and nine words each having a word length of 16 bits are included in one block, while twelve words each having a word ~2Z30~5 length of twelve bits are included in one block.
In addition, for example, the adjacent words of the audio PAM data are arranged as three or four words included in this least common multiple L.
It is now assumed that the audio PAM data of the two-dimensional array as shown in Fig. 2 Hussein arrangement such that every three words are the continuous data in each block with respect to 16-bit data and such that they are interleaved on a block unit basis.
It is also assumed that such an audio PAM data is rearranged into one data sequence in accordance with the original sequence. It will then be discussed the case where the Thea block is detected as an error by the error detection code C1 under such conditions.
This data which was detected as the error has such a distribution as indicated by the hatched portions in Fig. ED. Namely, when the word length is 16 bits, the error having a group of continuous three words as a unit occurs. On one hand, in case of the word length of 12 bits, the error having a group of continuous four words as a unit occurs. Fig. YE shows an enlarged diagram of this one unit, in which the continuous three words We, We and We each having a word length of 16 bits are the error words and in correspondence upon this, the continuous four words Wow, Wylie, Wow, ~22306S

and Wow each having a word length of 12 bits become the error words.
Therefore, if the cases where the Thea block is detected as the error and where the error correction is impossible occur similarly in both cases of 16-bit words and 12-bit words, the data of nine words and twelve words cannot be used, so that it is necessary to interpolate them. In general, the number of words which cannot be used when a word length is Q2 bits is (Q1/Q2) times the number of words which cannot be used when a word length is Q1 bits.
In other words, in the foregoing example, according to the present invention, it is possible to suppress the number of words which cannot be used when a word length is Al bits into 1.33 times instead of two times. This effect will be similarly obtained even when a word length of the code sequence of the error detection code C1 is unified into Q2 bits.
On the other hand, as is obvious from Figs.
3B and YE, in the above method as well, both of the 2n+1 (or W 2n+1) and the even number word Won (or Winnie) will have been included in one word slot.
When the audio PAM signal is recorded as an oblique track using a rotary head, a set of odd ~22~065 number words and a set of even number words are recorded in the former half of the track and in the latter half thereof, respectively. Even when the audio PAM signal is recorded in the longitudinal direction of the magnetic tape by a fixed head, as shown in Fig. 4, a set of odd number words and a set of even number --words are divisional recorded such that the recording locations of the adjacent two words are apart from one another by only D. This method is called an even/odd interleave and even if a burst error occurs due to the dropout or the like upon reproduction, it is possible to interpolate it by a mean value of the words without an error which are located before and behind the error word. However, as mentioned above, if the odd number and even number words of the audio PAM signal are included in one word which is processed as the odd number words, even if the even/odd interleave is performed, the error correcting ability will remarkably deteriorate.
Therefore, in another embodiment of the invention, when (M = 12 bits) and (N = 16 bits) and (k = 2), the audio PAM data is divided into a set of odd number data and a set of even number data.
As shown in Fig. PA, a PAM tape recorder is constituted so as to record the data sequence which 12230~5 was divided into a set of odd number words of (We, We, We) each having 16 bits and a set of even number words of (We, We, We) each having 16 bits. In correspondence upon this, when the audio PAM signal of which one word consists of 12 bits is recorded, as shown in Fig. SUB, the data sequence it divided into a set of odd number words of (Wow, Wow, Wow, Wow) and a set of even number words of (Wow, Wow, Wow, Wow). Each set is allocated into a time slot of 16 bits. In this case, the 12-bit words are divided so that only the odd number words are included in the same time slot as shown in an enlarged diagram in Fig. 5C. Similarly, the 12-bit words are divided so that only the even number words are included in the same time slot. After such a bit arrangement was performed, the PAM tape recorder executes substantially the same processing as in the case where the bit number is 16 bits, thereby to produce the recording signal.
Fig. 6 shows recording and reproducing circuits in another embodiment of the present invention, in which the analog audio signal is supplied to an input terminal 1. This audio signal is converted into the audio PAM signal of which one word consists of sixteen bits by an A/D converter 2. This audio 122;~S

PAM signal is supplied to an input terminal of a switching circuit 3. One output terminal PA of the switching circuit 3 is connected to an input terminal of a recording encoder 5, while the other output terminal 4B is connected to an input terminal of a digital non-linear compression circuit 6.
The switching circuit 3 selects the output terminal PA when the data of which the number of bits of a sampling word is sixteen bits is recorded, while it selects the output terminal 4B when the data of which the sampling word has twelve bits is recorded. In addition, the sampling frequency is switched between 48 kHz and 32 kHz in association with the change-over of this switching circuit 3.
Therefore, in case of the 16-bit format, the sampling is performed at a frequency of 48 kHz and the linearly quantized audio PAM signal is supplied as it is to the recording encoder 5. On the contrary, in case of the 12-bit format, sixteen bits are compressed to twelve bits by the non-linear compression circuit 6 and this compressed 12-bit data is further supplied to a bit arrangement circuit 7. An output of the bit arrangement circuit 7 is supplied to the recording encoder 5.
Fig. 7 shows an example of the bit arrangement ~22306~

circuit 7. This circuit 7 is constituted by a shift register 21 of serial-in/parallel-out and a shift register 22 of parallel-in/serial-out. The shift register 21 consists of (12 bits x 8 = 96 bits) and the shift register 22 consists of (16 bits x 6 =
96 bits). In Fig. 7, the signal lines between Thea shift registers 21 and 22 are combined on a four-bit unit basis.
The audio PAM signal of which each one word was compressed to 12 bits is supplied from an input terminal 23 to the shift register 21. A shift clock is supplied from a terminal 24 to the shift registers 21 and 22 at a rate of once per bit. A parallel output of this shift register 21 becomes a parallel input of the shift register 22. The connection between these shift registers 21 and 22 is as shown in Fig. 7. It is now assumed that the time slots each having 16 bits are To to To sequentially from the side where an output terminal 25 of the shift register 22 is led out. In this case, the odd number words are divided and inserted into the time slots To, To and To as shown in Fig. 5C, while the even number words are similarly divided and inserted into the time slots To, To and To. The shift register 22 loads the output of the shift register 21 at a ~22~065 rate of once whenever eight words each consisting of 12 bits, i.e., 96 bits are shifted in response to a load pulse from a terminal 26. A serial output from the shift register 22 is fetched from the output terminal 25.
In addition to a combination circuit arrangement using the shift registers as mentioned above, the bit arrangement circuit 7 ma be constituted by an RAM and its control circuit as will be mentioned later.
The recording encoder 5 encodes the error correction codes using 16 bits as one word and performs the even/odd interleave for separating the respective recording locations of the adjacent odd number data and even number data. An output of this recording encoder 5 is supplied to a magnetic head 10 through a recording amplifier 8 and a recording/reproduction change-over switch 9. The audio PAM signal of which the error correction codes were encoded is recorded on a magnetic tape trot shown) in its longitudinal direction by the magnetic head 10. The sampling frequency is set to be low and the bit number is reduced from 16 bits to 12 bits, so that an amount of recording data is reduced by half and the running speed of the magnetic tape is also reduced by half.

~23~65 It is also possible to adopt a multi-track method whereby a plurality of tracks are provided in the direction of a width of the magnetic tape or a recording method using a rotary head.
Upon reproduction, the signal to be reproduced by the magnetic head 10 is supplied to a clock recovery circuit 12 through the recording/reproduction change-over switch 9 and a reproducing amplifier 11. The clock recovery circuit 12 is constituted as a PULL
to produce a bit clock synchronized with the reproduction signal. The reproduced bit clock is used for the data processing upon reproduction. The reproduction signal appearing in an output of the clock recovery circuit 12 is supplied to a reproducing decoder 13.
In the reproducing decoder 13, the deinterleave for returning the odd number data and even number data which have been recorded in the separate locations to the inherent sequence and the error correction are executed. Sizes of errors which can be corrected by the error correction codes to be used differ.
As the error correction codes, Reed Solomon Codes, simple parity, adjacent codes, etc. can be used.
These codes may be combined as a form of product codes or may be used together with the CRC codes for error detection.

The audio PAM signal which was returned to the original time sequence is fetched as an output of the reproducing decoder 13. This reproduction signal is supplied to a switching circuit 14. One output terminal AYE of this switching circuit 14 is connected to an input terminal of an error correction circuit 18 and the other output terminal 15B is connected to an input terminal of a bit rearrangement circuit 16. The switching circuit 14 selects the output terminal AYE when the bit number of the sampling word is sixteen bits and selects the output terminal 15B when it it twelve bits. This switching operation of the switching circuit 14 is automatically performed by, for instance, fetching a format discrimination signal added to the recording signal upon reproduction.
The bit rearrangement circuit 16 serves to return the 16-bit word inserted into each time slot into the 12-bit word. This bit rearrangement circuit 16 is constituted such that it has the opposite input/output relation to that of the bit arrangement circuit 7 shown in Fig. 5 and that the load pulse is given to the shift register 21. An output of the bit rearrangement circuit 16 is supplied to a digital non-linear expansion circuit 17. This non-linear expansion circuit 17 performs the expansion ~2~30~5 which is complementary to the compression by the non-linear compression circuit 6, so that the audio PAM signal of which each one word consists of sixteen bits appears as its output.
This output of the non-linear expansion circuit 17 is supplied to the error correction circuit 18~ The error correction circuit 18 corrects the error words which could not corrected by the reproducing decoder 13. The error correction circuit 18 performs the interpolation using a mean value when the words before and behind the error word are correct, while it carries out the operation of front-value holding or post-value holding when only one of the words before and behind the error word is correct. An output of the error correction circuit 18 is supplied to a D/A converter 19, so that the analog audio signal is fetched from an output terminal 20.
Upon reproduction, the switching circuit 14 is switched in accordance with the format of the reproduction data and the running speed of the magnetic tape is also determined in correspondence upon the format.
As in above-described another embodiment of the invention, the bit rearrangement circuit 16 for converting the 16-bit words into the 12-bit words ~:23C~S

is inserted at the stage after error correction and before error compensation. This is because the error correction to be executed by the reproducing decoder 13 is the processing in which sixteen bits are used as one word and when the error correction was done, the data is completely returned to the original data;
on the contrary, the compensation to be performed by the error correction circuit 18 is the arithmetic operation processing in which a word value itself has the meaning.
A more practical example of the embodiment of the present invention will be further described.
The signal in the L channel and the signal in the R channel in the two-channel audio signals are sampled at the sampling frequency of 48 kHz, respectively, so that the words H and Rip each having sixteen bits are formed. A two-dimensional array corresponding to one segment is constituted by 720 words of Lo to L719 and 720 words of Row to R719.
This arrangement method will be explained with reference to Fig. 8. Fig. 8 shows an array of one channel, for example, L channel and the word numbers 0 to 719 are written in the diagram. There are forty eight blocks in this array and the block numbers 0 to 47 are added to the respective blocks lZ23~36~;

and every fifteen words are inserted in each block.
The data of these blocks are sequentially recorded on the magnetic tape from the Thea block.
The error word which cannot be corrected among the error words caused due to the errors upon recording and reproducing is interpolated by the correct words before and behind the error word.
As mentioned before, to effectively perform this interpolation, the recording locations of the even number designated PAM data and of the odd number designated PAM data in each channel are kept away from each other. Therefore, the even number data Lo Lo, Lo, ..., L718 are arranged in the twenty four blocks of the block numbers (O - 23), while the odd number data Lo, Lo, Lo, ..., L719 are arranged in the twenty four blocks of the block numbers (24 -47).
The PAM data is distributed in each block (O - 23) such that the adjacent three words in this data sequence bearing even numbers are arranged as a unit, while the PAM data is distributed in each block (24 - 47) such that the adjacent three words among the data sequence bearing odd numbers are arranged as a unit. When discussing the even number designated data as an example, three words of (Lo Lo, Lo) are ~2230~;5 arranged in the Thea block and three words of (Lo, Lo, L10) are arranged in the first block; in this way, the data are distributed in the similar manner, and three words of (L138~ L140' L142) arranged in the 23rd block. Then, three words of (L144, L146, L148) are again arranged in the Thea block. By repeatedly performing these operations, the even number designated PAM data of total 360 words of (Lo - L718) are arranged. In addition the odd number designated PAM data are also arranged in the same manner as described above such that every adjacent three words are arranged as a unit- In such an array, three words in each block are neighboring and the groups each consisting of such three words can be separated.
Furthermore, the other R channel has the similar arrangement as Fig. 8.
On the other hand, in the case where one word consists of twelve bits, as shown in Fig. 9, the data of four words is inserted into the data region of three words when one word consists of sixteen bits even with regard to the words Lowe and Roy in each channel. For example, the data of the 12-bit words of the word numbers 0, 2, 4, and 6 are inserted into the data region of the 16-bit words of the word 12230~;~

numbers 0, 2 and 4.
Moreover, in one embodiment of the invention, since the encoding processing is performed using eight bits as one symbol, one word is divided into the higher significant eight bits and the lower significant eight bits. Figs. lo and lob show the whole code constitution including the PAM data in the L and R channels which have the fundamental array shown in Fig. 8 and the check codes of each of the error detection code Of and error correction code I In Figs. lo and lob a suffix A indicates a symbol of the higher significant eight bits and a suffix B represents a symbol of a lower significant--eight bits.
Generally, in rotary head type tape recorders, the contact conditions between the rotary head and the magnetic tape at the edge portion where the slide contact there between is started and at the edge portion where the slide contact is ended are bad, so that this causes an error rate to be raised.
Therefore, the check code symbol Q of the error correction code C2 and the check code symbol P of the error detection code Of regarding this are arranged respectively in the blocks having the block addresses of (O - 15) (Fig. loan and in the blocks having the ~2;~306~

block addresses of (112 - 127) (Fig. lob which correspond to these edge portions. The audio PAM
data and the check code symbol P regarding this are arranged in the blocks of the block addresses of (16 - 111) corresponding to the central section.
It is also possible to arrange the check code symbol Q and the check code symbol P of the error detection code C1 regarding this in the central section and to arrange the even number designated audio PAM
data and the odd number designated audio PAM data in the sections on both sides.
The error detection code C1 is the Reed Solomon Codes over GO (2 ) of (32, 30) and the code-sequence has the two-block completion type interleave for allowing errors of the block addresses to be certainly detected. For example, the error detection code C1 is encoded with regard to thirty symbols (Q00' Queue' Q04' Queue ' Queue Sol' Q03~ Queue Queue Queue) which locate in the even number designated addresses in the blocks of each of the block addresses 0 and 1 and the check code symbols of PRO
and Pox are added. Similarly with respect to the block addresses 16 and 17, one code sequence of the error detection code C1 is formed by thirty two symbols (L L , LEA, LOB L2goA~ 290B AYE 292B

SKYE

AYE 580B' P160' P161) which locate in the even number designated addresses in the blocks of each block address. In addition, one code sequence of the error detection code C1 is formed by thirty two symbols (Roar Rob ..., Roy R290B' ' ROY' R580B, P170, P171) which locate in the odd number -designated addresses in the blocks of the block addresses 16 and 17.
On the other hand, in case of the 12-bit data, the encoding processing is performed using six bits as one symbol, so that one word is divided into higher significant six bits and lower significant six bits.
Figs. lea and lob show an example corresponding to a part of Fig. Andy the error check code symbols P and Q of the error detection code sequence Of and error correction code sequence C2 may be processed on an eight bit unit basis; in such a case, no problem will be caused.
Therefore, the encoding of the error detection code Of is performed with respect to thirty symbols (Q00~ Queue' Q04~ Queue Queue Queue Sol' Q03~
Queue Queue) which locate in the even number designated addresses in the blocks of each of the block addresses of, e.g., 0 and 1, and the check code symbols of lZ23065 PRO and Pox are added. Moreover, one code sequence of the error detection code C1 is formed by forty two symbols (Lowe L OBOE L AYE L 2B~ L AYE' 384B' AYE' 386B' ' AYE' 774B' 160' P161) which locate in the even-number designated addresses in the blocks of each of the block addresses of 16 and 17. These are similar to the R channel as well.
It will be appreciated from this example that, in the code constitutions shown in Figs. loan lob lea, and lob, two symbols which constitute the same word are included in the same code sequence of the error detection code C1. This is because in the cases where this code sequence is detected as the error and where it cannot be corrected by the error correction code C2, this error word can be interpolated by fifteen words (in case of 16 bits) or by twenty words (in case of 12 bits).
In addition, the data in one channel in the data of two channels is concentrated in the code sequence of the error detection code C1. However, since the symbols of the mutually corresponding symbol numbers in two channels are alternately recorded, there will hardly occur the case such that the errors concentrically occur in only one channel when recording.
2~065 An example of the H matrix of the error detection code C1 is shown below.

1 1 1 ... 1 1 1 1 1 !31 (Yo-yo ~129 a yo-yo of 1 J
in which, is any element over GO (28).
Assuming that the matrix of the reproduction data sequence of 32 symbols which include two parity symbols is V and that its transposed matrix is VT, the decoding of the error detection code Of is performed by forming two syndromes by the arithmetic operation of H VT. When both of these syndromes are 0, it -means that no error is detected, and in the other cases, it means that errors are detected. The error correction code C1 is inherently the code in which a single error can be corrected and double or more-tuple errors can be detected.
In addition, 128 blocks are divided into 32 sections each consisting of four blocks and the code sequence of the error correction code C2 is formed by 32 symbols fetched from each four blocks.
This error correction code C2 is the Reed Solomon Codes over GO (28) of (32, 24) and eight check code symbols are formed with regard to total 24 symbols of the blocks at every four blocks (for example, the block addresses of 16, 20, 24, ..., 104, and 108) ~2Z:~06~;

among the 96 blocks of the block addresses of 16 to 111. These check code symbols are arranged to the addresses at every four blocks (e.g., the block addresses of 0, 4, I, 12, 112, 116, 120, and 124).
That is, the interleave of four blocks is performed regarding the error correction code C2 and the check code symbols of the error correction code C2 locate in thirty two blocks of the block addresses of 0 to 15 and 112 to 127. However, the check code symbols of the error detection code C1 regarding these check code symbols are arranged in the addresses 30 and 31 in the block.
The error correction code C2 is the code in which a four-tuple error can be corrected and when the erasure correction is performed using a pointer, an eight-tuple error can be corrected.
An example of the H matrix of the error correction code C2 is shown below.

1 1 1 ..... 1 a 9 a 8 a 7 , .... a a a .. a a a H = ..... a a a . . . .,,, . at 2 a a . ..... at s at o as ~2230~

I 8 C~1 2 C~6 1 1 2 1 0! 1 4 I! 7 1 J

In this way, both codes Of and C2 have the same code length of 32 symbols, so that this enables a hardware to be simplified. In addition, when -decoding, the error detection is simply performed using the error correction code Of; on the other hand, when errors are detected, a pointer is set into its code sequence and the error correction is then performed using the error correction code C2.
This error correction is carried out with respect to each of the addresses O to 29 in the block, so that the decoding operations are done thirty times.
Each block in the arrays shown in Figs.
lo and lob has a data format shown in Fig. AYE.
Namely, a block sync signal of eight bits (one symbol) is added to the head, and a segment address of eight bits and a block address of eight bits are added, then a CRC code (eight bits) for error detection of these segment address and block address is added.
An MOB of the block address is used to discriminate the block address of the data from the block address of the sub code. Furthermore, the data of 30 symbols (audio data or check code symbols Q of the error - 3L2~306~;

correction code C2~ are arranged after this CRC code.
Two check code symbols P of the error correction code C1 are arranged in the last portion.
On the other hand, the data of one segment which is produced by the rotary head has a data format shown in Fig. 12B. In this embodiment, one segment is formed by the rotary head in the oblique direction of the magnetic tape which was wrapped at an angle of 84.8 around a tape guide drum having a diameter of 30 mm. Pilot signals AT for automatically following the track are recorded in each interval of 3 in both end portions and central portion of this segment.
The reason why the pilot signals are recorded in these three portions is to prevent a fear such that the pilot signals cannot be reproduced due to the dropout. A tracking error is detected due to the reproduction output of these pilot signals AT and a piezo-electric element which supports the rotary head is driven on the basis of this detection, thereby removing the tracking error.
In addition, the data of the block addresses (0 to 63) shown in Fig. AYE are sequentially recorded in a range of an angle of 29.7. Furthermore, the sub codes of four blocks such as time codes, display data and the like are written twice before and after ~22306~

the pilot signal AT in the central portion. The data of the block addresses (64 to 127) shown in Fig. lob are sequentially recorded in a range of 29.7. Also, in Fig. 12B, the intervals of each angle of 1.5 in the hatched portions denote the interlock gaps where no data is recorded and pulse signals of a constant frequency are recorded in these intervals.
Fig. 13 shows a constitution of a recording/
reproducing circuit of one embodiment of the present invention, in which an analog audio signal is supplied to an input terminal 31. This analog audio signal is digitized by an A/D converter 32. The audio PAM-signal from the A/D converter 32 it input as the data input to an RAM 34 through a data bus 33. The RAM 34 has the memory capacity which can store the data of the unit (2880 symbols in the foregoing example) of which the error correction code is encoded.
In addition, the data read out from the RAM
34 is supplied to an encoder 35 for the error detection code Of and error correction code C2. An address data generated from an address generator 36 is supplied to the RAM 34 through an address bus 37. This address data can be interleaved to change the sequence of the PAM data to the original sequence. The interleaved ~2230S5 data is read out from the RAM 34 and is supplied to the encoder 35, then the check code symbols of the error detection code C1 and error correction code C2 are formed and these check code symbols are written in the RAM 34. Upon completion of the production of the check code symbols, the data including these check code symbols is read out from the RAM 34 for every block and is supplied to a digital modulator 39.
Although not shown, the processing to add the block address, segment address and block sync signal are executed. The rotary head is connected to an output terminal 40 of the digital modulator --39 through a recording amplifier and a rotary transformer.
Also, the signal reproduced from the magnetic tape by the rotary head is supplied to a digital demodulator 42 through a rotary transformer and a reproducing amplifier and the demodulated data is written in the RAM 34 through the data bus 33. The data read out from the RAM 34 is supplied to a decoder 43 and is subjected to the processing of the error detection and error correction. The data processed by this decoder 43 is written in the RAM 34 and the PAM data which was de-interleaved to the original sequence is read out from the RAM 34 and is supplied ~2230~5 to a D/A converter 44, so that the reproduction audio signal is fetched from an output terminal 45.
The address data to the RUM 34 upon reproduction is also produced by the address generator 36. The clock pulses and timing signals necessary to control the above-mentioned processing upon recording and-reproduction are produced by a clock timing generator 38 which includes a crystal oscillator therein.
On one hand, when the sampling frequency is 32 kHz and the number of quantization bits is twelve bits, the running speed of the magnetic tape and the rotating speed of the rotary head are reduced by half as compared with those in the case where the sampling frequency is 48 kHz. Due to this, assuming that the recording density is constant, the time when the recording on, e.g., one set of cassette tape is possible can be doubled.
In case of dividing the input data sequence and transmission data sequence into a plurality of sets, they have been divided into the even number sets and the odd number sets in the present embodiment;
however, the invention is not limited to this. For instance, when a multiple of three is written as on, those sequences may be divide-d into three sets of (on), (on + 1) and (on + 2) or into four sets ~223065 of (on), (on + 1), (on + 2), and (on + 3).
In addition, with regard to N blocks of the two-dimensional construction in which the or or correction code C1 was encoded in the vertical direction and the error correction code C2 was encoded in the horizontal direction as shown in Fig. 14, the present invention can be applied to the case where the error detection code C3 is encoded regarding N words at the corresponding locations of each block.
For example, as the error correction codes C1 and C2, the Reed Solomon Codes of (15, 13) are used, while the CRC codes are used as the error detection code C3. In the case where there are three kinds of word lengths of eight bits, twelve bits and sixteen bits, a length of one code sequence of the error detection code C3 is set into 144 bits which are integer times larger than 48 bits of a least common multiple of these bit numbers.
On one hand, the present invention can be also applied to the case where any digital information such as a digital video signal or the like other than the digital audio signal is transmitted. It is obvious that the invention can be also applied to the case where a magnetic disc recording apparatus or the like other than the rotary head type recording 122306~

apparatus is used.
According to the present invention, even in the time sequence of transmission data, the odd number and even number words are respectively inserted in the odd number and even number time slots on the basis of the original time sequence; therefore, in case of performing the even/odd interleave, it is possible to prevent that the error correcting ability remarkably decreases due to a difference in bit number.
In this invention, the processing for error correction encoding can be commonly performed with respect to a plurality of number of quantization bits, thereby enabling a general encoder to be realized.
Furthermore, the present invention has an advantage such that in the case where the errors which exceed the correcting ability for the error correction code occur, it is possible to prevent that the data amount which cannot be used is doubled since there is a difference between the quantization bit numbers.
Although the present invention has been shown and described with respect to preferred embodiments, various changes and modifications which are obvious to a person skilled in the art to which the invention pertains are deemed to lie within the spirit and scope of the invention.

Claims (24)

THE EMBODIMENTS OF THE INVENTION IN WHICH AN EXCLUSIVE
PROPERTY OR PRIVILEGE IS CLAIMED ARE DEFINED AS FOLLOWS:
1. A method of uniformly encoding a digital information signal occurring in groups of symbols, where all symbols within each group have a same length equal to one of n predetermined symbol lengths, said method operating on each group to generate error correction codes therefor independent of the length of the symbols therein, said method comprising the steps of:
forming the symbols in one group into an array consisting of a first plurality of blocks each including a second plurality of said symbols, said array having at least first and second directions of adjacent symbols defined therein;
defining first and second encoding processes of generating error codes operative on selected combinations of symbols occurring successively along said first and second directions, respectively;
selecting a unit length of encoding for said first encoding process equal to an integer times a least common multiple of said n predetermined lengths;
defining successive units of said symbols along said first direction by allocating successive third pluralities of said symbols to said units such that the sum of the lengths of the symbols within each unit equals said unit length; and generating error codes in accordance with said first encoding process operating on said units.
2. A method according to claim 1, wherein n equals 2 and said symbol lengths are 12 bits and 16 bits.
3. A method according to claim 1, wherein n equals 2 and said symbol lengths are 6 bits and 8 bits.
4. A method according to claim 2, wherein said digital information data is interleaved so that even number designated symbols and odd number designated symbols are separated, and said adjacent symbols are the adjacent symbols in each of said even number designated symbols and said odd number designated symbols in said first and second directions.
5. A data transmitting method for uniformly processing data occurring in words of different lengths, in which first input data occurring in first words of which each said first word consists of M bits and second input data occurring in second words of which each said second word consists of N bits are processed and transmitted, said method comprising the steps of:
defining an a-th first word of said M-bit first input data as Wa;
dividing said first input data into k kinds of sets of (Wnk+1), (Wnk+2), ..., (Wnk+k), n being an arbitrary integer;
defining a b-th word of said N-bit input data as Wb;
dividing said second input data into k kinds of sets of (W'nk+1), (W'nk+2), ..., (W'nk+k), the number of bits of the first words in the set of (Wnk+m), m being an integer from 1 to k, equals the number of bits of the second words in the set of (W'nk+m); and processing and transmitting said data in units of said sets.
6. A data transmitting method according to claim 5, wherein M is twelve and N is sixteen.
7. A data transmitting method according to claim 5, wherein M is six and N is eight.
8, A data transmitting method according to claim 5, wherein k is two, and said sets (Wnk-1) and (Wnk+2) are even number designated data and said sets (W'nk+1) and (W'nk+2) are odd number designated data, respectively.
9. Apparatus for uniformly encoding a digital information signal occurring in groups of symbols, where all symbols within each group have a same length equal to one of n predetermined symbol lengths, said method operating on each group to generate error correction codes therefor independent of the length of the symbols therein, said method comprising the steps of:
means for forming the symbols in one group into an array consisting of a first plurality of blocks each including a second plurality of said symbols, said array having at least first and second directions of adjacent symbols defined therein;
means for performing first and second encoding processes of generating error codes operative on selected combinations of symbols occurring successively along said first and second directions, respectively;
said means for performing said first encoding process being operative to select a unit length of encoding equal to an integer times a least common multiple of said n predetermined lengths; and means for defining successive units of said symbols along said first direction my allocating successive third pluralities of said symbols to said units such that the sum of the lengths of the symbols within each unit equals said unit length;
said means for performing said first encoding process being operative to generate error codes by operating on said units.
10. Apparatus according to claim 9, wherein n equals 2 and said symbol lengths are 12 bits and 16 bits.
11. Apparatus according to claim 9, wherein n equals 2 and said symbol lengths are 6 bits and 8 bits.
12. Apparatus according to claim 10, further comprising means for interleaving said digital information data so that even number designated symbols and odd number designated symbols are separated, and wherein said adjacent symbols are the adjacent symbols in each of said even number designated symbols and said odd number designated symbols in said first and second directions.
13. Data transmitting apparatus for uniformly processing data occurring in words of different lengths, in which first input data occurring in first words of which each said first word consists of M bits and second input data occurring in second words of which each said second word consists of N bits are processed and transmitted, said apparatus comprising:
means for dividing said first input data into k kinds of sets of (Wnk+1), (Wnk+2), ..., (Wnk+k), n being an arbitrary integer and an a-th first word of said M-bit first input data being defined as Wa;
means for dividing said second input data into k kinds of sets of (W'nk+1), (W'nk+2), ..., (W'nk+k), wherein a b-th word of said N-bit second input data is defined as Wb, and wherein the number of bits of the first words in the set of (Wnk+m), m being an integer from 1 to k, equals the number of bits of the second words in the set of (W'nk+m); and means for processing and transmitting said data in units of said sets,
14. A data transmitting method according to claim 13, wherein M is 12 and N is 16.
15. A data transmitting method according to claim 13, wherein M is 6 and N is 8.
16. A data transmitting method according to claim 13, wherein k is 2 and said sets (Wnk+1) and (Wnk+2) are even number designated data and said sets (W'nk+1) and (W'nk+2) are odd number designated data, respectively.
17. A data transmitting method for uniformly processing data occurring in words of different lengths, in which first input data occurring in first words each consisting of M bits and second input data occurring in second words each consisting of N bits are processed and transmitted, said method comprising the steps of:
receiving a selected one of said first input data and said second input data;
allocating the received input data into k kinds of input sets (Wnk+1), (Wnk+2), ..., (Wnk+k)' n and k being positive integers and each said input set including n words of said received input data;
allocating said data of said input sets into k kinds of output sets (W'nk+1), (W'nk+2), ..., (W'nk+k), such that the bits of the words in the input set (Wnk+m) are the bits in the output set (W'nk+m), each said output set having a number of bits equal to a multiple of a selected one of M
and N; and processing and transmitting said received input data in units of said output sets.
18. A data transmitting method according to claim 17, wherein M is 12 and N is 16.
19. A data transmitting method according to claim 17, wherein M is 6 and N is 8.
20. A data transmitting method according to claim 17, wherein k is 2, and said sets (Wnk+1) and (Wnk+2) are even number designated data and said sets (W'nk+1) and (W'nk+2) are odd number designated data, respectively.
21. A data transmitting apparatus for uniformly processing data occurring in words of different lengths, in which first input data occurring in first words each consisting of M bits and second input data occurring in second words each consisting of N bits are processed and transmitted, said apparatus comprising:
means for receiving a selected one of said first input data and said second input data;
means for allocating the received input data into k kinds of input sets (Wnk+1), (Wnk+2), ..., (Wnk+k), N and k being positive integers and each said input set including n words of said received input data;
means for allocationg said data of said input sets into k kinds of output sets (W'nk+1), (W'nk+2), ..., (W'nk+k), such that the bits of the words in the input sets (Wnk+m) are the bits in the output set (W'nk+m), each said output set having a number of bits equal to a multiple of a selected one of M and N; and means for processing and transmitting said received input data in units of said output sets,
22. A data transmitting apparatus according to claim 21, wherein M is 12 and N is 16.
23. A data transmitting apparatus according to claim 21, wherein M is 6 and N is 8.
24. A data transmitting apparatus according to claim 21, wherein k is 2, and said sets (Wnk+1) and (Wnk+2) are even number designated data and said sets (W'nk+1) and (W'nk+2) are odd number designated data, respectively.
CA000454669A 1983-05-21 1984-05-18 Method for uniformly encoding data occurring with different word lengths Expired CA1223065A (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP89589/83 1983-05-21
JP58089589A JPH0661156B2 (en) 1983-05-21 1983-05-21 Encoding method for error correction

Publications (1)

Publication Number Publication Date
CA1223065A true CA1223065A (en) 1987-06-16

Family

ID=13974965

Family Applications (1)

Application Number Title Priority Date Filing Date
CA000454669A Expired CA1223065A (en) 1983-05-21 1984-05-18 Method for uniformly encoding data occurring with different word lengths

Country Status (14)

Country Link
US (2) US4688225A (en)
JP (1) JPH0661156B2 (en)
KR (1) KR920009105B1 (en)
AT (1) AT404655B (en)
AU (2) AU565309B2 (en)
BR (1) BR8402424A (en)
CA (1) CA1223065A (en)
DE (1) DE3418912C2 (en)
ES (2) ES8606713A1 (en)
FR (1) FR2546348B1 (en)
GB (2) GB2140178B (en)
IT (1) IT1177741B (en)
NL (1) NL194744C (en)
SE (1) SE461309B (en)

Families Citing this family (39)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH07111815B2 (en) * 1984-07-23 1995-11-29 株式会社日立製作所 Digital signal recording system
JP2574744B2 (en) * 1985-04-10 1997-01-22 株式会社日立製作所 PCM signal recording / reproducing device
FR2583240B1 (en) * 1985-06-05 1994-02-04 France Telediffusion METHOD FOR THE BLOCK TRANSMISSION OF DIGITAL INFORMATION WORDS
JPH0782712B2 (en) * 1985-10-11 1995-09-06 株式会社日立製作所 Digital signal recording / reproducing device
JPH0782713B2 (en) * 1985-12-25 1995-09-06 株式会社日立製作所 PCM signal recording / reproducing apparatus and reproducing apparatus
AU594995B2 (en) * 1986-01-24 1990-03-22 Sony Corporation Data transmission method suitable for a disc
JP2590813B2 (en) * 1986-02-18 1997-03-12 ソニー株式会社 Data recording method
JPS62235851A (en) * 1986-04-07 1987-10-16 Tamura Electric Works Ltd Data transmission system for key tlephone system
US4907215A (en) * 1986-08-27 1990-03-06 Sony Corporation Integral optical recording of product code in data areas
US4745604A (en) * 1986-10-20 1988-05-17 International Business Machines Corporation Method and apparatus for transferring data between a host processor and a data storage device
JP2751201B2 (en) * 1988-04-19 1998-05-18 ソニー株式会社 Data transmission device and reception device
DE3889804T2 (en) * 1987-08-12 1994-09-08 Hitachi Ltd Device for recording / playing back PCM signals.
US4943964A (en) * 1987-08-12 1990-07-24 Hitachi, Ltd. PCM signal reproducing device
JP2638091B2 (en) * 1988-06-24 1997-08-06 ソニー株式会社 Data transmission method
JPH03141752A (en) * 1989-10-27 1991-06-17 Hitachi Ltd Picture signal transmitting method
JP2619983B2 (en) * 1989-11-09 1997-06-11 エクサバイト・コーポレーシヨン Error correction method and device
JP2605434B2 (en) * 1989-12-09 1997-04-30 ヤマハ株式会社 Electronic musical instrument data generator
KR950001439B1 (en) * 1990-04-30 1995-02-24 삼성전자주식회사 Coding apparatus of error correction
US5251219A (en) * 1990-09-10 1993-10-05 Advanced Micro Devices, Inc. Error detection and correction circuit
US5504759A (en) * 1991-07-11 1996-04-02 Sony Corporation Digital signal recording and/or reproducing apparatus using a common processing device for digital signals having different data configurations
JP2785531B2 (en) * 1991-09-17 1998-08-13 ヤマハ株式会社 Electronic musical instrument
DE4308235A1 (en) * 1993-03-10 1994-09-15 Thomson Brandt Gmbh Methods of storing or playing back data packets
WO1996025801A1 (en) * 1995-02-17 1996-08-22 Trustus Pty. Ltd. Method for partitioning a block of data into subblocks and for storing and communicating such subblocks
US6118754A (en) * 1995-05-16 2000-09-12 Sony Corporation Data recording/reproducing apparatus and method corresponding to a plurality of data formats, and data recording medium
TW316976B (en) * 1995-05-16 1997-10-01 Sony Co Ltd
US5706298A (en) * 1995-11-09 1998-01-06 Emc Corporation Method and apparatus for calculating the longitudinal redundancy check in a mixed stream channel
JP3661890B2 (en) * 1995-12-15 2005-06-22 ソニー株式会社 Image data transmission method and image data reception method
US6126074A (en) * 1998-01-28 2000-10-03 Symbol Technologies, Inc. Error correction in macro bar code symbols
US6125467A (en) * 1998-04-21 2000-09-26 International Business Machines Corporation Method and apparatus for partial word read through ECC block
US6363350B1 (en) 1999-12-29 2002-03-26 Quikcat.Com, Inc. Method and apparatus for digital audio generation and coding using a dynamical system
US6567781B1 (en) 1999-12-30 2003-05-20 Quikcat.Com, Inc. Method and apparatus for compressing audio data using a dynamical system having a multi-state dynamical rule set and associated transform basis function
JP3752995B2 (en) * 2000-09-27 2006-03-08 日本ビクター株式会社 Information recording / reproducing device
US20020041595A1 (en) * 2000-10-05 2002-04-11 Marc Delvaux System and method for suspending and resuming transmission of information without creating significant additional overhead
US8656246B2 (en) * 2001-04-16 2014-02-18 Qualcomm Incorporated Method and an apparatus for use of codes in multicast transmission
US7389468B2 (en) * 2004-09-20 2008-06-17 International Business Machines Corporation Writing and reading of data in probe-based data storage devices
TWI303414B (en) * 2005-12-21 2008-11-21 Ind Tech Res Inst A data encoding method for error correcton
US7245450B1 (en) * 2006-01-26 2007-07-17 International Business Machines Corporation Synchronous servo channel for longitudinal position detection and position error signal generation in tape drive systems
US7813070B2 (en) * 2008-02-19 2010-10-12 International Business Machines Corporation Error correction capability for longitudinal position data in a tape storage system
US8533564B2 (en) * 2009-12-23 2013-09-10 Sandisk Technologies Inc. System and method of error correction of control data at a memory device

Family Cites Families (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4386416A (en) * 1980-06-02 1983-05-31 Mostek Corporation Data compression, encryption, and in-line transmission system
JPS5710558A (en) * 1980-06-20 1982-01-20 Sony Corp Error correcting method
US4346474A (en) * 1980-07-03 1982-08-24 International Business Machines Corporation Even-odd parity checking for synchronous data transmission
CA1161946A (en) * 1980-07-26 1984-02-07 Sony Corporation Method and apparatus for recording digitized information on a record medium
JPS5730108A (en) * 1980-07-28 1982-02-18 Sony Corp Digital signal processing circuit
JPS5736475A (en) * 1980-08-08 1982-02-27 Sony Corp Recording method of pcm signal
US4449536A (en) * 1980-10-31 1984-05-22 Sri International Method and apparatus for digital data compression
JPS5829237A (en) * 1981-08-14 1983-02-21 Sony Corp Error correcting method
JPS5845613A (en) * 1981-09-11 1983-03-16 Hitachi Ltd Pulse code modulation recorder
JPS5866448A (en) * 1981-10-16 1983-04-20 Hitachi Ltd Error detecting system for exchange of packet
JPS58125209A (en) * 1982-01-20 1983-07-26 Mitsubishi Electric Corp Pcm recording and reproducing device
US4464747A (en) * 1982-02-18 1984-08-07 The Singer Company High reliability memory
CA1196106A (en) * 1982-04-28 1985-10-29 Tsuneo Furuya Method and apparatus for error correction
GB2122778B (en) * 1982-06-29 1985-09-11 Sony Corp Digital audio signal processing
US4495623A (en) * 1982-09-02 1985-01-22 Discovision Associates Digital data storage in video format
US4488302A (en) * 1983-02-11 1984-12-11 At&T Bell Laboratories Burst error correction using cyclic block codes
US4564945A (en) * 1983-06-20 1986-01-14 Reference Technology, Inc. Error-correction code for digital data on video disc
US4751742A (en) * 1985-05-07 1988-06-14 Avelex Priority coding of transform coefficients

Also Published As

Publication number Publication date
ES8608755A1 (en) 1986-06-16
AU7615787A (en) 1987-11-05
GB2186401A (en) 1987-08-12
SE8402714D0 (en) 1984-05-21
ES541831A0 (en) 1986-06-16
KR920009105B1 (en) 1992-10-13
FR2546348A1 (en) 1984-11-23
FR2546348B1 (en) 1991-11-15
NL8401612A (en) 1984-12-17
DE3418912A1 (en) 1984-11-22
AU565309B2 (en) 1987-09-10
ES532666A0 (en) 1986-04-01
GB8412782D0 (en) 1984-06-27
NL194744C (en) 2003-01-07
GB2186401B (en) 1987-12-16
KR850000095A (en) 1985-02-25
AT404655B (en) 1999-01-25
IT8448233A0 (en) 1984-05-21
JPS59215013A (en) 1984-12-04
AU600495B2 (en) 1990-08-16
SE8402714L (en) 1984-11-22
IT1177741B (en) 1987-08-26
SE461309B (en) 1990-01-29
NL194744B (en) 2002-09-02
GB2140178A (en) 1984-11-21
ATA167084A (en) 1998-05-15
ES8606713A1 (en) 1986-04-01
US4866636A (en) 1989-09-12
BR8402424A (en) 1985-04-02
DE3418912C2 (en) 1993-11-18
JPH0661156B2 (en) 1994-08-10
GB8618378D0 (en) 1986-09-03
AU2836684A (en) 1984-11-22
GB2140178B (en) 1987-12-16
US4688225A (en) 1987-08-18

Similar Documents

Publication Publication Date Title
CA1223065A (en) Method for uniformly encoding data occurring with different word lengths
US4630272A (en) Encoding method for error correction
US4697212A (en) Method and apparatus for recording a digital information signal
EP0203773B1 (en) Apparatus for decoding error correcting code
US4675754A (en) Magnetic recorder/reproducer
US4685004A (en) Rotary head type PCM recording and reproduction method and system
KR900003595B1 (en) Method and apparatus for recording pcm signal
EP0397472B1 (en) Rotary head recording and playback apparatus and method
EP0317197B1 (en) Error detection and correction method
US4491882A (en) Disc players
US5257271A (en) Sample data transmission apparatus
JPH053773B2 (en)
JPH077581B2 (en) Rotating head type PCM magnetic recording / reproducing apparatus
EP0411829B1 (en) Sample data transmission apparatus
JPS6338897B2 (en)
US5233480A (en) Magnetic recorder/reproducer
JP2546190B2 (en) Signal processing circuit for rotary head type magnetic reproducing device
JPH0519784B2 (en)
JP2546189B2 (en) Rotating head type magnetic reproducing apparatus and signal processing circuit used therefor
JPS6137688B2 (en)
JPH0473334B2 (en)
JPH05234265A (en) Rotary head type magnetic recording and reproducing, signal processing circuit and magnetic tape
JPS61214281A (en) Pcm signal recording and reproducing device
JPH0634311B2 (en) Recording method of digital information signal
JPH05234259A (en) Rotary head type magnetic recording/reproducing device, and signal processing circuit used therefor, and magnetic tape

Legal Events

Date Code Title Description
MKEX Expiry