mirror of
https://github.com/DSheirer/sdrtrunk.git
synced 2026-11-12 08:37:25 -05:00
Note: Several of the decoders are currently non-functioning in this commit. If you want the latest functioning codebase, please checkout the commit prior to this one. All decoders will eventually be updated with this new architecture. Currently broken: - Logging and recording - Aux decoders (Fleetsync/MDC/LoJack/Tait) - LTR/Passport decoders Changes in this commit: - Module architecture for decoders and components with central provisioning by the DecoderFactory - Transition from Complex sample stream processing to float buffer processing for improved memory management - Redesigned filter structures - to support buffers and streams - Resolved several memory leak issues - Universal sharing of the thread pool manager - Added centralized audio management with call/user prioritization and new gui with mute/volume controls - Embedded audio metadata for eventual streaming support - Redesigned ProcessingChain to support independent re-use - Added new TrafficChannelManager to handle traffic channel allocations - Traffic Channel pool size and Call timeout available in P25 and MPT1327 configs - Redesigned channel and decoder gui components
92 lines
2.6 KiB
Java
92 lines
2.6 KiB
Java
/*******************************************************************************
|
|
* SDR Trunk
|
|
* Copyright (C) 2014 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 buffer;
|
|
|
|
import java.nio.ByteBuffer;
|
|
import java.util.Enumeration;
|
|
|
|
import sample.complex.Complex;
|
|
|
|
/**
|
|
* Provides a complex sample enumeration wrapper around a byte array containing
|
|
* interleaved byte-length I & Q sample values in the range of 0 - 255, converting
|
|
* those samples into complex samples with value range of -128 to 0 to 127.
|
|
*/
|
|
public class ComplexByteBuffer implements Enumeration<Complex>
|
|
{
|
|
private static float[] mValues;
|
|
|
|
/**
|
|
* Creates a lookup table that converts the 8-bit valued range from 0 - 255
|
|
* into scaled float values of -128 to 0 to 127
|
|
*/
|
|
static
|
|
{
|
|
mValues = new float[ 256 ];
|
|
|
|
float scale = (float)( 1.0f / 127.0f );
|
|
|
|
for( int x = 0; x < 256; x++ )
|
|
{
|
|
mValues[ x ] = (float)( x - 128 ) * scale;
|
|
}
|
|
}
|
|
|
|
private ByteBuffer mBytes;
|
|
// private byte[] mBytes;
|
|
// private int mPointer;
|
|
|
|
public ComplexByteBuffer( byte[] bytes )
|
|
{
|
|
mBytes = ByteBuffer.wrap( bytes );
|
|
// mBytes = bytes;
|
|
// mPointer = 0;
|
|
}
|
|
|
|
public byte[] toArray()
|
|
{
|
|
// return mBytes;
|
|
return mBytes.array();
|
|
}
|
|
|
|
/**
|
|
* Indicates if there are more complex samples remaining.
|
|
*/
|
|
@Override
|
|
public boolean hasMoreElements()
|
|
{
|
|
// return mPointer < mBytes.length;
|
|
return mBytes.hasRemaining();
|
|
}
|
|
|
|
/**
|
|
* Returns the next complex sample.
|
|
*
|
|
* Note: does not check for buffer overrun. Use the hasMoreElements()
|
|
* method to ensure you do not read past the end of the buffer.
|
|
*/
|
|
@Override
|
|
public Complex nextElement()
|
|
{
|
|
// return new ComplexSample( mValues[ ( mBytes[ mPointer++ ] & 0xFF ) ],
|
|
// mValues[ ( mBytes[ mPointer++ ] & 0xFF ) ] );
|
|
return new Complex( mValues[ ( mBytes.get() & 0xFF ) ],
|
|
mValues[ ( mBytes.get() & 0xFF ) ] );
|
|
}
|
|
}
|