]>
Commit | Line | Data |
---|---|---|
eb191de6 | 1 | //----------------------------------------------------------------------------- |
ba1a299c | 2 | // Copyright (C) 2014 |
eb191de6 | 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 | //----------------------------------------------------------------------------- | |
bf74114d | 8 | // Low frequency demod/decode commands - by marshmellow, holiman, iceman and |
9 | // many others who came before | |
4d3c1796 | 10 | // |
11 | // NOTES: | |
12 | // LF Demod functions are placed here to allow the flexability to use client or | |
43591e64 | 13 | // device side. Most BUT NOT ALL of these functions are currently safe for |
14 | // device side use. (DetectST for example...) | |
4d3c1796 | 15 | // |
16 | // There are likely many improvements to the code that could be made, please | |
17 | // make suggestions... | |
18 | // | |
bf74114d | 19 | // we tried to include author comments so any questions could be directed to |
20 | // the source. | |
21 | // | |
4d3c1796 | 22 | // There are 4 main sections of code below: |
23 | // Utilities Section: | |
24 | // for general utilities used by multiple other functions | |
4d3c1796 | 25 | // Clock / Bitrate Detection Section: |
26 | // for clock detection functions for each modulation | |
d5051b98 | 27 | // Modulation Demods &/or Decoding Section: |
28 | // for main general modulation demodulating and encoding decoding code. | |
4d3c1796 | 29 | // Tag format detection section: |
30 | // for detection of specific tag formats within demodulated data | |
31 | // | |
32 | // marshmellow | |
eb191de6 | 33 | //----------------------------------------------------------------------------- |
34 | ||
d5051b98 | 35 | #include <string.h> // for memset, memcmp and size_t |
b97311b1 | 36 | #include "lfdemod.h" |
d5051b98 | 37 | #include <stdint.h> // for uint_32+ |
38 | #include <stdbool.h> // for bool | |
f2ea55fb | 39 | #include "parity.h" // for parity test |
6fe5c94b | 40 | |
d5051b98 | 41 | //********************************************************************************************** |
42 | //---------------------------------Utilities Section-------------------------------------------- | |
43 | //********************************************************************************************** | |
56de46b4 | 44 | #define LOWEST_DEFAULT_CLOCK 32 |
6f36848f | 45 | #define FSK_PSK_THRESHOLD 123 |
ec187c2f | 46 | |
d1869c33 | 47 | //to allow debug print calls when used not on device |
6fe5c94b | 48 | void dummy(char *fmt, ...){} |
6fe5c94b | 49 | #ifndef ON_DEVICE |
50 | #include "ui.h" | |
709665b5 | 51 | #include "cmdparser.h" |
52 | #include "cmddata.h" | |
6fe5c94b | 53 | #define prnt PrintAndLog |
54 | #else | |
709665b5 | 55 | uint8_t g_debugMode=0; |
6fe5c94b | 56 | #define prnt dummy |
57 | #endif | |
6fe5c94b | 58 | |
bf74114d | 59 | uint8_t justNoise(uint8_t *BitStream, size_t size) { |
a1d17964 | 60 | //test samples are not just noise |
61 | uint8_t justNoise1 = 1; | |
62 | for(size_t idx=0; idx < size && justNoise1 ;idx++){ | |
6f36848f | 63 | justNoise1 = BitStream[idx] < FSK_PSK_THRESHOLD; |
a1d17964 | 64 | } |
65 | return justNoise1; | |
66 | } | |
67 | ||
1e090a61 | 68 | //by marshmellow |
872e3d4d | 69 | //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 |
bf74114d | 70 | int getHiLo(uint8_t *BitStream, size_t size, int *high, int *low, uint8_t fuzzHi, uint8_t fuzzLo) { |
1e090a61 | 71 | *high=0; |
72 | *low=255; | |
73 | // get high and low thresholds | |
2eec55c8 | 74 | for (size_t i=0; i < size; i++){ |
1e090a61 | 75 | if (BitStream[i] > *high) *high = BitStream[i]; |
76 | if (BitStream[i] < *low) *low = BitStream[i]; | |
77 | } | |
6f36848f | 78 | if (*high < FSK_PSK_THRESHOLD) return -1; // just noise |
75cbbe9a | 79 | *high = ((*high-128)*fuzzHi + 12800)/100; |
80 | *low = ((*low-128)*fuzzLo + 12800)/100; | |
1e090a61 | 81 | return 1; |
82 | } | |
83 | ||
a1d17964 | 84 | // by marshmellow |
85 | // pass bits to be tested in bits, length bits passed in bitLen, and parity type (even=0 | odd=1) in pType | |
86 | // returns 1 if passed | |
f2ea55fb | 87 | bool parityTest(uint32_t bits, uint8_t bitLen, uint8_t pType) { |
88 | return oddparity32(bits) ^ pType; | |
a1d17964 | 89 | } |
90 | ||
709665b5 | 91 | // by marshmellow |
f2ea55fb | 92 | // takes a array of binary values, start position, length of bits per parity (includes parity bit - MAX 32), |
93 | // Parity Type (1 for odd; 0 for even; 2 for Always 1's; 3 for Always 0's), and binary Length (length to run) | |
bf74114d | 94 | size_t removeParity(uint8_t *BitStream, size_t startIdx, uint8_t pLen, uint8_t pType, size_t bLen) { |
709665b5 | 95 | uint32_t parityWd = 0; |
f2ea55fb | 96 | size_t bitCnt = 0; |
e39a92bb | 97 | for (int word = 0; word < (bLen); word+=pLen) { |
98 | for (int bit=0; bit < pLen; bit++) { | |
f2ea55fb | 99 | if (word+bit >= bLen) break; |
709665b5 | 100 | parityWd = (parityWd << 1) | BitStream[startIdx+word+bit]; |
f2ea55fb | 101 | BitStream[bitCnt++] = (BitStream[startIdx+word+bit]); |
709665b5 | 102 | } |
e88096ba | 103 | if (word+pLen > bLen) break; |
e39a92bb | 104 | |
f2ea55fb | 105 | bitCnt--; // overwrite parity with next data |
709665b5 | 106 | // if parity fails then return 0 |
88e85bde | 107 | switch (pType) { |
f2ea55fb | 108 | case 3: if (BitStream[bitCnt]==1) {return 0;} break; //should be 0 spacer bit |
109 | case 2: if (BitStream[bitCnt]==0) {return 0;} break; //should be 1 spacer bit | |
29435274 | 110 | default: if (parityTest(parityWd, pLen, pType) == 0) {return 0;} break; //test parity |
709665b5 | 111 | } |
709665b5 | 112 | parityWd = 0; |
113 | } | |
114 | // if we got here then all the parities passed | |
f2ea55fb | 115 | //return size |
709665b5 | 116 | return bitCnt; |
117 | } | |
118 | ||
119 | // by marshmellow | |
120 | // takes a array of binary values, length of bits per parity (includes parity bit), | |
88e85bde | 121 | // Parity Type (1 for odd; 0 for even; 2 Always 1's; 3 Always 0's), and binary Length (length to run) |
122 | // Make sure *dest is long enough to store original sourceLen + #_of_parities_to_be_added | |
bf74114d | 123 | size_t addParity(uint8_t *BitSource, uint8_t *dest, uint8_t sourceLen, uint8_t pLen, uint8_t pType) { |
709665b5 | 124 | uint32_t parityWd = 0; |
125 | size_t j = 0, bitCnt = 0; | |
126 | for (int word = 0; word < sourceLen; word+=pLen-1) { | |
127 | for (int bit=0; bit < pLen-1; bit++){ | |
128 | parityWd = (parityWd << 1) | BitSource[word+bit]; | |
129 | dest[j++] = (BitSource[word+bit]); | |
130 | } | |
131 | // if parity fails then return 0 | |
88e85bde | 132 | switch (pType) { |
133 | case 3: dest[j++]=0; break; // marker bit which should be a 0 | |
134 | case 2: dest[j++]=1; break; // marker bit which should be a 1 | |
135 | default: | |
136 | dest[j++] = parityTest(parityWd, pLen-1, pType) ^ 1; | |
137 | break; | |
709665b5 | 138 | } |
139 | bitCnt += pLen; | |
140 | parityWd = 0; | |
141 | } | |
142 | // if we got here then all the parities passed | |
143 | //return ID start index and size | |
144 | return bitCnt; | |
145 | } | |
146 | ||
bf74114d | 147 | uint32_t bytebits_to_byte(uint8_t *src, size_t numbits) { |
709665b5 | 148 | uint32_t num = 0; |
149 | for(int i = 0 ; i < numbits ; i++) | |
150 | { | |
151 | num = (num << 1) | (*src); | |
152 | src++; | |
153 | } | |
154 | return num; | |
155 | } | |
156 | ||
157 | //least significant bit first | |
bf74114d | 158 | uint32_t bytebits_to_byteLSBF(uint8_t *src, size_t numbits) { |
709665b5 | 159 | uint32_t num = 0; |
160 | for(int i = 0 ; i < numbits ; i++) | |
161 | { | |
162 | num = (num << 1) | *(src + (numbits-(i+1))); | |
163 | } | |
164 | return num; | |
165 | } | |
166 | ||
e88096ba | 167 | // search for given preamble in given BitStream and return success=1 or fail=0 and startIndex (where it was found) and length if not fineone |
168 | // fineone does not look for a repeating preamble for em4x05/4x69 sends preamble once, so look for it once in the first pLen bits | |
169 | bool preambleSearchEx(uint8_t *BitStream, uint8_t *preamble, size_t pLen, size_t *size, size_t *startIdx, bool findone) { | |
59f726c9 | 170 | // Sanity check. If preamble length is bigger than bitstream length. |
e88096ba | 171 | if ( *size <= pLen ) return false; |
59f726c9 | 172 | |
e88096ba | 173 | uint8_t foundCnt = 0; |
174 | for (size_t idx = 0; idx < *size - pLen; idx++) { | |
175 | if (memcmp(BitStream+idx, preamble, pLen) == 0) { | |
e0165dcf | 176 | //first index found |
177 | foundCnt++; | |
e88096ba | 178 | if (foundCnt == 1) { |
179 | if (g_debugMode) prnt("DEBUG: preamble found at %u", idx); | |
e0165dcf | 180 | *startIdx = idx; |
e88096ba | 181 | if (findone) return true; |
182 | } else if (foundCnt == 2) { | |
e0165dcf | 183 | *size = idx - *startIdx; |
e88096ba | 184 | return true; |
e0165dcf | 185 | } |
186 | } | |
187 | } | |
4c6ccc2b | 188 | return false; |
189 | } | |
190 | ||
bf74114d | 191 | //by marshmellow |
192 | //search for given preamble in given BitStream and return success=1 or fail=0 and startIndex and length | |
193 | uint8_t preambleSearch(uint8_t *BitStream, uint8_t *preamble, size_t pLen, size_t *size, size_t *startIdx) { | |
194 | return (preambleSearchEx(BitStream, preamble, pLen, size, startIdx, false)) ? 1 : 0; | |
195 | } | |
196 | ||
34ff8985 | 197 | // find start of modulating data (for fsk and psk) in case of beginning noise or slow chip startup. |
6f36848f | 198 | size_t findModStart(uint8_t dest[], size_t size, uint8_t expWaveSize) { |
34ff8985 | 199 | size_t i = 0; |
200 | size_t waveSizeCnt = 0; | |
201 | uint8_t thresholdCnt = 0; | |
6f36848f | 202 | bool isAboveThreshold = dest[i++] >= FSK_PSK_THRESHOLD; |
34ff8985 | 203 | for (; i < size-20; i++ ) { |
6f36848f | 204 | if(dest[i] < FSK_PSK_THRESHOLD && isAboveThreshold) { |
34ff8985 | 205 | thresholdCnt++; |
206 | if (thresholdCnt > 2 && waveSizeCnt < expWaveSize+1) break; | |
207 | isAboveThreshold = false; | |
208 | waveSizeCnt = 0; | |
6f36848f | 209 | } else if (dest[i] >= FSK_PSK_THRESHOLD && !isAboveThreshold) { |
34ff8985 | 210 | thresholdCnt++; |
211 | if (thresholdCnt > 2 && waveSizeCnt < expWaveSize+1) break; | |
212 | isAboveThreshold = true; | |
213 | waveSizeCnt = 0; | |
214 | } else { | |
215 | waveSizeCnt++; | |
216 | } | |
217 | if (thresholdCnt > 10) break; | |
218 | } | |
219 | if (g_debugMode == 2) prnt("DEBUG: threshold Count reached at %u, count: %u",i, thresholdCnt); | |
220 | return i; | |
221 | } | |
222 | ||
56de46b4 | 223 | int getClosestClock(int testclk) { |
224 | uint8_t fndClk[] = {8,16,32,40,50,64,128}; | |
225 | ||
226 | for (uint8_t clkCnt = 0; clkCnt<7; clkCnt++) | |
227 | if (testclk >= fndClk[clkCnt]-(fndClk[clkCnt]/8) && testclk <= fndClk[clkCnt]+1) | |
228 | return fndClk[clkCnt]; | |
229 | ||
230 | return 0; | |
231 | } | |
232 | ||
233 | void getNextLow(uint8_t samples[], size_t size, int low, size_t *i) { | |
d87bf156 | 234 | while ((samples[*i] > low) && (*i < size)) |
235 | *i+=1; | |
236 | } | |
237 | ||
56de46b4 | 238 | void getNextHigh(uint8_t samples[], size_t size, int high, size_t *i) { |
d87bf156 | 239 | while ((samples[*i] < high) && (*i < size)) |
240 | *i+=1; | |
241 | } | |
242 | ||
243 | // load wave counters | |
244 | bool loadWaveCounters(uint8_t samples[], size_t size, int lowToLowWaveLen[], int highToLowWaveLen[], int *waveCnt, int *skip, int *minClk, int *high, int *low) { | |
56de46b4 | 245 | size_t i=0, firstLow, firstHigh; |
d87bf156 | 246 | size_t testsize = (size < 512) ? size : 512; |
247 | ||
248 | if ( getHiLo(samples, testsize, high, low, 80, 80) == -1 ) { | |
249 | if (g_debugMode==2) prnt("DEBUG STT: just noise detected - quitting"); | |
250 | return false; //just noise | |
251 | } | |
252 | ||
253 | // get to first full low to prime loop and skip incomplete first pulse | |
254 | getNextHigh(samples, size, *high, &i); | |
255 | getNextLow(samples, size, *low, &i); | |
256 | *skip = i; | |
257 | ||
258 | // populate tmpbuff buffer with pulse lengths | |
259 | while (i < size) { | |
260 | // measure from low to low | |
56de46b4 | 261 | firstLow = i; |
d87bf156 | 262 | //find first high point for this wave |
263 | getNextHigh(samples, size, *high, &i); | |
56de46b4 | 264 | firstHigh = i; |
d87bf156 | 265 | |
266 | getNextLow(samples, size, *low, &i); | |
267 | ||
56de46b4 | 268 | if (*waveCnt >= (size/LOWEST_DEFAULT_CLOCK)) |
d87bf156 | 269 | break; |
270 | ||
56de46b4 | 271 | highToLowWaveLen[*waveCnt] = i - firstHigh; //first high to first low |
272 | lowToLowWaveLen[*waveCnt] = i - firstLow; | |
d87bf156 | 273 | *waveCnt += 1; |
56de46b4 | 274 | if (i-firstLow < *minClk && i < size) { |
275 | *minClk = i - firstLow; | |
d87bf156 | 276 | } |
277 | } | |
278 | return true; | |
279 | } | |
280 | ||
b97311b1 | 281 | size_t pskFindFirstPhaseShift(uint8_t samples[], size_t size, uint8_t *curPhase, size_t waveStart, uint16_t fc, uint16_t *fullWaveLen) { |
282 | uint16_t loopCnt = (size+3 < 4096) ? size : 4096; //don't need to loop through entire array... | |
283 | ||
284 | uint16_t avgWaveVal=0, lastAvgWaveVal=0; | |
285 | size_t i = waveStart, waveEnd, waveLenCnt, firstFullWave; | |
286 | for (; i<loopCnt; i++) { | |
287 | // find peak // was "samples[i] + fc" but why? must have been used to weed out some wave error... removed.. | |
288 | if (samples[i] < samples[i+1] && samples[i+1] >= samples[i+2]){ | |
289 | waveEnd = i+1; | |
290 | if (g_debugMode == 2) prnt("DEBUG PSK: waveEnd: %u, waveStart: %u", waveEnd, waveStart); | |
291 | waveLenCnt = waveEnd-waveStart; | |
292 | if (waveLenCnt > fc && waveStart > fc && !(waveLenCnt > fc+8)){ //not first peak and is a large wave but not out of whack | |
293 | lastAvgWaveVal = avgWaveVal/(waveLenCnt); | |
294 | firstFullWave = waveStart; | |
295 | *fullWaveLen = waveLenCnt; | |
296 | //if average wave value is > graph 0 then it is an up wave or a 1 (could cause inverting) | |
297 | if (lastAvgWaveVal > FSK_PSK_THRESHOLD) *curPhase ^= 1; | |
298 | return firstFullWave; | |
299 | } | |
300 | waveStart = i+1; | |
301 | avgWaveVal = 0; | |
302 | } | |
303 | avgWaveVal += samples[i+2]; | |
304 | } | |
305 | return 0; | |
306 | } | |
307 | ||
2147c307 | 308 | //by marshmellow |
4d3c1796 | 309 | //amplify based on ask edge detection - not accurate enough to use all the time |
310 | void askAmp(uint8_t *BitStream, size_t size) { | |
16ea2b8c | 311 | uint8_t Last = 128; |
fef74fdc | 312 | for(size_t i = 1; i<size; i++){ |
313 | if (BitStream[i]-BitStream[i-1]>=30) //large jump up | |
16ea2b8c | 314 | Last = 255; |
315 | else if(BitStream[i-1]-BitStream[i]>=20) //large jump down | |
316 | Last = 0; | |
317 | ||
318 | BitStream[i-1] = Last; | |
fef74fdc | 319 | } |
320 | return; | |
321 | } | |
f822a063 | 322 | |
3606ac0a | 323 | uint32_t manchesterEncode2Bytes(uint16_t datain) { |
324 | uint32_t output = 0; | |
325 | uint8_t curBit = 0; | |
326 | for (uint8_t i=0; i<16; i++) { | |
327 | curBit = (datain >> (15-i) & 1); | |
328 | output |= (1<<(((15-i)*2)+curBit)); | |
329 | } | |
330 | return output; | |
331 | } | |
332 | ||
fef74fdc | 333 | //by marshmellow |
334 | //encode binary data into binary manchester | |
86b8ecb5 | 335 | //NOTE: BitStream must have triple the size of "size" available in memory to do the swap |
4d3c1796 | 336 | int ManchesterEncode(uint8_t *BitStream, size_t size) { |
86b8ecb5 | 337 | //allow up to 4K out (means BitStream must be at least 2048+4096 to handle the swap) |
338 | size = (size>2048) ? 2048 : size; | |
339 | size_t modIdx = size; | |
340 | size_t i; | |
fef74fdc | 341 | for (size_t idx=0; idx < size; idx++){ |
342 | BitStream[idx+modIdx++] = BitStream[idx]; | |
343 | BitStream[idx+modIdx++] = BitStream[idx]^1; | |
344 | } | |
86b8ecb5 | 345 | for (i=0; i<(size*2); i++){ |
4d3c1796 | 346 | BitStream[i] = BitStream[i+size]; |
fef74fdc | 347 | } |
348 | return i; | |
349 | } | |
350 | ||
d5051b98 | 351 | // by marshmellow |
352 | // to detect a wave that has heavily clipped (clean) samples | |
353 | uint8_t DetectCleanAskWave(uint8_t dest[], size_t size, uint8_t high, uint8_t low) { | |
354 | bool allArePeaks = true; | |
355 | uint16_t cntPeaks=0; | |
356 | size_t loopEnd = 512+160; | |
357 | if (loopEnd > size) loopEnd = size; | |
358 | for (size_t i=160; i<loopEnd; i++){ | |
359 | if (dest[i]>low && dest[i]<high) | |
360 | allArePeaks = false; | |
361 | else | |
362 | cntPeaks++; | |
bf74114d | 363 | } |
d5051b98 | 364 | if (!allArePeaks){ |
365 | if (cntPeaks > 300) return true; | |
366 | } | |
367 | return allArePeaks; | |
bf74114d | 368 | } |
4d3c1796 | 369 | |
d5051b98 | 370 | //********************************************************************************************** |
371 | //-------------------Clock / Bitrate Detection Section------------------------------------------ | |
372 | //********************************************************************************************** | |
373 | ||
374 | // by marshmellow | |
375 | // to help detect clocks on heavily clipped samples | |
376 | // based on count of low to low | |
56de46b4 | 377 | int DetectStrongAskClock(uint8_t dest[], size_t size, int high, int low, int *clock) { |
d5051b98 | 378 | size_t startwave; |
379 | size_t i = 100; | |
380 | size_t minClk = 255; | |
381 | int shortestWaveIdx = 0; | |
382 | // get to first full low to prime loop and skip incomplete first pulse | |
56de46b4 | 383 | getNextHigh(dest, size, high, &i); |
384 | getNextLow(dest, size, low, &i); | |
4d3c1796 | 385 | |
d5051b98 | 386 | // loop through all samples |
387 | while (i < size) { | |
4d3c1796 | 388 | // measure from low to low |
d5051b98 | 389 | startwave = i; |
56de46b4 | 390 | |
391 | getNextHigh(dest, size, high, &i); | |
392 | getNextLow(dest, size, low, &i); | |
d5051b98 | 393 | //get minimum measured distance |
394 | if (i-startwave < minClk && i < size) { | |
395 | minClk = i - startwave; | |
396 | shortestWaveIdx = startwave; | |
4d3c1796 | 397 | } |
398 | } | |
d5051b98 | 399 | // set clock |
56de46b4 | 400 | if (g_debugMode==2) prnt("DEBUG ASK: DetectStrongAskClock smallest wave: %d",minClk); |
401 | *clock = getClosestClock(minClk); | |
402 | if (*clock == 0) | |
403 | return 0; | |
404 | ||
405 | return shortestWaveIdx; | |
d5051b98 | 406 | } |
4d3c1796 | 407 | |
d5051b98 | 408 | // by marshmellow |
409 | // not perfect especially with lower clocks or VERY good antennas (heavy wave clipping) | |
410 | // maybe somehow adjust peak trimming value based on samples to fix? | |
411 | // return start index of best starting position for that clock and return clock (by reference) | |
412 | int DetectASKClock(uint8_t dest[], size_t size, int *clock, int maxErr) { | |
413 | size_t i=1; | |
414 | uint8_t clk[] = {255,8,16,32,40,50,64,100,128,255}; | |
415 | uint8_t clkEnd = 9; | |
416 | uint8_t loopCnt = 255; //don't need to loop through entire array... | |
417 | if (size <= loopCnt+60) return -1; //not enough samples | |
418 | size -= 60; //sometimes there is a strange end wave - filter out this.... | |
419 | //if we already have a valid clock | |
420 | uint8_t clockFnd=0; | |
421 | for (;i<clkEnd;++i) | |
422 | if (clk[i] == *clock) clockFnd = i; | |
423 | //clock found but continue to find best startpos | |
424 | ||
425 | //get high and low peak | |
426 | int peak, low; | |
427 | if (getHiLo(dest, loopCnt, &peak, &low, 75, 75) < 1) return -1; | |
4d3c1796 | 428 | |
d5051b98 | 429 | //test for large clean peaks |
430 | if (!clockFnd){ | |
431 | if (DetectCleanAskWave(dest, size, peak, low)==1){ | |
432 | int ans = DetectStrongAskClock(dest, size, peak, low, clock); | |
433 | if (g_debugMode==2) prnt("DEBUG ASK: detectaskclk Clean Ask Wave Detected: clk %i, ShortestWave: %i",clock, ans); | |
434 | if (ans > 0) { | |
435 | return ans; //return shortest wave start position | |
4d3c1796 | 436 | } |
4d3c1796 | 437 | } |
d5051b98 | 438 | } |
439 | uint8_t ii; | |
440 | uint8_t clkCnt, tol = 0; | |
441 | uint16_t bestErr[]={1000,1000,1000,1000,1000,1000,1000,1000,1000}; | |
442 | uint8_t bestStart[]={0,0,0,0,0,0,0,0,0}; | |
443 | size_t errCnt = 0; | |
444 | size_t arrLoc, loopEnd; | |
4d3c1796 | 445 | |
d5051b98 | 446 | if (clockFnd>0) { |
447 | clkCnt = clockFnd; | |
448 | clkEnd = clockFnd+1; | |
4d3c1796 | 449 | } |
d5051b98 | 450 | else clkCnt=1; |
4d3c1796 | 451 | |
d5051b98 | 452 | //test each valid clock from smallest to greatest to see which lines up |
453 | for(; clkCnt < clkEnd; clkCnt++){ | |
454 | if (clk[clkCnt] <= 32){ | |
455 | tol=1; | |
456 | }else{ | |
457 | tol=0; | |
ba1a299c | 458 | } |
d5051b98 | 459 | //if no errors allowed - keep start within the first clock |
460 | if (!maxErr && size > clk[clkCnt]*2 + tol && clk[clkCnt]<128) loopCnt=clk[clkCnt]*2; | |
461 | bestErr[clkCnt]=1000; | |
462 | //try lining up the peaks by moving starting point (try first few clocks) | |
463 | for (ii=0; ii < loopCnt; ii++){ | |
464 | if (dest[ii] < peak && dest[ii] > low) continue; | |
11081e04 | 465 | |
d5051b98 | 466 | errCnt=0; |
467 | // now that we have the first one lined up test rest of wave array | |
468 | loopEnd = ((size-ii-tol) / clk[clkCnt]) - 1; | |
469 | for (i=0; i < loopEnd; ++i){ | |
470 | arrLoc = ii + (i * clk[clkCnt]); | |
471 | if (dest[arrLoc] >= peak || dest[arrLoc] <= low){ | |
472 | }else if (dest[arrLoc-tol] >= peak || dest[arrLoc-tol] <= low){ | |
473 | }else if (dest[arrLoc+tol] >= peak || dest[arrLoc+tol] <= low){ | |
474 | }else{ //error no peak detected | |
475 | errCnt++; | |
476 | } | |
477 | } | |
478 | //if we found no errors then we can stop here and a low clock (common clocks) | |
479 | // this is correct one - return this clock | |
480 | if (g_debugMode == 2) prnt("DEBUG ASK: clk %d, err %d, startpos %d, endpos %d",clk[clkCnt],errCnt,ii,i); | |
481 | if(errCnt==0 && clkCnt<7) { | |
482 | if (!clockFnd) *clock = clk[clkCnt]; | |
483 | return ii; | |
484 | } | |
485 | //if we found errors see if it is lowest so far and save it as best run | |
486 | if(errCnt<bestErr[clkCnt]){ | |
487 | bestErr[clkCnt]=errCnt; | |
488 | bestStart[clkCnt]=ii; | |
489 | } | |
4d3c1796 | 490 | } |
11081e04 | 491 | } |
d5051b98 | 492 | uint8_t iii; |
493 | uint8_t best=0; | |
494 | for (iii=1; iii<clkEnd; ++iii){ | |
495 | if (bestErr[iii] < bestErr[best]){ | |
496 | if (bestErr[iii] == 0) bestErr[iii]=1; | |
497 | // current best bit to error ratio vs new bit to error ratio | |
498 | if ( (size/clk[best])/bestErr[best] < (size/clk[iii])/bestErr[iii] ){ | |
499 | best = iii; | |
500 | } | |
4d3c1796 | 501 | } |
d5051b98 | 502 | if (g_debugMode == 2) prnt("DEBUG ASK: clk %d, # Errors %d, Current Best Clk %d, bestStart %d",clk[iii],bestErr[iii],clk[best],bestStart[best]); |
4d3c1796 | 503 | } |
d5051b98 | 504 | if (!clockFnd) *clock = clk[best]; |
505 | return bestStart[best]; | |
11081e04 | 506 | } |
507 | ||
0e2ddb41 | 508 | int DetectStrongNRZClk(uint8_t *dest, size_t size, int peak, int low, bool *strong) { |
d5051b98 | 509 | //find shortest transition from high to low |
0e2ddb41 | 510 | *strong = false; |
d5051b98 | 511 | size_t i = 0; |
512 | size_t transition1 = 0; | |
513 | int lowestTransition = 255; | |
514 | bool lastWasHigh = false; | |
0e2ddb41 | 515 | size_t transitionSampleCount = 0; |
d5051b98 | 516 | //find first valid beginning of a high or low wave |
517 | while ((dest[i] >= peak || dest[i] <= low) && (i < size)) | |
518 | ++i; | |
519 | while ((dest[i] < peak && dest[i] > low) && (i < size)) | |
520 | ++i; | |
521 | lastWasHigh = (dest[i] >= peak); | |
522 | ||
523 | if (i==size) return 0; | |
524 | transition1 = i; | |
525 | ||
526 | for (;i < size; i++) { | |
527 | if ((dest[i] >= peak && !lastWasHigh) || (dest[i] <= low && lastWasHigh)) { | |
528 | lastWasHigh = (dest[i] >= peak); | |
529 | if (i-transition1 < lowestTransition) lowestTransition = i-transition1; | |
530 | transition1 = i; | |
0e2ddb41 | 531 | } else if (dest[i] < peak && dest[i] > low) { |
532 | transitionSampleCount++; | |
d5051b98 | 533 | } |
4d3c1796 | 534 | } |
d5051b98 | 535 | if (lowestTransition == 255) lowestTransition = 0; |
536 | if (g_debugMode==2) prnt("DEBUG NRZ: detectstrongNRZclk smallest wave: %d",lowestTransition); | |
0e2ddb41 | 537 | // if less than 10% of the samples were not peaks (or 90% were peaks) then we have a strong wave |
538 | if (transitionSampleCount / size < 10) { | |
539 | *strong = true; | |
540 | lowestTransition = getClosestClock(lowestTransition); | |
541 | } | |
d5051b98 | 542 | return lowestTransition; |
4d3c1796 | 543 | } |
544 | ||
545 | //by marshmellow | |
d5051b98 | 546 | //detect nrz clock by reading #peaks vs no peaks(or errors) |
6f36848f | 547 | int DetectNRZClock(uint8_t dest[], size_t size, int clock, size_t *clockStartIdx) { |
d5051b98 | 548 | size_t i=0; |
549 | uint8_t clk[]={8,16,32,40,50,64,100,128,255}; | |
550 | size_t loopCnt = 4096; //don't need to loop through entire array... | |
551 | if (size == 0) return 0; | |
552 | if (size<loopCnt) loopCnt = size-20; | |
553 | //if we already have a valid clock quit | |
554 | for (; i < 8; ++i) | |
555 | if (clk[i] == clock) return clock; | |
556 | ||
557 | //get high and low peak | |
558 | int peak, low; | |
bf85d22f | 559 | if (getHiLo(dest, loopCnt, &peak, &low, 90, 90) < 1) return 0; |
d5051b98 | 560 | |
0e2ddb41 | 561 | bool strong = false; |
562 | int lowestTransition = DetectStrongNRZClk(dest, size-20, peak, low, &strong); | |
563 | if (strong) return lowestTransition; | |
d5051b98 | 564 | size_t ii; |
565 | uint8_t clkCnt; | |
566 | uint8_t tol = 0; | |
567 | uint16_t smplCnt = 0; | |
568 | int16_t peakcnt = 0; | |
569 | int16_t peaksdet[] = {0,0,0,0,0,0,0,0}; | |
b97311b1 | 570 | uint16_t minPeak = 255; |
571 | bool firstpeak = true; | |
572 | //test for large clipped waves - ignore first peak | |
573 | for (i=0; i<loopCnt; i++) { | |
574 | if (dest[i] >= peak || dest[i] <= low) { | |
575 | if (firstpeak) continue; | |
4d3c1796 | 576 | smplCnt++; |
d5051b98 | 577 | } else { |
b97311b1 | 578 | firstpeak = false; |
579 | if (smplCnt > 0) { | |
580 | if (minPeak > smplCnt && smplCnt > 7) minPeak = smplCnt; | |
d5051b98 | 581 | peakcnt++; |
b97311b1 | 582 | if (g_debugMode == 2) prnt("DEBUG NRZ: minPeak: %d, smplCnt: %d, peakcnt: %d",minPeak,smplCnt,peakcnt); |
583 | smplCnt = 0; | |
4d3c1796 | 584 | } |
585 | } | |
586 | } | |
b97311b1 | 587 | if (minPeak < 8) return 0; |
d5051b98 | 588 | bool errBitHigh = 0; |
589 | bool bitHigh = 0; | |
590 | uint8_t ignoreCnt = 0; | |
591 | uint8_t ignoreWindow = 4; | |
592 | bool lastPeakHigh = 0; | |
593 | int lastBit = 0; | |
594 | size_t bestStart[]={0,0,0,0,0,0,0,0,0}; | |
595 | peakcnt=0; | |
596 | //test each valid clock from smallest to greatest to see which lines up | |
b97311b1 | 597 | for(clkCnt=0; clkCnt < 8; ++clkCnt) { |
d5051b98 | 598 | //ignore clocks smaller than smallest peak |
b97311b1 | 599 | if (clk[clkCnt] < minPeak - (clk[clkCnt]/4)) continue; |
d5051b98 | 600 | //try lining up the peaks by moving starting point (try first 256) |
b97311b1 | 601 | for (ii=20; ii < loopCnt; ++ii) { |
602 | if ((dest[ii] >= peak) || (dest[ii] <= low)) { | |
d5051b98 | 603 | peakcnt = 0; |
604 | bitHigh = false; | |
605 | ignoreCnt = 0; | |
606 | lastBit = ii-clk[clkCnt]; | |
607 | //loop through to see if this start location works | |
608 | for (i = ii; i < size-20; ++i) { | |
609 | //if we are at a clock bit | |
610 | if ((i >= lastBit + clk[clkCnt] - tol) && (i <= lastBit + clk[clkCnt] + tol)) { | |
611 | //test high/low | |
612 | if (dest[i] >= peak || dest[i] <= low) { | |
613 | //if same peak don't count it | |
614 | if ((dest[i] >= peak && !lastPeakHigh) || (dest[i] <= low && lastPeakHigh)) { | |
615 | peakcnt++; | |
616 | } | |
617 | lastPeakHigh = (dest[i] >= peak); | |
618 | bitHigh = true; | |
619 | errBitHigh = false; | |
620 | ignoreCnt = ignoreWindow; | |
621 | lastBit += clk[clkCnt]; | |
622 | } else if (i == lastBit + clk[clkCnt] + tol) { | |
623 | lastBit += clk[clkCnt]; | |
624 | } | |
625 | //else if not a clock bit and no peaks | |
b97311b1 | 626 | } else if (dest[i] < peak && dest[i] > low) { |
627 | if (ignoreCnt==0) { | |
d5051b98 | 628 | bitHigh=false; |
629 | if (errBitHigh==true) peakcnt--; | |
630 | errBitHigh=false; | |
631 | } else { | |
632 | ignoreCnt--; | |
633 | } | |
634 | // else if not a clock bit but we have a peak | |
635 | } else if ((dest[i]>=peak || dest[i]<=low) && (!bitHigh)) { | |
636 | //error bar found no clock... | |
637 | errBitHigh=true; | |
638 | } | |
639 | } | |
640 | if(peakcnt>peaksdet[clkCnt]) { | |
641 | bestStart[clkCnt]=ii; | |
642 | peaksdet[clkCnt]=peakcnt; | |
643 | } | |
4d3c1796 | 644 | } |
4d3c1796 | 645 | } |
4d3c1796 | 646 | } |
d5051b98 | 647 | int iii=7; |
648 | uint8_t best=0; | |
b97311b1 | 649 | for (iii=7; iii > 0; iii--) { |
d5051b98 | 650 | if ((peaksdet[iii] >= (peaksdet[best]-1)) && (peaksdet[iii] <= peaksdet[best]+1) && lowestTransition) { |
651 | if (clk[iii] > (lowestTransition - (clk[iii]/8)) && clk[iii] < (lowestTransition + (clk[iii]/8))) { | |
652 | best = iii; | |
4d3c1796 | 653 | } |
b97311b1 | 654 | } else if (peaksdet[iii] > peaksdet[best]) { |
d5051b98 | 655 | best = iii; |
4d3c1796 | 656 | } |
b97311b1 | 657 | if (g_debugMode==2) prnt("DEBUG NRZ: Clk: %d, peaks: %d, minPeak: %d, bestClk: %d, lowestTrs: %d",clk[iii],peaksdet[iii],minPeak, clk[best], lowestTransition); |
4d3c1796 | 658 | } |
d5051b98 | 659 | *clockStartIdx = bestStart[best]; |
660 | return clk[best]; | |
4d3c1796 | 661 | } |
d5051b98 | 662 | |
d5051b98 | 663 | //by marshmellow |
664 | //countFC is to detect the field clock lengths. | |
665 | //counts and returns the 2 most common wave lengths | |
666 | //mainly used for FSK field clock detection | |
667 | uint16_t countFC(uint8_t *BitStream, size_t size, uint8_t fskAdj) { | |
668 | uint8_t fcLens[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; | |
669 | uint16_t fcCnts[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; | |
670 | uint8_t fcLensFnd = 0; | |
671 | uint8_t lastFCcnt = 0; | |
672 | uint8_t fcCounter = 0; | |
673 | size_t i; | |
674 | if (size < 180) return 0; | |
c85858f5 | 675 | |
d5051b98 | 676 | // prime i to first up transition |
677 | for (i = 160; i < size-20; i++) | |
678 | if (BitStream[i] > BitStream[i-1] && BitStream[i] >= BitStream[i+1]) | |
679 | break; | |
ba1a299c | 680 | |
d5051b98 | 681 | for (; i < size-20; i++){ |
682 | if (BitStream[i] > BitStream[i-1] && BitStream[i] >= BitStream[i+1]){ | |
683 | // new up transition | |
684 | fcCounter++; | |
685 | if (fskAdj){ | |
686 | //if we had 5 and now have 9 then go back to 8 (for when we get a fc 9 instead of an 8) | |
687 | if (lastFCcnt==5 && fcCounter==9) fcCounter--; | |
688 | //if fc=9 or 4 add one (for when we get a fc 9 instead of 10 or a 4 instead of a 5) | |
689 | if ((fcCounter==9) || fcCounter==4) fcCounter++; | |
690 | // save last field clock count (fc/xx) | |
691 | lastFCcnt = fcCounter; | |
692 | } | |
693 | // find which fcLens to save it to: | |
694 | for (int ii=0; ii<15; ii++){ | |
695 | if (fcLens[ii]==fcCounter){ | |
696 | fcCnts[ii]++; | |
697 | fcCounter=0; | |
698 | break; | |
f4eadf8a | 699 | } |
ba1a299c | 700 | } |
d5051b98 | 701 | if (fcCounter>0 && fcLensFnd<15){ |
702 | //add new fc length | |
703 | fcCnts[fcLensFnd]++; | |
704 | fcLens[fcLensFnd++]=fcCounter; | |
705 | } | |
706 | fcCounter=0; | |
707 | } else { | |
708 | // count sample | |
709 | fcCounter++; | |
ba1a299c | 710 | } |
711 | } | |
d5051b98 | 712 | |
713 | uint8_t best1=14, best2=14, best3=14; | |
714 | uint16_t maxCnt1=0; | |
715 | // go through fclens and find which ones are bigest 2 | |
716 | for (i=0; i<15; i++){ | |
717 | // get the 3 best FC values | |
718 | if (fcCnts[i]>maxCnt1) { | |
719 | best3=best2; | |
720 | best2=best1; | |
721 | maxCnt1=fcCnts[i]; | |
722 | best1=i; | |
723 | } else if(fcCnts[i]>fcCnts[best2]){ | |
724 | best3=best2; | |
725 | best2=i; | |
726 | } else if(fcCnts[i]>fcCnts[best3]){ | |
727 | best3=i; | |
728 | } | |
729 | if (g_debugMode==2) prnt("DEBUG countfc: FC %u, Cnt %u, best fc: %u, best2 fc: %u",fcLens[i],fcCnts[i],fcLens[best1],fcLens[best2]); | |
b97311b1 | 730 | if (fcLens[i]==0) break; |
d5051b98 | 731 | } |
732 | if (fcLens[best1]==0) return 0; | |
733 | uint8_t fcH=0, fcL=0; | |
734 | if (fcLens[best1]>fcLens[best2]){ | |
735 | fcH=fcLens[best1]; | |
736 | fcL=fcLens[best2]; | |
737 | } else{ | |
738 | fcH=fcLens[best2]; | |
739 | fcL=fcLens[best1]; | |
740 | } | |
741 | if ((size-180)/fcH/3 > fcCnts[best1]+fcCnts[best2]) { | |
742 | if (g_debugMode==2) prnt("DEBUG countfc: fc is too large: %u > %u. Not psk or fsk",(size-180)/fcH/3,fcCnts[best1]+fcCnts[best2]); | |
743 | return 0; //lots of waves not psk or fsk | |
744 | } | |
745 | // TODO: take top 3 answers and compare to known Field clocks to get top 2 | |
746 | ||
747 | uint16_t fcs = (((uint16_t)fcH)<<8) | fcL; | |
b97311b1 | 748 | if (fskAdj) return fcs; |
749 | return (uint16_t)fcLens[best2] << 8 | fcLens[best1]; | |
eb191de6 | 750 | } |
751 | ||
d5051b98 | 752 | //by marshmellow |
753 | //detect psk clock by reading each phase shift | |
754 | // a phase shift is determined by measuring the sample length of each wave | |
b97311b1 | 755 | int DetectPSKClock(uint8_t dest[], size_t size, int clock, size_t *firstPhaseShift, uint8_t *curPhase, uint8_t *fc) { |
d5051b98 | 756 | uint8_t clk[]={255,16,32,40,50,64,100,128,255}; //255 is not a valid clock |
757 | uint16_t loopCnt = 4096; //don't need to loop through entire array... | |
758 | if (size == 0) return 0; | |
b97311b1 | 759 | if (size+3<loopCnt) loopCnt = size-20; |
760 | ||
761 | uint16_t fcs = countFC(dest, size, 0); | |
762 | *fc = fcs & 0xFF; | |
763 | if (g_debugMode==2) prnt("DEBUG PSK: FC: %d, FC2: %d",*fc, fcs>>8); | |
0aed2199 | 764 | if ((fcs>>8) == 10 && *fc == 8) return 0; |
765 | if (*fc!=2 && *fc!=4 && *fc!=8) return 0; | |
d5051b98 | 766 | |
767 | //if we already have a valid clock quit | |
768 | size_t i=1; | |
769 | for (; i < 8; ++i) | |
770 | if (clk[i] == clock) return clock; | |
771 | ||
772 | size_t waveStart=0, waveEnd=0, firstFullWave=0, lastClkBit=0; | |
b97311b1 | 773 | |
774 | uint8_t clkCnt, tol=1; | |
775 | uint16_t peakcnt=0, errCnt=0, waveLenCnt=0, fullWaveLen=0; | |
d5051b98 | 776 | uint16_t bestErr[]={1000,1000,1000,1000,1000,1000,1000,1000,1000}; |
777 | uint16_t peaksdet[]={0,0,0,0,0,0,0,0,0}; | |
d5051b98 | 778 | |
b97311b1 | 779 | //find start of modulating data in trace |
780 | i = findModStart(dest, size, *fc); | |
781 | ||
782 | firstFullWave = pskFindFirstPhaseShift(dest, size, curPhase, i, *fc, &fullWaveLen); | |
783 | if (firstFullWave == 0) { | |
784 | // no phase shift detected - could be all 1's or 0's - doesn't matter where we start | |
785 | // so skip a little to ensure we are past any Start Signal | |
786 | firstFullWave = 160; | |
787 | fullWaveLen = 0; | |
d5051b98 | 788 | } |
b97311b1 | 789 | |
d5051b98 | 790 | *firstPhaseShift = firstFullWave; |
791 | if (g_debugMode ==2) prnt("DEBUG PSK: firstFullWave: %d, waveLen: %d",firstFullWave,fullWaveLen); | |
792 | //test each valid clock from greatest to smallest to see which lines up | |
b97311b1 | 793 | for(clkCnt=7; clkCnt >= 1 ; clkCnt--) { |
794 | tol = *fc/2; | |
d5051b98 | 795 | lastClkBit = firstFullWave; //set end of wave as clock align |
796 | waveStart = 0; | |
797 | errCnt=0; | |
798 | peakcnt=0; | |
799 | if (g_debugMode == 2) prnt("DEBUG PSK: clk: %d, lastClkBit: %d",clk[clkCnt],lastClkBit); | |
ba1a299c | 800 | |
d5051b98 | 801 | for (i = firstFullWave+fullWaveLen-1; i < loopCnt-2; i++){ |
802 | //top edge of wave = start of new wave | |
803 | if (dest[i] < dest[i+1] && dest[i+1] >= dest[i+2]){ | |
804 | if (waveStart == 0) { | |
805 | waveStart = i+1; | |
806 | waveLenCnt=0; | |
807 | } else { //waveEnd | |
808 | waveEnd = i+1; | |
809 | waveLenCnt = waveEnd-waveStart; | |
b97311b1 | 810 | if (waveLenCnt > *fc){ |
d5051b98 | 811 | //if this wave is a phase shift |
b97311b1 | 812 | if (g_debugMode == 2) prnt("DEBUG PSK: phase shift at: %d, len: %d, nextClk: %d, i: %d, fc: %d",waveStart,waveLenCnt,lastClkBit+clk[clkCnt]-tol,i+1,*fc); |
d5051b98 | 813 | if (i+1 >= lastClkBit + clk[clkCnt] - tol){ //should be a clock bit |
814 | peakcnt++; | |
815 | lastClkBit+=clk[clkCnt]; | |
816 | } else if (i<lastClkBit+8){ | |
817 | //noise after a phase shift - ignore | |
818 | } else { //phase shift before supposed to based on clock | |
819 | errCnt++; | |
820 | } | |
b97311b1 | 821 | } else if (i+1 > lastClkBit + clk[clkCnt] + tol + *fc){ |
d5051b98 | 822 | lastClkBit+=clk[clkCnt]; //no phase shift but clock bit |
823 | } | |
824 | waveStart=i+1; | |
825 | } | |
826 | } | |
13d77ef9 | 827 | } |
d5051b98 | 828 | if (errCnt == 0){ |
829 | return clk[clkCnt]; | |
830 | } | |
831 | if (errCnt <= bestErr[clkCnt]) bestErr[clkCnt]=errCnt; | |
832 | if (peakcnt > peaksdet[clkCnt]) peaksdet[clkCnt]=peakcnt; | |
833 | } | |
834 | //all tested with errors | |
835 | //return the highest clk with the most peaks found | |
836 | uint8_t best=7; | |
837 | for (i=7; i>=1; i--){ | |
838 | if (peaksdet[i] > peaksdet[best]) { | |
839 | best = i; | |
840 | } | |
841 | if (g_debugMode == 2) prnt("DEBUG PSK: Clk: %d, peaks: %d, errs: %d, bestClk: %d",clk[i],peaksdet[i],bestErr[i],clk[best]); | |
13d77ef9 | 842 | } |
d5051b98 | 843 | return clk[best]; |
eb191de6 | 844 | } |
6fe5c94b | 845 | |
d5051b98 | 846 | //by marshmellow |
847 | //detects the bit clock for FSK given the high and low Field Clocks | |
0f321d63 | 848 | uint8_t detectFSKClk(uint8_t *BitStream, size_t size, uint8_t fcHigh, uint8_t fcLow, int *firstClockEdge) { |
d5051b98 | 849 | uint8_t clk[] = {8,16,32,40,50,64,100,128,0}; |
850 | uint16_t rfLens[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; | |
851 | uint8_t rfCnts[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; | |
852 | uint8_t rfLensFnd = 0; | |
853 | uint8_t lastFCcnt = 0; | |
854 | uint16_t fcCounter = 0; | |
855 | uint16_t rfCounter = 0; | |
856 | uint8_t firstBitFnd = 0; | |
857 | size_t i; | |
858 | if (size == 0) return 0; | |
669959bc | 859 | |
d5051b98 | 860 | uint8_t fcTol = ((fcHigh*100 - fcLow*100)/2 + 50)/100; //(uint8_t)(0.5+(float)(fcHigh-fcLow)/2); |
861 | rfLensFnd=0; | |
862 | fcCounter=0; | |
863 | rfCounter=0; | |
864 | firstBitFnd=0; | |
865 | //PrintAndLog("DEBUG: fcTol: %d",fcTol); | |
866 | // prime i to first peak / up transition | |
867 | for (i = 160; i < size-20; i++) | |
868 | if (BitStream[i] > BitStream[i-1] && BitStream[i]>=BitStream[i+1]) | |
869 | break; | |
870 | ||
871 | for (; i < size-20; i++){ | |
872 | fcCounter++; | |
873 | rfCounter++; | |
874 | ||
875 | if (BitStream[i] <= BitStream[i-1] || BitStream[i] < BitStream[i+1]) | |
876 | continue; | |
877 | // else new peak | |
878 | // if we got less than the small fc + tolerance then set it to the small fc | |
879 | // if it is inbetween set it to the last counter | |
880 | if (fcCounter < fcHigh && fcCounter > fcLow) | |
881 | fcCounter = lastFCcnt; | |
882 | else if (fcCounter < fcLow+fcTol) | |
883 | fcCounter = fcLow; | |
884 | else //set it to the large fc | |
885 | fcCounter = fcHigh; | |
886 | ||
887 | //look for bit clock (rf/xx) | |
888 | if ((fcCounter < lastFCcnt || fcCounter > lastFCcnt)){ | |
889 | //not the same size as the last wave - start of new bit sequence | |
890 | if (firstBitFnd > 1){ //skip first wave change - probably not a complete bit | |
891 | for (int ii=0; ii<15; ii++){ | |
892 | if (rfLens[ii] >= (rfCounter-4) && rfLens[ii] <= (rfCounter+4)){ | |
893 | rfCnts[ii]++; | |
894 | rfCounter = 0; | |
895 | break; | |
896 | } | |
897 | } | |
898 | if (rfCounter > 0 && rfLensFnd < 15){ | |
899 | //PrintAndLog("DEBUG: rfCntr %d, fcCntr %d",rfCounter,fcCounter); | |
900 | rfCnts[rfLensFnd]++; | |
901 | rfLens[rfLensFnd++] = rfCounter; | |
902 | } | |
903 | } else { | |
904 | *firstClockEdge = i; | |
905 | firstBitFnd++; | |
906 | } | |
907 | rfCounter=0; | |
908 | lastFCcnt=fcCounter; | |
e0165dcf | 909 | } |
d5051b98 | 910 | fcCounter=0; |
e0165dcf | 911 | } |
d5051b98 | 912 | uint8_t rfHighest=15, rfHighest2=15, rfHighest3=15; |
913 | ||
914 | for (i=0; i<15; i++){ | |
915 | //get highest 2 RF values (might need to get more values to compare or compare all?) | |
916 | if (rfCnts[i]>rfCnts[rfHighest]){ | |
917 | rfHighest3=rfHighest2; | |
918 | rfHighest2=rfHighest; | |
919 | rfHighest=i; | |
920 | } else if(rfCnts[i]>rfCnts[rfHighest2]){ | |
921 | rfHighest3=rfHighest2; | |
922 | rfHighest2=i; | |
923 | } else if(rfCnts[i]>rfCnts[rfHighest3]){ | |
924 | rfHighest3=i; | |
925 | } | |
926 | if (g_debugMode==2) prnt("DEBUG FSK: RF %d, cnts %d",rfLens[i], rfCnts[i]); | |
927 | } | |
928 | // set allowed clock remainder tolerance to be 1 large field clock length+1 | |
929 | // we could have mistakenly made a 9 a 10 instead of an 8 or visa versa so rfLens could be 1 FC off | |
930 | uint8_t tol1 = fcHigh+1; | |
931 | ||
932 | if (g_debugMode==2) prnt("DEBUG FSK: most counted rf values: 1 %d, 2 %d, 3 %d",rfLens[rfHighest],rfLens[rfHighest2],rfLens[rfHighest3]); | |
eb191de6 | 933 | |
d5051b98 | 934 | // loop to find the highest clock that has a remainder less than the tolerance |
935 | // compare samples counted divided by | |
936 | // test 128 down to 32 (shouldn't be possible to have fc/10 & fc/8 and rf/16 or less) | |
937 | int ii=7; | |
938 | for (; ii>=2; ii--){ | |
939 | if (rfLens[rfHighest] % clk[ii] < tol1 || rfLens[rfHighest] % clk[ii] > clk[ii]-tol1){ | |
940 | if (rfLens[rfHighest2] % clk[ii] < tol1 || rfLens[rfHighest2] % clk[ii] > clk[ii]-tol1){ | |
941 | if (rfLens[rfHighest3] % clk[ii] < tol1 || rfLens[rfHighest3] % clk[ii] > clk[ii]-tol1){ | |
942 | if (g_debugMode==2) prnt("DEBUG FSK: clk %d divides into the 3 most rf values within tolerance",clk[ii]); | |
943 | break; | |
944 | } | |
945 | } | |
4d3c1796 | 946 | } |
ec75f5c1 | 947 | } |
ec75f5c1 | 948 | |
d5051b98 | 949 | if (ii<2) return 0; // oops we went too far |
eb191de6 | 950 | |
d5051b98 | 951 | return clk[ii]; |
952 | } | |
415274a7 | 953 | |
d5051b98 | 954 | //********************************************************************************************** |
955 | //--------------------Modulation Demods &/or Decoding Section----------------------------------- | |
956 | //********************************************************************************************** | |
1e090a61 | 957 | |
d5051b98 | 958 | // look for Sequence Terminator - should be pulses of clk*(1 or 2), clk*2, clk*(1.5 or 2), by idx we mean graph position index... |
56de46b4 | 959 | bool findST(int *stStopLoc, int *stStartIdx, int lowToLowWaveLen[], int highToLowWaveLen[], int clk, int tol, int buffSize, size_t *i) { |
bf85d22f | 960 | if (buffSize < *i+4) return false; |
961 | ||
549daaf7 | 962 | for (; *i < buffSize - 4; *i+=1) { |
963 | *stStartIdx += lowToLowWaveLen[*i]; //caution part of this wave may be data and part may be ST.... to be accounted for in main function for now... | |
964 | if (lowToLowWaveLen[*i] >= clk*1-tol && lowToLowWaveLen[*i] <= (clk*2)+tol && highToLowWaveLen[*i] < clk+tol) { //1 to 2 clocks depending on 2 bits prior | |
965 | if (lowToLowWaveLen[*i+1] >= clk*2-tol && lowToLowWaveLen[*i+1] <= clk*2+tol && highToLowWaveLen[*i+1] > clk*3/2-tol) { //2 clocks and wave size is 1 1/2 | |
966 | if (lowToLowWaveLen[*i+2] >= (clk*3)/2-tol && lowToLowWaveLen[*i+2] <= clk*2+tol && highToLowWaveLen[*i+2] > clk-tol) { //1 1/2 to 2 clocks and at least one full clock wave | |
967 | if (lowToLowWaveLen[*i+3] >= clk*1-tol && lowToLowWaveLen[*i+3] <= clk*2+tol) { //1 to 2 clocks for end of ST + first bit | |
968 | *stStopLoc = *i + 3; | |
d5051b98 | 969 | return true; |
4d3c1796 | 970 | } |
4d3c1796 | 971 | } |
4d3c1796 | 972 | } |
973 | } | |
4d3c1796 | 974 | } |
d5051b98 | 975 | return false; |
6923d3f1 | 976 | } |
d5051b98 | 977 | //by marshmellow |
978 | //attempt to identify a Sequence Terminator in ASK modulated raw wave | |
0f321d63 | 979 | bool DetectST(uint8_t buffer[], size_t *size, int *foundclock, size_t *ststart, size_t *stend) { |
d5051b98 | 980 | size_t bufsize = *size; |
981 | //need to loop through all samples and identify our clock, look for the ST pattern | |
d5051b98 | 982 | int clk = 0; |
983 | int tol = 0; | |
b97311b1 | 984 | int j=0, high, low, skip=0, start=0, end=0, minClk=255; |
56de46b4 | 985 | size_t i = 0; |
d5051b98 | 986 | //probably should malloc... || test if memory is available ... handle device side? memory danger!!! [marshmellow] |
56de46b4 | 987 | int tmpbuff[bufsize / LOWEST_DEFAULT_CLOCK]; // low to low wave count //guess rf/32 clock, if click is smaller we will only have room for a fraction of the samples captured |
988 | int waveLen[bufsize / LOWEST_DEFAULT_CLOCK]; // high to low wave count //if clock is larger then we waste memory in array size that is not needed... | |
c83d6dc6 | 989 | //size_t testsize = (bufsize < 512) ? bufsize : 512; |
d5051b98 | 990 | int phaseoff = 0; |
991 | high = low = 128; | |
992 | memset(tmpbuff, 0, sizeof(tmpbuff)); | |
549daaf7 | 993 | memset(waveLen, 0, sizeof(waveLen)); |
d5051b98 | 994 | |
c83d6dc6 | 995 | if (!loadWaveCounters(buffer, bufsize, tmpbuff, waveLen, &j, &skip, &minClk, &high, &low)) return false; |
d5051b98 | 996 | // set clock - might be able to get this externally and remove this work... |
56de46b4 | 997 | clk = getClosestClock(minClk); |
998 | // clock not found - ERROR | |
999 | if (clk == 0) { | |
1000 | if (g_debugMode==2) prnt("DEBUG STT: clock not found - quitting"); | |
1001 | return false; | |
1002 | } | |
d5051b98 | 1003 | *foundclock = clk; |
56de46b4 | 1004 | |
1005 | tol = clk/8; | |
549daaf7 | 1006 | if (!findST(&start, &skip, tmpbuff, waveLen, clk, tol, j, &i)) { |
d5051b98 | 1007 | // first ST not found - ERROR |
1008 | if (g_debugMode==2) prnt("DEBUG STT: first STT not found - quitting"); | |
1009 | return false; | |
1010 | } else { | |
549daaf7 | 1011 | if (g_debugMode==2) prnt("DEBUG STT: first STT found at wave: %i, skip: %i, j=%i", start, skip, j); |
cc15a118 | 1012 | } |
d5051b98 | 1013 | if (waveLen[i+2] > clk*1+tol) |
1014 | phaseoff = 0; | |
1015 | else | |
1016 | phaseoff = clk/2; | |
1017 | ||
1018 | // skip over the remainder of ST | |
1019 | skip += clk*7/2; //3.5 clocks from tmpbuff[i] = end of st - also aligns for ending point | |
2eec55c8 | 1020 | |
d5051b98 | 1021 | // now do it again to find the end |
1022 | int dummy1 = 0; | |
1023 | end = skip; | |
549daaf7 | 1024 | i+=3; |
1025 | if (!findST(&dummy1, &end, tmpbuff, waveLen, clk, tol, j, &i)) { | |
d5051b98 | 1026 | //didn't find second ST - ERROR |
1027 | if (g_debugMode==2) prnt("DEBUG STT: second STT not found - quitting"); | |
1028 | return false; | |
1029 | } | |
1030 | end -= phaseoff; | |
1031 | if (g_debugMode==2) prnt("DEBUG STT: start of data: %d end of data: %d, datalen: %d, clk: %d, bits: %d, phaseoff: %d", skip, end, end-skip, clk, (end-skip)/clk, phaseoff); | |
1032 | //now begin to trim out ST so we can use normal demod cmds | |
1033 | start = skip; | |
1034 | size_t datalen = end - start; | |
1035 | // check validity of datalen (should be even clock increments) - use a tolerance of up to 1/8th a clock | |
1036 | if ( clk - (datalen % clk) <= clk/8) { | |
1037 | // padd the amount off - could be problematic... but shouldn't happen often | |
1038 | datalen += clk - (datalen % clk); | |
1039 | } else if ( (datalen % clk) <= clk/8 ) { | |
1040 | // padd the amount off - could be problematic... but shouldn't happen often | |
1041 | datalen -= datalen % clk; | |
1042 | } else { | |
1043 | if (g_debugMode==2) prnt("DEBUG STT: datalen not divisible by clk: %u %% %d = %d - quitting", datalen, clk, datalen % clk); | |
1044 | return false; | |
1045 | } | |
1046 | // if datalen is less than one t55xx block - ERROR | |
1047 | if (datalen/clk < 8*4) { | |
1048 | if (g_debugMode==2) prnt("DEBUG STT: datalen is less than 1 full t55xx block - quitting"); | |
1049 | return false; | |
1050 | } | |
1051 | size_t dataloc = start; | |
b97311b1 | 1052 | if (buffer[dataloc-(clk*4)-(clk/4)] <= low && buffer[dataloc] <= low && buffer[dataloc-(clk*4)] >= high) { |
d5051b98 | 1053 | //we have low drift (and a low just before the ST and a low just after the ST) - compensate by backing up the start |
b97311b1 | 1054 | for ( i=0; i <= (clk/4); ++i ) { |
d5051b98 | 1055 | if ( buffer[dataloc - (clk*4) - i] <= low ) { |
1056 | dataloc -= i; | |
1057 | break; | |
2eec55c8 | 1058 | } |
e0165dcf | 1059 | } |
1060 | } | |
d5051b98 | 1061 | |
1062 | size_t newloc = 0; | |
1063 | i=0; | |
1064 | if (g_debugMode==2) prnt("DEBUG STT: Starting STT trim - start: %d, datalen: %d ",dataloc, datalen); | |
1065 | bool firstrun = true; | |
1066 | // warning - overwriting buffer given with raw wave data with ST removed... | |
1067 | while ( dataloc < bufsize-(clk/2) ) { | |
1068 | //compensate for long high at end of ST not being high due to signal loss... (and we cut out the start of wave high part) | |
b97311b1 | 1069 | if (buffer[dataloc]<high && buffer[dataloc]>low && buffer[dataloc+clk/4]<high && buffer[dataloc+clk/4]>low) { |
d5051b98 | 1070 | for(i=0; i < clk/2-tol; ++i) { |
1071 | buffer[dataloc+i] = high+5; | |
1072 | } | |
b97311b1 | 1073 | } //test for small spike outlier (high between two lows) in the case of very strong waves |
1074 | if (buffer[dataloc] > low && buffer[dataloc+clk/4] <= low) { | |
1075 | for(i=0; i < clk/4; ++i) { | |
1076 | buffer[dataloc+i] = buffer[dataloc+clk/4]; | |
1077 | } | |
d5051b98 | 1078 | } |
1079 | if (firstrun) { | |
1080 | *stend = dataloc; | |
1081 | *ststart = dataloc-(clk*4); | |
1082 | firstrun=false; | |
1083 | } | |
1084 | for (i=0; i<datalen; ++i) { | |
1085 | if (i+newloc < bufsize) { | |
1086 | if (i+newloc < dataloc) | |
1087 | buffer[i+newloc] = buffer[dataloc]; | |
1088 | ||
1089 | dataloc++; | |
e0165dcf | 1090 | } |
1091 | } | |
d5051b98 | 1092 | newloc += i; |
1093 | //skip next ST - we just assume it will be there from now on... | |
1094 | if (g_debugMode==2) prnt("DEBUG STT: skipping STT at %d to %d", dataloc, dataloc+(clk*4)); | |
1095 | dataloc += clk*4; | |
e0165dcf | 1096 | } |
d5051b98 | 1097 | *size = newloc; |
1098 | return true; | |
1099 | } | |
ba1a299c | 1100 | |
549daaf7 | 1101 | //by marshmellow |
127f1490 | 1102 | //take 11 10 01 11 00 and make 01100 ... miller decoding |
549daaf7 | 1103 | //check for phase errors - should never have half a 1 or 0 by itself and should never exceed 1111 or 0000 in a row |
1104 | //decodes miller encoded binary | |
1105 | //NOTE askrawdemod will NOT demod miller encoded ask unless the clock is manually set to 1/2 what it is detected as! | |
127f1490 | 1106 | int millerRawDecode(uint8_t *BitStream, size_t *size, int invert) { |
549daaf7 | 1107 | if (*size < 16) return -1; |
127f1490 | 1108 | uint16_t MaxBits = 512, errCnt = 0; |
1109 | size_t i, bitCnt=0; | |
1110 | uint8_t alignCnt = 0, curBit = BitStream[0], alignedIdx = 0; | |
1111 | uint8_t halfClkErr = 0; | |
549daaf7 | 1112 | //find alignment, needs 4 1s or 0s to properly align |
127f1490 | 1113 | for (i=1; i < *size-1; i++) { |
549daaf7 | 1114 | alignCnt = (BitStream[i] == curBit) ? alignCnt+1 : 0; |
1115 | curBit = BitStream[i]; | |
1116 | if (alignCnt == 4) break; | |
1117 | } | |
1118 | // for now error if alignment not found. later add option to run it with multiple offsets... | |
1119 | if (alignCnt != 4) { | |
1120 | if (g_debugMode) prnt("ERROR MillerDecode: alignment not found so either your bitstream is not miller or your data does not have a 101 in it"); | |
1121 | return -1; | |
1122 | } | |
127f1490 | 1123 | alignedIdx = (i-1) % 2; |
1124 | for (i=alignedIdx; i < *size-3; i+=2) { | |
1125 | halfClkErr = (uint8_t)((halfClkErr << 1 | BitStream[i]) & 0xFF); | |
1126 | if ( (halfClkErr & 0x7) == 5 || (halfClkErr & 0x7) == 2 || (i > 2 && (halfClkErr & 0x7) == 0) || (halfClkErr & 0x1F) == 0x1F) { | |
1127 | errCnt++; | |
1128 | BitStream[bitCnt++] = 7; | |
1129 | continue; | |
1130 | } | |
1131 | BitStream[bitCnt++] = BitStream[i] ^ BitStream[i+1] ^ invert; | |
549daaf7 | 1132 | |
127f1490 | 1133 | if (bitCnt > MaxBits) break; |
1134 | } | |
1135 | *size = bitCnt; | |
1136 | return errCnt; | |
1137 | } | |
549daaf7 | 1138 | |
d5051b98 | 1139 | //by marshmellow |
1140 | //take 01 or 10 = 1 and 11 or 00 = 0 | |
1141 | //check for phase errors - should never have 111 or 000 should be 01001011 or 10110100 for 1010 | |
1142 | //decodes biphase or if inverted it is AKA conditional dephase encoding AKA differential manchester encoding | |
9fe4507c | 1143 | int BiphaseRawDecode(uint8_t *BitStream, size_t *size, int *offset, int invert) { |
d5051b98 | 1144 | uint16_t bitnum = 0; |
1145 | uint16_t errCnt = 0; | |
9fe4507c | 1146 | size_t i = *offset; |
d5051b98 | 1147 | uint16_t MaxBits=512; |
1148 | //if not enough samples - error | |
1149 | if (*size < 51) return -1; | |
1150 | //check for phase change faults - skip one sample if faulty | |
1151 | uint8_t offsetA = 1, offsetB = 1; | |
1152 | for (; i<48; i+=2){ | |
1153 | if (BitStream[i+1]==BitStream[i+2]) offsetA=0; | |
1154 | if (BitStream[i+2]==BitStream[i+3]) offsetB=0; | |
1155 | } | |
9fe4507c | 1156 | if (!offsetA && offsetB) *offset+=1; |
1157 | for (i=*offset; i<*size-3; i+=2){ | |
d5051b98 | 1158 | //check for phase error |
1159 | if (BitStream[i+1]==BitStream[i+2]) { | |
1160 | BitStream[bitnum++]=7; | |
1161 | errCnt++; | |
1162 | } | |
1163 | if((BitStream[i]==1 && BitStream[i+1]==0) || (BitStream[i]==0 && BitStream[i+1]==1)){ | |
1164 | BitStream[bitnum++]=1^invert; | |
1165 | } else if((BitStream[i]==0 && BitStream[i+1]==0) || (BitStream[i]==1 && BitStream[i+1]==1)){ | |
1166 | BitStream[bitnum++]=invert; | |
1167 | } else { | |
1168 | BitStream[bitnum++]=7; | |
1169 | errCnt++; | |
db829602 | 1170 | } |
d5051b98 | 1171 | if(bitnum>MaxBits) break; |
db829602 | 1172 | } |
d5051b98 | 1173 | *size=bitnum; |
1174 | return errCnt; | |
db829602 | 1175 | } |
1176 | ||
6de43508 | 1177 | //by marshmellow |
d5051b98 | 1178 | //take 10 and 01 and manchester decode |
1179 | //run through 2 times and take least errCnt | |
1180 | int manrawdecode(uint8_t * BitStream, size_t *size, uint8_t invert, uint8_t *alignPos) { | |
1181 | uint16_t bitnum=0, MaxBits = 512, errCnt = 0; | |
1182 | size_t i, ii; | |
1183 | uint16_t bestErr = 1000, bestRun = 0; | |
1184 | if (*size < 16) return -1; | |
1185 | //find correct start position [alignment] | |
1186 | for (ii=0;ii<2;++ii){ | |
1187 | for (i=ii; i<*size-3; i+=2) | |
1188 | if (BitStream[i]==BitStream[i+1]) | |
1189 | errCnt++; | |
1190 | ||
1191 | if (bestErr>errCnt){ | |
1192 | bestErr=errCnt; | |
1193 | bestRun=ii; | |
1194 | } | |
1195 | errCnt=0; | |
1196 | } | |
1197 | *alignPos=bestRun; | |
1198 | //decode | |
1199 | for (i=bestRun; i < *size-3; i+=2){ | |
1200 | if(BitStream[i] == 1 && (BitStream[i+1] == 0)){ | |
1201 | BitStream[bitnum++]=invert; | |
1202 | } else if((BitStream[i] == 0) && BitStream[i+1] == 1){ | |
1203 | BitStream[bitnum++]=invert^1; | |
e0165dcf | 1204 | } else { |
d5051b98 | 1205 | BitStream[bitnum++]=7; |
e0165dcf | 1206 | } |
d5051b98 | 1207 | if(bitnum>MaxBits) break; |
e0165dcf | 1208 | } |
d5051b98 | 1209 | *size=bitnum; |
1210 | return bestErr; | |
1211 | } | |
1212 | ||
1213 | //by marshmellow | |
1214 | //demodulates strong heavily clipped samples | |
1215 | int cleanAskRawDemod(uint8_t *BinStream, size_t *size, int clk, int invert, int high, int low, int *startIdx) | |
1216 | { | |
1217 | *startIdx=0; | |
1218 | size_t bitCnt=0, smplCnt=1, errCnt=0; | |
1219 | bool waveHigh = (BinStream[0] >= high); | |
1220 | for (size_t i=1; i < *size; i++){ | |
1221 | if (BinStream[i] >= high && waveHigh){ | |
1222 | smplCnt++; | |
1223 | } else if (BinStream[i] <= low && !waveHigh){ | |
1224 | smplCnt++; | |
1225 | } else { //transition | |
1226 | if ((BinStream[i] >= high && !waveHigh) || (BinStream[i] <= low && waveHigh)){ | |
1227 | if (smplCnt > clk-(clk/4)-1) { //full clock | |
1228 | if (smplCnt > clk + (clk/4)+1) { //too many samples | |
1229 | errCnt++; | |
1230 | if (g_debugMode==2) prnt("DEBUG ASK: Modulation Error at: %u", i); | |
1231 | BinStream[bitCnt++] = 7; | |
1232 | } else if (waveHigh) { | |
1233 | BinStream[bitCnt++] = invert; | |
1234 | BinStream[bitCnt++] = invert; | |
1235 | } else if (!waveHigh) { | |
1236 | BinStream[bitCnt++] = invert ^ 1; | |
1237 | BinStream[bitCnt++] = invert ^ 1; | |
e0165dcf | 1238 | } |
d5051b98 | 1239 | if (*startIdx==0) *startIdx = i-clk; |
1240 | waveHigh = !waveHigh; | |
1241 | smplCnt = 0; | |
1242 | } else if (smplCnt > (clk/2) - (clk/4)-1) { //half clock | |
1243 | if (waveHigh) { | |
1244 | BinStream[bitCnt++] = invert; | |
1245 | } else if (!waveHigh) { | |
1246 | BinStream[bitCnt++] = invert ^ 1; | |
1247 | } | |
1248 | if (*startIdx==0) *startIdx = i-(clk/2); | |
1249 | waveHigh = !waveHigh; | |
1250 | smplCnt = 0; | |
1251 | } else { | |
1252 | smplCnt++; | |
1253 | //transition bit oops | |
e0165dcf | 1254 | } |
d5051b98 | 1255 | } else { //haven't hit new high or new low yet |
1256 | smplCnt++; | |
db829602 | 1257 | } |
e0165dcf | 1258 | } |
e0165dcf | 1259 | } |
d5051b98 | 1260 | *size = bitCnt; |
1261 | return errCnt; | |
669959bc | 1262 | } |
1263 | ||
4d3c1796 | 1264 | //by marshmellow |
d5051b98 | 1265 | //attempts to demodulate ask modulations, askType == 0 for ask/raw, askType==1 for ask/manchester |
1266 | int askdemod_ext(uint8_t *BinStream, size_t *size, int *clk, int *invert, int maxErr, uint8_t amp, uint8_t askType, int *startIdx) { | |
1267 | if (*size==0) return -1; | |
1268 | int start = DetectASKClock(BinStream, *size, clk, maxErr); //clock default | |
1269 | if (*clk==0 || start < 0) return -3; | |
1270 | if (*invert != 1) *invert = 0; | |
1271 | if (amp==1) askAmp(BinStream, *size); | |
1272 | if (g_debugMode==2) prnt("DEBUG ASK: clk %d, beststart %d, amp %d", *clk, start, amp); | |
4d3c1796 | 1273 | |
d5051b98 | 1274 | //start pos from detect ask clock is 1/2 clock offset |
1275 | // NOTE: can be negative (demod assumes rest of wave was there) | |
1276 | *startIdx = start - (*clk/2); | |
1277 | uint8_t initLoopMax = 255; | |
1278 | if (initLoopMax > *size) initLoopMax = *size; | |
1279 | // Detect high and lows | |
1280 | //25% clip in case highs and lows aren't clipped [marshmellow] | |
1281 | int high, low; | |
1282 | if (getHiLo(BinStream, initLoopMax, &high, &low, 75, 75) < 1) | |
1283 | return -2; //just noise | |
4d3c1796 | 1284 | |
d5051b98 | 1285 | size_t errCnt = 0; |
1286 | // if clean clipped waves detected run alternate demod | |
1287 | if (DetectCleanAskWave(BinStream, *size, high, low)) { | |
1288 | if (g_debugMode==2) prnt("DEBUG ASK: Clean Wave Detected - using clean wave demod"); | |
1289 | errCnt = cleanAskRawDemod(BinStream, size, *clk, *invert, high, low, startIdx); | |
1290 | if (askType) { //askman | |
1291 | uint8_t alignPos = 0; | |
1292 | errCnt = manrawdecode(BinStream, size, 0, &alignPos); | |
1293 | *startIdx += *clk/2 * alignPos; | |
1294 | if (g_debugMode) prnt("DEBUG ASK CLEAN: startIdx %i, alignPos %u", *startIdx, alignPos); | |
1295 | return errCnt; | |
1296 | } else { //askraw | |
1297 | return errCnt; | |
1298 | } | |
1299 | } | |
1300 | if (g_debugMode) prnt("DEBUG ASK WEAK: startIdx %i", *startIdx); | |
1301 | if (g_debugMode==2) prnt("DEBUG ASK: Weak Wave Detected - using weak wave demod"); | |
1302 | ||
1303 | int lastBit; //set first clock check - can go negative | |
1304 | size_t i, bitnum = 0; //output counter | |
1305 | uint8_t midBit = 0; | |
1306 | 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 | |
1307 | 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 | |
1308 | size_t MaxBits = 3072; //max bits to collect | |
1309 | lastBit = start - *clk; | |
1310 | ||
1311 | for (i = start; i < *size; ++i) { | |
1312 | if (i-lastBit >= *clk-tol){ | |
1313 | if (BinStream[i] >= high) { | |
1314 | BinStream[bitnum++] = *invert; | |
1315 | } else if (BinStream[i] <= low) { | |
1316 | BinStream[bitnum++] = *invert ^ 1; | |
1317 | } else if (i-lastBit >= *clk+tol) { | |
1318 | if (bitnum > 0) { | |
1319 | if (g_debugMode==2) prnt("DEBUG ASK: Modulation Error at: %u", i); | |
1320 | BinStream[bitnum++]=7; | |
1321 | errCnt++; | |
1322 | } | |
1323 | } else { //in tolerance - looking for peak | |
1324 | continue; | |
4d3c1796 | 1325 | } |
d5051b98 | 1326 | midBit = 0; |
1327 | lastBit += *clk; | |
1328 | } else if (i-lastBit >= (*clk/2-tol) && !midBit && !askType){ | |
1329 | if (BinStream[i] >= high) { | |
1330 | BinStream[bitnum++] = *invert; | |
1331 | } else if (BinStream[i] <= low) { | |
1332 | BinStream[bitnum++] = *invert ^ 1; | |
1333 | } else if (i-lastBit >= *clk/2+tol) { | |
1334 | BinStream[bitnum] = BinStream[bitnum-1]; | |
1335 | bitnum++; | |
1336 | } else { //in tolerance - looking for peak | |
1337 | continue; | |
4d3c1796 | 1338 | } |
d5051b98 | 1339 | midBit = 1; |
04d2721b | 1340 | } |
d5051b98 | 1341 | if (bitnum >= MaxBits) break; |
04d2721b | 1342 | } |
d5051b98 | 1343 | *size = bitnum; |
1344 | return errCnt; | |
1345 | } | |
1346 | ||
1347 | int askdemod(uint8_t *BinStream, size_t *size, int *clk, int *invert, int maxErr, uint8_t amp, uint8_t askType) { | |
1348 | int start = 0; | |
1349 | return askdemod_ext(BinStream, size, clk, invert, maxErr, amp, askType, &start); | |
1350 | } | |
1351 | ||
1352 | // by marshmellow - demodulate NRZ wave - requires a read with strong signal | |
1353 | // peaks invert bit (high=1 low=0) each clock cycle = 1 bit determined by last peak | |
6f36848f | 1354 | int nrzRawDemod(uint8_t *dest, size_t *size, int *clk, int *invert, int *startIdx) { |
d5051b98 | 1355 | if (justNoise(dest, *size)) return -1; |
6f36848f | 1356 | size_t clkStartIdx = 0; |
1357 | *clk = DetectNRZClock(dest, *size, *clk, &clkStartIdx); | |
d5051b98 | 1358 | if (*clk==0) return -2; |
1359 | size_t i, gLen = 4096; | |
1360 | if (gLen>*size) gLen = *size-20; | |
1361 | int high, low; | |
1362 | if (getHiLo(dest, gLen, &high, &low, 75, 75) < 1) return -3; //25% fuzz on high 25% fuzz on low | |
4d3c1796 | 1363 | |
d5051b98 | 1364 | uint8_t bit=0; |
1365 | //convert wave samples to 1's and 0's | |
1366 | for(i=20; i < *size-20; i++){ | |
1367 | if (dest[i] >= high) bit = 1; | |
1368 | if (dest[i] <= low) bit = 0; | |
1369 | dest[i] = bit; | |
4d3c1796 | 1370 | } |
d5051b98 | 1371 | //now demod based on clock (rf/32 = 32 1's for one 1 bit, 32 0's for one 0 bit) |
1372 | size_t lastBit = 0; | |
1373 | size_t numBits = 0; | |
1374 | for(i=21; i < *size-20; i++) { | |
1375 | //if transition detected or large number of same bits - store the passed bits | |
1376 | if (dest[i] != dest[i-1] || (i-lastBit) == (10 * *clk)) { | |
1377 | memset(dest+numBits, dest[i-1] ^ *invert, (i - lastBit + (*clk/4)) / *clk); | |
1378 | numBits += (i - lastBit + (*clk/4)) / *clk; | |
1379 | if (lastBit == 0) { | |
1380 | *startIdx = i - (numBits * *clk); | |
1381 | if (g_debugMode==2) prnt("DEBUG NRZ: startIdx %i", *startIdx); | |
1382 | } | |
1383 | lastBit = i-1; | |
1384 | } | |
4d3c1796 | 1385 | } |
d5051b98 | 1386 | *size = numBits; |
1387 | return 0; | |
1388 | } | |
3bc66a96 | 1389 | |
d5051b98 | 1390 | //translate wave to 11111100000 (1 for each short wave [higher freq] 0 for each long wave [lower freq]) |
1391 | size_t fsk_wave_demod(uint8_t * dest, size_t size, uint8_t fchigh, uint8_t fclow, int *startIdx) { | |
1392 | size_t last_transition = 0; | |
1393 | size_t idx = 1; | |
1394 | if (fchigh==0) fchigh=10; | |
1395 | if (fclow==0) fclow=8; | |
1396 | //set the threshold close to 0 (graph) or 128 std to avoid static | |
d5051b98 | 1397 | size_t preLastSample = 0; |
1398 | size_t LastSample = 0; | |
1399 | size_t currSample = 0; | |
1400 | if ( size < 1024 ) return 0; // not enough samples | |
ba1a299c | 1401 | |
d5051b98 | 1402 | //find start of modulating data in trace |
6f36848f | 1403 | idx = findModStart(dest, size, fchigh); |
d5051b98 | 1404 | // Need to threshold first sample |
6f36848f | 1405 | if(dest[idx] < FSK_PSK_THRESHOLD) dest[0] = 0; |
d5051b98 | 1406 | else dest[0] = 1; |
1407 | ||
1408 | last_transition = idx; | |
1409 | idx++; | |
1410 | size_t numBits = 0; | |
1411 | // count cycles between consecutive lo-hi transitions, there should be either 8 (fc/8) | |
1412 | // or 10 (fc/10) cycles but in practice due to noise etc we may end up with anywhere | |
1413 | // between 7 to 11 cycles so fuzz it by treat anything <9 as 8 and anything else as 10 | |
1414 | // (could also be fc/5 && fc/7 for fsk1 = 4-9) | |
1415 | for(; idx < size; idx++) { | |
1416 | // threshold current value | |
6f36848f | 1417 | if (dest[idx] < FSK_PSK_THRESHOLD) dest[idx] = 0; |
d5051b98 | 1418 | else dest[idx] = 1; |
4d3c1796 | 1419 | |
d5051b98 | 1420 | // Check for 0->1 transition |
1421 | if (dest[idx-1] < dest[idx]) { | |
1422 | preLastSample = LastSample; | |
1423 | LastSample = currSample; | |
1424 | currSample = idx-last_transition; | |
1425 | if (currSample < (fclow-2)) { //0-5 = garbage noise (or 0-3) | |
1426 | //do nothing with extra garbage | |
1427 | } else if (currSample < (fchigh-1)) { //6-8 = 8 sample waves (or 3-6 = 5) | |
1428 | //correct previous 9 wave surrounded by 8 waves (or 6 surrounded by 5) | |
1429 | if (numBits > 1 && LastSample > (fchigh-2) && (preLastSample < (fchigh-1))){ | |
1430 | dest[numBits-1]=1; | |
1431 | } | |
1432 | dest[numBits++]=1; | |
1433 | if (numBits > 0 && *startIdx==0) *startIdx = idx - fclow; | |
1434 | } else if (currSample > (fchigh+1) && numBits < 3) { //12 + and first two bit = unusable garbage | |
1435 | //do nothing with beginning garbage and reset.. should be rare.. | |
1436 | numBits = 0; | |
1437 | } else if (currSample == (fclow+1) && LastSample == (fclow-1)) { // had a 7 then a 9 should be two 8's (or 4 then a 6 should be two 5's) | |
1438 | dest[numBits++]=1; | |
1439 | if (numBits > 0 && *startIdx==0) *startIdx = idx - fclow; | |
1440 | } else { //9+ = 10 sample waves (or 6+ = 7) | |
1441 | dest[numBits++]=0; | |
1442 | if (numBits > 0 && *startIdx==0) *startIdx = idx - fchigh; | |
4d3c1796 | 1443 | } |
d5051b98 | 1444 | last_transition = idx; |
4d3c1796 | 1445 | } |
e0165dcf | 1446 | } |
d5051b98 | 1447 | return numBits; //Actually, it returns the number of bytes, but each byte represents a bit: 1 or 0 |
1448 | } | |
4d3c1796 | 1449 | |
d5051b98 | 1450 | //translate 11111100000 to 10 |
1451 | //rfLen = clock, fchigh = larger field clock, fclow = smaller field clock | |
1452 | size_t aggregate_bits(uint8_t *dest, size_t size, uint8_t rfLen, uint8_t invert, uint8_t fchigh, uint8_t fclow, int *startIdx) { | |
1453 | uint8_t lastval=dest[0]; | |
1454 | size_t idx=0; | |
1455 | size_t numBits=0; | |
1456 | uint32_t n=1; | |
1457 | for( idx=1; idx < size; idx++) { | |
1458 | n++; | |
1459 | if (dest[idx]==lastval) continue; //skip until we hit a transition | |
1460 | ||
1461 | //find out how many bits (n) we collected (use 1/2 clk tolerance) | |
1462 | //if lastval was 1, we have a 1->0 crossing | |
1463 | if (dest[idx-1]==1) { | |
1464 | n = (n * fclow + rfLen/2) / rfLen; | |
1465 | } else {// 0->1 crossing | |
1466 | n = (n * fchigh + rfLen/2) / rfLen; | |
e0165dcf | 1467 | } |
d5051b98 | 1468 | if (n == 0) n = 1; |
1469 | ||
1470 | //first transition - save startidx | |
1471 | if (numBits == 0) { | |
1472 | if (lastval == 1) { //high to low | |
1473 | *startIdx += (fclow * idx) - (n*rfLen); | |
1474 | if (g_debugMode==2) prnt("DEBUG FSK: startIdx %i, fclow*idx %i, n*rflen %u", *startIdx, fclow*(idx), n*rfLen); | |
1475 | } else { | |
1476 | *startIdx += (fchigh * idx) - (n*rfLen); | |
1477 | if (g_debugMode==2) prnt("DEBUG FSK: startIdx %i, fchigh*idx %i, n*rflen %u", *startIdx, fchigh*(idx), n*rfLen); | |
1478 | } | |
4d3c1796 | 1479 | } |
d5051b98 | 1480 | |
1481 | //add to our destination the bits we collected | |
1482 | memset(dest+numBits, dest[idx-1]^invert , n); | |
1483 | numBits += n; | |
1484 | n=0; | |
1485 | lastval=dest[idx]; | |
1486 | }//end for | |
1487 | // if valid extra bits at the end were all the same frequency - add them in | |
1488 | if (n > rfLen/fchigh) { | |
1489 | if (dest[idx-2]==1) { | |
1490 | n = (n * fclow + rfLen/2) / rfLen; | |
1491 | } else { | |
1492 | n = (n * fchigh + rfLen/2) / rfLen; | |
4d3c1796 | 1493 | } |
d5051b98 | 1494 | memset(dest+numBits, dest[idx-1]^invert , n); |
1495 | numBits += n; | |
e0165dcf | 1496 | } |
d5051b98 | 1497 | return numBits; |
ba1a299c | 1498 | } |
4d3c1796 | 1499 | |
d5051b98 | 1500 | //by marshmellow (from holiman's base) |
1501 | // full fsk demod from GraphBuffer wave to decoded 1s and 0s (no mandemod) | |
1c70664a | 1502 | int fskdemod(uint8_t *dest, size_t size, uint8_t rfLen, uint8_t invert, uint8_t fchigh, uint8_t fclow, int *startIdx) { |
c4f51073 | 1503 | if (justNoise(dest, size)) return 0; |
d5051b98 | 1504 | // FSK demodulator |
1505 | size = fsk_wave_demod(dest, size, fchigh, fclow, startIdx); | |
1506 | size = aggregate_bits(dest, size, rfLen, invert, fchigh, fclow, startIdx); | |
1507 | return size; | |
8b6abef5 | 1508 | } |
1509 | ||
d5051b98 | 1510 | // by marshmellow |
1511 | // convert psk1 demod to psk2 demod | |
1512 | // only transition waves are 1s | |
1513 | void psk1TOpsk2(uint8_t *BitStream, size_t size) { | |
1514 | size_t i=1; | |
1515 | uint8_t lastBit=BitStream[0]; | |
1516 | for (; i<size; i++){ | |
1517 | if (BitStream[i]==7){ | |
1518 | //ignore errors | |
1519 | } else if (lastBit!=BitStream[i]){ | |
1520 | lastBit=BitStream[i]; | |
1521 | BitStream[i]=1; | |
1522 | } else { | |
1523 | BitStream[i]=0; | |
1524 | } | |
1525 | } | |
1526 | return; | |
1527 | } | |
e0165dcf | 1528 | |
d5051b98 | 1529 | // by marshmellow |
1530 | // convert psk2 demod to psk1 demod | |
1531 | // from only transition waves are 1s to phase shifts change bit | |
1532 | void psk2TOpsk1(uint8_t *BitStream, size_t size) { | |
1533 | uint8_t phase=0; | |
1534 | for (size_t i=0; i<size; i++){ | |
1535 | if (BitStream[i]==1){ | |
1536 | phase ^=1; | |
1537 | } | |
1538 | BitStream[i]=phase; | |
1539 | } | |
1540 | return; | |
1541 | } | |
2eec55c8 | 1542 | |
d5051b98 | 1543 | //by marshmellow - demodulate PSK1 wave |
1544 | //uses wave lengths (# Samples) | |
1545 | int pskRawDemod_ext(uint8_t dest[], size_t *size, int *clock, int *invert, int *startIdx) { | |
6f36848f | 1546 | if (*size < 170) return -1; |
2eec55c8 | 1547 | |
d5051b98 | 1548 | uint8_t curPhase = *invert; |
b97311b1 | 1549 | uint8_t fc=0; |
6f36848f | 1550 | size_t i=0, numBits=0, waveStart=1, waveEnd=0, firstFullWave=0, lastClkBit=0; |
b97311b1 | 1551 | uint16_t fullWaveLen=0, waveLenCnt=0, avgWaveVal; |
6f36848f | 1552 | uint16_t errCnt=0, errCnt2=0; |
1553 | ||
b97311b1 | 1554 | *clock = DetectPSKClock(dest, *size, *clock, &firstFullWave, &curPhase, &fc); |
0aed2199 | 1555 | if (*clock <= 0) return -1; |
b97311b1 | 1556 | //if clock detect found firstfullwave... |
1557 | uint16_t tol = fc/2; | |
d5051b98 | 1558 | if (firstFullWave == 0) { |
b97311b1 | 1559 | //find start of modulating data in trace |
1560 | i = findModStart(dest, *size, fc); | |
1561 | //find first phase shift | |
1562 | firstFullWave = pskFindFirstPhaseShift(dest, *size, &curPhase, i, fc, &fullWaveLen); | |
1563 | if (firstFullWave == 0) { | |
1564 | // no phase shift detected - could be all 1's or 0's - doesn't matter where we start | |
1565 | // so skip a little to ensure we are past any Start Signal | |
1566 | firstFullWave = 160; | |
1567 | memset(dest, curPhase, firstFullWave / *clock); | |
1568 | } else { | |
1569 | memset(dest, curPhase^1, firstFullWave / *clock); | |
1570 | } | |
d5051b98 | 1571 | } else { |
1572 | memset(dest, curPhase^1, firstFullWave / *clock); | |
1573 | } | |
1574 | //advance bits | |
1575 | numBits += (firstFullWave / *clock); | |
1576 | *startIdx = firstFullWave - (*clock * numBits)+2; | |
1577 | //set start of wave as clock align | |
1578 | lastClkBit = firstFullWave; | |
1579 | if (g_debugMode==2) prnt("DEBUG PSK: firstFullWave: %u, waveLen: %u, startIdx %i",firstFullWave,fullWaveLen, *startIdx); | |
1580 | if (g_debugMode==2) prnt("DEBUG PSK: clk: %d, lastClkBit: %u, fc: %u", *clock, lastClkBit,(unsigned int) fc); | |
1581 | waveStart = 0; | |
1582 | dest[numBits++] = curPhase; //set first read bit | |
b97311b1 | 1583 | for (i = firstFullWave + fullWaveLen - 1; i < *size-3; i++) { |
d5051b98 | 1584 | //top edge of wave = start of new wave |
b97311b1 | 1585 | if (dest[i]+fc < dest[i+1] && dest[i+1] >= dest[i+2]) { |
d5051b98 | 1586 | if (waveStart == 0) { |
1587 | waveStart = i+1; | |
1588 | waveLenCnt = 0; | |
1589 | avgWaveVal = dest[i+1]; | |
1590 | } else { //waveEnd | |
1591 | waveEnd = i+1; | |
1592 | waveLenCnt = waveEnd-waveStart; | |
b97311b1 | 1593 | if (waveLenCnt > fc) { |
d5051b98 | 1594 | //this wave is a phase shift |
1595 | //PrintAndLog("DEBUG: phase shift at: %d, len: %d, nextClk: %d, i: %d, fc: %d",waveStart,waveLenCnt,lastClkBit+*clock-tol,i+1,fc); | |
b97311b1 | 1596 | if (i+1 >= lastClkBit + *clock - tol) { //should be a clock bit |
d5051b98 | 1597 | curPhase ^= 1; |
1598 | dest[numBits++] = curPhase; | |
1599 | lastClkBit += *clock; | |
b97311b1 | 1600 | } else if (i < lastClkBit+10+fc) { |
d5051b98 | 1601 | //noise after a phase shift - ignore |
1602 | } else { //phase shift before supposed to based on clock | |
1603 | errCnt++; | |
1604 | dest[numBits++] = 7; | |
1605 | } | |
b97311b1 | 1606 | } else if (i+1 > lastClkBit + *clock + tol + fc) { |
d5051b98 | 1607 | lastClkBit += *clock; //no phase shift but clock bit |
1608 | dest[numBits++] = curPhase; | |
1609 | } else if (waveLenCnt < fc - 1) { //wave is smaller than field clock (shouldn't happen often) | |
1610 | errCnt2++; | |
1611 | if(errCnt2 > 101) return errCnt2; | |
b97311b1 | 1612 | avgWaveVal += dest[i+1]; |
1613 | continue; | |
e0165dcf | 1614 | } |
d5051b98 | 1615 | avgWaveVal = 0; |
1616 | waveStart = i+1; | |
e0165dcf | 1617 | } |
1618 | } | |
d5051b98 | 1619 | avgWaveVal += dest[i+1]; |
e0165dcf | 1620 | } |
d5051b98 | 1621 | *size = numBits; |
1622 | return errCnt; | |
03e6bb4a | 1623 | } |
1e090a61 | 1624 | |
d5051b98 | 1625 | int pskRawDemod(uint8_t dest[], size_t *size, int *clock, int *invert) { |
1626 | int startIdx = 0; | |
1627 | return pskRawDemod_ext(dest, size, clock, invert, &startIdx); | |
669959bc | 1628 | } |
1629 | ||
d5051b98 | 1630 | //********************************************************************************************** |
1631 | //-----------------Tag format detection section------------------------------------------------- | |
1632 | //********************************************************************************************** | |
4d3c1796 | 1633 | |
1634 | // by marshmellow | |
1635 | // FSK Demod then try to locate an AWID ID | |
1c70664a | 1636 | int AWIDdemodFSK(uint8_t *dest, size_t *size, int *waveStartIdx) { |
4d3c1796 | 1637 | //make sure buffer has enough data |
1638 | if (*size < 96*50) return -1; | |
1639 | ||
4d3c1796 | 1640 | // FSK demodulator |
1c70664a | 1641 | *size = fskdemod(dest, *size, 50, 1, 10, 8, waveStartIdx); // fsk2a RF/50 |
4d3c1796 | 1642 | if (*size < 96) return -3; //did we get a good demod? |
1643 | ||
1644 | uint8_t preamble[] = {0,0,0,0,0,0,0,1}; | |
1645 | size_t startIdx = 0; | |
1646 | uint8_t errChk = preambleSearch(dest, preamble, sizeof(preamble), size, &startIdx); | |
1647 | if (errChk == 0) return -4; //preamble not found | |
1648 | if (*size != 96) return -5; | |
1649 | return (int)startIdx; | |
1650 | } | |
1651 | ||
03e6bb4a | 1652 | //by marshmellow |
4d3c1796 | 1653 | //takes 1s and 0s and searches for EM410x format - output EM ID |
1654 | uint8_t Em410xDecode(uint8_t *BitStream, size_t *size, size_t *startIdx, uint32_t *hi, uint64_t *lo) | |
03e6bb4a | 1655 | { |
4d3c1796 | 1656 | //sanity checks |
1657 | if (*size < 64) return 0; | |
1658 | if (BitStream[1]>1) return 0; //allow only 1s and 0s | |
e0165dcf | 1659 | |
4d3c1796 | 1660 | // 111111111 bit pattern represent start of frame |
1661 | // include 0 in front to help get start pos | |
1662 | uint8_t preamble[] = {0,1,1,1,1,1,1,1,1,1}; | |
1663 | uint8_t errChk = 0; | |
1664 | uint8_t FmtLen = 10; // sets of 4 bits = end data | |
1665 | *startIdx = 0; | |
1666 | errChk = preambleSearch(BitStream, preamble, sizeof(preamble), size, startIdx); | |
1667 | if ( errChk == 0 || (*size != 64 && *size != 128) ) return 0; | |
1668 | if (*size == 128) FmtLen = 22; // 22 sets of 4 bits | |
e0165dcf | 1669 | |
4d3c1796 | 1670 | //skip last 4bit parity row for simplicity |
1671 | *size = removeParity(BitStream, *startIdx + sizeof(preamble), 5, 0, FmtLen * 5); | |
1672 | if (*size == 40) { // std em410x format | |
1673 | *hi = 0; | |
1674 | *lo = ((uint64_t)(bytebits_to_byte(BitStream, 8)) << 32) | (bytebits_to_byte(BitStream + 8, 32)); | |
1675 | } else if (*size == 88) { // long em format | |
1676 | *hi = (bytebits_to_byte(BitStream, 24)); | |
1677 | *lo = ((uint64_t)(bytebits_to_byte(BitStream + 24, 32)) << 32) | (bytebits_to_byte(BitStream + 24 + 32, 32)); | |
1678 | } else { | |
f2ea55fb | 1679 | if (g_debugMode) prnt("Error removing parity: %u", *size); |
4d3c1796 | 1680 | return 0; |
709665b5 | 1681 | } |
4d3c1796 | 1682 | return 1; |
6de43508 | 1683 | } |
1684 | ||
4d3c1796 | 1685 | // Ask/Biphase Demod then try to locate an ISO 11784/85 ID |
1686 | // BitStream must contain previously askrawdemod and biphasedemoded data | |
1687 | int FDXBdemodBI(uint8_t *dest, size_t *size) { | |
1688 | //make sure buffer has enough data | |
1689 | if (*size < 128) return -1; | |
e0165dcf | 1690 | |
4d3c1796 | 1691 | size_t startIdx = 0; |
1692 | uint8_t preamble[] = {0,0,0,0,0,0,0,0,0,0,1}; | |
6980d66b | 1693 | |
4d3c1796 | 1694 | uint8_t errChk = preambleSearch(dest, preamble, sizeof(preamble), size, &startIdx); |
1695 | if (errChk == 0) return -2; //preamble not found | |
4db6f3bb | 1696 | if (*size != 128) return -3; //wrong size for fdxb |
1697 | //return start position | |
4d3c1796 | 1698 | return (int)startIdx; |
1699 | } | |
6980d66b | 1700 | |
4d3c1796 | 1701 | // by marshmellow |
1702 | // demod gProxIIDemod | |
1703 | // error returns as -x | |
1704 | // success returns start position in BitStream | |
1705 | // BitStream must contain previously askrawdemod and biphasedemoded data | |
1706 | int gProxII_Demod(uint8_t BitStream[], size_t *size) { | |
1707 | size_t startIdx=0; | |
1708 | uint8_t preamble[] = {1,1,1,1,1,0}; | |
669959bc | 1709 | |
4d3c1796 | 1710 | uint8_t errChk = preambleSearch(BitStream, preamble, sizeof(preamble), size, &startIdx); |
1711 | if (errChk == 0) return -3; //preamble not found | |
1712 | if (*size != 96) return -2; //should have found 96 bits | |
1713 | //check first 6 spacer bits to verify format | |
1714 | if (!BitStream[startIdx+5] && !BitStream[startIdx+10] && !BitStream[startIdx+15] && !BitStream[startIdx+20] && !BitStream[startIdx+25] && !BitStream[startIdx+30]){ | |
1715 | //confirmed proper separator bits found | |
1716 | //return start position | |
1717 | return (int) startIdx; | |
e0165dcf | 1718 | } |
4d3c1796 | 1719 | return -5; //spacer bits not found - not a valid gproxII |
ab812dfa | 1720 | } |
1721 | ||
4d3c1796 | 1722 | // loop to get raw HID waveform then FSK demodulate the TAG ID from it |
1c70664a | 1723 | int HIDdemodFSK(uint8_t *dest, size_t *size, uint32_t *hi2, uint32_t *hi, uint32_t *lo, int *waveStartIdx) { |
4d3c1796 | 1724 | size_t numStart=0, size2=*size, startIdx=0; |
1c70664a | 1725 | // FSK demodulator fsk2a so invert and fc/10/8 |
1726 | *size = fskdemod(dest, size2, 50, 1, 10, 8, waveStartIdx); | |
4d3c1796 | 1727 | if (*size < 96*2) return -2; |
1728 | // 00011101 bit pattern represent start of frame, 01 pattern represents a 0 and 10 represents a 1 | |
1729 | uint8_t preamble[] = {0,0,0,1,1,1,0,1}; | |
1730 | // find bitstring in array | |
1731 | uint8_t errChk = preambleSearch(dest, preamble, sizeof(preamble), size, &startIdx); | |
1732 | if (errChk == 0) return -3; //preamble not found | |
d1869c33 | 1733 | |
4d3c1796 | 1734 | numStart = startIdx + sizeof(preamble); |
1735 | // final loop, go over previously decoded FSK data and manchester decode into usable tag ID | |
1736 | for (size_t idx = numStart; (idx-numStart) < *size - sizeof(preamble); idx+=2){ | |
1737 | if (dest[idx] == dest[idx+1]){ | |
1738 | return -4; //not manchester data | |
d1869c33 | 1739 | } |
4d3c1796 | 1740 | *hi2 = (*hi2<<1)|(*hi>>31); |
1741 | *hi = (*hi<<1)|(*lo>>31); | |
1742 | //Then, shift in a 0 or one into low | |
1743 | if (dest[idx] && !dest[idx+1]) // 1 0 | |
1744 | *lo=(*lo<<1)|1; | |
1745 | else // 0 1 | |
1746 | *lo=(*lo<<1)|0; | |
d1869c33 | 1747 | } |
4d3c1796 | 1748 | return (int)startIdx; |
1749 | } | |
d1869c33 | 1750 | |
1c70664a | 1751 | int IOdemodFSK(uint8_t *dest, size_t size, int *waveStartIdx) { |
4d3c1796 | 1752 | //make sure buffer has data |
1753 | if (size < 66*64) return -2; | |
1c70664a | 1754 | // FSK demodulator RF/64, fsk2a so invert, and fc/10/8 |
1755 | size = fskdemod(dest, size, 64, 1, 10, 8, waveStartIdx); | |
4d3c1796 | 1756 | if (size < 65) return -3; //did we get a good demod? |
1757 | //Index map | |
1758 | //0 10 20 30 40 50 60 | |
1759 | //| | | | | | | | |
1760 | //01234567 8 90123456 7 89012345 6 78901234 5 67890123 4 56789012 3 45678901 23 | |
1761 | //----------------------------------------------------------------------------- | |
1762 | //00000000 0 11110000 1 facility 1 version* 1 code*one 1 code*two 1 ???????? 11 | |
1763 | // | |
1764 | //XSF(version)facility:codeone+codetwo | |
1765 | //Handle the data | |
1766 | size_t startIdx = 0; | |
1767 | uint8_t preamble[] = {0,0,0,0,0,0,0,0,0,1}; | |
1768 | uint8_t errChk = preambleSearch(dest, preamble, sizeof(preamble), &size, &startIdx); | |
1769 | if (errChk == 0) return -4; //preamble not found | |
d1869c33 | 1770 | |
4d3c1796 | 1771 | if (!dest[startIdx+8] && dest[startIdx+17]==1 && dest[startIdx+26]==1 && dest[startIdx+35]==1 && dest[startIdx+44]==1 && dest[startIdx+53]==1){ |
1772 | //confirmed proper separator bits found | |
1773 | //return start position | |
1774 | return (int) startIdx; | |
d1869c33 | 1775 | } |
4d3c1796 | 1776 | return -5; |
1777 | } | |
d1869c33 | 1778 | |
4d3c1796 | 1779 | // redesigned by marshmellow adjusted from existing decode functions |
1dae9811 | 1780 | // indala id decoding |
1781 | int indala64decode(uint8_t *bitStream, size_t *size, uint8_t *invert) { | |
1782 | //standard 64 bit indala formats including 26 bit 40134 format | |
1783 | uint8_t preamble64[] = {1,0,1,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 1}; | |
1784 | uint8_t preamble64_i[] = {0,1,0,1, 1,1,1,1, 1,1,1,1, 1,1,1,1, 1,1,1,1, 1,1,1,1, 1,1,1,1, 1,1,1,1, 0}; | |
1785 | size_t startidx = 0; | |
1786 | size_t found_size = *size; | |
1787 | bool found = preambleSearch(bitStream, preamble64, sizeof(preamble64), &found_size, &startidx); | |
1788 | if (!found) { | |
1789 | found = preambleSearch(bitStream, preamble64_i, sizeof(preamble64_i), &found_size, &startidx); | |
1790 | if (!found) return -1; | |
4d3c1796 | 1791 | *invert ^= 1; |
1dae9811 | 1792 | } |
1793 | if (found_size != 64) return -2; | |
4d3c1796 | 1794 | if (*invert==1) |
1dae9811 | 1795 | for (size_t i = startidx; i < found_size + startidx; i++) |
1796 | bitStream[i] ^= 1; | |
1797 | ||
1798 | // note: don't change *size until we are sure we got it... | |
1799 | *size = found_size; | |
1800 | return (int) startidx; | |
1801 | } | |
1802 | ||
1803 | int indala224decode(uint8_t *bitStream, size_t *size, uint8_t *invert) { | |
1804 | //large 224 bit indala formats (different preamble too...) | |
1805 | uint8_t preamble224[] = {1,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,1}; | |
1806 | uint8_t preamble224_i[] = {0,1,1,1, 1,1,1,1, 1,1,1,1, 1,1,1,1, 1,1,1,1, 1,1,1,1, 1,1,1,1, 1,1,1,0}; | |
1807 | size_t startidx = 0; | |
1808 | size_t found_size = *size; | |
1809 | bool found = preambleSearch(bitStream, preamble224, sizeof(preamble224), &found_size, &startidx); | |
1810 | if (!found) { | |
1811 | found = preambleSearch(bitStream, preamble224_i, sizeof(preamble224_i), &found_size, &startidx); | |
1812 | if (!found) return -1; | |
1813 | *invert ^= 1; | |
1814 | } | |
1815 | if (found_size != 224) return -2; | |
1816 | if (*invert==1 && startidx > 0) | |
1817 | for (size_t i = startidx-1; i < found_size + startidx + 2; i++) | |
4d3c1796 | 1818 | bitStream[i] ^= 1; |
1819 | ||
1dae9811 | 1820 | // 224 formats are typically PSK2 (afaik 2017 Marshmellow) |
1821 | // note loses 1 bit at beginning of transformation... | |
1822 | // don't need to verify array is big enough as to get here there has to be a full preamble after all of our data | |
1823 | psk1TOpsk2(bitStream + (startidx-1), found_size+2); | |
1824 | startidx++; | |
1825 | ||
1826 | *size = found_size; | |
4d3c1796 | 1827 | return (int) startidx; |
1828 | } | |
1829 | ||
1830 | // loop to get raw paradox waveform then FSK demodulate the TAG ID from it | |
1c70664a | 1831 | int ParadoxdemodFSK(uint8_t *dest, size_t *size, uint32_t *hi2, uint32_t *hi, uint32_t *lo, int *waveStartIdx) { |
4d3c1796 | 1832 | size_t numStart=0, size2=*size, startIdx=0; |
1833 | // FSK demodulator | |
1c70664a | 1834 | *size = fskdemod(dest, size2,50,1,10,8,waveStartIdx); //fsk2a |
4d3c1796 | 1835 | if (*size < 96) return -2; |
d1869c33 | 1836 | |
4d3c1796 | 1837 | // 00001111 bit pattern represent start of frame, 01 pattern represents a 0 and 10 represents a 1 |
1838 | uint8_t preamble[] = {0,0,0,0,1,1,1,1}; | |
1839 | ||
1840 | uint8_t errChk = preambleSearch(dest, preamble, sizeof(preamble), size, &startIdx); | |
1841 | if (errChk == 0) return -3; //preamble not found | |
1842 | ||
1843 | numStart = startIdx + sizeof(preamble); | |
1844 | // final loop, go over previously decoded FSK data and manchester decode into usable tag ID | |
1845 | for (size_t idx = numStart; (idx-numStart) < *size - sizeof(preamble); idx+=2){ | |
1846 | if (dest[idx] == dest[idx+1]) | |
1847 | return -4; //not manchester data | |
1848 | *hi2 = (*hi2<<1)|(*hi>>31); | |
1849 | *hi = (*hi<<1)|(*lo>>31); | |
1850 | //Then, shift in a 0 or one into low | |
1851 | if (dest[idx] && !dest[idx+1]) // 1 0 | |
1852 | *lo=(*lo<<1)|1; | |
1853 | else // 0 1 | |
1854 | *lo=(*lo<<1)|0; | |
d1869c33 | 1855 | } |
4d3c1796 | 1856 | return (int)startIdx; |
d1869c33 | 1857 | } |
8b6abef5 | 1858 | |
4d3c1796 | 1859 | // find presco preamble 0x10D in already demoded data |
1860 | int PrescoDemod(uint8_t *dest, size_t *size) { | |
1861 | //make sure buffer has data | |
1862 | if (*size < 64*2) return -2; | |
1863 | ||
1864 | size_t startIdx = 0; | |
1865 | uint8_t preamble[] = {1,0,0,0,0,1,1,0,1,0,0,0,0,0,0,0,0,0,0,0}; | |
1866 | uint8_t errChk = preambleSearch(dest, preamble, sizeof(preamble), size, &startIdx); | |
1867 | if (errChk == 0) return -4; //preamble not found | |
1868 | //return start position | |
1869 | return (int) startIdx; | |
669959bc | 1870 | } |
1871 | ||
4d3c1796 | 1872 | // by marshmellow |
1873 | // FSK Demod then try to locate a Farpointe Data (pyramid) ID | |
1c70664a | 1874 | int PyramiddemodFSK(uint8_t *dest, size_t *size, int *waveStartIdx) { |
4d3c1796 | 1875 | //make sure buffer has data |
1876 | if (*size < 128*50) return -5; | |
1877 | ||
4d3c1796 | 1878 | // FSK demodulator |
1c70664a | 1879 | *size = fskdemod(dest, *size, 50, 1, 10, 8, waveStartIdx); // fsk2a RF/50 |
4d3c1796 | 1880 | if (*size < 128) return -2; //did we get a good demod? |
1881 | ||
1882 | uint8_t preamble[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}; | |
1883 | size_t startIdx = 0; | |
1884 | uint8_t errChk = preambleSearch(dest, preamble, sizeof(preamble), size, &startIdx); | |
1885 | if (errChk == 0) return -4; //preamble not found | |
1886 | if (*size != 128) return -3; | |
1887 | return (int)startIdx; | |
1888 | } | |
1889 | ||
1890 | // by marshmellow | |
1891 | // find viking preamble 0xF200 in already demoded data | |
1892 | int VikingDemod_AM(uint8_t *dest, size_t *size) { | |
1893 | //make sure buffer has data | |
1894 | if (*size < 64*2) return -2; | |
1895 | ||
1896 | size_t startIdx = 0; | |
1897 | uint8_t preamble[] = {1,1,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; | |
1898 | uint8_t errChk = preambleSearch(dest, preamble, sizeof(preamble), size, &startIdx); | |
1899 | if (errChk == 0) return -4; //preamble not found | |
1900 | uint32_t checkCalc = bytebits_to_byte(dest+startIdx,8) ^ bytebits_to_byte(dest+startIdx+8,8) ^ bytebits_to_byte(dest+startIdx+16,8) | |
1901 | ^ bytebits_to_byte(dest+startIdx+24,8) ^ bytebits_to_byte(dest+startIdx+32,8) ^ bytebits_to_byte(dest+startIdx+40,8) | |
1902 | ^ bytebits_to_byte(dest+startIdx+48,8) ^ bytebits_to_byte(dest+startIdx+56,8); | |
1903 | if ( checkCalc != 0xA8 ) return -5; | |
1904 | if (*size != 64) return -6; | |
1905 | //return start position | |
1906 | return (int) startIdx; | |
1907 | } | |
1908 | ||
8b6abef5 | 1909 | // by iceman |
1910 | // find Visa2000 preamble in already demoded data | |
1911 | int Visa2kDemod_AM(uint8_t *dest, size_t *size) { | |
1912 | if (*size < 96) return -1; //make sure buffer has data | |
1913 | size_t startIdx = 0; | |
1914 | uint8_t preamble[] = {0,1,0,1,0,1,1,0,0,1,0,0,1,0,0,1,0,1,0,1,0,0,1,1,0,0,1,1,0,0,1,0}; | |
1915 | if (preambleSearch(dest, preamble, sizeof(preamble), size, &startIdx) == 0) | |
1916 | return -2; //preamble not found | |
1917 | if (*size != 96) return -3; //wrong demoded size | |
1918 | //return start position | |
1919 | return (int)startIdx; | |
1920 | } |