blob: c704a85199e6614de990aae3c239a0e913712adb (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
/* -*- c++ -*- */
/*
* Copyright 2004,2013 Free Software Foundation, Inc.
*
* This file is part of GNU Radio
*
* SPDX-License-Identifier: GPL-3.0-or-later
*
*/
#ifndef INCLUDED_GR_CHECK_LFSR_32K_S_IMPL_H
#define INCLUDED_GR_CHECK_LFSR_32K_S_IMPL_H
#include <gnuradio/blocks/check_lfsr_32k_s.h>
#include <gnuradio/blocks/lfsr_32k.h>
namespace gr {
namespace blocks {
class check_lfsr_32k_s_impl : public check_lfsr_32k_s
{
private:
enum state {
SEARCHING, // searching for synchronization
MATCH0,
MATCH1,
MATCH2,
LOCKED // is locked
};
state d_state;
unsigned int d_history; // bitmask of decisions
long d_ntotal; // total number of shorts
long d_nright; // # of correct shorts
long d_runlength; // # of correct shorts in a row
static constexpr int BUFSIZE = 2048 - 1; // ensure pattern isn't packet aligned
int d_index;
unsigned short d_buffer[BUFSIZE];
void enter_SEARCHING();
void enter_MATCH0();
void enter_MATCH1();
void enter_MATCH2();
void enter_LOCKED();
void right()
{
d_history = (d_history << 1) | 0x1;
d_nright++;
d_runlength++;
}
void wrong()
{
d_history = (d_history << 1) | 0x0;
d_runlength = 0;
}
bool right_three_times() { return (d_history & 0x7) == 0x7; }
bool wrong_three_times() { return (d_history & 0x7) == 0x0; }
void log_error(unsigned short expected, unsigned short actual);
public:
check_lfsr_32k_s_impl();
~check_lfsr_32k_s_impl();
int work(int noutput_items,
gr_vector_const_void_star& input_items,
gr_vector_void_star& output_items) override;
long ntotal() const { return d_ntotal; }
long nright() const { return d_nright; }
long runlength() const { return d_runlength; }
};
} /* namespace blocks */
} /* namespace gr */
#endif /* INCLUDED_GR_CHECK_LFSR_32K_S_IMPL_H */
|
