|
| 1 | +/* |
| 2 | + * Copyright (C) 2016 Swift Navigation Inc. |
| 3 | + * Contact: Dmitry Tatarinov <dmitry.tatarinov@exafore.com> |
| 4 | + * |
| 5 | + * This source is subject to the license found in the file 'LICENSE' which must |
| 6 | + * be be distributed together with this source. All other rights reserved. |
| 7 | + * |
| 8 | + * THIS CODE AND INFORMATION IS PROVIDED "AS IS" WITHOUT WARRANTY OF ANY KIND, |
| 9 | + * EITHER EXPRESSED OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE IMPLIED |
| 10 | + * WARRANTIES OF MERCHANTABILITY AND/OR FITNESS FOR A PARTICULAR PURPOSE. |
| 11 | + */ |
| 12 | + |
| 13 | +#include <stdio.h> |
| 14 | +#include <check.h> |
| 15 | +#include <math.h> |
| 16 | +#include <libswiftnav/nav_msg_glo.h> |
| 17 | + |
| 18 | +nav_msg_glo_t n; |
| 19 | + |
| 20 | + |
| 21 | +START_TEST(test_extract_glo_word) |
| 22 | +{ |
| 23 | + u32 ret = 0; |
| 24 | + nav_msg_init_glo(&n); |
| 25 | + n.string_bits[0] = 5; |
| 26 | + n.string_bits[1] = 5; |
| 27 | + n.string_bits[2] = 5; |
| 28 | + ret = extract_word_glo(&n,1,32); |
| 29 | + fail_unless(ret == 5, "1. %x, expected %x", ret, 5); |
| 30 | + ret = extract_word_glo(&n,33,3); |
| 31 | + fail_unless(ret == 5, "2. %x, expected %x", ret, 5); |
| 32 | + ret = extract_word_glo(&n,65,3); |
| 33 | + fail_unless(ret == 5, "3. %x, expected %x", ret, 5); |
| 34 | + |
| 35 | + n.string_bits[0] = 0x12345678; |
| 36 | + n.string_bits[1] = 0xdeadbeef; |
| 37 | + n.string_bits[2] = 0x87654321; |
| 38 | + ret = extract_word_glo(&n,1,32); |
| 39 | + fail_unless(ret == 0x12345678, "4. %x, expected %x", ret, 0x12345678); |
| 40 | + ret = extract_word_glo(&n,33,32); |
| 41 | + fail_unless(ret == 0xdeadbeef, "5. %x, expected %x", ret, 0xdeadbeef); |
| 42 | + ret = extract_word_glo(&n,65,32); |
| 43 | + fail_unless(ret == 0x87654321, "6. %x, expected %x", ret, 0x87654321); |
| 44 | + ret = extract_word_glo(&n,49,4); |
| 45 | + fail_unless(ret == 0xd, "7. %x, expected %x", ret, 0xd); |
| 46 | + |
| 47 | + n.string_bits[0] = 0xbeef0000; |
| 48 | + n.string_bits[1] = 0x4321dead; |
| 49 | + n.string_bits[2] = 0x00008765; |
| 50 | + ret = extract_word_glo(&n,17,32); |
| 51 | + fail_unless(ret == 0xdeadbeef, "8. %x, expected %x", ret, 0xdeadbeef); |
| 52 | + ret = extract_word_glo(&n,49,32); |
| 53 | + fail_unless(ret == 0x87654321, "9. %x, expected %x", ret, 0x87654321); |
| 54 | + ret = extract_word_glo(&n,49,16); |
| 55 | + fail_unless(ret == 0x4321, "10. %x, expected %x", ret, 0x4321); |
| 56 | +} |
| 57 | +END_TEST |
| 58 | + |
| 59 | +START_TEST(test_extract_real_glo_word) |
| 60 | +{ |
| 61 | + u32 ret = 0; |
| 62 | + u8 sign = 0; |
| 63 | + double f_ret; |
| 64 | + nav_msg_init_glo(&n); |
| 65 | + //parse string 1 |
| 66 | + n.string_bits[0] = 0xc3a850b5; |
| 67 | + n.string_bits[1] = 0x96999b05; |
| 68 | + n.string_bits[2] = 0x010743; |
| 69 | + ret = extract_word_glo(&n,85,1); |
| 70 | + fail_unless(ret == 0, "1. %x, expected %x", ret, 0); |
| 71 | + ret = extract_word_glo(&n,81,4); |
| 72 | + fail_unless(ret == 1, "2. %x, expected %x", ret, 1); |
| 73 | + printf("STRING %u\n",ret); |
| 74 | + ret = extract_word_glo(&n,9,26); |
| 75 | + sign = extract_word_glo(&n,9+26,1); |
| 76 | + f_ret = sign ? -1.0*ret*pow(2,-11)*1000.0 : ret*pow(2,-11)*1000.0; |
| 77 | + printf("x = %f(%x, %u)\n",f_ret,ret,sign); |
| 78 | + ret = extract_word_glo(&n,41,23); |
| 79 | + sign = extract_word_glo(&n,41+23,1); |
| 80 | + f_ret = sign ? -1.0*ret*pow(2,-20)*1000.0 : ret*pow(2,-20)*1000.0; |
| 81 | + printf("Vx = %f(%x, %u)\n",f_ret,ret,sign); |
| 82 | + ret = extract_word_glo(&n,36,4); |
| 83 | + sign = extract_word_glo(&n,36+4,1); |
| 84 | + f_ret = sign ? -1.0*ret*pow(2,-30)*1000.0 : ret*pow(2,-30)*1000.0; |
| 85 | + printf("Ax = %f(%x, %u)\n",f_ret,ret,sign); |
| 86 | + ret = extract_word_glo(&n,65,12); |
| 87 | + printf("row Tk = %x\n",ret); |
| 88 | + ret = extract_word_glo(&n,65,5); |
| 89 | + printf("Tk(hours) = %u\n",ret); |
| 90 | + ret = extract_word_glo(&n,70,6); |
| 91 | + printf("Tk(mins) = %u\n",ret); |
| 92 | + ret = extract_word_glo(&n,76,1); |
| 93 | + printf("Tk(sec) = %u\n",ret); |
| 94 | + //parse string 2 |
| 95 | + n.string_bits[0] = 0xd9c15f66; |
| 96 | + n.string_bits[1] = 0xa5256204; |
| 97 | + n.string_bits[2] = 0x021760; |
| 98 | + ret = extract_word_glo(&n,85,1); |
| 99 | + fail_unless(ret == 0, "1. %x, expected %x", ret, 0); |
| 100 | + ret = extract_word_glo(&n,81,4); |
| 101 | + fail_unless(ret == 2, "2. %x, expected %x", ret, 2); |
| 102 | + printf("STRING %u\n",ret); |
| 103 | + ret = extract_word_glo(&n,9,26); |
| 104 | + sign = extract_word_glo(&n,9+26,1); |
| 105 | + f_ret = sign ? -1.0*ret*pow(2,-11)*1000.0 : ret*pow(2,-11)*1000.0; |
| 106 | + printf("y = %f(%x, %u)\n",f_ret,ret,sign); |
| 107 | + ret = extract_word_glo(&n,41,23); |
| 108 | + sign = extract_word_glo(&n,41+23,1); |
| 109 | + f_ret = sign ? -1.0*ret*pow(2,-20)*1000.0 : ret*pow(2,-20)*1000.0; |
| 110 | + printf("Vy = %f(%x, %u)\n",f_ret,ret,sign); |
| 111 | + ret = extract_word_glo(&n,36,4); |
| 112 | + sign = extract_word_glo(&n,36+4,1); |
| 113 | + f_ret = sign ? -1.0*ret*pow(2,-30)*1000.0 : ret*pow(2,-30)*1000.0; |
| 114 | + printf("Ay = %f(%x, %u)\n",f_ret,ret,sign); |
| 115 | + //parse string 3 |
| 116 | + n.string_bits[0] = 0x6d0e3123; |
| 117 | + n.string_bits[1] = 0x9d60899a; |
| 118 | + n.string_bits[2] = 0x038026; |
| 119 | + ret = extract_word_glo(&n,85,1); |
| 120 | + fail_unless(ret == 0, "1. %x, expected %x", ret, 0); |
| 121 | + ret = extract_word_glo(&n,81,4); |
| 122 | + fail_unless(ret == 3, "2. %x, expected %x", ret, 3); |
| 123 | + printf("STRING %u\n",ret); |
| 124 | + ret = extract_word_glo(&n,9,26); |
| 125 | + sign = extract_word_glo(&n,9+26,1); |
| 126 | + f_ret = sign ? -1.0*ret*pow(2,-11)*1000.0 : ret*pow(2,-11)*1000.0; |
| 127 | + printf("z = %f(%x, %u)\n",f_ret,ret,sign); |
| 128 | + ret = extract_word_glo(&n,41,23); |
| 129 | + sign = extract_word_glo(&n,41+23,1); |
| 130 | + f_ret = sign ? -1.0*ret*pow(2,-20)*1000.0 : ret*pow(2,-20)*1000.0; |
| 131 | + printf("Vz = %f(%x, %u)\n",f_ret,ret,sign); |
| 132 | + ret = extract_word_glo(&n,36,4); |
| 133 | + sign = extract_word_glo(&n,36+4,1); |
| 134 | + f_ret = sign ? -1.0*ret*pow(2,-30)*1000.0 : ret*pow(2,-30)*1000.0; |
| 135 | + printf("Az = %f(%x, %u)\n",f_ret,ret,sign); |
| 136 | + ret = extract_word_glo(&n,66,2); |
| 137 | + printf("P = %u\n",ret); |
| 138 | + //parse string 4 |
| 139 | + n.string_bits[0] = 0x00344918; |
| 140 | + n.string_bits[1] = 0x1cc00000; |
| 141 | + n.string_bits[2] = 0x04865d; |
| 142 | + ret = extract_word_glo(&n,85,1); |
| 143 | + fail_unless(ret == 0, "1. %x, expected %x", ret, 0); |
| 144 | + ret = extract_word_glo(&n,81,4); |
| 145 | + fail_unless(ret == 4, "2. %x, expected %x", ret, 4); |
| 146 | + printf("STRING %u\n",ret); |
| 147 | + ret = extract_word_glo(&n,16,11); |
| 148 | + printf("Nt = %u\n",ret); |
| 149 | + //parse string 5 |
| 150 | + n.string_bits[0] = 0x40000895; |
| 151 | + n.string_bits[1] = 0x3; |
| 152 | + n.string_bits[2] = 0x050d10; |
| 153 | + ret = extract_word_glo(&n,85,1); |
| 154 | + fail_unless(ret == 0, "1. %x, expected %x", ret, 0); |
| 155 | + ret = extract_word_glo(&n,81,4); |
| 156 | + fail_unless(ret == 5, "2. %x, expected %x", ret, 5); |
| 157 | + printf("STRING %u\n",ret); |
| 158 | + ret = extract_word_glo(&n,38,32); |
| 159 | + printf("Tau c = %u\n",ret); |
| 160 | + ret = extract_word_glo(&n,32,5); |
| 161 | + printf("N4 = %u\n",ret); |
| 162 | + ret = extract_word_glo(&n,10,22); |
| 163 | + printf("Tau GPS = %u\n",ret); |
| 164 | + ret = extract_word_glo(&n,70,11); |
| 165 | + printf("Na = %u\n",ret); |
| 166 | +} |
| 167 | +END_TEST |
| 168 | +Suite* glo_decoder_test_suite(void) |
| 169 | +{ |
| 170 | + Suite *s = suite_create("GLO decoder"); |
| 171 | + TCase *tc_core = tcase_create("Core"); |
| 172 | + tcase_add_test(tc_core, test_extract_glo_word); |
| 173 | + tcase_add_test(tc_core, test_extract_real_glo_word); |
| 174 | + suite_add_tcase(s, tc_core); |
| 175 | + |
| 176 | + return s; |
| 177 | +} |
0 commit comments