]> git.zerfleddert.de Git - proxmark3-svn/blob - common/lfdemod.c
c0f2bb71265ee4ffcce67f5da4be77527eb71321
[proxmark3-svn] / common / lfdemod.c
1 //-----------------------------------------------------------------------------
2 // Copyright (C) 2014
3 //
4 // This code is licensed to you under the terms of the GNU GPL, version 2 or,
5 // at your option, any later version. See the LICENSE.txt file for the text of
6 // the license.
7 //-----------------------------------------------------------------------------
8 // Low frequency demod/decode commands
9 //-----------------------------------------------------------------------------
10
11 #include <stdlib.h>
12 #include <string.h>
13 #include "lfdemod.h"
14 uint8_t justNoise(uint8_t *BitStream, size_t size)
15 {
16 static const uint8_t THRESHOLD = 123;
17 //test samples are not just noise
18 uint8_t justNoise1 = 1;
19 for(size_t idx=0; idx < size && justNoise1 ;idx++){
20 justNoise1 = BitStream[idx] < THRESHOLD;
21 }
22 return justNoise1;
23 }
24
25 //by marshmellow
26 //get high and low values of a wave with passed in fuzz factor. also return noise test = 1 for passed or 0 for only noise
27 int getHiLo(uint8_t *BitStream, size_t size, int *high, int *low, uint8_t fuzzHi, uint8_t fuzzLo)
28 {
29 *high=0;
30 *low=255;
31 // get high and low thresholds
32 for (size_t i=0; i < size; i++){
33 if (BitStream[i] > *high) *high = BitStream[i];
34 if (BitStream[i] < *low) *low = BitStream[i];
35 }
36 if (*high < 123) return -1; // just noise
37 *high = ((*high-128)*fuzzHi + 12800)/100;
38 *low = ((*low-128)*fuzzLo + 12800)/100;
39 return 1;
40 }
41
42 // by marshmellow
43 // pass bits to be tested in bits, length bits passed in bitLen, and parity type (even=0 | odd=1) in pType
44 // returns 1 if passed
45 uint8_t parityTest(uint32_t bits, uint8_t bitLen, uint8_t pType)
46 {
47 uint8_t ans = 0;
48 for (uint8_t i = 0; i < bitLen; i++){
49 ans ^= ((bits >> i) & 1);
50 }
51 //PrintAndLog("DEBUG: ans: %d, ptype: %d",ans,pType);
52 return (ans == pType);
53 }
54
55 //by marshmellow
56 //search for given preamble in given BitStream and return success=1 or fail=0 and startIndex and length
57 uint8_t preambleSearch(uint8_t *BitStream, uint8_t *preamble, size_t pLen, size_t *size, size_t *startIdx)
58 {
59 uint8_t foundCnt=0;
60 for (int idx=0; idx < *size - pLen; idx++){
61 if (memcmp(BitStream+idx, preamble, pLen) == 0){
62 //first index found
63 foundCnt++;
64 if (foundCnt == 1){
65 *startIdx = idx;
66 }
67 if (foundCnt == 2){
68 *size = idx - *startIdx;
69 return 1;
70 }
71 }
72 }
73 return 0;
74 }
75
76 //by marshmellow
77 //takes 1s and 0s and searches for EM410x format - output EM ID
78 uint8_t Em410xDecode(uint8_t *BitStream, size_t *size, size_t *startIdx, uint32_t *hi, uint64_t *lo)
79 {
80 //no arguments needed - built this way in case we want this to be a direct call from "data " cmds in the future
81 // otherwise could be a void with no arguments
82 //set defaults
83 uint32_t i = 0;
84 if (BitStream[1]>1) return 0; //allow only 1s and 0s
85
86 // 111111111 bit pattern represent start of frame
87 // include 0 in front to help get start pos
88 uint8_t preamble[] = {0,1,1,1,1,1,1,1,1,1};
89 uint32_t idx = 0;
90 uint32_t parityBits = 0;
91 uint8_t errChk = 0;
92 uint8_t FmtLen = 10;
93 *startIdx = 0;
94 errChk = preambleSearch(BitStream, preamble, sizeof(preamble), size, startIdx);
95 if (errChk == 0 || *size < 64) return 0;
96 if (*size > 64) FmtLen = 22;
97 *startIdx += 1; //get rid of 0 from preamble
98 idx = *startIdx + 9;
99 for (i=0; i<FmtLen; i++){ //loop through 10 or 22 sets of 5 bits (50-10p = 40 bits or 88 bits)
100 parityBits = bytebits_to_byte(BitStream+(i*5)+idx,5);
101 //check even parity - quit if failed
102 if (parityTest(parityBits, 5, 0) == 0) return 0;
103 //set uint64 with ID from BitStream
104 for (uint8_t ii=0; ii<4; ii++){
105 *hi = (*hi << 1) | (*lo >> 63);
106 *lo = (*lo << 1) | (BitStream[(i*5)+ii+idx]);
107 }
108 }
109 if (errChk != 0) return 1;
110 //skip last 5 bit parity test for simplicity.
111 // *size = 64 | 128;
112 return 0;
113 }
114
115 //by marshmellow
116 //demodulates strong heavily clipped samples
117 int cleanAskRawDemod(uint8_t *BinStream, size_t *size, int clk, int invert, int high, int low)
118 {
119 size_t bitCnt=0, smplCnt=0, errCnt=0;
120 uint8_t waveHigh = 0;
121 for (size_t i=0; i < *size; i++){
122 if (BinStream[i] >= high && waveHigh){
123 smplCnt++;
124 } else if (BinStream[i] <= low && !waveHigh){
125 smplCnt++;
126 } else { //transition
127 if ((BinStream[i] >= high && !waveHigh) || (BinStream[i] <= low && waveHigh)){
128 if (smplCnt > clk-(clk/4)-1) { //full clock
129 if (smplCnt > clk + (clk/4)+1) { //too many samples
130 errCnt++;
131 BinStream[bitCnt++]=7;
132 } else if (waveHigh) {
133 BinStream[bitCnt++] = invert;
134 BinStream[bitCnt++] = invert;
135 } else if (!waveHigh) {
136 BinStream[bitCnt++] = invert ^ 1;
137 BinStream[bitCnt++] = invert ^ 1;
138 }
139 waveHigh ^= 1;
140 smplCnt = 0;
141 } else if (smplCnt > (clk/2) - (clk/4)-1) {
142 if (waveHigh) {
143 BinStream[bitCnt++] = invert;
144 } else if (!waveHigh) {
145 BinStream[bitCnt++] = invert ^ 1;
146 }
147 waveHigh ^= 1;
148 smplCnt = 0;
149 } else if (!bitCnt) {
150 //first bit
151 waveHigh = (BinStream[i] >= high);
152 smplCnt = 1;
153 } else {
154 smplCnt++;
155 //transition bit oops
156 }
157 } else { //haven't hit new high or new low yet
158 smplCnt++;
159 }
160 }
161 }
162 *size = bitCnt;
163 return errCnt;
164 }
165
166 //by marshmellow
167 void askAmp(uint8_t *BitStream, size_t size)
168 {
169 for(size_t i = 1; i<size; i++){
170 if (BitStream[i]-BitStream[i-1]>=30) //large jump up
171 BitStream[i]=127;
172 else if(BitStream[i]-BitStream[i-1]<=-20) //large jump down
173 BitStream[i]=-127;
174 }
175 return;
176 }
177
178 //by marshmellow
179 //attempts to demodulate ask modulations, askType == 0 for ask/raw, askType==1 for ask/manchester
180 int askdemod(uint8_t *BinStream, size_t *size, int *clk, int *invert, int maxErr, uint8_t amp, uint8_t askType)
181 {
182 if (*size==0) return -1;
183 int start = DetectASKClock(BinStream, *size, clk, maxErr); //clock default
184 if (*clk==0 || start < 0) return -3;
185 if (*invert != 1) *invert = 0;
186 if (amp==1) askAmp(BinStream, *size);
187
188 uint8_t initLoopMax = 255;
189 if (initLoopMax > *size) initLoopMax = *size;
190 // Detect high and lows
191 //25% clip in case highs and lows aren't clipped [marshmellow]
192 int high, low;
193 if (getHiLo(BinStream, initLoopMax, &high, &low, 75, 75) < 1)
194 return -2; //just noise
195
196 size_t errCnt = 0;
197 // if clean clipped waves detected run alternate demod
198 if (DetectCleanAskWave(BinStream, *size, high, low)) {
199 errCnt = cleanAskRawDemod(BinStream, size, *clk, *invert, high, low);
200 if (askType) //askman
201 return manrawdecode(BinStream, size, 0);
202 else //askraw
203 return errCnt;
204 }
205
206 int lastBit; //set first clock check - can go negative
207 size_t i, bitnum = 0; //output counter
208 uint8_t midBit = 0;
209 uint8_t tol = 0; //clock tolerance adjust - waves will be accepted as within the clock if they fall + or - this value + clock from last valid wave
210 if (*clk <= 32) tol = 1; //clock tolerance may not be needed anymore currently set to + or - 1 but could be increased for poor waves or removed entirely
211 size_t MaxBits = 1024;
212 lastBit = start - *clk;
213
214 for (i = start; i < *size; ++i) {
215 if (i-lastBit >= *clk-tol){
216 if (BinStream[i] >= high) {
217 BinStream[bitnum++] = *invert;
218 } else if (BinStream[i] <= low) {
219 BinStream[bitnum++] = *invert ^ 1;
220 } else if (i-lastBit >= *clk+tol) {
221 if (bitnum > 0) {
222 BinStream[bitnum++]=7;
223 errCnt++;
224 }
225 } else { //in tolerance - looking for peak
226 continue;
227 }
228 midBit = 0;
229 lastBit += *clk;
230 } else if (i-lastBit >= (*clk/2-tol) && !midBit && !askType){
231 if (BinStream[i] >= high) {
232 BinStream[bitnum++] = *invert;
233 } else if (BinStream[i] <= low) {
234 BinStream[bitnum++] = *invert ^ 1;
235 } else if (i-lastBit >= *clk/2+tol) {
236 BinStream[bitnum] = BinStream[bitnum-1];
237 bitnum++;
238 } else { //in tolerance - looking for peak
239 continue;
240 }
241 midBit = 1;
242 }
243 if (bitnum >= MaxBits) break;
244 }
245 *size = bitnum;
246 return errCnt;
247 }
248
249 //by marshmellow
250 //take 10 and 01 and manchester decode
251 //run through 2 times and take least errCnt
252 int manrawdecode(uint8_t * BitStream, size_t *size, uint8_t invert)
253 {
254 uint16_t bitnum=0, MaxBits = 512, errCnt = 0;
255 size_t i, ii;
256 uint16_t bestErr = 1000, bestRun = 0;
257 if (*size < 16) return -1;
258 //find correct start position [alignment]
259 for (ii=0;ii<2;++ii){
260 for (i=ii; i<*size-3; i+=2)
261 if (BitStream[i]==BitStream[i+1])
262 errCnt++;
263
264 if (bestErr>errCnt){
265 bestErr=errCnt;
266 bestRun=ii;
267 }
268 errCnt=0;
269 }
270 //decode
271 for (i=bestRun; i < *size-3; i+=2){
272 if(BitStream[i] == 1 && (BitStream[i+1] == 0)){
273 BitStream[bitnum++]=invert;
274 } else if((BitStream[i] == 0) && BitStream[i+1] == 1){
275 BitStream[bitnum++]=invert^1;
276 } else {
277 BitStream[bitnum++]=7;
278 }
279 if(bitnum>MaxBits) break;
280 }
281 *size=bitnum;
282 return bestErr;
283 }
284
285 //by marshmellow
286 //encode binary data into binary manchester
287 int ManchesterEncode(uint8_t *BitStream, size_t size)
288 {
289 size_t modIdx=20000, i=0;
290 if (size>modIdx) return -1;
291 for (size_t idx=0; idx < size; idx++){
292 BitStream[idx+modIdx++] = BitStream[idx];
293 BitStream[idx+modIdx++] = BitStream[idx]^1;
294 }
295 for (; i<(size*2); i++){
296 BitStream[i] = BitStream[i+20000];
297 }
298 return i;
299 }
300
301 //by marshmellow
302 //take 01 or 10 = 1 and 11 or 00 = 0
303 //check for phase errors - should never have 111 or 000 should be 01001011 or 10110100 for 1010
304 //decodes biphase or if inverted it is AKA conditional dephase encoding AKA differential manchester encoding
305 int BiphaseRawDecode(uint8_t *BitStream, size_t *size, int offset, int invert)
306 {
307 uint16_t bitnum = 0;
308 uint16_t errCnt = 0;
309 size_t i = offset;
310 uint16_t MaxBits=512;
311 //if not enough samples - error
312 if (*size < 51) return -1;
313 //check for phase change faults - skip one sample if faulty
314 uint8_t offsetA = 1, offsetB = 1;
315 for (; i<48; i+=2){
316 if (BitStream[i+1]==BitStream[i+2]) offsetA=0;
317 if (BitStream[i+2]==BitStream[i+3]) offsetB=0;
318 }
319 if (!offsetA && offsetB) offset++;
320 for (i=offset; i<*size-3; i+=2){
321 //check for phase error
322 if (BitStream[i+1]==BitStream[i+2]) {
323 BitStream[bitnum++]=7;
324 errCnt++;
325 }
326 if((BitStream[i]==1 && BitStream[i+1]==0) || (BitStream[i]==0 && BitStream[i+1]==1)){
327 BitStream[bitnum++]=1^invert;
328 } else if((BitStream[i]==0 && BitStream[i+1]==0) || (BitStream[i]==1 && BitStream[i+1]==1)){
329 BitStream[bitnum++]=invert;
330 } else {
331 BitStream[bitnum++]=7;
332 errCnt++;
333 }
334 if(bitnum>MaxBits) break;
335 }
336 *size=bitnum;
337 return errCnt;
338 }
339
340 // by marshmellow
341 // demod gProxIIDemod
342 // error returns as -x
343 // success returns start position in BitStream
344 // BitStream must contain previously askrawdemod and biphasedemoded data
345 int gProxII_Demod(uint8_t BitStream[], size_t *size)
346 {
347 size_t startIdx=0;
348 uint8_t preamble[] = {1,1,1,1,1,0};
349
350 uint8_t errChk = preambleSearch(BitStream, preamble, sizeof(preamble), size, &startIdx);
351 if (errChk == 0) return -3; //preamble not found
352 if (*size != 96) return -2; //should have found 96 bits
353 //check first 6 spacer bits to verify format
354 if (!BitStream[startIdx+5] && !BitStream[startIdx+10] && !BitStream[startIdx+15] && !BitStream[startIdx+20] && !BitStream[startIdx+25] && !BitStream[startIdx+30]){
355 //confirmed proper separator bits found
356 //return start position
357 return (int) startIdx;
358 }
359 return -5;
360 }
361
362 //translate wave to 11111100000 (1 for each short wave 0 for each long wave)
363 size_t fsk_wave_demod(uint8_t * dest, size_t size, uint8_t fchigh, uint8_t fclow)
364 {
365 size_t last_transition = 0;
366 size_t idx = 1;
367 //uint32_t maxVal=0;
368 if (fchigh==0) fchigh=10;
369 if (fclow==0) fclow=8;
370 //set the threshold close to 0 (graph) or 128 std to avoid static
371 uint8_t threshold_value = 123;
372
373 // sync to first lo-hi transition, and threshold
374
375 // Need to threshold first sample
376
377 if(dest[0] < threshold_value) dest[0] = 0;
378 else dest[0] = 1;
379
380 size_t numBits = 0;
381 // count cycles between consecutive lo-hi transitions, there should be either 8 (fc/8)
382 // or 10 (fc/10) cycles but in practice due to noise etc we may end up with with anywhere
383 // between 7 to 11 cycles so fuzz it by treat anything <9 as 8 and anything else as 10
384 for(idx = 1; idx < size; idx++) {
385 // threshold current value
386
387 if (dest[idx] < threshold_value) dest[idx] = 0;
388 else dest[idx] = 1;
389
390 // Check for 0->1 transition
391 if (dest[idx-1] < dest[idx]) { // 0 -> 1 transition
392 if ((idx-last_transition)<(fclow-2)){ //0-5 = garbage noise
393 //do nothing with extra garbage
394 } else if ((idx-last_transition) < (fchigh-1)) { //6-8 = 8 waves
395 dest[numBits++]=1;
396 } else if ((idx-last_transition) > (fchigh+1) && !numBits) { //12 + and first bit = garbage
397 //do nothing with beginning garbage
398 } else { //9+ = 10 waves
399 dest[numBits++]=0;
400 }
401 last_transition = idx;
402 }
403 }
404 return numBits; //Actually, it returns the number of bytes, but each byte represents a bit: 1 or 0
405 }
406
407 //translate 11111100000 to 10
408 size_t aggregate_bits(uint8_t *dest, size_t size, uint8_t rfLen,
409 uint8_t invert, uint8_t fchigh, uint8_t fclow)
410 {
411 uint8_t lastval=dest[0];
412 size_t idx=0;
413 size_t numBits=0;
414 uint32_t n=1;
415 for( idx=1; idx < size; idx++) {
416 n++;
417 if (dest[idx]==lastval) continue;
418
419 //if lastval was 1, we have a 1->0 crossing
420 if (dest[idx-1]==1) {
421 if (!numBits && n < rfLen/fclow) {
422 n=0;
423 lastval = dest[idx];
424 continue;
425 }
426 n = (n * fclow + rfLen/2) / rfLen;
427 } else {// 0->1 crossing
428 //test first bitsample too small
429 if (!numBits && n < rfLen/fchigh) {
430 n=0;
431 lastval = dest[idx];
432 continue;
433 }
434 n = (n * fchigh + rfLen/2) / rfLen;
435 }
436 if (n == 0) n = 1;
437
438 memset(dest+numBits, dest[idx-1]^invert , n);
439 numBits += n;
440 n=0;
441 lastval=dest[idx];
442 }//end for
443 // if valid extra bits at the end were all the same frequency - add them in
444 if (n > rfLen/fchigh) {
445 if (dest[idx-2]==1) {
446 n = (n * fclow + rfLen/2) / rfLen;
447 } else {
448 n = (n * fchigh + rfLen/2) / rfLen;
449 }
450 memset(dest+numBits, dest[idx-1]^invert , n);
451 numBits += n;
452 }
453 return numBits;
454 }
455 //by marshmellow (from holiman's base)
456 // full fsk demod from GraphBuffer wave to decoded 1s and 0s (no mandemod)
457 int fskdemod(uint8_t *dest, size_t size, uint8_t rfLen, uint8_t invert, uint8_t fchigh, uint8_t fclow)
458 {
459 // FSK demodulator
460 size = fsk_wave_demod(dest, size, fchigh, fclow);
461 size = aggregate_bits(dest, size, rfLen, invert, fchigh, fclow);
462 return size;
463 }
464
465 // loop to get raw HID waveform then FSK demodulate the TAG ID from it
466 int HIDdemodFSK(uint8_t *dest, size_t *size, uint32_t *hi2, uint32_t *hi, uint32_t *lo)
467 {
468 if (justNoise(dest, *size)) return -1;
469
470 size_t numStart=0, size2=*size, startIdx=0;
471 // FSK demodulator
472 *size = fskdemod(dest, size2,50,1,10,8); //fsk2a
473 if (*size < 96*2) return -2;
474 // 00011101 bit pattern represent start of frame, 01 pattern represents a 0 and 10 represents a 1
475 uint8_t preamble[] = {0,0,0,1,1,1,0,1};
476 // find bitstring in array
477 uint8_t errChk = preambleSearch(dest, preamble, sizeof(preamble), size, &startIdx);
478 if (errChk == 0) return -3; //preamble not found
479
480 numStart = startIdx + sizeof(preamble);
481 // final loop, go over previously decoded FSK data and manchester decode into usable tag ID
482 for (size_t idx = numStart; (idx-numStart) < *size - sizeof(preamble); idx+=2){
483 if (dest[idx] == dest[idx+1]){
484 return -4; //not manchester data
485 }
486 *hi2 = (*hi2<<1)|(*hi>>31);
487 *hi = (*hi<<1)|(*lo>>31);
488 //Then, shift in a 0 or one into low
489 if (dest[idx] && !dest[idx+1]) // 1 0
490 *lo=(*lo<<1)|1;
491 else // 0 1
492 *lo=(*lo<<1)|0;
493 }
494 return (int)startIdx;
495 }
496
497 // loop to get raw paradox waveform then FSK demodulate the TAG ID from it
498 int ParadoxdemodFSK(uint8_t *dest, size_t *size, uint32_t *hi2, uint32_t *hi, uint32_t *lo)
499 {
500 if (justNoise(dest, *size)) return -1;
501
502 size_t numStart=0, size2=*size, startIdx=0;
503 // FSK demodulator
504 *size = fskdemod(dest, size2,50,1,10,8); //fsk2a
505 if (*size < 96) return -2;
506
507 // 00001111 bit pattern represent start of frame, 01 pattern represents a 0 and 10 represents a 1
508 uint8_t preamble[] = {0,0,0,0,1,1,1,1};
509
510 uint8_t errChk = preambleSearch(dest, preamble, sizeof(preamble), size, &startIdx);
511 if (errChk == 0) return -3; //preamble not found
512
513 numStart = startIdx + sizeof(preamble);
514 // final loop, go over previously decoded FSK data and manchester decode into usable tag ID
515 for (size_t idx = numStart; (idx-numStart) < *size - sizeof(preamble); idx+=2){
516 if (dest[idx] == dest[idx+1])
517 return -4; //not manchester data
518 *hi2 = (*hi2<<1)|(*hi>>31);
519 *hi = (*hi<<1)|(*lo>>31);
520 //Then, shift in a 0 or one into low
521 if (dest[idx] && !dest[idx+1]) // 1 0
522 *lo=(*lo<<1)|1;
523 else // 0 1
524 *lo=(*lo<<1)|0;
525 }
526 return (int)startIdx;
527 }
528
529 uint32_t bytebits_to_byte(uint8_t* src, size_t numbits)
530 {
531 uint32_t num = 0;
532 for(int i = 0 ; i < numbits ; i++)
533 {
534 num = (num << 1) | (*src);
535 src++;
536 }
537 return num;
538 }
539
540 //least significant bit first
541 uint32_t bytebits_to_byteLSBF(uint8_t* src, size_t numbits)
542 {
543 uint32_t num = 0;
544 for(int i = 0 ; i < numbits ; i++)
545 {
546 num = (num << 1) | (*src);
547 src++;
548 }
549 return num;
550 }
551
552 int IOdemodFSK(uint8_t *dest, size_t size)
553 {
554 if (justNoise(dest, size)) return -1;
555 //make sure buffer has data
556 if (size < 66*64) return -2;
557 // FSK demodulator
558 size = fskdemod(dest, size, 64, 1, 10, 8); // FSK2a RF/64
559 if (size < 65) return -3; //did we get a good demod?
560 //Index map
561 //0 10 20 30 40 50 60
562 //| | | | | | |
563 //01234567 8 90123456 7 89012345 6 78901234 5 67890123 4 56789012 3 45678901 23
564 //-----------------------------------------------------------------------------
565 //00000000 0 11110000 1 facility 1 version* 1 code*one 1 code*two 1 ???????? 11
566 //
567 //XSF(version)facility:codeone+codetwo
568 //Handle the data
569 size_t startIdx = 0;
570 uint8_t preamble[] = {0,0,0,0,0,0,0,0,0,1};
571 uint8_t errChk = preambleSearch(dest, preamble, sizeof(preamble), &size, &startIdx);
572 if (errChk == 0) return -4; //preamble not found
573
574 if (!dest[startIdx+8] && dest[startIdx+17]==1 && dest[startIdx+26]==1 && dest[startIdx+35]==1 && dest[startIdx+44]==1 && dest[startIdx+53]==1){
575 //confirmed proper separator bits found
576 //return start position
577 return (int) startIdx;
578 }
579 return -5;
580 }
581
582 // by marshmellow
583 // takes a array of binary values, start position, length of bits per parity (includes parity bit),
584 // Parity Type (1 for odd 0 for even), and binary Length (length to run)
585 size_t removeParity(uint8_t *BitStream, size_t startIdx, uint8_t pLen, uint8_t pType, size_t bLen)
586 {
587 uint32_t parityWd = 0;
588 size_t j = 0, bitCnt = 0;
589 for (int word = 0; word < (bLen); word+=pLen){
590 for (int bit=0; bit < pLen; bit++){
591 parityWd = (parityWd << 1) | BitStream[startIdx+word+bit];
592 BitStream[j++] = (BitStream[startIdx+word+bit]);
593 }
594 j--;
595 // if parity fails then return 0
596 if (parityTest(parityWd, pLen, pType) == 0) return -1;
597 bitCnt+=(pLen-1);
598 parityWd = 0;
599 }
600 // if we got here then all the parities passed
601 //return ID start index and size
602 return bitCnt;
603 }
604
605 // Ask/Biphase Demod then try to locate an ISO 11784/85 ID
606 // BitStream must contain previously askrawdemod and biphasedemoded data
607 int ISO11784demodBI(uint8_t *dest, size_t *size)
608 {
609 //make sure buffer has enough data
610 if (*size < 128) return -1;
611
612 size_t startIdx = 0;
613 uint8_t preamble[] = {0,0,0,0,0,0,0,0,0,0,1};
614
615 uint8_t errChk = preambleSearch(dest, preamble, sizeof(preamble), size, &startIdx);
616 if (errChk == 0) return -2; //preamble not found
617 return (int)startIdx;
618 }
619
620 // by marshmellow
621 // FSK Demod then try to locate an AWID ID
622 int AWIDdemodFSK(uint8_t *dest, size_t *size)
623 {
624 //make sure buffer has enough data
625 if (*size < 96*50) return -1;
626
627 if (justNoise(dest, *size)) return -2;
628
629 // FSK demodulator
630 *size = fskdemod(dest, *size, 50, 1, 10, 8); // fsk2a RF/50
631 if (*size < 96) return -3; //did we get a good demod?
632
633 uint8_t preamble[] = {0,0,0,0,0,0,0,1};
634 size_t startIdx = 0;
635 uint8_t errChk = preambleSearch(dest, preamble, sizeof(preamble), size, &startIdx);
636 if (errChk == 0) return -4; //preamble not found
637 if (*size != 96) return -5;
638 return (int)startIdx;
639 }
640
641 // by marshmellow
642 // FSK Demod then try to locate an Farpointe Data (pyramid) ID
643 int PyramiddemodFSK(uint8_t *dest, size_t *size)
644 {
645 //make sure buffer has data
646 if (*size < 128*50) return -5;
647
648 //test samples are not just noise
649 if (justNoise(dest, *size)) return -1;
650
651 // FSK demodulator
652 *size = fskdemod(dest, *size, 50, 1, 10, 8); // fsk2a RF/50
653 if (*size < 128) return -2; //did we get a good demod?
654
655 uint8_t preamble[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1};
656 size_t startIdx = 0;
657 uint8_t errChk = preambleSearch(dest, preamble, sizeof(preamble), size, &startIdx);
658 if (errChk == 0) return -4; //preamble not found
659 if (*size != 128) return -3;
660 return (int)startIdx;
661 }
662
663 // by marshmellow
664 // to detect a wave that has heavily clipped (clean) samples
665 uint8_t DetectCleanAskWave(uint8_t dest[], size_t size, uint8_t high, uint8_t low)
666 {
667 uint16_t allPeaks=1;
668 uint16_t cntPeaks=0;
669 size_t loopEnd = 512+60;
670 if (loopEnd > size) loopEnd = size;
671 for (size_t i=60; i<loopEnd; i++){
672 if (dest[i]>low && dest[i]<high)
673 allPeaks=0;
674 else
675 cntPeaks++;
676 }
677 if (allPeaks == 0){
678 if (cntPeaks > 300) return 1;
679 }
680 return allPeaks;
681 }
682
683 // by marshmellow
684 // to help detect clocks on heavily clipped samples
685 // based on count of low to low
686 int DetectStrongAskClock(uint8_t dest[], size_t size, uint8_t high, uint8_t low)
687 {
688 uint8_t fndClk[] = {8,16,32,40,50,64,128};
689 size_t startwave;
690 size_t i = 0;
691 size_t minClk = 255;
692 // get to first full low to prime loop and skip incomplete first pulse
693 while ((dest[i] < high) && (i < size))
694 ++i;
695 while ((dest[i] > low) && (i < size))
696 ++i;
697
698 // loop through all samples
699 while (i < size) {
700 // measure from low to low
701 while ((dest[i] > low) && (i < size))
702 ++i;
703 startwave= i;
704 while ((dest[i] < high) && (i < size))
705 ++i;
706 while ((dest[i] > low) && (i < size))
707 ++i;
708 //get minimum measured distance
709 if (i-startwave < minClk && i < size)
710 minClk = i - startwave;
711 }
712 // set clock
713 for (uint8_t clkCnt = 0; clkCnt<7; clkCnt++) {
714 if (minClk >= fndClk[clkCnt]-(fndClk[clkCnt]/8) && minClk <= fndClk[clkCnt]+1)
715 return fndClk[clkCnt];
716 }
717 return 0;
718 }
719
720 // by marshmellow
721 // not perfect especially with lower clocks or VERY good antennas (heavy wave clipping)
722 // maybe somehow adjust peak trimming value based on samples to fix?
723 // return start index of best starting position for that clock and return clock (by reference)
724 int DetectASKClock(uint8_t dest[], size_t size, int *clock, int maxErr)
725 {
726 size_t i=1;
727 uint8_t clk[] = {255,8,16,32,40,50,64,100,128,255};
728 uint8_t clkEnd = 9;
729 uint8_t loopCnt = 255; //don't need to loop through entire array...
730 if (size <= loopCnt) return -1; //not enough samples
731
732 //if we already have a valid clock
733 uint8_t clockFnd=0;
734 for (;i<clkEnd;++i)
735 if (clk[i] == *clock) clockFnd = i;
736 //clock found but continue to find best startpos
737
738 //get high and low peak
739 int peak, low;
740 if (getHiLo(dest, loopCnt, &peak, &low, 75, 75) < 1) return -1;
741
742 //test for large clean peaks
743 if (!clockFnd){
744 if (DetectCleanAskWave(dest, size, peak, low)==1){
745 int ans = DetectStrongAskClock(dest, size, peak, low);
746 for (i=clkEnd-1; i>0; i--){
747 if (clk[i] == ans) {
748 *clock = ans;
749 //clockFnd = i;
750 return 0; // for strong waves i don't use the 'best start position' yet...
751 //break; //clock found but continue to find best startpos [not yet]
752 }
753 }
754 }
755 }
756
757 uint8_t ii;
758 uint8_t clkCnt, tol = 0;
759 uint16_t bestErr[]={1000,1000,1000,1000,1000,1000,1000,1000,1000};
760 uint8_t bestStart[]={0,0,0,0,0,0,0,0,0};
761 size_t errCnt = 0;
762 size_t arrLoc, loopEnd;
763
764 if (clockFnd>0) {
765 clkCnt = clockFnd;
766 clkEnd = clockFnd+1;
767 }
768 else clkCnt=1;
769
770 //test each valid clock from smallest to greatest to see which lines up
771 for(; clkCnt < clkEnd; clkCnt++){
772 if (clk[clkCnt] <= 32){
773 tol=1;
774 }else{
775 tol=0;
776 }
777 //if no errors allowed - keep start within the first clock
778 if (!maxErr && size > clk[clkCnt]*2 + tol && clk[clkCnt]<128) loopCnt=clk[clkCnt]*2;
779 bestErr[clkCnt]=1000;
780 //try lining up the peaks by moving starting point (try first few clocks)
781 for (ii=0; ii < loopCnt; ii++){
782 if (dest[ii] < peak && dest[ii] > low) continue;
783
784 errCnt=0;
785 // now that we have the first one lined up test rest of wave array
786 loopEnd = ((size-ii-tol) / clk[clkCnt]) - 1;
787 for (i=0; i < loopEnd; ++i){
788 arrLoc = ii + (i * clk[clkCnt]);
789 if (dest[arrLoc] >= peak || dest[arrLoc] <= low){
790 }else if (dest[arrLoc-tol] >= peak || dest[arrLoc-tol] <= low){
791 }else if (dest[arrLoc+tol] >= peak || dest[arrLoc+tol] <= low){
792 }else{ //error no peak detected
793 errCnt++;
794 }
795 }
796 //if we found no errors then we can stop here and a low clock (common clocks)
797 // this is correct one - return this clock
798 //PrintAndLog("DEBUG: clk %d, err %d, ii %d, i %d",clk[clkCnt],errCnt,ii,i);
799 if(errCnt==0 && clkCnt<7) {
800 if (!clockFnd) *clock = clk[clkCnt];
801 return ii;
802 }
803 //if we found errors see if it is lowest so far and save it as best run
804 if(errCnt<bestErr[clkCnt]){
805 bestErr[clkCnt]=errCnt;
806 bestStart[clkCnt]=ii;
807 }
808 }
809 }
810 uint8_t iii;
811 uint8_t best=0;
812 for (iii=1; iii<clkEnd; ++iii){
813 if (bestErr[iii] < bestErr[best]){
814 if (bestErr[iii] == 0) bestErr[iii]=1;
815 // current best bit to error ratio vs new bit to error ratio
816 if ( (size/clk[best])/bestErr[best] < (size/clk[iii])/bestErr[iii] ){
817 best = iii;
818 }
819 }
820 }
821 //if (bestErr[best] > maxErr) return -1;
822 if (!clockFnd) *clock = clk[best];
823 return bestStart[best];
824 }
825
826 //by marshmellow
827 //detect psk clock by reading each phase shift
828 // a phase shift is determined by measuring the sample length of each wave
829 int DetectPSKClock(uint8_t dest[], size_t size, int clock)
830 {
831 uint8_t clk[]={255,16,32,40,50,64,100,128,255}; //255 is not a valid clock
832 uint16_t loopCnt = 4096; //don't need to loop through entire array...
833 if (size == 0) return 0;
834 if (size<loopCnt) loopCnt = size;
835
836 //if we already have a valid clock quit
837 size_t i=1;
838 for (; i < 8; ++i)
839 if (clk[i] == clock) return clock;
840
841 size_t waveStart=0, waveEnd=0, firstFullWave=0, lastClkBit=0;
842 uint8_t clkCnt, fc=0, fullWaveLen=0, tol=1;
843 uint16_t peakcnt=0, errCnt=0, waveLenCnt=0;
844 uint16_t bestErr[]={1000,1000,1000,1000,1000,1000,1000,1000,1000};
845 uint16_t peaksdet[]={0,0,0,0,0,0,0,0,0};
846 fc = countFC(dest, size, 0);
847 if (fc!=2 && fc!=4 && fc!=8) return -1;
848 //PrintAndLog("DEBUG: FC: %d",fc);
849
850 //find first full wave
851 for (i=0; i<loopCnt; i++){
852 if (dest[i] < dest[i+1] && dest[i+1] >= dest[i+2]){
853 if (waveStart == 0) {
854 waveStart = i+1;
855 //PrintAndLog("DEBUG: waveStart: %d",waveStart);
856 } else {
857 waveEnd = i+1;
858 //PrintAndLog("DEBUG: waveEnd: %d",waveEnd);
859 waveLenCnt = waveEnd-waveStart;
860 if (waveLenCnt > fc){
861 firstFullWave = waveStart;
862 fullWaveLen=waveLenCnt;
863 break;
864 }
865 waveStart=0;
866 }
867 }
868 }
869 //PrintAndLog("DEBUG: firstFullWave: %d, waveLen: %d",firstFullWave,fullWaveLen);
870
871 //test each valid clock from greatest to smallest to see which lines up
872 for(clkCnt=7; clkCnt >= 1 ; clkCnt--){
873 lastClkBit = firstFullWave; //set end of wave as clock align
874 waveStart = 0;
875 errCnt=0;
876 peakcnt=0;
877 //PrintAndLog("DEBUG: clk: %d, lastClkBit: %d",clk[clkCnt],lastClkBit);
878
879 for (i = firstFullWave+fullWaveLen-1; i < loopCnt-2; i++){
880 //top edge of wave = start of new wave
881 if (dest[i] < dest[i+1] && dest[i+1] >= dest[i+2]){
882 if (waveStart == 0) {
883 waveStart = i+1;
884 waveLenCnt=0;
885 } else { //waveEnd
886 waveEnd = i+1;
887 waveLenCnt = waveEnd-waveStart;
888 if (waveLenCnt > fc){
889 //if this wave is a phase shift
890 //PrintAndLog("DEBUG: phase shift at: %d, len: %d, nextClk: %d, ii: %d, fc: %d",waveStart,waveLenCnt,lastClkBit+clk[clkCnt]-tol,ii+1,fc);
891 if (i+1 >= lastClkBit + clk[clkCnt] - tol){ //should be a clock bit
892 peakcnt++;
893 lastClkBit+=clk[clkCnt];
894 } else if (i<lastClkBit+8){
895 //noise after a phase shift - ignore
896 } else { //phase shift before supposed to based on clock
897 errCnt++;
898 }
899 } else if (i+1 > lastClkBit + clk[clkCnt] + tol + fc){
900 lastClkBit+=clk[clkCnt]; //no phase shift but clock bit
901 }
902 waveStart=i+1;
903 }
904 }
905 }
906 if (errCnt == 0){
907 return clk[clkCnt];
908 }
909 if (errCnt <= bestErr[clkCnt]) bestErr[clkCnt]=errCnt;
910 if (peakcnt > peaksdet[clkCnt]) peaksdet[clkCnt]=peakcnt;
911 }
912 //all tested with errors
913 //return the highest clk with the most peaks found
914 uint8_t best=7;
915 for (i=7; i>=1; i--){
916 if (peaksdet[i] > peaksdet[best]) {
917 best = i;
918 }
919 //PrintAndLog("DEBUG: Clk: %d, peaks: %d, errs: %d, bestClk: %d",clk[iii],peaksdet[iii],bestErr[iii],clk[best]);
920 }
921 return clk[best];
922 }
923
924 //by marshmellow
925 //detect nrz clock by reading #peaks vs no peaks(or errors)
926 int DetectNRZClock(uint8_t dest[], size_t size, int clock)
927 {
928 size_t i=0;
929 uint8_t clk[]={8,16,32,40,50,64,100,128,255};
930 size_t loopCnt = 4096; //don't need to loop through entire array...
931 if (size == 0) return 0;
932 if (size<loopCnt) loopCnt = size;
933
934 //if we already have a valid clock quit
935 for (; i < 8; ++i)
936 if (clk[i] == clock) return clock;
937
938 //get high and low peak
939 int peak, low;
940 if (getHiLo(dest, loopCnt, &peak, &low, 75, 75) < 1) return 0;
941
942 //PrintAndLog("DEBUG: peak: %d, low: %d",peak,low);
943 size_t ii;
944 uint8_t clkCnt;
945 uint8_t tol = 0;
946 uint16_t peakcnt=0;
947 uint16_t peaksdet[]={0,0,0,0,0,0,0,0};
948 uint16_t maxPeak=0;
949 //test for large clipped waves
950 for (i=0; i<loopCnt; i++){
951 if (dest[i] >= peak || dest[i] <= low){
952 peakcnt++;
953 } else {
954 if (peakcnt>0 && maxPeak < peakcnt){
955 maxPeak = peakcnt;
956 }
957 peakcnt=0;
958 }
959 }
960 peakcnt=0;
961 //test each valid clock from smallest to greatest to see which lines up
962 for(clkCnt=0; clkCnt < 8; ++clkCnt){
963 //ignore clocks smaller than largest peak
964 if (clk[clkCnt]<maxPeak) continue;
965
966 //try lining up the peaks by moving starting point (try first 256)
967 for (ii=0; ii< loopCnt; ++ii){
968 if ((dest[ii] >= peak) || (dest[ii] <= low)){
969 peakcnt=0;
970 // now that we have the first one lined up test rest of wave array
971 for (i=0; i < ((int)((size-ii-tol)/clk[clkCnt])-1); ++i){
972 if (dest[ii+(i*clk[clkCnt])]>=peak || dest[ii+(i*clk[clkCnt])]<=low){
973 peakcnt++;
974 }
975 }
976 if(peakcnt>peaksdet[clkCnt]) {
977 peaksdet[clkCnt]=peakcnt;
978 }
979 }
980 }
981 }
982 int iii=7;
983 uint8_t best=0;
984 for (iii=7; iii > 0; iii--){
985 if (peaksdet[iii] > peaksdet[best]){
986 best = iii;
987 }
988 //PrintAndLog("DEBUG: Clk: %d, peaks: %d, errs: %d, bestClk: %d",clk[iii],peaksdet[iii],bestErr[iii],clk[best]);
989 }
990 return clk[best];
991 }
992
993 // by marshmellow
994 // convert psk1 demod to psk2 demod
995 // only transition waves are 1s
996 void psk1TOpsk2(uint8_t *BitStream, size_t size)
997 {
998 size_t i=1;
999 uint8_t lastBit=BitStream[0];
1000 for (; i<size; i++){
1001 if (BitStream[i]==7){
1002 //ignore errors
1003 } else if (lastBit!=BitStream[i]){
1004 lastBit=BitStream[i];
1005 BitStream[i]=1;
1006 } else {
1007 BitStream[i]=0;
1008 }
1009 }
1010 return;
1011 }
1012
1013 // by marshmellow
1014 // convert psk2 demod to psk1 demod
1015 // from only transition waves are 1s to phase shifts change bit
1016 void psk2TOpsk1(uint8_t *BitStream, size_t size)
1017 {
1018 uint8_t phase=0;
1019 for (size_t i=0; i<size; i++){
1020 if (BitStream[i]==1){
1021 phase ^=1;
1022 }
1023 BitStream[i]=phase;
1024 }
1025 return;
1026 }
1027
1028 // redesigned by marshmellow adjusted from existing decode functions
1029 // indala id decoding - only tested on 26 bit tags, but attempted to make it work for more
1030 int indala26decode(uint8_t *bitStream, size_t *size, uint8_t *invert)
1031 {
1032 //26 bit 40134 format (don't know other formats)
1033 int i;
1034 int long_wait=29;//29 leading zeros in format
1035 int start;
1036 int first = 0;
1037 int first2 = 0;
1038 int bitCnt = 0;
1039 int ii;
1040 // Finding the start of a UID
1041 for (start = 0; start <= *size - 250; start++) {
1042 first = bitStream[start];
1043 for (i = start; i < start + long_wait; i++) {
1044 if (bitStream[i] != first) {
1045 break;
1046 }
1047 }
1048 if (i == (start + long_wait)) {
1049 break;
1050 }
1051 }
1052 if (start == *size - 250 + 1) {
1053 // did not find start sequence
1054 return -1;
1055 }
1056 // Inverting signal if needed
1057 if (first == 1) {
1058 for (i = start; i < *size; i++) {
1059 bitStream[i] = !bitStream[i];
1060 }
1061 *invert = 1;
1062 }else *invert=0;
1063
1064 int iii;
1065 //found start once now test length by finding next one
1066 for (ii=start+29; ii <= *size - 250; ii++) {
1067 first2 = bitStream[ii];
1068 for (iii = ii; iii < ii + long_wait; iii++) {
1069 if (bitStream[iii] != first2) {
1070 break;
1071 }
1072 }
1073 if (iii == (ii + long_wait)) {
1074 break;
1075 }
1076 }
1077 if (ii== *size - 250 + 1){
1078 // did not find second start sequence
1079 return -2;
1080 }
1081 bitCnt=ii-start;
1082
1083 // Dumping UID
1084 i = start;
1085 for (ii = 0; ii < bitCnt; ii++) {
1086 bitStream[ii] = bitStream[i++];
1087 }
1088 *size=bitCnt;
1089 return 1;
1090 }
1091
1092 // by marshmellow - demodulate NRZ wave (both similar enough)
1093 // peaks invert bit (high=1 low=0) each clock cycle = 1 bit determined by last peak
1094 // there probably is a much simpler way to do this....
1095 int nrzRawDemod(uint8_t *dest, size_t *size, int *clk, int *invert, int maxErr)
1096 {
1097 if (justNoise(dest, *size)) return -1;
1098 *clk = DetectNRZClock(dest, *size, *clk);
1099 if (*clk==0) return -2;
1100 size_t i, gLen = 4096;
1101 if (gLen>*size) gLen = *size;
1102 int high, low;
1103 if (getHiLo(dest, gLen, &high, &low, 75, 75) < 1) return -3; //25% fuzz on high 25% fuzz on low
1104 int lastBit = 0; //set first clock check
1105 size_t iii = 0, bitnum = 0; //bitnum counter
1106 uint16_t errCnt = 0, MaxBits = 1000;
1107 size_t bestErrCnt = maxErr+1;
1108 size_t bestPeakCnt = 0, bestPeakStart = 0;
1109 uint8_t bestFirstPeakHigh=0, firstPeakHigh=0, curBit=0, bitHigh=0, errBitHigh=0;
1110 uint8_t tol = 1; //clock tolerance adjust - waves will be accepted as within the clock if they fall + or - this value + clock from last valid wave
1111 uint16_t peakCnt=0;
1112 uint8_t ignoreWindow=4;
1113 uint8_t ignoreCnt=ignoreWindow; //in case of noise near peak
1114 //loop to find first wave that works - align to clock
1115 for (iii=0; iii < gLen; ++iii){
1116 if ((dest[iii]>=high) || (dest[iii]<=low)){
1117 if (dest[iii]>=high) firstPeakHigh=1;
1118 else firstPeakHigh=0;
1119 lastBit=iii-*clk;
1120 peakCnt=0;
1121 errCnt=0;
1122 //loop through to see if this start location works
1123 for (i = iii; i < *size; ++i) {
1124 // if we are at a clock bit
1125 if ((i >= lastBit + *clk - tol) && (i <= lastBit + *clk + tol)) {
1126 //test high/low
1127 if (dest[i] >= high || dest[i] <= low) {
1128 bitHigh = 1;
1129 peakCnt++;
1130 errBitHigh = 0;
1131 ignoreCnt = ignoreWindow;
1132 lastBit += *clk;
1133 } else if (i == lastBit + *clk + tol) {
1134 lastBit += *clk;
1135 }
1136 //else if no bars found
1137 } else if (dest[i] < high && dest[i] > low){
1138 if (ignoreCnt==0){
1139 bitHigh=0;
1140 if (errBitHigh==1) errCnt++;
1141 errBitHigh=0;
1142 } else {
1143 ignoreCnt--;
1144 }
1145 } else if ((dest[i]>=high || dest[i]<=low) && (bitHigh==0)) {
1146 //error bar found no clock...
1147 errBitHigh=1;
1148 }
1149 if (((i-iii) / *clk)>=MaxBits) break;
1150 }
1151 //we got more than 64 good bits and not all errors
1152 if (((i-iii) / *clk) > 64 && (errCnt <= (maxErr))) {
1153 //possible good read
1154 if (!errCnt || peakCnt > bestPeakCnt){
1155 bestFirstPeakHigh=firstPeakHigh;
1156 bestErrCnt = errCnt;
1157 bestPeakCnt = peakCnt;
1158 bestPeakStart = iii;
1159 if (!errCnt) break; //great read - finish
1160 }
1161 }
1162 }
1163 }
1164 //PrintAndLog("DEBUG: bestErrCnt: %d, maxErr: %d, bestStart: %d, bestPeakCnt: %d, bestPeakStart: %d",bestErrCnt,maxErr,bestStart,bestPeakCnt,bestPeakStart);
1165 if (bestErrCnt > maxErr) return bestErrCnt;
1166
1167 //best run is good enough set to best run and set overwrite BinStream
1168 lastBit = bestPeakStart - *clk;
1169 memset(dest, bestFirstPeakHigh^1, bestPeakStart / *clk);
1170 bitnum += (bestPeakStart / *clk);
1171 for (i = bestPeakStart; i < *size; ++i) {
1172 // if expecting a clock bit
1173 if ((i >= lastBit + *clk - tol) && (i <= lastBit + *clk + tol)) {
1174 // test high/low
1175 if (dest[i] >= high || dest[i] <= low) {
1176 peakCnt++;
1177 bitHigh = 1;
1178 errBitHigh = 0;
1179 ignoreCnt = ignoreWindow;
1180 curBit = *invert;
1181 if (dest[i] >= high) curBit ^= 1;
1182 dest[bitnum++] = curBit;
1183 lastBit += *clk;
1184 //else no bars found in clock area
1185 } else if (i == lastBit + *clk + tol) {
1186 dest[bitnum++] = curBit;
1187 lastBit += *clk;
1188 }
1189 //else if no bars found
1190 } else if (dest[i] < high && dest[i] > low){
1191 if (ignoreCnt == 0){
1192 bitHigh = 0;
1193 if (errBitHigh == 1){
1194 dest[bitnum++] = 7;
1195 errCnt++;
1196 }
1197 errBitHigh=0;
1198 } else {
1199 ignoreCnt--;
1200 }
1201 } else if ((dest[i] >= high || dest[i] <= low) && (bitHigh == 0)) {
1202 //error bar found no clock...
1203 errBitHigh=1;
1204 }
1205 if (bitnum >= MaxBits) break;
1206 }
1207 *size = bitnum;
1208 return bestErrCnt;
1209 }
1210
1211 //by marshmellow
1212 //detects the bit clock for FSK given the high and low Field Clocks
1213 uint8_t detectFSKClk(uint8_t *BitStream, size_t size, uint8_t fcHigh, uint8_t fcLow)
1214 {
1215 uint8_t clk[] = {8,16,32,40,50,64,100,128,0};
1216 uint16_t rfLens[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
1217 uint8_t rfCnts[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
1218 uint8_t rfLensFnd = 0;
1219 uint8_t lastFCcnt = 0;
1220 uint16_t fcCounter = 0;
1221 uint16_t rfCounter = 0;
1222 uint8_t firstBitFnd = 0;
1223 size_t i;
1224 if (size == 0) return 0;
1225
1226 uint8_t fcTol = (uint8_t)(0.5+(float)(fcHigh-fcLow)/2);
1227 rfLensFnd=0;
1228 fcCounter=0;
1229 rfCounter=0;
1230 firstBitFnd=0;
1231 //PrintAndLog("DEBUG: fcTol: %d",fcTol);
1232 // prime i to first up transition
1233 for (i = 1; i < size-1; i++)
1234 if (BitStream[i] > BitStream[i-1] && BitStream[i]>=BitStream[i+1])
1235 break;
1236
1237 for (; i < size-1; i++){
1238 fcCounter++;
1239 rfCounter++;
1240
1241 if (BitStream[i] <= BitStream[i-1] || BitStream[i] < BitStream[i+1])
1242 continue;
1243 // else new peak
1244 // if we got less than the small fc + tolerance then set it to the small fc
1245 if (fcCounter < fcLow+fcTol)
1246 fcCounter = fcLow;
1247 else //set it to the large fc
1248 fcCounter = fcHigh;
1249
1250 //look for bit clock (rf/xx)
1251 if ((fcCounter < lastFCcnt || fcCounter > lastFCcnt)){
1252 //not the same size as the last wave - start of new bit sequence
1253 if (firstBitFnd > 1){ //skip first wave change - probably not a complete bit
1254 for (int ii=0; ii<15; ii++){
1255 if (rfLens[ii] == rfCounter){
1256 rfCnts[ii]++;
1257 rfCounter = 0;
1258 break;
1259 }
1260 }
1261 if (rfCounter > 0 && rfLensFnd < 15){
1262 //PrintAndLog("DEBUG: rfCntr %d, fcCntr %d",rfCounter,fcCounter);
1263 rfCnts[rfLensFnd]++;
1264 rfLens[rfLensFnd++] = rfCounter;
1265 }
1266 } else {
1267 firstBitFnd++;
1268 }
1269 rfCounter=0;
1270 lastFCcnt=fcCounter;
1271 }
1272 fcCounter=0;
1273 }
1274 uint8_t rfHighest=15, rfHighest2=15, rfHighest3=15;
1275
1276 for (i=0; i<15; i++){
1277 //PrintAndLog("DEBUG: RF %d, cnts %d",rfLens[i], rfCnts[i]);
1278 //get highest 2 RF values (might need to get more values to compare or compare all?)
1279 if (rfCnts[i]>rfCnts[rfHighest]){
1280 rfHighest3=rfHighest2;
1281 rfHighest2=rfHighest;
1282 rfHighest=i;
1283 } else if(rfCnts[i]>rfCnts[rfHighest2]){
1284 rfHighest3=rfHighest2;
1285 rfHighest2=i;
1286 } else if(rfCnts[i]>rfCnts[rfHighest3]){
1287 rfHighest3=i;
1288 }
1289 }
1290 // set allowed clock remainder tolerance to be 1 large field clock length+1
1291 // we could have mistakenly made a 9 a 10 instead of an 8 or visa versa so rfLens could be 1 FC off
1292 uint8_t tol1 = fcHigh+1;
1293
1294 //PrintAndLog("DEBUG: hightest: 1 %d, 2 %d, 3 %d",rfLens[rfHighest],rfLens[rfHighest2],rfLens[rfHighest3]);
1295
1296 // loop to find the highest clock that has a remainder less than the tolerance
1297 // compare samples counted divided by
1298 int ii=7;
1299 for (; ii>=0; ii--){
1300 if (rfLens[rfHighest] % clk[ii] < tol1 || rfLens[rfHighest] % clk[ii] > clk[ii]-tol1){
1301 if (rfLens[rfHighest2] % clk[ii] < tol1 || rfLens[rfHighest2] % clk[ii] > clk[ii]-tol1){
1302 if (rfLens[rfHighest3] % clk[ii] < tol1 || rfLens[rfHighest3] % clk[ii] > clk[ii]-tol1){
1303 break;
1304 }
1305 }
1306 }
1307 }
1308
1309 if (ii<0) return 0; // oops we went too far
1310
1311 return clk[ii];
1312 }
1313
1314 //by marshmellow
1315 //countFC is to detect the field clock lengths.
1316 //counts and returns the 2 most common wave lengths
1317 //mainly used for FSK field clock detection
1318 uint16_t countFC(uint8_t *BitStream, size_t size, uint8_t fskAdj)
1319 {
1320 uint8_t fcLens[] = {0,0,0,0,0,0,0,0,0,0};
1321 uint16_t fcCnts[] = {0,0,0,0,0,0,0,0,0,0};
1322 uint8_t fcLensFnd = 0;
1323 uint8_t lastFCcnt=0;
1324 uint8_t fcCounter = 0;
1325 size_t i;
1326 if (size == 0) return 0;
1327
1328 // prime i to first up transition
1329 for (i = 1; i < size-1; i++)
1330 if (BitStream[i] > BitStream[i-1] && BitStream[i] >= BitStream[i+1])
1331 break;
1332
1333 for (; i < size-1; i++){
1334 if (BitStream[i] > BitStream[i-1] && BitStream[i] >= BitStream[i+1]){
1335 // new up transition
1336 fcCounter++;
1337 if (fskAdj){
1338 //if we had 5 and now have 9 then go back to 8 (for when we get a fc 9 instead of an 8)
1339 if (lastFCcnt==5 && fcCounter==9) fcCounter--;
1340 //if fc=9 or 4 add one (for when we get a fc 9 instead of 10 or a 4 instead of a 5)
1341 if ((fcCounter==9) || fcCounter==4) fcCounter++;
1342 // save last field clock count (fc/xx)
1343 lastFCcnt = fcCounter;
1344 }
1345 // find which fcLens to save it to:
1346 for (int ii=0; ii<10; ii++){
1347 if (fcLens[ii]==fcCounter){
1348 fcCnts[ii]++;
1349 fcCounter=0;
1350 break;
1351 }
1352 }
1353 if (fcCounter>0 && fcLensFnd<10){
1354 //add new fc length
1355 fcCnts[fcLensFnd]++;
1356 fcLens[fcLensFnd++]=fcCounter;
1357 }
1358 fcCounter=0;
1359 } else {
1360 // count sample
1361 fcCounter++;
1362 }
1363 }
1364
1365 uint8_t best1=9, best2=9, best3=9;
1366 uint16_t maxCnt1=0;
1367 // go through fclens and find which ones are bigest 2
1368 for (i=0; i<10; i++){
1369 // PrintAndLog("DEBUG: FC %d, Cnt %d, Errs %d",fcLens[i],fcCnts[i],errCnt);
1370 // get the 3 best FC values
1371 if (fcCnts[i]>maxCnt1) {
1372 best3=best2;
1373 best2=best1;
1374 maxCnt1=fcCnts[i];
1375 best1=i;
1376 } else if(fcCnts[i]>fcCnts[best2]){
1377 best3=best2;
1378 best2=i;
1379 } else if(fcCnts[i]>fcCnts[best3]){
1380 best3=i;
1381 }
1382 }
1383 uint8_t fcH=0, fcL=0;
1384 if (fcLens[best1]>fcLens[best2]){
1385 fcH=fcLens[best1];
1386 fcL=fcLens[best2];
1387 } else{
1388 fcH=fcLens[best2];
1389 fcL=fcLens[best1];
1390 }
1391
1392 // TODO: take top 3 answers and compare to known Field clocks to get top 2
1393
1394 uint16_t fcs = (((uint16_t)fcH)<<8) | fcL;
1395 // PrintAndLog("DEBUG: Best %d best2 %d best3 %d",fcLens[best1],fcLens[best2],fcLens[best3]);
1396 if (fskAdj) return fcs;
1397 return fcLens[best1];
1398 }
1399
1400 //by marshmellow - demodulate PSK1 wave
1401 //uses wave lengths (# Samples)
1402 int pskRawDemod(uint8_t dest[], size_t *size, int *clock, int *invert)
1403 {
1404 if (size == 0) return -1;
1405 uint16_t loopCnt = 4096; //don't need to loop through entire array...
1406 if (*size<loopCnt) loopCnt = *size;
1407
1408 uint8_t curPhase = *invert;
1409 size_t i, waveStart=1, waveEnd=0, firstFullWave=0, lastClkBit=0;
1410 uint8_t fc=0, fullWaveLen=0, tol=1;
1411 uint16_t errCnt=0, waveLenCnt=0;
1412 fc = countFC(dest, *size, 0);
1413 if (fc!=2 && fc!=4 && fc!=8) return -1;
1414 //PrintAndLog("DEBUG: FC: %d",fc);
1415 *clock = DetectPSKClock(dest, *size, *clock);
1416 if (*clock == 0) return -1;
1417 int avgWaveVal=0, lastAvgWaveVal=0;
1418 //find first phase shift
1419 for (i=0; i<loopCnt; i++){
1420 if (dest[i]+fc < dest[i+1] && dest[i+1] >= dest[i+2]){
1421 waveEnd = i+1;
1422 //PrintAndLog("DEBUG: waveEnd: %d",waveEnd);
1423 waveLenCnt = waveEnd-waveStart;
1424 if (waveLenCnt > fc && waveStart > fc){ //not first peak and is a large wave
1425 lastAvgWaveVal = avgWaveVal/(waveLenCnt);
1426 firstFullWave = waveStart;
1427 fullWaveLen=waveLenCnt;
1428 //if average wave value is > graph 0 then it is an up wave or a 1
1429 if (lastAvgWaveVal > 123) curPhase ^= 1; //fudge graph 0 a little 123 vs 128
1430 break;
1431 }
1432 waveStart = i+1;
1433 avgWaveVal = 0;
1434 }
1435 avgWaveVal += dest[i+2];
1436 }
1437 //PrintAndLog("DEBUG: firstFullWave: %d, waveLen: %d",firstFullWave,fullWaveLen);
1438 lastClkBit = firstFullWave; //set start of wave as clock align
1439 //PrintAndLog("DEBUG: clk: %d, lastClkBit: %d", *clock, lastClkBit);
1440 waveStart = 0;
1441 size_t numBits=0;
1442 //set skipped bits
1443 memset(dest, curPhase^1, firstFullWave / *clock);
1444 numBits += (firstFullWave / *clock);
1445 dest[numBits++] = curPhase; //set first read bit
1446 for (i = firstFullWave + fullWaveLen - 1; i < *size-3; i++){
1447 //top edge of wave = start of new wave
1448 if (dest[i]+fc < dest[i+1] && dest[i+1] >= dest[i+2]){
1449 if (waveStart == 0) {
1450 waveStart = i+1;
1451 waveLenCnt = 0;
1452 avgWaveVal = dest[i+1];
1453 } else { //waveEnd
1454 waveEnd = i+1;
1455 waveLenCnt = waveEnd-waveStart;
1456 lastAvgWaveVal = avgWaveVal/waveLenCnt;
1457 if (waveLenCnt > fc){
1458 //PrintAndLog("DEBUG: avgWaveVal: %d, waveSum: %d",lastAvgWaveVal,avgWaveVal);
1459 //this wave is a phase shift
1460 //PrintAndLog("DEBUG: phase shift at: %d, len: %d, nextClk: %d, i: %d, fc: %d",waveStart,waveLenCnt,lastClkBit+*clock-tol,i+1,fc);
1461 if (i+1 >= lastClkBit + *clock - tol){ //should be a clock bit
1462 curPhase ^= 1;
1463 dest[numBits++] = curPhase;
1464 lastClkBit += *clock;
1465 } else if (i < lastClkBit+10+fc){
1466 //noise after a phase shift - ignore
1467 } else { //phase shift before supposed to based on clock
1468 errCnt++;
1469 dest[numBits++] = 7;
1470 }
1471 } else if (i+1 > lastClkBit + *clock + tol + fc){
1472 lastClkBit += *clock; //no phase shift but clock bit
1473 dest[numBits++] = curPhase;
1474 }
1475 avgWaveVal = 0;
1476 waveStart = i+1;
1477 }
1478 }
1479 avgWaveVal += dest[i+1];
1480 }
1481 *size = numBits;
1482 return errCnt;
1483 }
Impressum, Datenschutz