WO2021046756A1 - Procédé et dispositif de codage et de décodage basés sur la contrainte de bosk bidimensionnelle - Google Patents

Procédé et dispositif de codage et de décodage basés sur la contrainte de bosk bidimensionnelle Download PDF

Info

Publication number
WO2021046756A1
WO2021046756A1 PCT/CN2019/105376 CN2019105376W WO2021046756A1 WO 2021046756 A1 WO2021046756 A1 WO 2021046756A1 CN 2019105376 W CN2019105376 W CN 2019105376W WO 2021046756 A1 WO2021046756 A1 WO 2021046756A1
Authority
WO
WIPO (PCT)
Prior art keywords
dimensional
data
encoding
bit data
codeword
Prior art date
Application number
PCT/CN2019/105376
Other languages
English (en)
Chinese (zh)
Inventor
刘继斌
魏明
Original Assignee
武汉烽火技术服务有限公司
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 武汉烽火技术服务有限公司 filed Critical 武汉烽火技术服务有限公司
Priority to EP19928292.2A priority Critical patent/EP4030427A4/fr
Priority to US17/055,534 priority patent/US11233526B2/en
Priority to CN201980096304.3A priority patent/CN113811947B/zh
Priority to PCT/CN2019/105376 priority patent/WO2021046756A1/fr
Publication of WO2021046756A1 publication Critical patent/WO2021046756A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/3066—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction by means of a mask or a bit-map
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/14—Conversion to or from non-weighted codes
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B27/00—Editing; Indexing; Addressing; Timing or synchronising; Monitoring; Measuring tape travel
    • G11B27/02—Editing, e.g. varying the order of information signals recorded on, or reproduced from, record carriers
    • G11B27/031—Electronic editing of digitised analogue information signals, e.g. audio or video signals
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/60—General implementation details not specific to a particular type of compression
    • H03M7/6005—Decoder aspects
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/60—General implementation details not specific to a particular type of compression
    • H03M7/6011—Encoder aspects

