1 /*
2 * Copyright (C) 2023 Rockchip Electronics Co., Ltd.
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17 #include <stdbool.h>
18 #include "defineHeader.h"
19 UINT gTable_Crc32[256] = {
20 0x00000000, 0x04c10db7, 0x09821b6e, 0x0d4316d9,
21 0x130436dc, 0x17c53b6b, 0x1a862db2, 0x1e472005,
22 0x26086db8, 0x22c9600f, 0x2f8a76d6, 0x2b4b7b61,
23 0x350c5b64, 0x31cd56d3, 0x3c8e400a, 0x384f4dbd,
24 0x4c10db70, 0x48d1d6c7, 0x4592c01e, 0x4153cda9,
25 0x5f14edac, 0x5bd5e01b, 0x5696f6c2, 0x5257fb75,
26 0x6a18b6c8, 0x6ed9bb7f, 0x639aada6, 0x675ba011,
27 0x791c8014, 0x7ddd8da3, 0x709e9b7a, 0x745f96cd,
28 0x9821b6e0, 0x9ce0bb57, 0x91a3ad8e, 0x9562a039,
29 0x8b25803c, 0x8fe48d8b, 0x82a79b52, 0x866696e5,
30 0xbe29db58, 0xbae8d6ef, 0xb7abc036, 0xb36acd81,
31 0xad2ded84, 0xa9ece033, 0xa4aff6ea, 0xa06efb5d,
32 0xd4316d90, 0xd0f06027, 0xddb376fe, 0xd9727b49,
33 0xc7355b4c, 0xc3f456fb, 0xceb74022, 0xca764d95,
34 0xf2390028, 0xf6f80d9f, 0xfbbb1b46, 0xff7a16f1,
35 0xe13d36f4, 0xe5fc3b43, 0xe8bf2d9a, 0xec7e202d,
36 0x34826077, 0x30436dc0, 0x3d007b19, 0x39c176ae,
37 0x278656ab, 0x23475b1c, 0x2e044dc5, 0x2ac54072,
38 0x128a0dcf, 0x164b0078, 0x1b0816a1, 0x1fc91b16,
39 0x018e3b13, 0x054f36a4, 0x080c207d, 0x0ccd2dca,
40 0x7892bb07, 0x7c53b6b0, 0x7110a069, 0x75d1adde,
41 0x6b968ddb, 0x6f57806c, 0x621496b5, 0x66d59b02,
42 0x5e9ad6bf, 0x5a5bdb08, 0x5718cdd1, 0x53d9c066,
43 0x4d9ee063, 0x495fedd4, 0x441cfb0d, 0x40ddf6ba,
44 0xaca3d697, 0xa862db20, 0xa521cdf9, 0xa1e0c04e,
45 0xbfa7e04b, 0xbb66edfc, 0xb625fb25, 0xb2e4f692,
46 0x8aabbb2f, 0x8e6ab698, 0x8329a041, 0x87e8adf6,
47 0x99af8df3, 0x9d6e8044, 0x902d969d, 0x94ec9b2a,
48 0xe0b30de7, 0xe4720050, 0xe9311689, 0xedf01b3e,
49 0xf3b73b3b, 0xf776368c, 0xfa352055, 0xfef42de2,
50 0xc6bb605f, 0xc27a6de8, 0xcf397b31, 0xcbf87686,
51 0xd5bf5683, 0xd17e5b34, 0xdc3d4ded, 0xd8fc405a,
52 0x6904c0ee, 0x6dc5cd59, 0x6086db80, 0x6447d637,
53 0x7a00f632, 0x7ec1fb85, 0x7382ed5c, 0x7743e0eb,
54 0x4f0cad56, 0x4bcda0e1, 0x468eb638, 0x424fbb8f,
55 0x5c089b8a, 0x58c9963d, 0x558a80e4, 0x514b8d53,
56 0x25141b9e, 0x21d51629, 0x2c9600f0, 0x28570d47,
57 0x36102d42, 0x32d120f5, 0x3f92362c, 0x3b533b9b,
58 0x031c7626, 0x07dd7b91, 0x0a9e6d48, 0x0e5f60ff,
59 0x101840fa, 0x14d94d4d, 0x199a5b94, 0x1d5b5623,
60 0xf125760e, 0xf5e47bb9, 0xf8a76d60, 0xfc6660d7,
61 0xe22140d2, 0xe6e04d65, 0xeba35bbc, 0xef62560b,
62 0xd72d1bb6, 0xd3ec1601, 0xdeaf00d8, 0xda6e0d6f,
63 0xc4292d6a, 0xc0e820dd, 0xcdab3604, 0xc96a3bb3,
64 0xbd35ad7e, 0xb9f4a0c9, 0xb4b7b610, 0xb076bba7,
65 0xae319ba2, 0xaaf09615, 0xa7b380cc, 0xa3728d7b,
66 0x9b3dc0c6, 0x9ffccd71, 0x92bfdba8, 0x967ed61f,
67 0x8839f61a, 0x8cf8fbad, 0x81bbed74, 0x857ae0c3,
68 0x5d86a099, 0x5947ad2e, 0x5404bbf7, 0x50c5b640,
69 0x4e829645, 0x4a439bf2, 0x47008d2b, 0x43c1809c,
70 0x7b8ecd21, 0x7f4fc096, 0x720cd64f, 0x76cddbf8,
71 0x688afbfd, 0x6c4bf64a, 0x6108e093, 0x65c9ed24,
72 0x11967be9, 0x1557765e, 0x18146087, 0x1cd56d30,
73 0x02924d35, 0x06534082, 0x0b10565b, 0x0fd15bec,
74 0x379e1651, 0x335f1be6, 0x3e1c0d3f, 0x3add0088,
75 0x249a208d, 0x205b2d3a, 0x2d183be3, 0x29d93654,
76 0xc5a71679, 0xc1661bce, 0xcc250d17, 0xc8e400a0,
77 0xd6a320a5, 0xd2622d12, 0xdf213bcb, 0xdbe0367c,
78 0xe3af7bc1, 0xe76e7676, 0xea2d60af, 0xeeec6d18,
79 0xf0ab4d1d, 0xf46a40aa, 0xf9295673, 0xfde85bc4,
80 0x89b7cd09, 0x8d76c0be, 0x8035d667, 0x84f4dbd0,
81 0x9ab3fbd5, 0x9e72f662, 0x9331e0bb, 0x97f0ed0c,
82 0xafbfa0b1, 0xab7ead06, 0xa63dbbdf, 0xa2fcb668,
83 0xbcbb966d, 0xb87a9bda, 0xb5398d03, 0xb1f880b4,
84 };
85 #define rr_max 104 /* Number of parity checks, rr = deg[g(x)] */
86 #define parallel 8 //bit count
87 #define mm 13//limit count
88 #define nn 8191//code size
89 #define kk 4120//info length
90 #define tt 8//correct count
91
92 #define tt2 2*tt
93 UINT s[tt2 + 1]; // Syndrome values
94
95 UINT rr;//redundant length // BCH code parameters
96
97
98 UINT p[mm + 1];
99 UINT alpha_to[nn + 1], index_of[nn + 1] ; // Galois field
100 UINT gg[rr_max + 1] ; // Generator polynomial
101
102 UINT ggx1 = 0;
103 UINT ggx2 = 0;
104 UINT ggx3 = 0;
105 UINT ggx4 = 0;
106 // get crc32 value
CRC_32(unsigned char * pData,UINT ulSize,UINT uiPreviousValue)107 UINT CRC_32(unsigned char *pData, UINT ulSize, UINT uiPreviousValue)
108 {
109 UINT i;
110 UINT nAccum = uiPreviousValue;
111
112 for ( i = 0; i < ulSize; i++)
113 nAccum = (nAccum << 8)^gTable_Crc32[(nAccum >> 24) ^ (*pData++)];
114 return nAccum;
115 }
116 #define CRC16_CCITT 0x1021 //CRC operator
CRCBuildTable16(unsigned short aPoly,unsigned short * crcTable)117 void CRCBuildTable16(unsigned short aPoly, unsigned short *crcTable)
118 {
119 unsigned short i, j;
120 unsigned short nData;
121 unsigned short nAccum;
122
123 for (i = 0; i < 256; i++) {
124 nData = (unsigned short)(i << 8);
125 nAccum = 0;
126 for (j = 0; j < 8; j++) {
127 if ((nData ^ nAccum) & 0x8000)
128 nAccum = (nAccum << 1) ^ aPoly;
129 else
130 nAccum <<= 1;
131 nData <<= 1;
132 }
133 crcTable[i] = nAccum;
134 }
135 }
136
CRC_16(unsigned char * aData,UINT aSize)137 unsigned short CRC_16(unsigned char* aData, UINT aSize)
138 {
139 UINT i;
140 unsigned short nAccum = 0;
141 unsigned short crcTable[256];
142
143 CRCBuildTable16(CRC16_CCITT, crcTable);
144 for (i = 0; i < aSize; i++)
145 nAccum = (nAccum << 8) ^ crcTable[(nAccum >> 8) ^ *aData++];
146
147 return nAccum;
148 }
149
P_RC4(unsigned char * buf,unsigned short len)150 void P_RC4(unsigned char* buf, unsigned short len)
151 {
152 unsigned char S[256], K[256], temp;
153 unsigned short i, j, t, x;
154 unsigned char key[16] = {124, 78, 3, 4, 85, 5, 9, 7, 45, 44, 123, 56, 23, 13, 23, 17};
155
156 j = 0;
157 for (i = 0; i < 256; i++) {
158 S[i] = (unsigned char)i;
159 j &= 0x0f;
160 K[i] = key[j];
161 j++;
162 }
163
164 j = 0;
165 for (i = 0; i < 256; i++) {
166 j = (j + S[i] + K[i]) % 256;
167 temp = S[i];
168 S[i] = S[j];
169 S[j] = temp;
170 }
171
172 i = j = 0;
173 for (x = 0; x < len; x++) {
174 i = (i + 1) % 256;
175 j = (j + S[i]) % 256;
176 temp = S[i];
177 S[i] = S[j];
178 S[j] = temp;
179 t = (S[i] + (S[j] % 256)) % 256;
180 buf[x] = buf[x] ^ S[t];
181 }
182 }
183
bch_encode(unsigned char * encode_in,unsigned char * encode_out)184 void bch_encode(unsigned char* encode_in, unsigned char* encode_out)
185 {
186 UINT i, j;
187 bool feed_back;
188 UINT bch1 = 0;
189 UINT bch2 = 0;
190 UINT bch3 = 0;
191 UINT bch4 = 0;
192
193 for (i = 0; i < 515; i++) {
194 for (j = 0; j < 8; j++) {
195 feed_back = (bch1 & 1) ^ ((encode_in[i] >> j) & 1);
196
197 bch1 = ((bch1 >> 1) | ((bch2 & 1) * 0x80000000)) ^ (ggx1 * feed_back);
198 bch2 = ((bch2 >> 1) | ((bch3 & 1) * 0x80000000)) ^ (ggx2 * feed_back);
199 bch3 = ((bch3 >> 1) | ((bch4 & 1) * 0x80000000)) ^ (ggx3 * feed_back);
200 bch4 = (((bch4 >> 1) ^ (ggx4 * feed_back))) | (feed_back * 0x80);
201 }
202 }
203
204 //********Handle FF***********************
205 bch1 = ~(bch1 ^ 0xad6273b1);
206 bch2 = ~(bch2 ^ 0x348393d2);
207 bch3 = ~(bch3 ^ 0xe6ebed3c);
208 bch4 = ~(bch4 ^ 0xc8);
209 //*********************************************
210
211 for (i = 0; i < 515; i++)
212 encode_out[i] = encode_in[i];
213 encode_out[515] = bch1 & 0x000000ff;
214 encode_out[516] = (bch1 & 0x0000ff00) >> 8;
215 encode_out[517] = (bch1 & 0x00ff0000) >> 16;
216 encode_out[518] = (bch1 & 0xff000000) >> 24;
217 encode_out[519] = bch2 & 0x000000ff;
218 encode_out[520] = (bch2 & 0x0000ff00) >> 8;
219 encode_out[521] = (bch2 & 0x00ff0000) >> 16;
220 encode_out[522] = (bch2 & 0xff000000) >> 24;
221 encode_out[523] = bch3 & 0x000000ff;
222 encode_out[524] = (bch3 & 0x0000ff00) >> 8;
223 encode_out[525] = (bch3 & 0x00ff0000) >> 16;
224 encode_out[526] = (bch3 & 0xff000000) >> 24;
225 encode_out[527] = bch4 & 0x000000ff;
226 }
227
228 #define poly16_CCITT 0x1021 /* crc-ccitt mask */
229
CRC_Calculate(unsigned short crc,unsigned char ch)230 unsigned short CRC_Calculate(unsigned short crc, unsigned char ch)
231 {
232 UINT i;
233 for (i = 0x80; i != 0; i >>= 1) {
234 if ((crc & 0x8000) != 0) {
235 crc <<= 1;
236 crc ^= poly16_CCITT;
237 } else
238 crc <<= 1;
239
240 if ((ch & i) != 0)
241 crc ^= poly16_CCITT;
242 }
243 return crc;
244 }
CRC_CCITT(unsigned char * p,UINT CalculateNumber)245 unsigned short CRC_CCITT(unsigned char* p, UINT CalculateNumber)
246 {
247 unsigned short crc = 0xffff;
248 while (CalculateNumber--) {
249 crc = CRC_Calculate(crc, *p);
250 p++;
251 }
252 return crc;
253 }
254
gen_poly()255 void gen_poly()
256 {
257 UINT gen_roots[nn + 1], gen_roots_true[nn + 1] ; // Roots of generator polynomial
258 UINT i, j, Temp ;
259
260 // Initialization of gen_roots
261 for (i = 0; i <= nn; i++) {
262 gen_roots_true[i] = 0;
263 gen_roots[i] = 0;
264 }
265
266 // Cyclotomic cosets of gen_roots
267 for (i = 1; i <= 2 * tt ; i++) {
268 for (j = 0; j < mm; j++) {
269 Temp = ((1 << j) * i) % nn;
270 gen_roots_true[Temp] = 1;
271 }
272 }
273 rr = 0; // Count thenumber of parity check bits
274 for (i = 0; i < nn; i++) {
275 if (gen_roots_true[i] == 1) {
276 rr++;
277 gen_roots[rr] = i;
278 }
279 }
280 // Compute generator polynomial based on its roots
281 gg[0] = 2 ; // g(x) = (X + alpha) initially
282 gg[1] = 1 ;
283 for (i = 2; i <= rr; i++) {
284 gg[i] = 1 ;
285 for (j = i - 1; j > 0; j--)
286 if (gg[j] != 0)
287 gg[j] = gg[j - 1] ^ alpha_to[(index_of[gg[j]] + index_of[alpha_to[gen_roots[i]]]) % nn] ;
288 else
289 gg[j] = gg[j - 1] ;
290 gg[0] = alpha_to[(index_of[gg[0]] + index_of[alpha_to[gen_roots[i]]]) % nn] ;
291 }
292
293 ggx1 = gg[103] | (gg[102] << 1) | (gg[101] << 2) | (gg[100] << 3) | (gg[99] << 4) | (gg[98] << 5) | (gg[97] << 6) | (gg[96] << 7)
294 | (gg[95] << 8) | (gg[94] << 9) | (gg[93] << 10) | (gg[92] << 11) | (gg[91] << 12) | (gg[90] << 13) | (gg[89] << 14) | (gg[88] << 15)
295 | (gg[87] << 16) | (gg[86] << 17) | (gg[85] << 18) | (gg[84] << 19) | (gg[83] << 20) | (gg[82] << 21) | (gg[81] << 22) | (gg[80] << 23)
296 | (gg[79] << 24) | (gg[78] << 25) | (gg[77] << 26) | (gg[76] << 27) | (gg[75] << 28) | (gg[74] << 29) | (gg[73] << 30) | (gg[72] << 31);
297 ggx2 = gg[71] | (gg[70] << 1) | (gg[69] << 2) | (gg[68] << 3) | (gg[67] << 4) | (gg[66] << 5) | (gg[65] << 6) | (gg[64] << 7)
298 | (gg[63] << 8) | (gg[62] << 9) | (gg[61] << 10) | (gg[60] << 11) | (gg[59] << 12) | (gg[58] << 13) | (gg[57] << 14) | (gg[56] << 15)
299 | (gg[55] << 16) | (gg[54] << 17) | (gg[53] << 18) | (gg[52] << 19) | (gg[51] << 20) | (gg[50] << 21) | (gg[49] << 22) | (gg[48] << 23)
300 | (gg[47] << 24) | (gg[46] << 25) | (gg[45] << 26) | (gg[44] << 27) | (gg[43] << 28) | (gg[42] << 29) | (gg[41] << 30) | (gg[40] << 31);
301 ggx3 = gg[39] | (gg[38] << 1) | (gg[37] << 2) | (gg[36] << 3) | (gg[35] << 4) | (gg[34] << 5) | (gg[33] << 6) | (gg[32] << 7)
302 | (gg[31] << 8) | (gg[30] << 9) | (gg[29] << 10) | (gg[28] << 11) | (gg[27] << 12) | (gg[26] << 13) | (gg[25] << 14) | (gg[24] << 15)
303 | (gg[23] << 16) | (gg[22] << 17) | (gg[21] << 18) | (gg[20] << 19) | (gg[19] << 20) | (gg[18] << 21) | (gg[17] << 22) | (gg[16] << 23)
304 | (gg[15] << 24) | (gg[14] << 25) | (gg[13] << 26) | (gg[12] << 27) | (gg[11] << 28) | (gg[10] << 29) | (gg[9] << 30) | (gg[8] << 31);
305 ggx4 = gg[7] | (gg[6] << 1) | (gg[5] << 2) | (gg[4] << 3) | (gg[3] << 4) | (gg[2] << 5) | (gg[1] << 6);
306
307 }
308
generate_gf()309 void generate_gf()
310 {
311 UINT i;
312 UINT mask ; // Register states
313
314 // Primitive polynomials
315 for (i = 1; i < mm; i++)
316 p[i] = 0;
317 p[0] = p[mm] = 1;
318 if (mm == 2) p[1] = 1;
319 else if (mm == 3) p[1] = 1;
320 else if (mm == 4) p[1] = 1;
321 else if (mm == 5) p[2] = 1;
322 else if (mm == 6) p[1] = 1;
323 else if (mm == 7) p[1] = 1;
324 else if (mm == 8) p[4] = p[5] = p[6] = 1;
325 else if (mm == 9) p[4] = 1;
326 else if (mm == 10) p[3] = 1;
327 else if (mm == 11) p[2] = 1;
328 else if (mm == 12) p[3] = p[4] = p[7] = 1;
329 else if (mm == 13) p[1] = p[2] = p[3] = p[5] = p[7] = p[8] = p[10] = 1; // 25AF
330 else if (mm == 14) p[2] = p[4] = p[6] = p[7] = p[8] = 1; // 41D5
331 else if (mm == 15) p[1] = 1;
332 else if (mm == 16) p[2] = p[3] = p[5] = 1;
333 else if (mm == 17) p[3] = 1;
334 else if (mm == 18) p[7] = 1;
335 else if (mm == 19) p[1] = p[5] = p[6] = 1;
336 else if (mm == 20) p[3] = 1;
337 // Galois field implementation with shift registers
338 // Ref: L&C, Chapter 6.7, pp. 217
339 mask = 1 ;
340 alpha_to[mm] = 0 ;
341 for (i = 0; i < mm; i++) {
342 alpha_to[i] = mask ;
343 index_of[alpha_to[i]] = i ;
344 if (p[i] != 0)
345 alpha_to[mm] ^= mask ;
346 mask <<= 1 ;
347 }
348
349 index_of[alpha_to[mm]] = mm ;
350 mask >>= 1 ;
351 for (i = mm + 1; i < nn; i++) {
352 if (alpha_to[i - 1] >= mask)
353 alpha_to[i] = alpha_to[mm] ^ ((alpha_to[i - 1] ^ mask) << 1) ;
354 else
355 alpha_to[i] = alpha_to[i - 1] << 1 ;
356
357 index_of[alpha_to[i]] = i ;
358 }
359 index_of[0] = -1 ;
360 }
361