CN102436834A - Method and device for reading disk information - Google Patents
Method and device for reading disk information Download PDFInfo
- Publication number
- CN102436834A CN102436834A CN2011103585259A CN201110358525A CN102436834A CN 102436834 A CN102436834 A CN 102436834A CN 2011103585259 A CN2011103585259 A CN 2011103585259A CN 201110358525 A CN201110358525 A CN 201110358525A CN 102436834 A CN102436834 A CN 102436834A
- Authority
- CN
- China
- Prior art keywords
- information
- module
- coding
- decoding
- polynomial
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 32
- 239000011159 matrix material Substances 0.000 claims description 39
- 238000007476 Maximum Likelihood Methods 0.000 claims description 23
- 238000006243 chemical reaction Methods 0.000 claims description 11
- 238000004364 calculation method Methods 0.000 claims description 6
- 239000000654 additive Substances 0.000 claims description 3
- 230000000996 additive effect Effects 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 abstract description 7
- 238000005259 measurement Methods 0.000 description 10
- 238000010586 diagram Methods 0.000 description 5
- 230000000694 effects Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000001131 transforming effect Effects 0.000 description 2
- 239000002360 explosive Substances 0.000 description 1
- 239000004615 ingredient Substances 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
Images
Landscapes
- Error Detection And Correction (AREA)
Abstract
The invention discloses a method and a device for reading disk information, wherein the method comprises the following steps: when reading the information on the disk, carrying out frequency domain RS coding on the read information; carrying out PR channel coding on the information subjected to the RS coding in the frequency domain; pre-decoding the information coded by the PR signal by adopting a BCJR algorithm; and decoding the information after the pre-decoding by adopting an algebraic soft decision algorithm to obtain correct information. The pre-decoding module of the invention adopts BCJR algorithm with soft information output to obtain the input information required by the RS decoding module, and uses algebraic soft decision mode to carry out RS decoding, thus having better performance error correction capability than RS hard decision decoding adopted by the existing disk, reducing the error rate of data transmission, thereby improving the storage density of the disk and saving the cost for modifying the existing disk.
Description
Technical field
The present invention relates to the disk storage system technical field, relate in particular to a kind of method and device of reading disk information.
Background technology
Since 21 century, people sharply increase the demand of memory capacity, and the also significantly raising thereupon of requirement to disk face density has brought serious intersymbol interference thus, has caused higher bit error rate, has reduced the performance of magnetic recording system.
Disk storage system primarily is to guarantee just to go to pursue high storage capacity and quick access after the reliability of data, and aspect such as low price and use be simple and easy.At present; (the partial reaction maximal phase seemingly for normal employing PRML in the magnetic recording; Partial Response Maximum Likelihood) technology detects to eliminate intersymbol interference channel; Its essence is that the PR with shorter ISI (Inter symbol Interference, intersymbol interference) (partial reaction, the Partial Response) signal of balanced device output is sent into Viterbi (Viterbi) detecting device; And can directly be fed into hard decision RS (Reed-Solomon) code decoder to constitute cascade system from the hard decision information of Vitebi detector output, this kind mode is applied in the current disk storage industrial standard.As systematic internal code, the RS sign indicating number is the mode of the common raising system performance that adopts in the present commercial disk as outer yard with the PR channel.But this device error correcting capability is not strong, and is more and more inapplicable in following compact disk.
To sum up, in information age now, the data volume that is explosive growth makes increasing to the capacity requirement of disk storage system.Under identical disc size, bigger capacity just corresponding higher storage density, the serious intersymbol interference that brings has thus reduced system performance.The RS sign indicating number can not adapt to the requirement of following disk storage system to the higher coding gain of error correcting code gradually as the industrial standard of error correcting code in the existing disk storage system.
Summary of the invention
The technical matters that the present invention will solve is, a kind of method and device of reading disk information is provided, and adapts to the high storage density of disk and satisfies the requirement of low error rate.
The technical scheme that the present invention adopts is that the method for said reading disk information comprises:
When step 1, the information on reading disk, the information that reads is carried out the RS Frequency Domain Coding;
Step 2, to carrying out the PR chnnel coding through the information behind the RS Frequency Domain Coding;
Step 3, employing BCJR (Bahl-Cocke-Je-linek-Raviv) algorithm are to decipher through the information after the PR signal encoding in advance;
Step 4, employing algebraically soft-decision algorithm are to deciphering the correct information that obtains through the information after deciphering in advance.
Further, said step 1 specifically comprises:
On the galois field in Abstract Algebra, calculate the polynomial each item coefficient of code word based on message polynomial, said each item coefficient is through the information behind the RS Frequency Domain Coding.
Further, said step 2 also comprises: to carrying out passing through AGWN (additive white Gaussian noise, additive white Gaussian noise) Channel Processing again after the PR chnnel coding through the information behind the RS Frequency Domain Coding.
Further, said step 3 specifically comprises:
The grid chart that is abstracted into based on the PR channel, by bcjr algorithm determine input through the optimal path of the information after the PR signal encoding along PR channel grid chart;
Maximum likelihood output probability according to each channel output sequence value constantly in the said optimal path calculates the maximum likelihood output valve, and the maximum likelihood output valve is the information after the preparatory decoding.
Further, said step 4 specifically comprises:
Information after deciphering in advance is arranged in the reliability matrix;
Is the severe matrix through the severe matrix algorithms with the reliability matrix conversion;
Information via polynomial interpolation algorithm according to the severe matrix obtains first polynomial expression;
On the first polynomial basis, obtain message polynomial through factoring algorithm;
Obtain correct information after will handling through posterior probability method based on the codeword information that message polynomial calculates.
The present invention also provides a kind of device of reading disk information, comprising:
The RS coding module when being used for the information on reading disk, carries out the RS Frequency Domain Coding to the information that reads;
The PR coding module is used for carrying out the PR chnnel coding through the information behind the RS Frequency Domain Coding;
Decoding module is used to adopt bcjr algorithm to deciphering in advance through the information after the PR signal encoding in advance;
The RS decoding module is used to adopt algebraically soft-decision algorithm to deciphering the correct information that obtains through the information after deciphering in advance.
Further, said RS coding module specifically is used for:
On the galois field in Abstract Algebra, calculate the polynomial each item coefficient of code word based on message polynomial, said each item coefficient is through the information behind the RS Frequency Domain Coding.
Further, said PR coding module also is used for: to carrying out passing through the AGWN Channel Processing again after the PR chnnel coding through the information behind the RS Frequency Domain Coding.
Further, said preparatory decoding module specifically comprises:
The path determination module is used for the grid chart that is abstracted into based on the PR channel, by bcjr algorithm determine input through the optimal path of the information after the PR signal encoding along PR channel grid chart;
The decoding output module is used for calculating the maximum likelihood output valve according to the maximum likelihood output probability of each channel output sequence value constantly of said optimal path, and the maximum likelihood output valve is the information after the preparatory decoding.
Further, said RS decoding module specifically comprises:
Reliability matrix acquisition module is used for the information after deciphering in advance is arranged in the reliability matrix;
The matrix conversion module, being used for through the severe matrix algorithms is the severe matrix with the reliability matrix conversion;
The interpolation calculation module is used for obtaining first polynomial expression according to the information via polynomial interpolation algorithm of severe matrix;
The factorization module is used on the first polynomial basis, obtaining message polynomial through factoring algorithm;
Output module is selected in RS decoding, is used for obtaining correct information after the codeword information process posterior probability method processing that calculates based on message polynomial.
Adopt technique scheme, the present invention has advantage at least:
The method of reading disk information according to the invention and device; Decoding module adopts the bcjr algorithm with soft information output to obtain the needed input information of RS decoding module in advance; Use algebraically soft-decision mode to carry out RS decoding, the RS Hard decision decoding that adopts than existing disk has more excellent performance error correcting capability, has reduced the bit error rate of data transmission; Thereby improve the storage density of disk, saved the expense of transforming existing disk.
Description of drawings
Fig. 1 is the method flow diagram of reading disk information in the first embodiment of the invention;
Fig. 2 is the synoptic diagram that calculates the process of forward state metric in the first embodiment of the invention;
Fig. 3 calculates the synoptic diagram of back to the process of state measurement in the first embodiment of the invention;
Fig. 4 is the apparatus structure synoptic diagram of reading disk information in the second embodiment of the invention.
Embodiment
Reach technological means and the effect that predetermined purpose is taked for further setting forth the present invention, below in conjunction with accompanying drawing and preferred embodiment, to the present invention be elaborated as after.
First embodiment of the invention, a kind of method of reading disk information, as shown in Figure 1, comprise following concrete steps:
Step S101 during information on reading disk, carries out the RS Frequency Domain Coding to the information that reads;
Concrete, on the galois field in Abstract Algebra, calculating the polynomial each item coefficient of code word based on message polynomial, said each item coefficient is through the information behind the RS Frequency Domain Coding.
On galois field GF (q), q is the numerical range of galois field, if m
0, m
1..., m
K-1Be information word, then message polynomial is:
f(x)=m
0+m
1x+L+m
k-1x
k-1 (1)
The code word polynomial expression is:
c(x)=f(1)+f(α)x+L+f(α
q-3)x
q-3+f(α
q-2)x
q-2
=c
0+c
1x+L+c
q-3x
q-3+c
q-2x
q-2 (2)
Below with the code length on the galois field GF (8) be 7, dimension is 3 RS (7,3) sign indicating number is explained the use Frequency Domain Coding for example step.If the disc information that reads is for { m2}={101} can know that according to formula (1) concrete message polynomial is f (x)=1+x for m0, m1
2, can know that according to formula (2) the code word multinomial coefficient is then: f (1)=0, f (α)=α
6, f (α
2)=α
5, f (α
3)=α
2, f (α
4)=α
3, f (α
5)=α, f (α
6)=α
4Obtaining concrete code word polynomial expression to these coefficient substitution formula (2) again is:
c(x)=0+α
6x+α
5x
2+α
2x
3+α
3x
4+αx
5+α
4x
6
The code word of this Frequency Domain Coding be 0, α
6, α
5, α
2, α
3, α, α
4.
Step S102 is to carrying out the PR chnnel coding through the information behind the RS Frequency Domain Coding.This step has been simulated the intersymbol interference that information is run into, the i.e. stack of intersymbol interference in transmission course.Because the process of PR chnnel coding is a technology well known in the art, so locate not detail.Preferably, to carrying out passing through the AGWN Channel Processing again after the PR chnnel coding through the information behind the RS Frequency Domain Coding, purpose be more the white Gaussian noise in the real simulated Channel Transmission environment to the influence of signal.
Step S103 adopts BCJR (Bahl-Cocke-Je-linek-Raviv) algorithm to deciphering in advance through the information after the PR signal encoding.
Concrete, step S103 comprises:
A1, the grid chart that is abstracted into based on the PR channel, by bcjr algorithm determine input through the optimal path of the information after the PR signal encoding along PR channel grid chart.This is the core of bcjr algorithm.
Bcjr algorithm is applicable to the decoding of any linear block codes or convolutional code, and is bigger than its computation complexity of viterbi algorithm, therefore under general situation such as information bit, is more prone to adopt viterbi algorithm.Otherwise, when information bit when not being etc. general, adopts bcjr algorithm to decipher and can realize more performance, and that the information that reads from disk in the reality all is that information bit does not wait basically is general.
Move towards to calculate maximum likelihood probability p (a based on bcjr algorithm along the grid chart of PR channel
n=± 1|Y), wherein Y=(y
1, y
2..., Y
N) be the channel output sequence value that receives after the intersymbol interference, promptly pass through the information after the PR signal encoding, n representes variable constantly.Maximum likelihood probability p (a
n=± 1|Y) representes that also certain sequential value y gets at n+1 perhaps-1 probability constantly.In the grid chart each the time be carved with a plurality of states, distinguish with leftover bits and pieces target difference, be s such as wherein two states in a moment
iAnd s
jIf current state representes that with s then Last status is represented with s ', if current state is s ', then NextState is s, that is to say, s ' always is a s preceding state in time.
State from s ' to s, the input value a that receives
nHave only ± 1, employing formula (2):
Wherein
With
Be respectively forward direction with the back to state measurement, c
n(s ', s) be branch metric, forward state metric and formula (3) and the formula (4) of back below the state measurement initialization condition is respectively:
Wherein, following footnote N representes higher limit constantly, and following footnote 0 expression is initial value constantly.
The forward state metric calculation formula is:
The expression of process on grid chart of calculating forward state metric is as shown in Figure 2; The rest may be inferred to obtain current forward state metric
by two branch metrics of the forward state metric
of two laststates and
and input, shifts the forward state metric of n-hour onto from 0 constantly forward state metric always.
The back to the state metric calculation formula is:
Calculating the back represent as shown in Figure 3 on grid chart to the process of state measurement: current afterwards obtain Last status back to state measurement
and
and two branch metrics importing the rest may be inferred to state measurement
by two; Shift the back of 0 moment from the back of n-hour onto to state measurement to state measurement always; The forward state metric of state point, back be under the situation of the branch metric of state measurement and input in calculating grid chart, according to formula (2) determine jointly input through the optimal path of the information after the PR signal encoding along PR channel grid chart.
A2 calculates the maximum likelihood output valve according to the maximum likelihood output probability of each channel output sequence value constantly in the said optimal path, and the maximum likelihood output valve is the information after the preparatory decoding.
Concrete, after the conversion through formula (7), per two the continuous forward state metric and the back of using when confirming optimal path in the grid chart go out the maximum likelihood output valve to state measurement and the branch metric calculation between them.The maximum likelihood output valve is:
Step S104 adopts algebraically soft-decision algorithm to deciphering through the information after deciphering in advance.
The coding of RS in the present embodiment (7,3) sign indicating number adopts the Frequency Domain Coding mode, supposes that the information of sending is a={010110110}, and it can be expressed as a={ α, α on GF (8)
3, α
3, and be c={ α through what obtain behind the Frequency Domain Coding, 0, α
6, 0, α
5, α
5, α
6, the information that will from the PR channel, receive is arranged as reliability matrix ∏:
Adopt the severe matrix algorithms in the algebraically soft-decision algorithm, the reliability matrix is converted into the severe matrix, when severe in the severe matrix is not 0 number of elements when being complexity s=18, the severe matrix M is:
As shown in table 1 according to severe matrix M initialization interpolation point and weight, x, y are the horizontal ordinate and the ordinate of interpolation point.
The substep of weight in table 1 interpolation arithmetic
x | y | Severe |
1 | α | 2 |
1 | α 4 | 2 |
α | 0 | 2 |
α 2 | α 6 | 2 |
α 3 | 0 | 2 |
α 3 | 1 | 1 |
α 4 | α 5 | 2 |
α 5 | α 4 | 1 |
α 5 | α 5 | 2 |
α 6 | α 6 | 2 |
Adopt the polynomial interpolation algorithm in the algebraically soft-decision algorithm, severe is not that interpolation is carried out in 0 place in the severe matrix M, obtains interpolation polynomial according to the horizontal ordinate x and the ordinate y of severe, as follows:
P(x,y)=α
6+α
2x+α
6x
2+x
3+α
4x
4+α
4x
5+x
6+α
2x
7+αy+αxy+x
2y+x
3y
+x
4y+x
5y+α
4y
2+xy
2+α
6x
2y
2+αx
3y
2+α
6y
3+α
6xy
3 (8)
Then, can obtain the correct factor through the factoring algorithm in the algebraically soft-decision algorithm is:
f(x)=α+α
4x+α
4x
2 (9)
On GF (8), with 1, a ..., a6 is respectively above the substitution in the formula (9),
f(1)=α+α
4+α
4=α,f(α)=α+α
5+α
6=0,
f(α
2)=α
6,f(α
3)=0,f(α
4)=α
5,f(α
5)=α
5,f(α
6)=α
6
The code word that obtains at last is c '={ α, 0, α
6, 0, α
5, α
5, α
6.According to posterior probability method, can obtain correct information and be { α, α
3, α
3, being translated into Bit data output is exactly { 010110110}.
Second embodiment of the invention, a kind of device of reading disk information, as shown in Figure 4, comprise following ingredient:
1) the RS coding module 10, when being used for the information on reading disk, the information that reads carried out the RS Frequency Domain Coding.Concrete, on the galois field in Abstract Algebra, calculating the polynomial each item coefficient of code word based on message polynomial, said each item coefficient is through the information behind the RS Frequency Domain Coding.
2) the PR coding module 20, are used for carrying out the PR chnnel coding through the information behind the RS Frequency Domain Coding.PR coding module 20 has been simulated the intersymbol interference that information is run into, the i.e. stack of intersymbol interference in transmission course.Because the process of PR chnnel coding is a technology well known in the art, so locate not detail.Preferably, PR coding module 20 also is used for carrying out passing through the AGWN Channel Processing again after the PR chnnel coding through the information behind the RS Frequency Domain Coding, purpose be more the white Gaussian noise in the real simulated Channel Transmission environment to the influence of signal.
3) preparatory decoding module 30 is used to adopt bcjr algorithm to deciphering in advance through the information after the PR signal encoding.Preparatory decoding module 30 specifically comprises:
Path determination module 31 is used for the grid chart that is abstracted into based on the PR channel, by bcjr algorithm determine input through the optimal path of the information after the PR signal encoding along PR channel grid chart;
Decoding output module 32 is used for calculating the maximum likelihood output valve according to the maximum likelihood output probability of each channel output sequence value constantly of said optimal path, and the maximum likelihood output valve is the information after the preparatory decoding.
4) the RS decoding module 40, are used to adopt algebraically soft-decision mode to deciphering the correct information that obtains through the information after deciphering in advance.RS decoding module 40 specifically comprises:
Reliability matrix acquisition module 41 is used for the information after deciphering in advance is arranged in the reliability matrix;
Matrix conversion module 42, being used for through the severe matrix algorithms is the severe matrix with the reliability matrix conversion;
Interpolation calculation module 43 is used for obtaining first polynomial expression according to the information via polynomial interpolation algorithm of severe matrix;
Factorization module 44 is used on the first polynomial basis, obtaining message polynomial through factoring algorithm;
Output module 45 is selected in RS decoding, is used for obtaining correct information after the codeword information process posterior probability method processing that calculates based on message polynomial.
The method of reading disk information according to the invention and device; Decoding module adopts the bcjr algorithm with soft information output to obtain the needed input information of RS decoding module in advance; Use algebraically soft-decision mode to carry out RS decoding, the RS Hard decision decoding that adopts than existing disk has more excellent performance error correcting capability, has reduced the bit error rate of data transmission; Thereby improve the storage density of disk, saved the expense of transforming existing disk.
Through the explanation of embodiment, should be to reach technological means and the effect that predetermined purpose takes to be able to more deeply and concrete understanding to the present invention, yet appended diagram only provide the usefulness of reference and explanation, is not to be used for the present invention is limited.
Claims (10)
1. the method for a reading disk information is characterized in that, comprising:
When step 1, the information on reading disk, the information that reads is carried out the RS Frequency Domain Coding;
Step 2, to carrying out the PR chnnel coding through the information behind the RS Frequency Domain Coding;
Step 3, employing bcjr algorithm are to decipher through the information after the PR signal encoding in advance;
Step 4, employing algebraically soft-decision algorithm are to deciphering the correct information that obtains through the information after deciphering in advance.
2. the method for reading disk information according to claim 1 is characterized in that, said step 1 specifically comprises:
On the galois field in Abstract Algebra, calculate the polynomial each item coefficient of code word based on message polynomial, said each item coefficient is through the information behind the RS Frequency Domain Coding.
3. the method for reading disk information according to claim 1 is characterized in that, said step 2 also comprises: to carrying out passing through additive white Gaussian noise AGWN Channel Processing again after the PR chnnel coding through the information behind the RS Frequency Domain Coding.
4. the method for reading disk information according to claim 1 is characterized in that, said step 3 specifically comprises:
The grid chart that is abstracted into based on the PR channel, by bcjr algorithm determine input through the optimal path of the information after the PR signal encoding along PR channel grid chart;
Maximum likelihood output probability according to each channel output sequence value constantly in the said optimal path calculates the maximum likelihood output valve, and the maximum likelihood output valve is the information after the preparatory decoding.
5. according to the method for each described reading disk information among the claim 1-4, it is characterized in that said step 4 specifically comprises:
Information after deciphering in advance is arranged in the reliability matrix;
Is the severe matrix through the severe matrix algorithms with the reliability matrix conversion;
Information via polynomial interpolation algorithm according to the severe matrix obtains first polynomial expression;
On the first polynomial basis, obtain message polynomial through factoring algorithm;
Obtain correct information after will handling through posterior probability method based on the codeword information that message polynomial calculates.
6. the device of a reading disk information is characterized in that, comprising:
The RS coding module when being used for the information on reading disk, carries out the RS Frequency Domain Coding to the information that reads;
The PR coding module is used for carrying out the PR chnnel coding through the information behind the RS Frequency Domain Coding;
Decoding module is used to adopt bcjr algorithm to deciphering in advance through the information after the PR signal encoding in advance;
The RS decoding module is used to adopt algebraically soft-decision algorithm to deciphering the correct information that obtains through the information after deciphering in advance.
7. the device of reading disk information according to claim 6 is characterized in that, said RS coding module specifically is used for:
On the galois field in Abstract Algebra, calculate the polynomial each item coefficient of code word based on message polynomial, said each item coefficient is through the information behind the RS Frequency Domain Coding.
8. the device of reading disk information according to claim 6 is characterized in that, said PR coding module also is used for: to carrying out passing through the AGWN Channel Processing again after the PR chnnel coding through the information behind the RS Frequency Domain Coding.
9. the device of reading disk information according to claim 6 is characterized in that, said preparatory decoding module specifically comprises:
The path determination module is used for the grid chart that is abstracted into based on the PR channel, by bcjr algorithm determine input through the optimal path of the information after the PR signal encoding along PR channel grid chart;
The decoding output module is used for calculating the maximum likelihood output valve according to the maximum likelihood output probability of each channel output sequence value constantly of said optimal path, and the maximum likelihood output valve is the information after the preparatory decoding.
10. according to the device of each described reading disk information among the claim 6-9, it is characterized in that said RS decoding module specifically comprises:
Reliability matrix acquisition module is used for the information after deciphering in advance is arranged in the reliability matrix;
The matrix conversion module, being used for through the severe matrix algorithms is the severe matrix with the reliability matrix conversion;
The interpolation calculation module is used for obtaining first polynomial expression according to the information via polynomial interpolation algorithm of severe matrix;
The factorization module is used on the first polynomial basis, obtaining message polynomial through factoring algorithm;
Output module is selected in RS decoding, is used for obtaining correct information after the codeword information process posterior probability method processing that calculates based on message polynomial.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2011103585259A CN102436834A (en) | 2011-11-14 | 2011-11-14 | Method and device for reading disk information |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2011103585259A CN102436834A (en) | 2011-11-14 | 2011-11-14 | Method and device for reading disk information |
Publications (1)
Publication Number | Publication Date |
---|---|
CN102436834A true CN102436834A (en) | 2012-05-02 |
Family
ID=45984849
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN2011103585259A Pending CN102436834A (en) | 2011-11-14 | 2011-11-14 | Method and device for reading disk information |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN102436834A (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105811999A (en) * | 2016-02-29 | 2016-07-27 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Improved Koetter-Vardy (KV) algorithm based matrix type two-dimension code Reed-Solomon(RS) decoding error correction method |
CN113610216A (en) * | 2021-07-13 | 2021-11-05 | 上海交通大学 | Multi-task neural network based on polarity conversion soft information assistance and multi-track detection method |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1201325C (en) * | 2000-03-23 | 2005-05-11 | 索尼公司 | Data reproducing method and appts., and method and/or appts. for reproducing data |
US7564933B2 (en) * | 2004-11-30 | 2009-07-21 | The Regents Of The University Of California | Method and system for near optimal iterative detection of the 2-dimensional ISI channel |
CN100517980C (en) * | 2005-02-07 | 2009-07-22 | 索尼株式会社 | Decoding apparatus and method |
-
2011
- 2011-11-14 CN CN2011103585259A patent/CN102436834A/en active Pending
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1201325C (en) * | 2000-03-23 | 2005-05-11 | 索尼公司 | Data reproducing method and appts., and method and/or appts. for reproducing data |
US7564933B2 (en) * | 2004-11-30 | 2009-07-21 | The Regents Of The University Of California | Method and system for near optimal iterative detection of the 2-dimensional ISI channel |
CN100517980C (en) * | 2005-02-07 | 2009-07-22 | 索尼株式会社 | Decoding apparatus and method |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105811999A (en) * | 2016-02-29 | 2016-07-27 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Improved Koetter-Vardy (KV) algorithm based matrix type two-dimension code Reed-Solomon(RS) decoding error correction method |
CN113610216A (en) * | 2021-07-13 | 2021-11-05 | 上海交通大学 | Multi-task neural network based on polarity conversion soft information assistance and multi-track detection method |
CN113610216B (en) * | 2021-07-13 | 2022-04-01 | 上海交通大学 | Multi-task neural network based on polarity conversion soft information assistance and multi-track detection method |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10547332B2 (en) | Device, system and method of implementing product error correction codes for fast encoding and decoding | |
US9015547B2 (en) | Multi-level LDPC layered decoder with out-of-order processing | |
US8819515B2 (en) | Mixed domain FFT-based non-binary LDPC decoder | |
US9015550B2 (en) | Low density parity check layer decoder for codes with overlapped circulants | |
US8656249B2 (en) | Multi-level LDPC layer decoder | |
US8996969B2 (en) | Low density parity check decoder with miscorrection handling | |
CN101047388B (en) | Error correction apparatus | |
US9130590B2 (en) | Non-binary layered low density parity check decoder | |
US8756478B2 (en) | Multi-level LDPC layer decoder | |
US20070061689A1 (en) | Method of detecting and correcting a prescribed set of error events based on error detecting code | |
EP1931034A2 (en) | Error correction method and apparatus for predetermined error patterns | |
EP1689085A2 (en) | Error correction with iterations of belief propagation decoding and algebraic decoding | |
US20130139022A1 (en) | Variable Sector Size LDPC Decoder | |
US20140082449A1 (en) | LDPC Decoder With Variable Node Hardening | |
US9048867B2 (en) | Shift register-based layered low density parity check decoder | |
US20140173385A1 (en) | Low Density Parity Check Decoder With Dynamic Scaling | |
Garcia-Herrero et al. | High-speed RS (255, 239) decoder based on LCC decoding | |
CN106656208A (en) | Concatenated code method of symbol-level hard decision iteration decoding correcting synchronization errors | |
CN105634506A (en) | Soft decision decoding method of quadratic residue (QR) code based on shifting search algorithm | |
CN104639282A (en) | RS (reed Solomon) decoding method and device thereof in communication system | |
CN101060341B (en) | Post-viterbi error correction method and apparatus for the same | |
US20070198896A1 (en) | Decoding with a concatenated error correcting code | |
CN102436834A (en) | Method and device for reading disk information | |
US8719686B2 (en) | Probability-based multi-level LDPC decoder | |
CN100395974C (en) | Method of decoding a data word |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20120502 |