Definitions

  • the invention belongs to the field of data storage and data communication, and specifically relates to a binary data array composed of "0" and "1" on a plane composed of a quadrilateral grid, along the horizontal, vertical, northeast, and southeast directions, data "1"
  • a binary data array composed of "0" and "1” on a plane composed of a quadrilateral grid, along the horizontal, vertical, northeast, and southeast directions, data "1"
  • a two-dimensional square constraint encoding and decoding method and device that cannot be directly adjacent to each other.
  • Accessing data along one-dimensional tracks of the recording medium is a common storage technology at present.
  • next-generation data storage technology that accesses data in two-dimensional pages (or even three-dimensional) has been significantly developed for the purpose of increasing data transmission rate and storage capacity.
  • Related examples include phase change memory (PCM), holographic memory, two-dimensional optical discs, two-dimensional patterned media recording, and so on.
  • PCM phase change memory
  • data is arranged on a two-dimensional plane in a quadrilateral grid or hexagonal grid to form a two-dimensional data array, and the inter-code crosstalk between the data becomes more complicated, changing from a one-dimensional situation to a two-dimensional data array. A two-dimensional situation.
  • the two-dimensional square constraint means that in a two-dimensional data array composed of data “0” and data “1”, the two data “1” are in the horizontal, vertical, and northeast directions. It cannot be directly adjacent to the southeast direction. That is, in the binary data pattern recorded on the storage medium, the pattern combination shown in FIG. 1 cannot appear.
  • the purpose of the present invention is to provide a method and device for encoding and decoding based on a two-dimensional square constraint of a quadrilateral grid, so that in a binary data array composed of data "0" and "1", In the four directions of horizontal, vertical, northeast, and southeast, the data "1" is not directly adjacent to each other.
  • the encoding method includes: buffering a one-dimensional data stream, and dividing the one-dimensional data stream into several groups of one-dimensional 2-bit data; by looking up the encoding table of the two-dimensional square constrained encoder, each group of 2-bit data is encoded into 3 ⁇ 2.
  • Two-dimensional codewords all encoded two-dimensional codewords are constructed according to the coding sequence to construct a two-dimensional constrained array with a size equal to one page; the two-dimensional constrained array is along the horizontal, vertical, northeast and southeast directions In the four directions, data "1" is not directly adjacent to each other;
  • the decoding method includes: reading the two-dimensional constraint array, dividing it into a number of 3 ⁇ 2 two-dimensional codewords according to a specified order, and using the decoding output of the current two-dimensional codeword to be directly related to the current two-dimensional codeword, It also has an internal relationship with the previous two-dimensional codeword or the next two-dimensional codeword.
  • each two-dimensional codeword is decoded into a set of one-dimensional codewords one by one.
  • 2-bit data, and all one-dimensional 2-bit data are sequentially assembled into a one-dimensional data stream and output.
  • the encoder includes two states, called the first state and the second state, respectively;
  • the encoding basis of the encoding table is:
  • the 3 ⁇ 2 two-dimensional codeword output by the current encoding is determined by the currently input one-dimensional 2-bit data and the next set of input one-dimensional 2-bit data and the current state of the encoder; the next state of the encoder is the encoding
  • the output state of the encoder is determined by the current state of the encoder, the current input one-dimensional 2-bit data and the next set of input one-dimensional 2-bit data.
  • the one-dimensional 2-bit data are respectively 00, 10, 01 and 11, and the basic two-dimensional codewords are respectively with Each group of one-dimensional 2-bit data corresponds to a basic two-dimensional codeword, and the corresponding relationship is set arbitrarily.
  • the one-dimensional 2-bit data 00, 10, 01 and 11 correspond to basic two-dimensional codewords one-to-one with Time
  • the encoding table of the encoder is:
  • the decoding table of the decoder is:
  • the one-dimensional 2-bit data are respectively 00, 10, 01 and 11, and the basic two-dimensional codewords are respectively with Each one-dimensional 2-bit data corresponds to a basic two-dimensional codeword, and the corresponding relationship is set arbitrarily.
  • the one-dimensional 2-bit data 00, 10, 01 and 11 correspond to basic two-dimensional codewords one-to-one with Time
  • the encoding table of the encoder is:
  • the decoding table of the decoder is:
  • the two-dimensional codewords obtained by encoding are cascaded from left to right and from top to bottom;
  • the two-dimensional constrained array is divided into a number of 3 ⁇ 2 two-dimensional codewords from left to right and top to bottom; and the decoder adopts sliding block decoding The way to decode the current two-dimensional codeword one by one.
  • the present invention also provides an encoding and decoding device suitable for the foregoing encoding and decoding method, and the encoding device includes:
  • One-dimensional data stream buffer component which is used to buffer one-dimensional data stream according to the code rate and the size of the two-dimensional data page;
  • a data stream dividing component which is used to divide the one-dimensional data stream buffered by the one-dimensional data stream buffering component into several groups of one-dimensional 2-bit data;
  • a square constrained codeword encoder which is used to read one-dimensional 2-bit data from the data stream dividing component, and encode each group of 2-bit data into a 3 ⁇ 2 two-dimensional codeword one by one according to the coding table;
  • a two-dimensional data array assembly component which is used to cache all the two-dimensional codewords generated by the square constrained codeword encoder, and cascade from left to right and from top to bottom according to the coding sequence to construct a size equal to one page Two-dimensional constrained array; also used to output two-dimensional data of a constructed page to a two-dimensional data recording device;
  • the decoding device includes:
  • a two-dimensional data array buffer component which is used to buffer a two-dimensional constrained array of one page output by the two-dimensional data recording device;
  • a two-dimensional codeword dividing component which is used to divide the two-dimensional constraint array into a number of 3 ⁇ 2 two-dimensional codewords in a specified order;
  • Square constrained codeword decoder which is used according to the principle of sliding block decoding, using the decoding output of the current two-dimensional codeword not only directly related to the current two-dimensional codeword, but also to the previous two-dimensional codeword or the next one Two-dimensional codewords also have related internal relationships.
  • each two-dimensional codeword is decoded into a set of one-dimensional 2-bit data one by one;
  • the one-dimensional data stream assembling component sequentially assembles all the one-dimensional 2-bit data output by the square constrained codeword decoder into a one-dimensional data stream for output.
  • the encoder adopts a look-ahead encoding method, which can encode a one-dimensional data stream into a two-dimensional data array that satisfies the two-dimensional square constraint; in the decoding stage, the decoder
  • the original data can be recovered from a two-dimensional data array that is stored on a recording medium and meets the constraints of a two-dimensional square.
  • the two-dimensional square constraint described in the present invention is sometimes referred to as the non-attack constraint (Non-Attacking-King, NAK) in some documents.
  • NAK non-attack constraint
  • the technical solution proposed by the present invention can be applied to a data storage system that records in the form of a two-dimensional data array ("page" plane mode), or a communication system that transmits data in the form of a two-dimensional array.
  • the current 2-bit data is encoded into a 3 ⁇ 2 two-dimensional codeword by "reading before” a 2-bit data combined with the current state of the encoder; in the decoding stage, sliding block decoding is adopted
  • the decoding of the current 3 ⁇ 2 two-dimensional codeword is realized. Since the data and the two-dimensional codeword are short, it is beneficial to simplify the circuit design and specific implementation of the encoding and decoding device.
  • the capacity of the two-dimensional square constraint is approximately equal to 0.42508, in the present invention, the coding efficiency is close to 80%, which is of great significance for improving the overall performance of the storage channel and the communication channel.
  • a two-state finite state encoder is used in the encoding and decoding device, and the state of the encoder is reduced to a minimum.
  • the decoding window of the decoder is equal to the length of 3 two-dimensional codewords, in fact, for the decoding of each two-dimensional codeword, the decoding window is only two two-dimensional codewords in length, so decoding errors cause The disastrous error propagation is limited to 4bits data.
  • Figure 1 shows the four types of prohibited two-dimensional data pattern combinations described in the two-dimensional square constraint of the present invention
  • Figure 2 is a two-dimensional code word composed of a 3 ⁇ 2 data array according to the present invention.
  • FIG. 3 is a schematic diagram of the timing relationship when reading data according to the present invention.
  • Fig. 4 is a schematic diagram of the coding principle of a data before reading according to the present invention.
  • Figure 5 is a layout diagram of the two-dimensional codewords in the data array of the present invention.
  • Fig. 6 is a schematic diagram of the sliding block decoding according to the present invention.
  • Fig. 7 is a functional block diagram of the encoding device according to the present invention.
  • Fig. 8 is a block diagram of the principle of the decoding device according to the present invention.
  • Fig. 9 is a schematic diagram of the two-dimensional square constrained array coding according to the present invention.
  • Figure 10 is a schematic diagram of the two-dimensional square constrained array decoding according to the present invention.
  • An embodiment of a two-dimensional square-constrained encoding and decoding method including an encoding method and a decoding method, and the encoding method includes:
  • the two-dimensional codeword adopted in this embodiment is a two-dimensional array with high 3 bits and 2 bits long, which is the smallest access unit in the process of actually accessing two-dimensional data.
  • the timing relationship between the read 2-bit data is shown in Figure 3, where t i+1 represents the next time of the data, t i represents the current time of the data, and t i-1 represents the previous time.
  • the encoder uses the one-dimensional 2-bit data and the next set of input 2-bit data (pre-reading data), and the encoder Perform two-dimensional encoding on the current state of the system, and then output the encoded two-dimensional codeword.
  • next state of the encoder (that is, the output state) is based on the current state of the encoder, the currently input one-dimensional 2-bit data and the next set of input one-dimensional 2-bit data (pre-reading data) according to Table 3 ( Or Table 7) Real-time update.
  • the next updated state is taken as the current state of the encoder at time ti+1.
  • FIG. 5 it is the layout diagram of the two-dimensional codewords in the data array.
  • the layout diagram illustrates that when one-dimensional user data is written in a two-dimensional array, the smallest access unit is a 3 ⁇ 2 two-dimensional array. From the point of view, the data processing is cascaded from left to right and from top to bottom row by row.
  • the two-dimensional constrained array is read from the two-dimensional data recording device and divided into a number of 3 ⁇ 2 two-dimensional codewords according to the specified cascade sequence, that is, the division is performed according to the minimum access unit.
  • the division is performed in a row-by-row manner from left to right and top to bottom.
  • the decoder uses sliding block decoding to decode two-dimensional codewords one by one.
  • the decoding table of the two-dimensional square constraint decoder combines the current two-dimensional codeword with the next two-dimensional codeword.
  • Codeword decode each two-dimensional codeword into one-dimensional 2-bit data one by one, and assemble all the one-dimensional 2-bit data obtained by decoding into one-dimensional data stream in turn and output.
  • a basic two-dimensional codeword or an alternative codeword is used to encode 2-bit data.
  • the one-dimensional 2-bit data includes 00, 10, 01, and 11.
  • Table 1 is a basic code table.
  • the above-mentioned one-dimensional 2-bit data can be encoded into 3 ⁇ 2 two-dimensional codewords, and the two-by-two horizontal cascade of the above four 3 ⁇ 2 two-dimensional codewords can form sixteen types of 3 ⁇ 4 two-dimensional codewords.
  • Array there are four cases that violate the two-dimensional square constraint restriction, namely:
  • the coding table 3 can be constructed, and the encoder performs search coding according to the table 3.
  • the decoding table 4 of the decoder can be constructed for the decoder to decode.
  • the X in Table 4 indicates that it will not appear.
  • a second embodiment of the basic code table and the replacement code table is also provided.
  • the basic code table is shown in Table 5.
  • the coding table 7 can be constructed, and the encoder performs search coding according to the table 7.
  • the decoding table 8 of the decoder can be constructed according to Table 7 for the decoder to perform decoding.
  • Table 8 X means that it will not appear.
  • the present invention also provides an encoding and decoding device suitable for the above embodiments, including an encoding device, a decoding device, and a two-dimensional data recording device.
  • the encoding device includes a one-dimensional data stream buffer component, a data stream dividing component, a square constrained codeword encoder, and a two-dimensional data array assembly component that are sequentially connected.
  • the one-dimensional data stream buffer component is used for buffering the one-dimensional data stream according to the code rate and the size of the two-dimensional data page.
  • the data stream dividing unit is used to divide the one-dimensional data stream buffered by the one-dimensional data stream buffering unit into several groups of one-dimensional 2-bit data.
  • Square constrained codeword encoder which is used to read a number of one-dimensional 2-bit data required to complete the encoding from the data stream dividing component, and encode each group of 2-bit data into 3 ⁇ according to the encoding table of the encoder. 2 two-dimensional codewords, and update the current state of the encoder in real time.
  • Two-dimensional data array assembly components which are used to cache all two-dimensional codewords generated by the square constraint codeword encoder, and construct a two-dimensional constraint array with a size equal to one page according to the coding sequence; and also used to construct the The two-dimensional data of one page is output to the two-dimensional data recording device.
  • the above coding sequence is "from left to right, from top to bottom".
  • the decoding device includes a two-dimensional data array buffer component, a two-dimensional codeword dividing component, a square constrained codeword decoder, and a one-dimensional data stream assembly component that are sequentially connected.
  • the two-dimensional data array buffer component is used to buffer the two-dimensional constrained array of one page output by the above-mentioned two-dimensional data recording device.
  • a two-dimensional codeword dividing component which is used to divide the two-dimensional constraint array into a number of 3 ⁇ 2 two-dimensional codewords in a specified order, and input them into the square constraint codeword decoder in the order of priority.
  • the specified order is : "From left to right, from top to bottom”.
  • Square constrained codeword decoder which is used to combine the current two-dimensional codeword, the previous two-dimensional codeword and the next two-dimensional codeword by using a decoding table according to the principle of sliding block decoding, and gradually convert each two-dimensional codeword
  • the one-dimensional codeword is decoded into a group of one-dimensional 2-bit data.
  • the one-dimensional data stream assembling component assembles all the one-dimensional 2-bit data output by the square constrained codeword decoder into a one-dimensional data stream in turn, and outputs it.
  • a two-dimensional square constrained array encoding process is given. Assuming that the size of a two-dimensional data page is 6 ⁇ 10, the one-dimensional random data sequence input to the encoder is 00 01 10 11 10 00 01 00 10 11 (input from left to right), and the initial state of the encoder is The first state (if the initial state is the second state, the analysis is similar). At time t i , the current input data of the encoder is 00, and the next data (pre-read data) is 01. The encoding is performed according to Table 7. The encoding of one-dimensional 2-bit data 00 is as follows:
  • the next state of the encoder is the first state (that is, remains unchanged).
  • the current input data of the encoder is 01
  • the next data (pre-read data) is 10
  • the current state of the encoder is 1, so the current one-dimensional 2-bit data 01 is encoded as follows:
  • the current input data of the encoder is 10
  • the current state of the encoder is the second state.
  • the encoding of the current one-dimensional 2-bit data 10 is as follows:
  • the next state of the encoder becomes the first state.
  • the coding of the above-mentioned one-dimensional random data sequence can be realized.
  • the encoding of subsequent data is as follows:
  • the encoded data is stored in a two-dimensional data recording device.
  • the corresponding decoding process is given. First, read the two-dimensional data array from the two-dimensional data recording device, and then divide the array into a number of the following two-dimensional data sub-arrays according to a group of 3 ⁇ 2.
  • the two-dimensional data sub-array obtained above takes the 3 ⁇ 2 two-dimensional codewords as the basic unit and input them to the decoder one by one for decoding.
  • the two-dimensional codeword that currently needs to be decoded by the decoder is Because the next two-dimensional codeword in the two-dimensional array is According to Table 8, the decoding of this data does not require the information of the previous two-dimensional codeword, so the decoding is as follows:
  • the current data at time t i+1 should be decoded as 01, that is, the decoding is as follows:
  • the encoder in the encoding device uses a pre-reading data encoding method, that is, the data encoding output is not only directly related to the current data, but also related to the next data and the current state of the encoder.
  • the decoder adopts a sliding block decoding method to decode the current two-dimensional codeword.
  • the decoding output of a two-dimensional codeword is directly related to the current codeword, the previous two-dimensional codeword, and the next two-dimensional codeword.
  • This sliding block decoding method makes full use of the time constraint information between codewords. Therefore, there is a decoding window for decoding.
  • the size of the decoding window has a significant impact on the catastrophic propagation of decoding errors.
  • the decoding window is theoretically 3 codewords, but actually there are only 2 codewords, so the decoding error does not exceed 2 data words at most, that is, 4-bit data, which is very advantageous in practical applications. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing For Digital Recording And Reproducing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

