michael@0: /***********************************************************************
michael@0: Copyright (c) 2006-2011, Skype Limited. All rights reserved.
michael@0: Redistribution and use in source and binary forms, with or without
michael@0: modification, are permitted provided that the following conditions
michael@0: are met:
michael@0: - Redistributions of source code must retain the above copyright notice,
michael@0: this list of conditions and the following disclaimer.
michael@0: - Redistributions in binary form must reproduce the above copyright
michael@0: notice, this list of conditions and the following disclaimer in the
michael@0: documentation and/or other materials provided with the distribution.
michael@0: - Neither the name of Internet Society, IETF or IETF Trust, nor the
michael@0: names of specific contributors, may be used to endorse or promote
michael@0: products derived from this software without specific prior written
michael@0: permission.
michael@0: THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
michael@0: AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
michael@0: IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
michael@0: ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
michael@0: LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
michael@0: CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
michael@0: SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
michael@0: INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
michael@0: CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
michael@0: ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
michael@0: POSSIBILITY OF SUCH DAMAGE.
michael@0: ***********************************************************************/
michael@0: 
michael@0: #ifdef HAVE_CONFIG_H
michael@0: #include "config.h"
michael@0: #endif
michael@0: 
michael@0: #include "main.h"
michael@0: 
michael@0: /* Quantize mid/side predictors */
michael@0: void silk_stereo_quant_pred(
michael@0:     opus_int32                  pred_Q13[],                     /* I/O  Predictors (out: quantized)                 */
michael@0:     opus_int8                   ix[ 2 ][ 3 ]                    /* O    Quantization indices                        */
michael@0: )
michael@0: {
michael@0:     opus_int   i, j, n;
michael@0:     opus_int32 low_Q13, step_Q13, lvl_Q13, err_min_Q13, err_Q13, quant_pred_Q13 = 0;
michael@0: 
michael@0:     /* Quantize */
michael@0:     for( n = 0; n < 2; n++ ) {
michael@0:         /* Brute-force search over quantization levels */
michael@0:         err_min_Q13 = silk_int32_MAX;
michael@0:         for( i = 0; i < STEREO_QUANT_TAB_SIZE - 1; i++ ) {
michael@0:             low_Q13 = silk_stereo_pred_quant_Q13[ i ];
michael@0:             step_Q13 = silk_SMULWB( silk_stereo_pred_quant_Q13[ i + 1 ] - low_Q13,
michael@0:                 SILK_FIX_CONST( 0.5 / STEREO_QUANT_SUB_STEPS, 16 ) );
michael@0:             for( j = 0; j < STEREO_QUANT_SUB_STEPS; j++ ) {
michael@0:                 lvl_Q13 = silk_SMLABB( low_Q13, step_Q13, 2 * j + 1 );
michael@0:                 err_Q13 = silk_abs( pred_Q13[ n ] - lvl_Q13 );
michael@0:                 if( err_Q13 < err_min_Q13 ) {
michael@0:                     err_min_Q13 = err_Q13;
michael@0:                     quant_pred_Q13 = lvl_Q13;
michael@0:                     ix[ n ][ 0 ] = i;
michael@0:                     ix[ n ][ 1 ] = j;
michael@0:                 } else {
michael@0:                     /* Error increasing, so we're past the optimum */
michael@0:                     goto done;
michael@0:                 }
michael@0:             }
michael@0:         }
michael@0:         done:
michael@0:         ix[ n ][ 2 ]  = silk_DIV32_16( ix[ n ][ 0 ], 3 );
michael@0:         ix[ n ][ 0 ] -= ix[ n ][ 2 ] * 3;
michael@0:         pred_Q13[ n ] = quant_pred_Q13;
michael@0:     }
michael@0: 
michael@0:     /* Subtract second from first predictor (helps when actually applying these) */
michael@0:     pred_Q13[ 0 ] -= pred_Q13[ 1 ];
michael@0: }