mirror of
https://github.com/DSheirer/sdrtrunk.git
synced 2026-11-09 23:27:24 -05:00
* Uses same shared architecture and symbol processor pattern as other C4FM decoders. * Adds soft symbol processing and sync detection. * Removes RRC filter and replaces with improved channel filter. * Viterbi soft symbol decoding with demodulator reliability weighting * Improved sync reacquisition in low SNR * Improved handling for phase wrapping and interpolation * NAC Tracker updated to track by NAC count * Native buffers returning partial buffers * Message processor uses only valid LDU1 words * Reduced phantom TDU messages * Tuner/Channe frequency error corrections don't reset the symbol trackers and fix possible divide by zero error * LSM timing error detector now updates per symbol block size instead of sample buffer size - faster convergence * New unit tests * Resolves several issues, including a lagging sync detect offset issue in the recently updated P25P1 C4FM decoder. * Consolidate filter designers for each protocol back into the FilterFactory class. * DMR, P25 Phase 1 C4FM and LSM, and P25 Phase 2 decoders design the baseband filter once and share the taps across the I and Q filters. Co-authored-by: denny <dennis.sheirer@gmail.com>
139 lines
4.3 KiB
Java
139 lines
4.3 KiB
Java
/*
|
|
* *****************************************************************************
|
|
* Copyright (C) 2014-2022 Dennis Sheirer
|
|
*
|
|
* This program 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 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program 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 program. If not, see <http://www.gnu.org/licenses/>
|
|
* ****************************************************************************
|
|
*/
|
|
|
|
package io.github.dsheirer.buffer;
|
|
|
|
import io.github.dsheirer.sample.SampleUtils;
|
|
import io.github.dsheirer.sample.complex.ComplexSamples;
|
|
import io.github.dsheirer.sample.complex.InterleavedComplexSamples;
|
|
|
|
import java.util.Arrays;
|
|
import java.util.Iterator;
|
|
|
|
/**
|
|
* Simple native buffer implementation that simply wraps a single, existing, non-native sample buffer.
|
|
*/
|
|
public class FloatNativeBuffer extends AbstractNativeBuffer
|
|
{
|
|
private float[] mInterleavedComplexSamples;
|
|
private static final int BUFFER_SIZE = 2048;
|
|
|
|
/**
|
|
* Constructs an instance
|
|
* @param complexSamples interleaved to wrap
|
|
* @param timestamp for the buffer
|
|
*/
|
|
public FloatNativeBuffer(float[] complexSamples, long timestamp, float samplesPerMillisecond)
|
|
{
|
|
super(timestamp, samplesPerMillisecond);
|
|
mInterleavedComplexSamples = complexSamples;
|
|
}
|
|
|
|
/**
|
|
* Constructs an instance
|
|
* @param samples to wrap
|
|
* @param timestamp for the buffer
|
|
*/
|
|
public FloatNativeBuffer(ComplexSamples samples)
|
|
{
|
|
this(SampleUtils.interleave(samples), samples.timestamp(), 0.0f);
|
|
}
|
|
|
|
/**
|
|
* Constructs an instance
|
|
* @param samples to wrap
|
|
*/
|
|
public FloatNativeBuffer(InterleavedComplexSamples samples)
|
|
{
|
|
this(samples.samples(), samples.timestamp(), 0.0f);
|
|
}
|
|
|
|
@Override
|
|
public Iterator<ComplexSamples> iterator()
|
|
{
|
|
return new ComplexSamplesIterator();
|
|
}
|
|
|
|
@Override
|
|
public Iterator<InterleavedComplexSamples> iteratorInterleaved()
|
|
{
|
|
return new InterleavedComplexSamplesIterator();
|
|
}
|
|
|
|
@Override
|
|
public int sampleCount()
|
|
{
|
|
return mInterleavedComplexSamples.length / 2;
|
|
}
|
|
|
|
private class ComplexSamplesIterator implements Iterator<ComplexSamples>
|
|
{
|
|
private int mBufferPointer = 0;
|
|
|
|
@Override
|
|
public boolean hasNext()
|
|
{
|
|
return mBufferPointer < mInterleavedComplexSamples.length;
|
|
}
|
|
|
|
@Override
|
|
public ComplexSamples next()
|
|
{
|
|
if(!hasNext())
|
|
{
|
|
throw new IllegalStateException("No more samples");
|
|
}
|
|
|
|
//The final chunk holds the remaining samples, so that it isn't padded with zero valued samples
|
|
int end = Math.min(mBufferPointer + BUFFER_SIZE * 2, mInterleavedComplexSamples.length);
|
|
float[] chunk = Arrays.copyOfRange(mInterleavedComplexSamples, mBufferPointer, end);
|
|
mBufferPointer = end;
|
|
|
|
return SampleUtils.deinterleave(chunk, getTimestamp());
|
|
}
|
|
}
|
|
|
|
private class InterleavedComplexSamplesIterator implements Iterator<InterleavedComplexSamples>
|
|
{
|
|
private int mBufferPointer = 0;
|
|
|
|
@Override
|
|
public boolean hasNext()
|
|
{
|
|
return mBufferPointer < mInterleavedComplexSamples.length;
|
|
}
|
|
|
|
@Override
|
|
public InterleavedComplexSamples next()
|
|
{
|
|
if(!hasNext())
|
|
{
|
|
throw new IllegalStateException("No more samples");
|
|
}
|
|
|
|
//The final chunk holds the remaining samples, so that it isn't padded with zero valued samples
|
|
int end = Math.min(mBufferPointer + BUFFER_SIZE * 2, mInterleavedComplexSamples.length);
|
|
float[] chunk = Arrays.copyOfRange(mInterleavedComplexSamples, mBufferPointer, end);
|
|
mBufferPointer = end;
|
|
|
|
return new InterleavedComplexSamples(chunk, getTimestamp());
|
|
}
|
|
}
|
|
}
|