mirror of https://github.com/hb9fxq/gr-digitalhf
50 lines
1.6 KiB
Python
50 lines
1.6 KiB
Python
#!/usr/bin/env python
|
|
# -*- coding: utf-8 -*-
|
|
#
|
|
# Copyright 2018 hcab14@mail.com.
|
|
#
|
|
# This is free software; you can redistribute it and/or modify
|
|
# it under the terms of the GNU General Public License as published by
|
|
# the Free Software Foundation; either version 3, or (at your option)
|
|
# any later version.
|
|
#
|
|
# This software is distributed in the hope that it will be useful,
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
# GNU General Public License for more details.
|
|
#
|
|
# You should have received a copy of the GNU General Public License
|
|
# along with this software; see the file COPYING. If not, write to
|
|
# the Free Software Foundation, Inc., 51 Franklin Street,
|
|
# Boston, MA 02110-1301, USA.
|
|
#
|
|
|
|
import digitalhf.digitalhf_swig as digitalhf
|
|
import random
|
|
import pmt
|
|
def main():
|
|
v = digitalhf.viterbi29(0x11d, 0x1af)
|
|
N = 45*500+5
|
|
bits = [random.randint(0,1) for _ in range(N+9)]
|
|
a = [1,0,1,1,1,0,0,0,1]
|
|
b = [1,1,1,1,0,1,0,1,1]
|
|
llr_encoded_bits = []
|
|
for i in range(N):
|
|
t1=t2=0
|
|
for j in range(9):
|
|
t1 += a[j]*bits[i+9-j]
|
|
t2 += b[j]*bits[i+9-j]
|
|
llr_encoded_bits.extend([7*(1-2*(t1%2)), 7*(1-2*(t2%2))])
|
|
v.reset()
|
|
decoded_bits = v.udpate(llr_encoded_bits)
|
|
print(bits[9:39])
|
|
print(decoded_bits[0:30])
|
|
print('quality:', v.quality())
|
|
test = [all([decoded_bits[i] == bits[i+9] for i in range(N)]), abs(v.quality()-2*N)<1]
|
|
print('test:', test)
|
|
if not all(test):
|
|
raise Exception(test)
|
|
|
|
if __name__ == '__main__':
|
|
main()
|