Merge pull request #738 from opentx/bsongis/vario_improvements

Bsongis/vario improvements
This commit is contained in:
Andre Bernet
2014-02-26 10:18:41 +01:00
14 changed files with 582 additions and 364 deletions
+51
View File
@@ -0,0 +1,51 @@
#!/bin/env python
SIGN_BIT = (0x80) # Sign bit for a A-law byte.
QUANT_MASK = (0xf) # Quantization field mask.
SEG_SHIFT = (4) # Left shift for segment number.
SEG_MASK = (0x70) # Segment field mask.
BIAS = (0x84) # Bias for linear code.
def alaw2linear(a_val):
a_val ^= 0x55
t = a_val & QUANT_MASK
seg = (a_val & SEG_MASK) >> SEG_SHIFT
if (seg):
t = (t + t + 1 + 32) << (seg + 2)
else:
t = (t + t + 1 ) << 3
if a_val & SIGN_BIT:
return t
else:
return -t
def ulaw2linear(u_val):
# Complement to obtain normal u-law value.
u_val = ~u_val
# Extract and bias the quantization bits. Then
# shift up by the segment number and subtract out the bias.
t = ((u_val & QUANT_MASK) << 3) + BIAS
t <<= (u_val & SEG_MASK) >> SEG_SHIFT
if u_val & SIGN_BIT:
return (BIAS - t)
else:
return (t - BIAS)
def pcmTable(fn):
result = []
for i in range(256):
result.append(fn(i))
return result
def tableToString(name, table):
result = 'const int16_t ' + name + '[256] = { '
result += ', '.join([str(i) for i in table])
result += ' };'
return result
print tableToString('alawTable', pcmTable(alaw2linear))
print tableToString('ulawTable', pcmTable(ulaw2linear))
+29
View File
@@ -0,0 +1,29 @@
#!/bin/env python
import math
samples = 1024
amplitudes = (32000, 0, 4000, 0, 4000)
max = 0
min = 0
for i in range(samples):
sample = 0.0
for harmonic, amplitude in enumerate(amplitudes):
sample += math.sin(math.pi*2*i*(harmonic+1)/samples) * amplitude / 2
sample = int(sample)
if sample > max:
max = sample
elif sample < min:
min = sample
print "%d," % sample,
if i % 10 == 9:
print
print
print 'Range is:', min, max
if max > 32767 or min < -32768:
print "Invalid range!"