WO2021046756A1 - 一种二维方形约束的编译码方法及装置 - Google Patents

一种二维方形约束的编译码方法及装置 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)
French (fr)
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 US17/055,534 priority Critical patent/US11233526B2/en
Priority to EP19928292.2A priority patent/EP4030427A4/en
Priority to PCT/CN2019/105376 priority patent/WO2021046756A1/zh
Priority to CN201980096304.3A priority patent/CN113811947B/zh
Publication of WO2021046756A1 publication Critical patent/WO2021046756A1/zh

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

一种二维方形约束的编译码方法及装置，涉及数据存储和数据通信领域。编码方法包括：缓存一维数据流，将一维数据流划分为若干组一维2比特数据；按照所述编码表，编码器逐一将每组2比特数据编码成3×2的二维码字，之后将所有二维码字按照指定次序级联成二维约束阵列；译码方法包括：译码器读取二维约束阵列，并划分为若干个3×2的二维码字，通过译码表，逐一将每一个二维码字译码为一维2比特数据，然后将产生的一维2比特数据依次组装为一维数据流并输出。所述的二维方形约束是指在数据"0"和"1"组成的二进制数据阵列中，沿着水平方向、垂直方向、东北方向和东南方向四个方向上，数据"1"两两之间不能直接相邻。

Description

