Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN...
Transcript of Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN...
![Page 1: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/1.jpg)
EFFICIENT LOGIC SHARING INPARALLEL CHIEN SEARCH USINGPARALLEL CHIEN SEARCH USINGALGORITHMIC APPROACH
Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju ParkMultimedia Systems Lab,Dept. of Computer Science & Engineeringp p g gHanyang University, South Korea
![Page 2: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/2.jpg)
BCH Codes
CONTENTS
BCH Decoder Chien searchConventional/parallel Chien SearchProposed AlgorithmSimulation ResultsImplementationConclusionConclusion
2
![Page 3: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/3.jpg)
Widely used in communication systems and digital
BCH CODES
y y gtechnology
Long Haul Optical CommunicationDi it l Vid B d tiDigital Video BroadcastingNAND Flash
N bit N bit K bitK bit N-bit N-bit K-bitK-bit
3
![Page 4: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/4.jpg)
A (n,k) binary BCH code decodes a n-bit codeword
BCH DECODER
( , ) yblock into a k-bit codeword.g(x) is the degree n-k generator polynomial.Block Diagram of Decoder
ELP Rootscodeword
ELP Error Location Polynomial
4
![Page 5: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/5.jpg)
CHIEN SEARCH
The Chien search block exhaustively examines whether i i t f Λ( ) f i 0 1 1αi is a root of Λ(x) for i = 0,1,…,n-1
=Error Locator Polynomial
Conventional generation gNeeds n cycles 5
![Page 6: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/6.jpg)
CHIEN SEARCH (CONT…)
p-parallel Chien Searchp p
Cycles searching for error locations is reduced from n to n/pCycles searching for error locations is reduced from n to n/p 6
![Page 7: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/7.jpg)
LOGIC SHARING IN CHIEN SEARCH
BCH (63, 30, 6) code, which can correct 6 errors. Its generator l i l ipolynomial is
g(x) = x6 + x + 1
Consider a constant FFM where the fixed multiplicands is α42 =α6*7Consider a constant FFM where the fixed multiplicands is α42 =α6 7.
Logic Repetition
b1 ^ b2 3 times
b1 ^ b5 4 times
b2 ^ b5 3 times
7
![Page 8: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/8.jpg)
Step 1:
PROPOSED ALGORITHM
Transform the output equations in matrix, named equation matrix
8
![Page 9: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/9.jpg)
Step 2: Compute similarity matrix
PROPOSED ALGORITHM(CONTD.)
Compute similarity matrix, take each row and check degree of similarity between other rows
Example:First row is taken and i il it b t fi tsimilarity between first row
and second row is b[1] ^ b[5] similarly check
i il it b t fi tsimilarity between first and other rows
9
![Page 10: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/10.jpg)
Step 3:
PROPOSED ALGORITHM(CONTD.)
Delete similar rows and rows containing less than 2 number of 1’sSort the similarity matrix in ascending order based upon number of in each prow.
10
![Page 11: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/11.jpg)
Step 4:
PROPOSED ALGORITHM(CONTD.)
Check for covered rows and covering rows and write covering rows in gterms of covered rows.
p5 = p0 ^ b[2]p7 = p6 ^ b[5]
11
![Page 12: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/12.jpg)
Step 5:
PROPOSED ALGORITHM(CONTD.)
Repeat step 4 for output equations.
O[0] = b[3] ^ p5O[1] = p7O[2] = p5O[3] = b[2]^p3O[4] = b[3]^b[5]^p7O[5] = b[2]^p7
12
![Page 13: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/13.jpg)
Step 6: PROPOSED ALGORITHM(CONTD.)
b[0] b[1] b[2] b[3] b[4] b[5]
Check for shortest path in output equations.
O[4] = b[3] ^ b[5] ^ p7 Now compute sum for each path.
Path 1,
sum 4 5 3 3 2 3
O[4] = b[3] ^ p6
Criteria:
Path 1,
O[4] = b[3]^b[5]^p7 = b[3]^b[5]^b[0]^b[1]^b[4]^b[5]
First compute column wise sum of similarity matrix.
Now select that path which has
Sum = 3+3+4+5+2+3=20Similarly
Now select that path which has minimum sum. Path 2,
Sum = 1413
![Page 14: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/14.jpg)
The BCH (2047, 1926, 11)used for testing of algorithm
IMPLEMENTATION
used for testing of algorithm
Algorithm is implemented in MATLAB.
Coded in Verilog
ModelSim is used for Simulation
Xilinx ISE is used for Synthesis
14
![Page 15: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/15.jpg)
RESULTSCHIEN SEARCH complexity of BCH (2047, 1926, 11) code
with 2 FFMs Resource Sharingwith 2 FFMs Resource Sharing
15
![Page 16: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/16.jpg)
An algorithmic approach for logic sharing between
CONCLUSION
g pp g gthe multipliers of Chien Search is presented.Optimizations in terms of both area and frequency
hi dare achieved.
16
![Page 17: Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju Park ... · PDF fileEFFICIENT LOGIC SHARING IN PARALLEL CHIEN SEARCH USING ALGORITHMIC APPROACH Umair Ishaq, Jungsub Oh, Woojin Yang, Sungju](https://reader034.fdocuments.us/reader034/viewer/2022051523/5a78ca207f8b9a273b8eee11/html5/thumbnails/17.jpg)
THANKS
17