resampler.c 9.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215
  1. /***********************************************************************
  2. Copyright (c) 2006-2011, Skype Limited. All rights reserved.
  3. Redistribution and use in source and binary forms, with or without
  4. modification, are permitted provided that the following conditions
  5. are met:
  6. - Redistributions of source code must retain the above copyright notice,
  7. this list of conditions and the following disclaimer.
  8. - Redistributions in binary form must reproduce the above copyright
  9. notice, this list of conditions and the following disclaimer in the
  10. documentation and/or other materials provided with the distribution.
  11. - Neither the name of Internet Society, IETF or IETF Trust, nor the
  12. names of specific contributors, may be used to endorse or promote
  13. products derived from this software without specific prior written
  14. permission.
  15. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  18. ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  19. LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  20. CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  21. SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  22. INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  23. CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  24. ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  25. POSSIBILITY OF SUCH DAMAGE.
  26. ***********************************************************************/
  27. #ifdef HAVE_CONFIG_H
  28. #include "config.h"
  29. #endif
  30. /*
  31. * Matrix of resampling methods used:
  32. * Fs_out (kHz)
  33. * 8 12 16 24 48
  34. *
  35. * 8 C UF U UF UF
  36. * 12 AF C UF U UF
  37. * Fs_in (kHz) 16 D AF C UF UF
  38. * 24 AF D AF C U
  39. * 48 AF AF AF D C
  40. *
  41. * C -> Copy (no resampling)
  42. * D -> Allpass-based 2x downsampling
  43. * U -> Allpass-based 2x upsampling
  44. * UF -> Allpass-based 2x upsampling followed by FIR interpolation
  45. * AF -> AR2 filter followed by FIR interpolation
  46. */
  47. #include "resampler_private.h"
  48. /* Tables with delay compensation values to equalize total delay for different modes */
  49. static const opus_int8 delay_matrix_enc[ 5 ][ 3 ] = {
  50. /* in \ out 8 12 16 */
  51. /* 8 */ { 6, 0, 3 },
  52. /* 12 */ { 0, 7, 3 },
  53. /* 16 */ { 0, 1, 10 },
  54. /* 24 */ { 0, 2, 6 },
  55. /* 48 */ { 18, 10, 12 }
  56. };
  57. static const opus_int8 delay_matrix_dec[ 3 ][ 5 ] = {
  58. /* in \ out 8 12 16 24 48 */
  59. /* 8 */ { 4, 0, 2, 0, 0 },
  60. /* 12 */ { 0, 9, 4, 7, 4 },
  61. /* 16 */ { 0, 3, 12, 7, 7 }
  62. };
  63. /* Simple way to make [8000, 12000, 16000, 24000, 48000] to [0, 1, 2, 3, 4] */
  64. #define rateID(R) ( ( ( ((R)>>12) - ((R)>16000) ) >> ((R)>24000) ) - 1 )
  65. #define USE_silk_resampler_copy (0)
  66. #define USE_silk_resampler_private_up2_HQ_wrapper (1)
  67. #define USE_silk_resampler_private_IIR_FIR (2)
  68. #define USE_silk_resampler_private_down_FIR (3)
  69. /* Initialize/reset the resampler state for a given pair of input/output sampling rates */
  70. opus_int silk_resampler_init(
  71. silk_resampler_state_struct *S, /* I/O Resampler state */
  72. opus_int32 Fs_Hz_in, /* I Input sampling rate (Hz) */
  73. opus_int32 Fs_Hz_out, /* I Output sampling rate (Hz) */
  74. opus_int forEnc /* I If 1: encoder; if 0: decoder */
  75. )
  76. {
  77. opus_int up2x;
  78. /* Clear state */
  79. silk_memset( S, 0, sizeof( silk_resampler_state_struct ) );
  80. /* Input checking */
  81. if( forEnc ) {
  82. if( ( Fs_Hz_in != 8000 && Fs_Hz_in != 12000 && Fs_Hz_in != 16000 && Fs_Hz_in != 24000 && Fs_Hz_in != 48000 ) ||
  83. ( Fs_Hz_out != 8000 && Fs_Hz_out != 12000 && Fs_Hz_out != 16000 ) ) {
  84. celt_assert( 0 );
  85. return -1;
  86. }
  87. S->inputDelay = delay_matrix_enc[ rateID( Fs_Hz_in ) ][ rateID( Fs_Hz_out ) ];
  88. } else {
  89. if( ( Fs_Hz_in != 8000 && Fs_Hz_in != 12000 && Fs_Hz_in != 16000 ) ||
  90. ( Fs_Hz_out != 8000 && Fs_Hz_out != 12000 && Fs_Hz_out != 16000 && Fs_Hz_out != 24000 && Fs_Hz_out != 48000 ) ) {
  91. celt_assert( 0 );
  92. return -1;
  93. }
  94. S->inputDelay = delay_matrix_dec[ rateID( Fs_Hz_in ) ][ rateID( Fs_Hz_out ) ];
  95. }
  96. S->Fs_in_kHz = silk_DIV32_16( Fs_Hz_in, 1000 );
  97. S->Fs_out_kHz = silk_DIV32_16( Fs_Hz_out, 1000 );
  98. /* Number of samples processed per batch */
  99. S->batchSize = S->Fs_in_kHz * RESAMPLER_MAX_BATCH_SIZE_MS;
  100. /* Find resampler with the right sampling ratio */
  101. up2x = 0;
  102. if( Fs_Hz_out > Fs_Hz_in ) {
  103. /* Upsample */
  104. if( Fs_Hz_out == silk_MUL( Fs_Hz_in, 2 ) ) { /* Fs_out : Fs_in = 2 : 1 */
  105. /* Special case: directly use 2x upsampler */
  106. S->resampler_function = USE_silk_resampler_private_up2_HQ_wrapper;
  107. } else {
  108. /* Default resampler */
  109. S->resampler_function = USE_silk_resampler_private_IIR_FIR;
  110. up2x = 1;
  111. }
  112. } else if ( Fs_Hz_out < Fs_Hz_in ) {
  113. /* Downsample */
  114. S->resampler_function = USE_silk_resampler_private_down_FIR;
  115. if( silk_MUL( Fs_Hz_out, 4 ) == silk_MUL( Fs_Hz_in, 3 ) ) { /* Fs_out : Fs_in = 3 : 4 */
  116. S->FIR_Fracs = 3;
  117. S->FIR_Order = RESAMPLER_DOWN_ORDER_FIR0;
  118. S->Coefs = silk_Resampler_3_4_COEFS;
  119. } else if( silk_MUL( Fs_Hz_out, 3 ) == silk_MUL( Fs_Hz_in, 2 ) ) { /* Fs_out : Fs_in = 2 : 3 */
  120. S->FIR_Fracs = 2;
  121. S->FIR_Order = RESAMPLER_DOWN_ORDER_FIR0;
  122. S->Coefs = silk_Resampler_2_3_COEFS;
  123. } else if( silk_MUL( Fs_Hz_out, 2 ) == Fs_Hz_in ) { /* Fs_out : Fs_in = 1 : 2 */
  124. S->FIR_Fracs = 1;
  125. S->FIR_Order = RESAMPLER_DOWN_ORDER_FIR1;
  126. S->Coefs = silk_Resampler_1_2_COEFS;
  127. } else if( silk_MUL( Fs_Hz_out, 3 ) == Fs_Hz_in ) { /* Fs_out : Fs_in = 1 : 3 */
  128. S->FIR_Fracs = 1;
  129. S->FIR_Order = RESAMPLER_DOWN_ORDER_FIR2;
  130. S->Coefs = silk_Resampler_1_3_COEFS;
  131. } else if( silk_MUL( Fs_Hz_out, 4 ) == Fs_Hz_in ) { /* Fs_out : Fs_in = 1 : 4 */
  132. S->FIR_Fracs = 1;
  133. S->FIR_Order = RESAMPLER_DOWN_ORDER_FIR2;
  134. S->Coefs = silk_Resampler_1_4_COEFS;
  135. } else if( silk_MUL( Fs_Hz_out, 6 ) == Fs_Hz_in ) { /* Fs_out : Fs_in = 1 : 6 */
  136. S->FIR_Fracs = 1;
  137. S->FIR_Order = RESAMPLER_DOWN_ORDER_FIR2;
  138. S->Coefs = silk_Resampler_1_6_COEFS;
  139. } else {
  140. /* None available */
  141. celt_assert( 0 );
  142. return -1;
  143. }
  144. } else {
  145. /* Input and output sampling rates are equal: copy */
  146. S->resampler_function = USE_silk_resampler_copy;
  147. }
  148. /* Ratio of input/output samples */
  149. S->invRatio_Q16 = silk_LSHIFT32( silk_DIV32( silk_LSHIFT32( Fs_Hz_in, 14 + up2x ), Fs_Hz_out ), 2 );
  150. /* Make sure the ratio is rounded up */
  151. while( silk_SMULWW( S->invRatio_Q16, Fs_Hz_out ) < silk_LSHIFT32( Fs_Hz_in, up2x ) ) {
  152. S->invRatio_Q16++;
  153. }
  154. return 0;
  155. }
  156. /* Resampler: convert from one sampling rate to another */
  157. /* Input and output sampling rate are at most 48000 Hz */
  158. opus_int silk_resampler(
  159. silk_resampler_state_struct *S, /* I/O Resampler state */
  160. opus_int16 out[], /* O Output signal */
  161. const opus_int16 in[], /* I Input signal */
  162. opus_int32 inLen /* I Number of input samples */
  163. )
  164. {
  165. opus_int nSamples;
  166. /* Need at least 1 ms of input data */
  167. celt_assert( inLen >= S->Fs_in_kHz );
  168. /* Delay can't exceed the 1 ms of buffering */
  169. celt_assert( S->inputDelay <= S->Fs_in_kHz );
  170. nSamples = S->Fs_in_kHz - S->inputDelay;
  171. /* Copy to delay buffer */
  172. silk_memcpy( &S->delayBuf[ S->inputDelay ], in, nSamples * sizeof( opus_int16 ) );
  173. switch( S->resampler_function ) {
  174. case USE_silk_resampler_private_up2_HQ_wrapper:
  175. silk_resampler_private_up2_HQ_wrapper( S, out, S->delayBuf, S->Fs_in_kHz );
  176. silk_resampler_private_up2_HQ_wrapper( S, &out[ S->Fs_out_kHz ], &in[ nSamples ], inLen - S->Fs_in_kHz );
  177. break;
  178. case USE_silk_resampler_private_IIR_FIR:
  179. silk_resampler_private_IIR_FIR( S, out, S->delayBuf, S->Fs_in_kHz );
  180. silk_resampler_private_IIR_FIR( S, &out[ S->Fs_out_kHz ], &in[ nSamples ], inLen - S->Fs_in_kHz );
  181. break;
  182. case USE_silk_resampler_private_down_FIR:
  183. silk_resampler_private_down_FIR( S, out, S->delayBuf, S->Fs_in_kHz );
  184. silk_resampler_private_down_FIR( S, &out[ S->Fs_out_kHz ], &in[ nSamples ], inLen - S->Fs_in_kHz );
  185. break;
  186. default:
  187. silk_memcpy( out, S->delayBuf, S->Fs_in_kHz * sizeof( opus_int16 ) );
  188. silk_memcpy( &out[ S->Fs_out_kHz ], &in[ nSamples ], ( inLen - S->Fs_in_kHz ) * sizeof( opus_int16 ) );
  189. }
  190. /* Copy to delay buffer */
  191. silk_memcpy( S->delayBuf, &in[ inLen - S->inputDelay ], S->inputDelay * sizeof( opus_int16 ) );
  192. return 0;
  193. }