Un procédé et un dispositif de codage et de décodage à base de contrainte de Bosk bidimensionnelle, se rapportant au domaine du stockage de données et de la communication de données. Le procédé de codage fait appel aux étapes suivantes : la mise en mémoire cache d'un flux de données unidimensionnelles, et la division du flux de données unidimensionnelles en plusieurs ensembles de données à 2 bits unidimensionnelles ; et selon une table de codage, un codeur code chaque ensemble de données à 2 bits en 3*2 mots de code bidimensionnels un par un, puis concatène tous les mots de code bidimensionnels dans un réseau de contraintes bidimensionnelles selon un ordre spécifié. Le procédé de décodage fait appel aux étapes suivantes : un décodeur lit le réseau de contraintes bidimensionnelles et le divise en plusieurs 3*2 mots de code bidimensionnels, décode chaque mot de code bidimensionnel en données à 2 bits unidimensionnelles une par une au moyen d'une table de décodage, puis assemble de manière séquentielle les données à 2 bits unidimensionnelles générées en un flux de données unidimensionnelles et délivre en sortie le flux de données unidimensionnelles. La contrainte de Bosk bidimensionnelle se réfère à celle dans un réseau de données binaires constitué de données « 0 » et « 1 », deux « 1 » ne peuvent pas être directement adjacents dans les directions horizontale, verticale, nord-est et sud-est.
PCT/CN2019/105376 2019-09-11 2019-09-11 Procédé et dispositif de codage et de décodage basés sur la contrainte de bosk bidimensionnelle WO2021046756A1 (fr)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP19928292.2A EP4030427A4 (fr) 2019-09-11 2019-09-11 Procédé et dispositif de codage et de décodage basés sur la contrainte de bosk bidimensionnelle
US17/055,534 US11233526B2 (en) 2019-09-11 2019-09-11 Two-dimensional square constraint encoding and decoding method and device
CN201980096304.3A CN113811947B (zh) 2019-09-11 2019-09-11 一种二维方形约束的编译码方法及装置
PCT/CN2019/105376 WO2021046756A1 (fr) 2019-09-11 2019-09-11 Procédé et dispositif de codage et de décodage basés sur la contrainte de bosk bidimensionnelle

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2019/105376 WO2021046756A1 (fr) 2019-09-11 2019-09-11 Procédé et dispositif de codage et de décodage basés sur la contrainte de bosk bidimensionnelle