一种二维方形约束的编译码方法及装置 技术领域
本发明属于数据存储和数据通信领域，具体涉及在四边形格子组成的平面上，由“0”和“1”组成的二进制数据阵列，沿着水平、垂直、东北、东南方向上，数据“1”两两不能直接相邻的一种二维方形约束编译码方法及装置。
背景技术
在现代存储器中，存储在记录介质上的直接相邻数据，由于相互影响会产生码间串扰。为了降低数据出错的可能性，提高存储器系统可靠性，数据记录在存储介质上通常需要满足一些限制条件，即数据需要被编码成一些满足特殊约束限制的图案才能存储在记录介质上。应用不同，约束图案也有所不同。常见的约束类型有最大变迁游程约束(MTR)、游程长度受限制约束及其它一些约束。
数据沿着记录介质的一维迹线(tracks)进行存取是目前常见的存储技术。近些年随着需求提升和技术进步，以提高数据传输率和存储容量为目的，将数据以二维页面(甚至三维)方式进行存取的下一代数据存储技术得到显著发展。相关例子包括相变存储器(PCM)、全息存储器、二维光盘、二维图案化介质记录等。在上述存储技术中，数据在二维平面上以四边形格子或六边形格子的方式排列组合成二维数据阵列，数据之间的码间串扰也变得更为复杂，从一维情形变成了二维情形。除了需要考虑码间串扰在“水平”左右方向上对数据的相互影响，还需要考虑在“垂直”方向上对相邻数据的相互影响。在 一些具体应用中，为了避免数据“1”之间的相互直接影响，即要求数据“1”在二维数据阵列中的4个方向上不能出现直接相邻的情形，这就是通常所说的二维方形约束。具体而言，以四边形格子为例，二维方形约束是指：在数据“0”和数据“1”构成的二维数据阵列中，两个数据“1”在水平方向、垂直方向和东北方向和东南方向上不能直接相邻。即记录在存储介质上的二进制数据图案中，不能出现图1所示的图案组合。
上述中的二维方形约束限制，在沿着一维迹线(例如光记录和磁记录)进行数据存取的存储技术中，表现为在记录数据序列中，任意两数据“1”不得直接相邻。传统上解决该问题的一种方案是采取一维游程长度受限制约束(1,∞)RLL的编码方法。但是在前述数据按照二维页面进行存取的技术中，数据“1”两两之间的直接相邻约束限制体现在4个方向上，只能解决水平方向的一维(1,∞)RLL编码方法在此显然无能为力。
发明内容
针对现有技术中存在的缺陷，本发明的目的在于提供一种基于四边形格子的二维方形约束的编译码方法及装置，使得在数据“0”和“1”组成的二进制数据阵列中，沿着水平、垂直、东北、东南四个方向上，数据“1”两两之间不直接相邻。
为达到以上目的，一方面，采取一种二维方形约束的编译码方法，
编码方法包括：缓存一维数据流，将所述一维数据流划分为若干组一维2比特数据；通过查找二维方形约束编码器的编码表，逐一将每组2比特数据编码成3×2的二维码字，将所有编码得到的二维码字按照编码先后次序构造出大小等于一个页面的二维约束阵列；该二维约束阵列，沿着水平方向、垂直方向、东北方向和东南方向四个方 向上，数据“1”两两之间不直接相邻；
译码方法包括：读取所述二维约束阵列，根据指定次序划分为若干个3×2的二维码字，利用当前二维码字的译码输出既和当前二维码字直接关联，又和上一个二维码字或下一个二维码字也有关联的内在关系，通过查找二维方形约束译码器的译码表，逐一将每一个二维码字译码为一组一维2比特数据，并将所有一维2比特数据依次组装为一维数据流并输出。
优选的，所述编码器包括两种状态，分别称第1状态和第2状态；所述编码表的编码依据为：
当前编码输出的3×2二维码字由当前输入的一维2比特数据和下一组输入的一维2比特数据及编码器的当前状态共同确定；所述编码器的下一个状态即编码器输出状态，由编码器当前状态和当前输入的一维2比特数据及下一组输入的一维2比特数据共同确定。
优选的，所述一维2比特数据分别为00、10、01和11，基本二维码字分别为
Figure PCTCN2019105376-appb-000001
和
Figure PCTCN2019105376-appb-000002
每组一维2比特数据和一个基本二维码字对应，且对应关系任意设置。
优选的，所述一维2比特数据00、10、01和11，一一对应基本二维码字
Figure PCTCN2019105376-appb-000003
和
Figure PCTCN2019105376-appb-000004
时，
若当前2比特数据与下一组2比特数据出现如下0100、1100、0110和1110四种情况时，此2比特数据和下一组2比特数据相对应的基本二维码字组合应该分别替代为如下组合：
Figure PCTCN2019105376-appb-000005
和
Figure PCTCN2019105376-appb-000006
优选的，所述编码器的编码表为：
Figure PCTCN2019105376-appb-000007
优选的，所述译码器的译码表为：
Figure PCTCN2019105376-appb-000008
其中，X表示不会出现。
优选的，所述一维2比特数据分别为00、10、01和11，基本二维码字分别为
Figure PCTCN2019105376-appb-000009
和
Figure PCTCN2019105376-appb-000010
每个一维2比特数据和一个基本二维码字对应，且对应关系任意设置。
优选的，所述一维2比特数据00、10、01和11，一一对应基本 二维码字
Figure PCTCN2019105376-appb-000011
和
Figure PCTCN2019105376-appb-000012
时，
若当前2比特数据与下一组2比特数据出现如下0100、1100、0110和1110四种情况时，此2比特数据和下一组2比特数据相对应的基本二维码字组合应该分别替代为如下组合：
Figure PCTCN2019105376-appb-000013
和
Figure PCTCN2019105376-appb-000014
优选的，所述编码器的编码表为：
Figure PCTCN2019105376-appb-000015
优选的，所述译码器的译码表为：
Figure PCTCN2019105376-appb-000016
其中，X表示不会出现。
优选的，编码方法中，将编码得到的二维码字从左到右、从上到下进行级联；
所述译码方法中，将所述二维约束阵列按照从左到右、从上到下划分为若干个3×2的二维码字；并且，所述译码器采用滑动分块译码方式逐一对当前二维码字进行译码。
另外，本发明还提供一种适用于上述编译码方法的编译码装置， 编码装置包括：
一维数据流缓冲部件，其用于根据码率和二维数据页的大小，缓存一维数据流；
数据流划分部件，其用于将所述一维数据流缓冲部件缓存的一维数据流划分分为若干组一维2比特数据；
方形约束码字编码器，其用于从所述数据流划分部件中读取一维2比特数据，根据编码表逐一将每一组2比特数据编码成3×2的二维码字；
二维数据阵列组装部件，其用于缓存所述方形约束码字编码器生成的所有二维码字，并按照编码先后次序从左到右、从上到下级联构造出大小等于一个页面的二维约束阵列；还用于将构造后的一个页面的二维数据输出给一个二维数据记录装置；
所述译码装置包括：
二维数据阵列缓冲部件，其用于缓冲所述二维数据记录装置输出的一个页面的二维约束阵列；
二维码字划分部件，其用于将所述二维约束阵列按照指定次序划分为若干个3×2的二维码字；
方形约束码字译码器，其用于根据滑动分块译码原理，利用当前二维码字的译码输出既和当前二维码字直接关联，又和上一个二维码字或下一个二维码字也有关联的内在关系，通过查找二维方形约束译码器的译码表，逐一将每一个二维码字译码为一组一维2比特数据；
一维数据流组装部件，将所述方形约束码字译码器输出的所有一维2比特数据依次组装为一维数据流输出。
上述技术方案有如下有益效果：
1、本发明中，在编码阶段，编码器采取前读(look-ahead)编码 方法，可以将一维数据流编码成满足二维方形约束的二维数据阵列；在译码阶段，译码器采取滑动分块(sliding-block)译码原理，可以从存储在记录介质上，且满足二维方形约束限制的二维数据阵列中恢复出原始数据。本发明所述的二维方形约束，在某些文献中，有时也称为国王非攻击约束(Non-Attacking-King，NAK)。本发明提出的技术方案，可应用于按照二维数据阵列形式(“页”面方式)记录的数据存储系统，或将数据按照二维阵列类型进行传输的通信系统。
2、编码阶段，当前2比特数据通过“前读”一个2比特数据并结合编码器当前时刻的状态，被编码成3×2的二维码字；在译码阶段，采取滑动分块译码原理，实现了对当前3×2的二维码字的译码，由于数据和二维码字都较短，有利于简化编译码装置的电路设计与具体实现。此外，鉴于二维方形约束的容量近似等于0.42508，因此在本发明中，编码效率接近80％，这对改善存储通道和通信信道的综合性能具有重要意义。
3、编译码装置中采用一个两状态的有限状态编码器，编码器的状态经过化简达到最小值。译码器的译码窗口虽然等于3个二维码字长度，但实际上对于每个二维码字的译码而言，译码窗口只有2个二维码字长度，因此译码出错导致的灾难性错误传播仅限于4bits数据。
附图说明
图1为本发明中二维方形约束所述的四类禁止二维数据图案组合；
图2为本发明所述由3×2的数据阵列组成的一个二维码字；
图3为本发明所述数据读取时的时序关系示意图；
图4为本发明所述前读一个数据的编码原理图；
图5为本发明所述二维码字在数据阵列中的布置图；
图6为本发明所述滑动分块译码原理图；
图7为本发明所述编码装置原理框图；
图8为本发明所述译码装置原理框图；
图9为本发明所述二维方形约束阵列编码示意图；
图10为本发明所述二维方形约束阵列译码示意图。
具体实施方式
为了使本发明的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本发明进行进一步详细说明。应当理解，此处所描述的具体实施例仅用以解释本发明，并不用于限定本发明。此外，下面所描述的本发明各个实施方式中所涉及到的技术特征可以相互组合。
提供一种二维方形约束的编译码方法的实施例，包括编码方法和译码方法，编码方法包括：
S101、根据码率和二维数据页的大小，缓存一维数据流，然后将缓存的一维数据流以2比特为一个数据字，划分成若干组数据字。
S102、通过二维方形约束编码器的编码表，逐一将每一组2比特数据编码成3×2的二维码字，将所有编码得到二维码字级联构成二维约束阵列，如图1所示沿着水平方向、垂直方向、东北方向和东南方向等四个方向上，数据“1”两两之间不直接相邻。其中，所述编码器的当前状态包括两种情形，分别称为第1状态和第2状态。
如图2所示，本实施例中采取的二维码字是高3比特、长2比特的二维阵列，它是在实际存取二维数据过程中的最小存取单位。
具体编码过程中，读取的2比特数据之间的时序关系如图3所示，其中t i+1表示数据的下一个时刻、t i表示数据的当前时刻、t i-1表示上 一个时刻。如图4所示，编码器需要对在t i时刻输入的2比特数据进行编码时，编码器根据该一维2比特数据和下一组输入的2比特数据(前读数据)，以及编码器的当前状态进行二维编码，然后将编码后的二维码字输出。另一方面，编码器的下一个状态(即输出状态)根据编码器的当前状态、当前输入的一维2比特数据和下一组输入的一维2比特数据(前读数据)依据表3(或表7)实时更新。更新后的下一个状态作为在t i+1时刻编码器的当前状态。
S103、将所有二维码字按照指定次序构造出大小等于一个页面的二维约束阵列后，输出给一个二维数据记录装置。
如图5所示，是二维码字在数据阵列中的布置图，该布置图说明了一维用户数据用二维阵列方式进行写入时，从3×2二维阵列这个最小存取单位的角度来讲，对数据的处理按照从左到右，从上到下逐行方式进行级联。
本实施例中的译码方法包括：
从二维数据记录装置中读取二维约束阵列，根据指定级联次序划分为若干个3×2的二维码字，即按照最小存取单位进行划分。本实施例中如图5所示，按照从左到右，从上到下逐行方式划分。
如图6所示，译码器采用滑动分块译码方式逐一对二维码字进行译码，通过二维方形约束译码器的译码表，结合当前二维码字和下一个二维码字，逐一将每一个二维码字译码成一维2比特数据，并将所有译码得到的一维2比特数据依次组装为一维数据流并输出。
上述编码方法中，需采用基本二维码字或替代码字对2比特数据进行编码，一维2比特数据包括00、10、01和11，本实施例中，表1为基本码表。
表1
Figure PCTCN2019105376-appb-000017
基于表1，上述一维2比特数据可被编码成3×2的二维码字，上述四个3×2的二维码字两两水平级联可组成十六种3×4的二维阵列,其中有四种情况违反了二维方形约束限制，即：
Figure PCTCN2019105376-appb-000018
当采取表1对数据进行编码时，若出现上面情况，则用替换码表2中的相应码字组合代替上述四种反例。
表2
Figure PCTCN2019105376-appb-000019
根据上述表1和表2，可以构造编码表3，编码器根据表3进行查找编码。
表3
Figure PCTCN2019105376-appb-000020
根据表3，可以构造译码器的译码表4，用于译码器进行译码，表4中X表示不会出现。
表4
Figure PCTCN2019105376-appb-000021
需要指出的是：在上述表1中，保持4组一维2比特数据和4个3×2的二维码字不变时，每组一维2比特数据与4个3×2的二维码字对应关系是可以变化的。通过简单计算可知，这种对应关系多达24种，换句话就是，表1指定的这种对应关系只是这24种对应关系中的一种，但当这两者之间的对应关系一经确定后，即可唯一得到与该对应关系相一致的新基本码表和新替代码表，其形式与基本码表1 及替代码表2相同。基于这种新对应关系产生的基本码表和替换码表，也会产生与之对应的唯一新编码表和新译码表，但是表格的形式与上述表3和表4相同，并且原理完全相同。
本发明中，还提供基本码表和替换码表的第二种实施例。第二种实施例中，基本码表详见表5。
表5
Figure PCTCN2019105376-appb-000022
在第二种实施例中，当采取表5对数据进行编码时，若出现四种违反了二维方形约束限制的情况，则用替换码表6中的相应码字组合代替上述四种反例。
表6
Figure PCTCN2019105376-appb-000023
同理，根据上述表5和表6，可以构造编码表7，编码器根据表7进行查找编码。
表7
Figure PCTCN2019105376-appb-000024
第二实施例中，根据表7可以构造译码器的译码表8，用于译码器进行译码，表8中，X表示不会出现。
表8
Figure PCTCN2019105376-appb-000025
基于上述实施例，本发明还提供一种适用于上述实施例的编译码装置，包括编码装置、译码装置和一个二维数据记录装置。
如图7所示，编码装置包括依次相连的一维数据流缓冲部件、数据流划分部件、方形约束码字编码器、二维数据阵列组装部件。
一维数据流缓冲部件，其用于根据码率和二维数据页的大小，缓存一维数据流。
数据流划分部件，其用于将一维数据流缓冲部件缓存的一维数据 流划分分为若干组一维2比特数据。
方形约束码字编码器，其用于从数据流划分部件中读取为完成编码所需要的若干一维2比特数据，根据编码器的编码表，逐一将每一组2比特数据编码成3×2的二维码字，并实时更新编码器的当前状态。
二维数据阵列组装部件，其用于缓存方形约束码字编码器生成的所有二维码字，并按照编码先后次序，构造出大小等于一个页面的二维约束阵列；还用于将构造出的一个页面的二维数据输出给二维数据记录装置。上述编码先后次序为“从左到右，从上到下”。
如图8所示，译码装置包括依次相连的二维数据阵列缓冲部件、二维码字划分部件、方形约束码字译码器和一维数据流组装部件。
二维数据阵列缓冲部件，其用于缓冲上述二维数据记录装置输出的一个页面的二维约束阵列。
二维码字划分部件，其用于将二维约束阵列按照指定次序划分为若干个3×2的二维码字，并按照先后顺序输入到方形约束码字译码器中，上述指定次序为：“从左到右，从上到下”。
方形约束码字译码器，其用于根据滑动分块译码原理，使用译码表，结合当前二维码字、上一个二维码字及下一个二维码字，逐步将每一个二维码字译码为一组一维2比特数据。
一维数据流组装部件，将方形约束码字译码器输出的所有一维2比特数据依次组装为一维数据流，并输出。
如图9所示，基于上述编译码装置和编码表的第二实施例(即表7)，给出一种二维方形约束阵列编码过程。假定一个二维数据页面大小为6×10，令输入给编码器的一维随机数据序列为00 01 10 11 10 00 01 00 10 11(从左到右输入)，且假设编码器的初始状态为第1状 态(若初始状态为第2状态，分析类似)。在时刻t i，编码器的当前输入数据为00，下一个数据(前读数据)为01，根据表7所示进行编码，一维2比特数据00的编码如下：
Figure PCTCN2019105376-appb-000026
编码器的下一个状态为第1状态(即保持不变)。在时刻t i+1，编码器的当前输入数据为01，下一个数据(前读数据)为10，且编码器的当前状态为1，因此当前一维2比特数据01的编码如下：
Figure PCTCN2019105376-appb-000027
且编码器的下一个状态变为第2状态。在时刻t i+2，编码器的当前输入数据为10，且编码器的当前状态为第2状态，根据表7，当前一维2比特数据10的编码如下：
Figure PCTCN2019105376-appb-000028
且编码器的下一个状态变为第1状态。重复上述过程，即可实现上述一维随机数据序列的编码。在本实施例中，后续数据的编码如下：
Figure PCTCN2019105376-appb-000029
在整个编码过程中，编码器的状态变化为：1121211111。编码后的数据存入二维数据记录装置。
如图10所示，根据上述编码过程，给出对应的译码过程。首先从二维数据记录装置读取二维数据阵列，然后按照3×2为一组，将该阵列划分成若干如下的二维数据子阵列。
Figure PCTCN2019105376-appb-000030
根据码字在二维阵列的写入次序，将上面得到的二维数据子阵列以3×2的二维码字为基本单元，逐一输入到译码器进行译码。令在时刻t i，当前需要被译码器译码的二维码字是
Figure PCTCN2019105376-appb-000031
因该数据在二维阵列中的下一个二维码字是
Figure PCTCN2019105376-appb-000032
根据表8，该数据的译码不需要上一个二维码字的信息，因此译码如下：
Figure PCTCN2019105376-appb-000033
在时刻t i+1，当前二维码字
Figure PCTCN2019105376-appb-000034
的下一个二维码字为
Figure PCTCN2019105376-appb-000035
因此时刻t i+1的当前数据应该译码为01，即译码如下：
Figure PCTCN2019105376-appb-000036
重复上述过程，即可实现二维数据阵列的译码，其余二维码字的译码如下：
Figure PCTCN2019105376-appb-000037
最后将“00 01 10 11 10 00 01 00 10 11”按照产生先后组装 成一维用户数据流11010010000111011000(从右到左)并输出，即可完成译码器对一页二维数据阵列的译码。
上述实施例中，编码装置中的编码器使用了一种前读数据的编码方法，即数据编码输出除了和当前数据有直接关系外，还和下一个数据及编码器当前状态有关。另一方面，在译码阶段，为了正确地译码，译码器采取的是一种滑动分块译码方法对当前二维码字进行译码。简而言之，二维码字的译码输出和当前码字、上一个二维码字及下一个二维码字直接相关。这种滑动分块译码方法充分利用了码字之间在时间先后上的约束信息，因此译码存在一个译码窗口，译码窗口的大小对译码错误的灾难性传播有显著影响，然而在本实施例中，这个译码窗口理论上是3个码字，实际上只有2个码字，因此译码错误最多不超过2个数据字，即4比特数据，这在实际应用中非常有利。
本发明不局限于上述实施方式，对于本技术领域的普通技术人员来说，在不脱离本发明原理的前提下，还可以做出若干改进和润饰，这些改进和润饰也视为本发明的保护范围之内。本说明书中未作详细描述的内容属于本领域专业技术人员熟悉的现有技术。

