Error-Trapping Decoding For Cyclic Codes Over Symbol-Pair Read Channels
Error-Trapping Decoding For Cyclic Codes Over Symbol-Pair Read Channels
Error-Trapping Decoding For Cyclic Codes Over Symbol-Pair Read Channels
November 2, 2016
ISITA2016@Monterey
Outline 1
• Introduction
• Symbol-pair read channel
• Error-trapping decoding over the Hamming metric channel
• Error-trapping decoding over symbol-pair read channel
• We show the conditions that pair errors are trapped
• The decoder is constructed by simple logic circuit
• Conclusion
Background 2
• High-density data storages are required
• Distance of symbols is close in storage application
• On each reading operation, two consecutive symbols are read
Outputs
1 0 0 1 0 1 (1,0), (0,0), (0,1), …
𝑢𝑟,2 ≠ 𝑢𝑙,2
conflict positon is 2
Pair error 5
• 𝑡-pair error
• 𝑡 is the number of elements in 𝑖: 𝑢𝑙,𝑖 , 𝑢𝑟,𝑖+1 ≠ 𝑥𝑖 , 𝑥𝑖+1
• Note that 𝑎, 𝑏 = 𝑐, 𝑑 if both 𝑎 = 𝑐 and 𝑏 = 𝑑
Example:
Reading 𝒙 = 1,0,1,0
pair vector 𝜋 𝒙 = 1,0 , 0,1 , 1,1 , 1,1
𝐷𝑝 𝒖, ി
𝒗 = 𝑖: 𝑢𝑙,𝑖 , 𝑢𝑟,𝑖+1 ≠ 𝑣𝑙,𝑖 , 𝑣𝑟,𝑖+1
• Pair weight of 𝒖 ∈ 0,1 𝑛
𝑑𝑝 = min 𝐷𝑝 𝜋 𝒙 , 𝜋 𝒚
𝒙,𝒚∈𝐶,𝒙≠𝒚
• Pair error correcting capability of a code 𝐶 ⊂ 0,1 𝑛
𝑑𝑝 − 1
𝑡𝑝 =
2
Syndrome decoding of symbol-pair codes 7
• We define two kinds of syndromes of symbol-pair codes[5]
• Symbol-pair syndrome ി
𝑠(𝑥) = 𝑠𝐿 𝑥 , 𝑠𝑅 𝑥
𝑠𝐿 𝑥 ≜ 𝑢𝐿 mod 𝑔 𝑥
𝑠𝑅 𝑥 ≜ 𝑢𝑅 mod 𝑔 𝑥
• Neighbor-symbol syndrome 𝑆(𝑥) represents conflict positions
𝑆 𝑥 = 𝑢𝐿 𝑥 + 𝑥𝑢𝑅 𝑥 mod 𝑥 𝑛 − 1
• These syndromes are unique for each pair error pattern
with 𝑡𝑝 or fewer errors
𝑛 − 𝑘 consecutive positions
𝑡 or fewer errors
𝑛 − 𝑘 low-order positions
Step 2. 𝑠 𝑥 ≤ 𝑡𝑝 ?
Condition 1. ി
𝑠 𝑥 equals low-order positions of 𝑆 𝑥 ?
Condition 2. conflict positions of ി
Conflict position of ി
𝑠 𝑥
or
low-order positions of 𝑆 𝑥
If ി
𝑠 𝑥 satisfies both of Condition 1 and 2, go to Step 5.
Otherwise, 𝑗 ≔ 0 and go to Step 3.
Received polynomial 𝑢
ി𝑥
𝑥 𝑛−𝑗 𝑠ി 𝑗 𝑥
𝜋 𝑐Ƹ 𝑥
Output: 𝑐Ƹ 𝑥
Proposed error-trapping decoder 16
Input
Output
𝑢𝐿 𝑥 Neighbor-symbol syndrome
𝑢𝑅 𝑥 calculation circuit
Neighbor-symbol syndrome
Symbol-pair syndrome
calculation circuit
・・・
Threshold gate 1 Threshold gate 2
Neighbor-symbol syndrome
Symbol-pair syndrome
calculation circuit
・・・
Threshold gate 1 Threshold gate 2
Neighbor-symbol syndrome
Symbol-pair syndrome
calculation circuit
・・・
Threshold gate 1 Threshold gate 2
Syndrome register
𝑢𝑅 𝑥
Neighbor-symbol syndrome
Symbol-pair syndrome
calculation circuit
・・・
Threshold gate 1 Threshold gate 2
𝑢𝐿 𝑥
Neighbor-symbol syndrome
⋯ ⋯ ⋯
Syndrome register
𝑢𝑅 𝑥
⋯ ⋯
Correctable
Uncorrectable
• (7,4) cyclic Hamming code can correct all pair error pattern
with 2 or fewer pair errors
Correctable
Improved error-trapping decoder 26
Input
Output
𝑢𝐿 𝑥 Neighbor-symbol syndrome
𝑢𝑅 𝑥 calculation circuit
Neighbor-symbol syndrome
Symbol-pair syndrome
calculation circuit
・・・
Threshold gate 1 Threshold gate 2
Additional circuit
Conclusion 27
We proposed new error-trapping decoding for cyclic codes
over symbol-pair read channel
• Show conditions that pair errors are trapped
• It corrects any pair error patterns with 𝑡𝑝 or fewer pair errors that confined to
𝑛 − 𝑘 consecutive pairs
• Proposed decoding algorithm and designed decoding circuit
Received polynomial 𝑢
ി𝑥 𝑡𝑝 or fewer pair errors
Symbol-pair syndrome ി
𝑠 𝑥 𝑡𝑝 or fewer pair errors
Conflict positions of ി
𝑠 𝑥 Conflict positions
Syndrome register
𝑢𝑅 𝑥
𝑢𝐿 𝑥
Neighbor-symbol syndrome
⋯ ⋯ ⋯
Syndrome register
𝑢𝑅 𝑥
⋯ ⋯