Publications (1)

Publication Number Publication Date
WO2021046756A1 true WO2021046756A1 (fr) 2021-03-18

Family

ID=74867166

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/105376 WO2021046756A1 (fr) 2019-09-11 2019-09-11 Procédé et dispositif de codage et de décodage basés sur la contrainte de bosk bidimensionnelle

Country Status (4)

Country Link
US (1) US11233526B2 (fr)
EP (1) EP4030427A4 (fr)
CN (1) CN113811947B (fr)
WO (1) WO2021046756A1 (fr)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5907581A (en) * 1996-09-27 1999-05-25 International Business Machines Corporation Two-dimensional low-pass filtering code apparatus and method
CN1463079A (zh) * 2003-06-18 2003-12-24 清华大学 采用有限游程长度调制的数据编码和解码方法
CN1650366A (zh) * 2002-04-26 2005-08-03 皇家飞利浦电子股份有限公司 用于多维编码和译码的方法和设备
CN102298953A (zh) * 2011-06-03 2011-12-28 武汉纺织大学 带保护字的二维游程长度受限约束的编解码器及使用方法
CN102903378A (zh) * 2012-09-29 2013-01-30 武汉纺织大学 用于变长码率的二维游程长度受限约束编解码装置及方法

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004105252A1 (fr) * 2003-05-21 2004-12-02 Koninklijke Philips Electronics N.V. Codage bidimensionnel par modulation pour stockage optique haute densite
WO2005119678A1 (fr) * 2004-06-02 2005-12-15 Koninklijke Philips Electronics N.V. Appareil de codage et decodage et procedes correspondants
CN101540610B (zh) * 2009-01-07 2011-12-28 湖南大学 一种二维非隔离位约束编解码方法及编解码器
US8700970B2 (en) * 2010-02-28 2014-04-15 Densbits Technologies Ltd. System and method for multi-dimensional decoding
CN102129875B (zh) * 2011-02-22 2013-04-24 武汉纺织大学 二维游程长度受限约束的块编解码装置及其使用方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5907581A (en) * 1996-09-27 1999-05-25 International Business Machines Corporation Two-dimensional low-pass filtering code apparatus and method
CN1650366A (zh) * 2002-04-26 2005-08-03 皇家飞利浦电子股份有限公司 用于多维编码和译码的方法和设备
CN1463079A (zh) * 2003-06-18 2003-12-24 清华大学 采用有限游程长度调制的数据编码和解码方法
CN102298953A (zh) * 2011-06-03 2011-12-28 武汉纺织大学 带保护字的二维游程长度受限约束的编解码器及使用方法
CN102903378A (zh) * 2012-09-29 2013-01-30 武汉纺织大学 用于变长码率的二维游程长度受限约束编解码装置及方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4030427A4 *

