uvg266/src/cabac.c

390 lines
10 KiB
C
Raw Normal View History

2012-06-04 10:47:12 +00:00
/**
2013-09-18 14:29:30 +00:00
* \file
*
* \author Marko Viitanen ( fador@iki.fi ),
* Tampere University of Technology,
* Department of Pervasive Computing.
* \author Ari Koivula ( ari@koivu.la ),
* Tampere University of Technology,
* Department of Pervasive Computing.
2012-06-04 10:47:12 +00:00
*/
#include "cabac.h"
2012-06-04 10:47:12 +00:00
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
2012-06-04 10:47:12 +00:00
2013-09-18 11:06:45 +00:00
const uint8_t g_auc_next_state_mps[ 128 ] =
2012-06-04 10:47:12 +00:00
{
2012-06-13 15:08:15 +00:00
2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65,
66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81,
82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97,
98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113,
2012-06-04 10:47:12 +00:00
114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 124, 125, 126, 127
};
2013-09-18 11:06:45 +00:00
const uint8_t g_auc_next_state_lps[ 128 ] =
2012-06-04 10:47:12 +00:00
{
2012-06-13 15:08:15 +00:00
1, 0, 0, 1, 2, 3, 4, 5, 4, 5, 8, 9, 8, 9, 10, 11,
12, 13, 14, 15, 16, 17, 18, 19, 18, 19, 22, 23, 22, 23, 24, 25,
26, 27, 26, 27, 30, 31, 30, 31, 32, 33, 32, 33, 36, 37, 36, 37,
38, 39, 38, 39, 42, 43, 42, 43, 44, 45, 44, 45, 46, 47, 48, 49,
48, 49, 50, 51, 52, 53, 52, 53, 54, 55, 54, 55, 56, 57, 58, 59,
58, 59, 60, 61, 60, 61, 60, 61, 62, 63, 64, 65, 64, 65, 66, 67,
66, 67, 66, 67, 68, 69, 68, 69, 70, 71, 70, 71, 70, 71, 72, 73,
2012-06-04 10:47:12 +00:00
72, 73, 72, 73, 74, 75, 74, 75, 74, 75, 76, 77, 76, 77, 126, 127
};
2013-09-18 11:06:45 +00:00
const uint8_t g_auc_lpst_table[64][4] =
2012-06-04 10:47:12 +00:00
{
2012-06-13 15:08:15 +00:00
{128, 176, 208, 240}, {128, 167, 197, 227}, {128, 158, 187, 216}, {123, 150, 178, 205}, {116, 142, 169, 195},
{111, 135, 160, 185}, {105, 128, 152, 175}, {100, 122, 144, 166}, { 95, 116, 137, 158}, { 90, 110, 130, 150},
{ 85, 104, 123, 142}, { 81, 99, 117, 135}, { 77, 94, 111, 128}, { 73, 89, 105, 122}, { 69, 85, 100, 116},
{ 66, 80, 95, 110}, { 62, 76, 90, 104}, { 59, 72, 86, 99}, { 56, 69, 81, 94}, { 53, 65, 77, 89},
{ 51, 62, 73, 85}, { 48, 59, 69, 80}, { 46, 56, 66, 76}, { 43, 53, 63, 72}, { 41, 50, 59, 69},
{ 39, 48, 56, 65}, { 37, 45, 54, 62}, { 35, 43, 51, 59}, { 33, 41, 48, 56}, { 32, 39, 46, 53},
{ 30, 37, 43, 50}, { 29, 35, 41, 48}, { 27, 33, 39, 45}, { 26, 31, 37, 43}, { 24, 30, 35, 41},
{ 23, 28, 33, 39}, { 22, 27, 32, 37}, { 21, 26, 30, 35}, { 20, 24, 29, 33}, { 19, 23, 27, 31},
{ 18, 22, 26, 30}, { 17, 21, 25, 28}, { 16, 20, 23, 27}, { 15, 19, 22, 25}, { 14, 18, 21, 24},
{ 14, 17, 20, 23}, { 13, 16, 19, 22}, { 12, 15, 18, 21}, { 12, 14, 17, 20}, { 11, 14, 16, 19},
{ 11, 13, 15, 18}, { 10, 12, 15, 17}, { 10, 12, 14, 16}, { 9, 11, 13, 15}, { 9, 11, 12, 14},
{ 8, 10, 12, 14}, { 8, 9, 11, 13}, { 7, 9, 11, 12}, { 7, 9, 10, 12}, { 7, 8, 10, 11},
{ 6, 8, 9, 11}, { 6, 7, 9, 10}, { 6, 7, 8, 9}, { 2, 2, 2, 2}
2012-06-04 10:47:12 +00:00
};
2013-09-19 08:05:42 +00:00
const uint8_t g_auc_renorm_table[32] = { 6, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2,
2012-06-13 15:08:15 +00:00
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1};
2012-06-04 10:47:12 +00:00
2013-09-18 11:06:45 +00:00
uint8_t g_next_state[128][2];
2012-06-04 10:47:12 +00:00
cabac_data cabac;
2013-09-19 08:05:42 +00:00
void ctx_init(cabac_ctx* ctx, uint32_t qp, uint32_t init_value )
2012-06-04 10:47:12 +00:00
{
2013-09-19 08:05:42 +00:00
int slope = (init_value>>4)*5 - 45;
int offset = ((init_value&15)<<3)-16;
int init_state = MIN( MAX( 1, ( ( ( slope * (int)qp ) >> 4 ) + offset ) ), 126 );
uint8_t mp_state = (init_state >= 64 )?1:0;
ctx->uc_state = ( (mp_state? (init_state - 64):(63 - init_state)) <<1) + mp_state;
2013-09-18 11:06:45 +00:00
ctx->bins_coded = 0;
2012-06-04 10:47:12 +00:00
}
2013-09-18 11:06:45 +00:00
void ctx_build_next_state_table()
2012-06-04 10:47:12 +00:00
{
int i,j;
for (i = 0; i < 128; i++)
{
for (j = 0; j < 2; j++)
{
2013-09-18 11:06:45 +00:00
g_next_state[i][j] = ((i&1) == j) ? g_auc_next_state_mps[i] : g_auc_next_state_lps[i];
2012-06-04 10:47:12 +00:00
}
}
}
2013-09-18 11:06:45 +00:00
INLINE void ctx_update(cabac_ctx* ctx, int val ) { ctx->uc_state = g_next_state[ctx->uc_state][val]; }
//void ctx_update_LPS(cabac_ctx* ctx) { ctx->ucState = g_aucNextStateLPS[ ctx->ucState ]; }
//void ctx_update_MPS(cabac_ctx* ctx) { ctx->ucState = g_aucNextStateMPS[ ctx->ucState ]; }
2012-06-04 10:47:12 +00:00
void cabac_init(cabac_data* data)
{
2013-09-18 11:06:45 +00:00
data->frac_bits = 0;
data->bin_count_increment = 0;
2013-09-19 08:05:42 +00:00
data->bins_coded = 0;
2013-09-18 11:06:45 +00:00
ctx_build_next_state_table();
2012-06-04 10:47:12 +00:00
}
void cabac_start(cabac_data* data)
{
2013-09-19 08:05:42 +00:00
data->low = 0;
data->range = 510;
2013-09-18 11:06:45 +00:00
data->bits_left = 23;
data->num_buffered_bytes = 0;
2013-09-19 08:05:42 +00:00
data->buffered_byte = 0xff;
2012-06-04 10:47:12 +00:00
}
2013-09-19 08:05:42 +00:00
void cabac_encode_bin(cabac_data* data, uint32_t bin_value )
2012-06-04 10:47:12 +00:00
{
2013-09-19 08:05:42 +00:00
uint32_t lps;
//printf("\tdecodeBin m_uiRange %d uivalue %d\n", data->uiRange, data->uiLow);
2013-09-19 08:05:42 +00:00
data->bins_coded += data->bin_count_increment;
2013-09-18 11:06:45 +00:00
data->ctx->bins_coded = 1;
2012-06-04 10:47:12 +00:00
2013-09-19 08:05:42 +00:00
lps = g_auc_lpst_table[ CTX_STATE(data->ctx) ][ ( data->range >> 6 ) & 3 ];
data->range -= lps;
2012-06-13 15:08:15 +00:00
#ifdef _DEBUG
//printf("\tencodeBin m_uiRange %d uiLPS %d m_uiValue %d ", data->uiRange,uiLPS,data->uiLow);
2012-06-13 15:08:15 +00:00
#endif
2012-06-04 10:47:12 +00:00
2012-06-13 15:08:15 +00:00
//Not the Most Probable Symbol?
2013-09-19 08:05:42 +00:00
if( bin_value != CTX_MPS(data->ctx) )
2012-06-04 10:47:12 +00:00
{
2013-09-19 08:05:42 +00:00
int num_bits = g_auc_renorm_table[ lps >> 3 ];
data->low = ( data->low + data->range ) << num_bits;
data->range = lps << num_bits;
2012-06-04 10:47:12 +00:00
ctx_update_LPS(data->ctx);
2012-06-04 10:47:12 +00:00
2013-09-19 08:05:42 +00:00
data->bits_left -= num_bits;
2012-06-04 10:47:12 +00:00
}
else
{
ctx_update_MPS(data->ctx);
2013-09-19 08:05:42 +00:00
if ( data->range >= 256 )
2012-06-04 10:47:12 +00:00
{
2012-06-13 15:08:15 +00:00
#ifdef _DEBUG
//printf("enduiValue %d \n",data->uiLow);
2012-06-13 15:08:15 +00:00
#endif
2012-06-04 10:47:12 +00:00
return;
}
2013-09-19 08:05:42 +00:00
data->low <<= 1;
data->range <<= 1;
2013-09-18 11:06:45 +00:00
data->bits_left--;
2012-06-04 10:47:12 +00:00
}
2013-09-18 11:06:45 +00:00
if(data->bits_left < 12)
2012-06-04 10:47:12 +00:00
{
cabac_write(data);
}
2012-06-13 15:08:15 +00:00
#ifdef _DEBUG
//printf("enduiValue %d \n",data->uiLow);
2012-06-13 15:08:15 +00:00
#endif
2012-06-04 10:47:12 +00:00
}
void cabac_write(cabac_data* data)
{
2013-09-19 08:05:42 +00:00
uint32_t lead_byte = data->low >> (24 - data->bits_left);
2013-09-18 11:06:45 +00:00
data->bits_left += 8;
2013-09-19 08:05:42 +00:00
data->low &= 0xffffffffu >> data->bits_left;
2012-06-04 10:47:12 +00:00
2013-09-19 08:05:42 +00:00
if ( lead_byte == 0xff )
2012-06-04 10:47:12 +00:00
{
2013-09-18 11:06:45 +00:00
data->num_buffered_bytes++;
2012-06-04 10:47:12 +00:00
}
else
{
2013-09-18 11:06:45 +00:00
if ( data->num_buffered_bytes > 0 )
2012-06-04 10:47:12 +00:00
{
2013-09-19 08:05:42 +00:00
uint32_t carry = lead_byte >> 8;
uint32_t byte = data->buffered_byte + carry;
data->buffered_byte = lead_byte & 0xff;
2012-06-04 10:47:12 +00:00
bitstream_put(data->stream,byte,8);
byte = ( 0xff + carry ) & 0xff;
2013-09-18 11:06:45 +00:00
while ( data->num_buffered_bytes > 1 )
2012-06-04 10:47:12 +00:00
{
bitstream_put(data->stream,byte,8);
2013-09-18 11:06:45 +00:00
data->num_buffered_bytes--;
2012-06-04 10:47:12 +00:00
}
}
else
{
2013-09-18 11:06:45 +00:00
data->num_buffered_bytes = 1;
2013-09-19 08:05:42 +00:00
data->buffered_byte = lead_byte;
}
}
2012-06-04 10:47:12 +00:00
}
void cabac_finish(cabac_data* data)
{
2013-09-19 08:05:42 +00:00
if ( data->low >> ( 32 - data->bits_left ) )
2012-06-04 10:47:12 +00:00
{
2013-09-19 08:05:42 +00:00
bitstream_put(data->stream,data->buffered_byte + 1, 8 );
2013-09-18 11:06:45 +00:00
while ( data->num_buffered_bytes > 1 )
2012-06-04 10:47:12 +00:00
{
bitstream_put(data->stream,0, 8 );
2013-09-18 11:06:45 +00:00
data->num_buffered_bytes--;
2012-06-04 10:47:12 +00:00
}
2013-09-19 08:05:42 +00:00
data->low -= 1 << ( 32 - data->bits_left );
2012-06-04 10:47:12 +00:00
}
else
{
2013-09-18 11:06:45 +00:00
if ( data->num_buffered_bytes > 0 )
2012-06-04 10:47:12 +00:00
{
2013-09-19 08:05:42 +00:00
bitstream_put(data->stream,data->buffered_byte, 8 );
2012-06-04 10:47:12 +00:00
}
2013-09-18 11:06:45 +00:00
while ( data->num_buffered_bytes > 1 )
2012-06-04 10:47:12 +00:00
{
bitstream_put(data->stream, 0xff, 8 );
2013-09-18 11:06:45 +00:00
data->num_buffered_bytes--;
}
2012-06-04 10:47:12 +00:00
}
2013-09-19 08:05:42 +00:00
bitstream_put(data->stream, data->low >> 8, 24 - data->bits_left );
2012-06-04 10:47:12 +00:00
}
/*!
\brief Encode terminating bin
\param binValue bin value
*/
2013-09-19 08:05:42 +00:00
void cabac_encode_bin_trm(cabac_data* data, uint8_t bin_value )
2012-06-04 10:47:12 +00:00
{
#ifdef _DEBUG
//printf("\tencodeBinTrm m_uiRange %d uivalue %d\n", data->uiRange, data->uiLow);
#endif
2013-09-19 08:05:42 +00:00
data->bins_coded += data->bin_count_increment;
data->range -= 2;
if( bin_value )
2012-06-04 10:47:12 +00:00
{
2013-09-19 08:05:42 +00:00
data->low += data->range;
data->low <<= 7;
data->range = 2 << 7;
2013-09-18 11:06:45 +00:00
data->bits_left -= 7;
2012-06-04 10:47:12 +00:00
}
2013-09-19 08:05:42 +00:00
else if ( data->range >= 256 )
2012-06-04 10:47:12 +00:00
{
return;
}
else
{
2013-09-19 08:05:42 +00:00
data->low <<= 1;
data->range <<= 1;
2013-09-18 11:06:45 +00:00
data->bits_left--;
2012-06-04 10:47:12 +00:00
}
2013-09-18 11:06:45 +00:00
if(data->bits_left < 12)
2012-06-04 10:47:12 +00:00
{
cabac_write(data);
}
}
void cabac_flush(cabac_data* data)
{
2013-09-18 11:06:45 +00:00
cabac_encode_bin_trm(data,1);
2012-06-04 10:47:12 +00:00
cabac_finish(data);
bitstream_put(data->stream,1,1);
bitstream_align_zero(data->stream);
2012-06-04 10:47:12 +00:00
cabac_start(data);
}
2013-09-19 08:05:42 +00:00
void cabac_encode_bin_ep(cabac_data* data, uint32_t bin_value )
2012-06-04 10:47:12 +00:00
{
2013-09-19 08:05:42 +00:00
data->bins_coded += data->bin_count_increment;
data->low <<= 1;
if( bin_value )
2012-06-04 10:47:12 +00:00
{
2013-09-19 08:05:42 +00:00
data->low += data->range;
2012-06-04 10:47:12 +00:00
}
2013-09-18 11:06:45 +00:00
data->bits_left--;
2012-06-04 10:47:12 +00:00
2013-09-18 11:06:45 +00:00
if(data->bits_left < 12)
2012-06-04 10:47:12 +00:00
{
cabac_write(data);
}
}
2013-09-19 08:05:42 +00:00
void cabac_encode_bins_ep(cabac_data* data, uint32_t bin_values, int num_bins )
2012-06-04 10:47:12 +00:00
{
uint32_t pattern;
2013-09-19 08:05:42 +00:00
data->bins_coded += num_bins & -data->bin_count_increment;
2012-06-04 10:47:12 +00:00
2013-09-19 08:05:42 +00:00
while ( num_bins > 8 )
2012-06-04 10:47:12 +00:00
{
2013-09-19 08:05:42 +00:00
num_bins -= 8;
pattern = bin_values >> num_bins;
data->low <<= 8;
data->low += data->range * pattern;
bin_values -= pattern << num_bins;
2013-09-18 11:06:45 +00:00
data->bits_left -= 8;
2012-06-04 10:47:12 +00:00
2013-09-18 11:06:45 +00:00
if(data->bits_left < 12)
2012-06-04 10:47:12 +00:00
{
cabac_write(data);
}
}
2013-09-19 08:05:42 +00:00
data->low <<= num_bins;
data->low += data->range * bin_values;
data->bits_left -= num_bins;
2012-06-04 10:47:12 +00:00
2013-09-18 11:06:45 +00:00
if(data->bits_left < 12)
2012-06-04 10:47:12 +00:00
{
cabac_write(data);
}
}
/*!
\brief Coding of coeff_abs_level_minus3
\param uiSymbol value of coeff_abs_level_minus3
\param ruiGoRiceParam reference to Rice parameter
\returns Void
*/
2013-09-19 08:05:42 +00:00
void cabac_write_coeff_remain(cabac_data* cabac, uint32_t symbol, uint32_t r_param )
{
2013-09-19 08:05:42 +00:00
int32_t code_number = symbol;
uint32_t length;
2013-09-19 08:05:42 +00:00
if (code_number < (3 << r_param))
{
2013-09-19 08:05:42 +00:00
length = code_number>>r_param;
2013-09-18 11:06:45 +00:00
cabac_encode_bins_ep(cabac, (1<<(length+1))-2 , length+1);
2013-09-19 08:05:42 +00:00
cabac_encode_bins_ep(cabac,(code_number%(1<<r_param)),r_param);
}
else
{
2013-09-19 08:05:42 +00:00
length = r_param;
code_number = code_number - ( 3 << r_param);
while (code_number >= (1<<length))
{
2013-09-19 08:05:42 +00:00
code_number -= (1<<(length++));
}
2013-09-19 08:05:42 +00:00
cabac_encode_bins_ep(cabac,(1<<(3+length+1-r_param))-2,3+length+1-r_param);
cabac_encode_bins_ep(cabac,code_number,length);
}
2013-08-02 13:35:30 +00:00
}
2013-09-19 08:05:42 +00:00
void cabac_write_unary_max_symbol(cabac_data* data,cabac_ctx* ctx, uint32_t symbol,int32_t offset, uint32_t max_symbol)
2013-08-02 13:35:30 +00:00
{
2013-09-19 08:05:42 +00:00
int8_t code_last = ( max_symbol > symbol );
2013-08-02 13:35:30 +00:00
2013-09-19 08:05:42 +00:00
if (!max_symbol)
2013-08-02 13:35:30 +00:00
return;
data->ctx = &ctx[0];
2013-09-19 08:05:42 +00:00
cabac_encode_bin(data, symbol ? 1 : 0);
2013-08-02 13:35:30 +00:00
2013-09-19 08:05:42 +00:00
if (!symbol)
2013-08-02 13:35:30 +00:00
return;
2013-09-19 08:05:42 +00:00
while( --symbol )
2013-08-02 13:35:30 +00:00
{
2013-09-19 08:05:42 +00:00
data->ctx = &ctx[offset];
2013-09-18 11:06:45 +00:00
cabac_encode_bin(data, 1);
2013-08-02 13:35:30 +00:00
}
2013-09-19 08:05:42 +00:00
if( code_last )
2013-08-02 13:35:30 +00:00
{
2013-09-19 08:05:42 +00:00
data->ctx = &ctx[offset];
2013-09-18 11:06:45 +00:00
cabac_encode_bin(data, 0);
2013-08-02 13:35:30 +00:00
}
return;
}
2013-09-19 08:05:42 +00:00
void cabac_write_ep_ex_golomb(cabac_data* data, uint32_t symbol, uint32_t count )
2013-08-02 13:35:30 +00:00
{
uint32_t bins = 0;
2013-09-19 08:05:42 +00:00
int32_t num_bins = 0;
2013-08-02 13:35:30 +00:00
2013-09-19 08:05:42 +00:00
while( symbol >= (uint32_t)(1<<count) )
2013-08-02 13:35:30 +00:00
{
bins = 2 * bins + 1;
2013-09-19 08:05:42 +00:00
num_bins++;
symbol -= 1 << count;
count ++;
2013-08-02 13:35:30 +00:00
}
bins = 2 * bins + 0;
2013-09-19 08:05:42 +00:00
num_bins++;
2013-08-02 13:35:30 +00:00
2013-09-19 08:05:42 +00:00
bins = (bins << count) | symbol;
num_bins += count;
2013-08-02 13:35:30 +00:00
2013-09-19 08:05:42 +00:00
cabac_encode_bins_ep(data, bins, num_bins);
}