Claims (12)

  1. 一种二维方形约束的编译码方法，其特征在于：
    编码方法包括：缓存一维数据流，将所述一维数据流划分为若干组一维2比特数据；通过查找二维方形约束编码器的编码表，逐一将每组2比特数据编码成3×2的二维码字，将所有编码得到的二维码字按照编码先后次序构造出大小等于一个页面的二维约束阵列；该二维约束阵列，沿着水平方向、垂直方向、东北方向和东南方向四个方向上，数据“1”两两之间不直接相邻；
    译码方法包括：读取所述二维约束阵列，根据指定次序划分为若干个3×2的二维码字，利用当前二维码字的译码输出既和当前二维码字直接关联，又和上一个二维码字或下一个二维码字也有关联的内在关系，通过查找二维方形约束译码器的译码表，逐一将每一个二维码字译码为一组一维2比特数据，并将所有一维2比特数据依次组装为一维数据流并输出。
  2. 如权利要求1所述的二维方形约束的编译码方法，其特征在于：所述编码器包括两种状态，分别称第1状态和第2状态；所述编码表的编码依据为：
    当前编码输出的3×2二维码字由当前输入的一维2比特数据和下一组输入的一维2比特数据及编码器的当前状态共同确定；所述编码器的下一个状态即编码器输出状态，由编码器当前状态和当前输入的一维2比特数据及下一组输入的一维2比特数据共同确定。
  3. 如权利要求2所述的二维方形约束的编译码方法，其特征在于：所述一维2比特数据分别为00、10、01和11，基本二维码字分别为
    Figure PCTCN2019105376-appb-100001
    和
    Figure PCTCN2019105376-appb-100002
    每组一维2比特数据和一个基本二维码字对应， 且对应关系任意设置。
  4. 如权利要求3所述的二维方形约束的编译码方法，其特征在于：所述一维2比特数据00、10、01和11，一一对应基本二维码字
    Figure PCTCN2019105376-appb-100003
    和
    Figure PCTCN2019105376-appb-100004
    时，
    若当前2比特数据与下一组2比特数据出现如下0100、1100、0110和1110四种情况时，此2比特数据和下一组2比特数据相对应的基本二维码字组合应该分别替代为如下组合：
    Figure PCTCN2019105376-appb-100005
    和
    Figure PCTCN2019105376-appb-100006
  5. 如权利要求4所述的二维方形约束的编译码方法，其特征在于，所述编码器的编码表为：
    Figure PCTCN2019105376-appb-100007
  6. 如权利要求5所述的二维方形约束的编译码方法，其特征在于，所述译码器的译码表为：
    Figure PCTCN2019105376-appb-100008
    其中，X表示不会出现。
  7. 如权利要求2所述的二维方形约束的编译码方法，其特征在于，所述一维2比特数据分别为00、10、01和11，基本二维码字分别为
    Figure PCTCN2019105376-appb-100009
    和
    Figure PCTCN2019105376-appb-100010
    每个一维2比特数据和一个基本二维码字对应，且对应关系任意设置。
  8. 如权利要求7所述的二维方形约束的编译码方法，其特征在于：所述一维2比特数据00、10、01和11，一一对应基本二维码字
    Figure PCTCN2019105376-appb-100011
    和
    Figure PCTCN2019105376-appb-100012
    时，
    若当前2比特数据与下一组2比特数据出现如下0100、1100、0110和1110四种情况时，此2比特数据和下一组2比特数据相对应的基本二维码字组合应该分别替代为如下组合：
    Figure PCTCN2019105376-appb-100013
    和
    Figure PCTCN2019105376-appb-100014
  9. 如权利要求8所述的二维方形约束的编译码方法，其特征在于，所述编码器的编码表为：
    Figure PCTCN2019105376-appb-100015
  10. 如权利要求9所述的二维方形约束的编译码方法，其特征在于，所述译码器的译码表为：
    Figure PCTCN2019105376-appb-100016
    其中，X表示不会出现。
  11. 如权利要求1所述的二维方形约束的编译码方法，其特征在于，编码方法中，将编码得到的二维码字从左到右、从上到下进行级联；
    所述译码方法中，将所述二维约束阵列按照从左到右、从上到下 划分为若干个3×2的二维码字；并且，所述译码器采用滑动分块译码方式逐一对当前二维码字进行译码。
  12. 一种适用于权利要求1所述编译码方法的编译码装置，其特征在于，编码装置包括：
    一维数据流缓冲部件，其用于根据码率和二维数据页的大小，缓存一维数据流；
    数据流划分部件，其用于将所述一维数据流缓冲部件缓存的一维数据流划分分为若干组一维2比特数据；
    方形约束码字编码器，其用于从所述数据流划分部件中读取一维2比特数据，根据编码表逐一将每一组2比特数据编码成3×2的二维码字；
    二维数据阵列组装部件，其用于缓存所述方形约束码字编码器生成的所有二维码字，并按照编码先后次序从左到右，从上到下级联构造出大小等于一个页面的二维约束阵列；还用于将构造后的一个页面的二维数据输出给一个二维数据记录装置；
    所述译码装置包括：
    二维数据阵列缓冲部件，其用于缓冲所述二维数据记录装置输出的一个页面的二维约束阵列；
    二维码字划分部件，其用于将所述二维约束阵列按照指定次序划分为若干个3×2的二维码字；
    方形约束码字译码器，其用于根据滑动分块译码原理，利用当前二维码字的译码输出既和当前二维码字直接关联，又和上一个二维码字或下一个二维码字也有关联的内在关系，通过查找二维方形约束译码器的译码表，逐一将每一个二维码字译码为一组一维2比特数据；
    一维数据流组装部件，将所述方形约束码字译码器输出的所有一 维2比特数据依次组装为一维数据流输出。