Also Published As

Publication number Publication date
EP4030427A4 (fr) 2023-06-21
CN113811947A (zh) 2021-12-17
EP4030427A1 (fr) 2022-07-20
CN113811947B (zh) 2022-12-13
US20210367612A1 (en) 2021-11-25
US11233526B2 (en) 2022-01-25

Similar Documents

Publication Publication Date Title
JP5875205B2 (ja) 高速シリアルリンクを用いるメモリシステム用のコーディングシステム
JP5723967B2 (ja) ソリッド・ステート・ストレージ・デバイスのｓレベル・ストレージに入力データを記録するための方法、エンコーダ装置、およびソリッド・ステート・ストレージ・デバイス
JPH05274811A (ja) Ｐｒｍｌコードを実行するための方法と装置
JP2013524609A5 (fr)
US8957792B2 (en) Two-dimensional run-length limited codec with protection words and method for using same
Seyedzadeh et al. Pres: Pseudo-random encoding scheme to increase the bit flip reduction in the memory
JPH02203476A (ja) コード変換器、記録媒体、及びデータ変換方法
US20060170577A1 (en) Techniques for using interleaved encoders to obtain modulation constraints
US7064687B1 (en) Techniques for modulating data using short block encoders
EP4057515B1 (fr) Dispositifs de codage
US7142134B2 (en) Techniques for generating modulation codes using running substitutions
WO2021046756A1 (fr) Procédé et dispositif de codage et de décodage basés sur la contrainte de bosk bidimensionnelle
JP2002520934A (ja) ランレングス制限コード化シーケンスへの２進シーケンスの可逆的マッピング方法及び装置
JP2000078025A (ja) 符号化されたデ―タを処理する装置
CN102129875B (zh) 二维游程长度受限约束的块编解码装置及其使用方法
CN1305064C (zh) 用于光致变色多阶光存储的游程长度受限编码式写入方法
US6985320B2 (en) Method and apparatus for encoding data to guarantee isolated transitions in a magnetic recording system
JPH02265329A (ja) 符号逆変換装置
JP2006277903A (ja) 符号化装置、及び復号装置
KR20220127113A (ko) 최소 오버헤드를 갖는 최대 천이 방지 코딩을 구현하는 인코딩 및 디코딩 장치 및 방법
JPH0349076A (ja) ディジタル信号の可変長記録符号化方式
Sankarasubramaniam New capacity-approaching codes for run-length-limited channels
KR19980053224A (ko) Mtr 조건을 만족하는 인코더 및 디코더
JPH01221924A (ja) 可変長符号逆変換装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19928292

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2019928292

Country of ref document: EP

Effective date: 20220411