PCT/CN2019/105376 2019-09-11 2019-09-11 一种二维方形约束的编译码方法及装置 WO2021046756A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
US17/055,534 US11233526B2 (en) 2019-09-11 2019-09-11 Two-dimensional square constraint encoding and decoding method and device
EP19928292.2A EP4030427A4 (en) 2019-09-11 2019-09-11 METHOD AND DEVICE FOR CODING AND DECODING BASED ON TWO-DIMENSIONAL BOSK STRESS
PCT/CN2019/105376 WO2021046756A1 (zh) 2019-09-11 2019-09-11 一种二维方形约束的编译码方法及装置
CN201980096304.3A CN113811947B (zh) 2019-09-11 2019-09-11 一种二维方形约束的编译码方法及装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2019/105376 WO2021046756A1 (zh) 2019-09-11 2019-09-11 一种二维方形约束的编译码方法及装置

Publications (1)

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

Family

ID=74867166

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/105376 WO2021046756A1 (zh) 2019-09-11 2019-09-11 一种二维方形约束的编译码方法及装置

Country Status (4)

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

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
KR20060015281A (ko) * 2003-05-21 2006-02-16 코닌클리케 필립스 일렉트로닉스 엔.브이. 고밀도 광 저장 장치용 2차원 변조 인코딩
EP1756824A1 (en) * 2004-06-02 2007-02-28 Koninklijke Philips Electronics N.V. Encoding and decoding apparatus and corresponding methods
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 (en) 2023-06-21
US11233526B2 (en) 2022-01-25
CN113811947A (zh) 2021-12-17
EP4030427A1 (en) 2022-07-20
US20210367612A1 (en) 2021-11-25
CN113811947B (zh) 2022-12-13

Similar Documents

Publication Publication Date Title
JP5875205B2 (ja) 高速シリアルリンクを用いるメモリシステム用のコーディングシステム
JP5723967B2 (ja) ソリッド・ステート・ストレージ・デバイスのｓレベル・ストレージに入力データを記録するための方法、エンコーダ装置、およびソリッド・ステート・ストレージ・デバイス
JPH05274811A (ja) Ｐｒｍｌコードを実行するための方法と装置
JP2013524609A5 (zh)
US8957792B2 (en) Two-dimensional run-length limited codec with protection words and method for using same
US7126502B2 (en) Techniques for using interleaved encoders to obtain modulation constraints
Seyedzadeh et al. Pres: Pseudo-random encoding scheme to increase the bit flip reduction in the memory
JPH02203476A (ja) コード変換器、記録媒体、及びデータ変換方法
US7064687B1 (en) Techniques for modulating data using short block encoders
EP4057515B1 (en) Devices for encoding
US7142134B2 (en) Techniques for generating modulation codes using running substitutions
WO2021046756A1 (zh) 一种二维方形约束的编译码方法及装置
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) 최소 오버헤드를 갖는 최대 천이 방지 코딩을 구현하는 인코딩 및 디코딩 장치 및 방법
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