Line data Source code
1 : /******************************************************************************************************
2 :
3 : (C) 2022-2025 IVAS codec Public Collaboration with portions copyright Dolby International AB, Ericsson AB,
4 : Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e.V., Huawei Technologies Co. LTD.,
5 : Koninklijke Philips N.V., Nippon Telegraph and Telephone Corporation, Nokia Technologies Oy, Orange,
6 : Panasonic Holdings Corporation, Qualcomm Technologies, Inc., VoiceAge Corporation, and other
7 : contributors to this repository. All Rights Reserved.
8 :
9 : This software is protected by copyright law and by international treaties.
10 : The IVAS codec Public Collaboration consisting of Dolby International AB, Ericsson AB,
11 : Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e.V., Huawei Technologies Co. LTD.,
12 : Koninklijke Philips N.V., Nippon Telegraph and Telephone Corporation, Nokia Technologies Oy, Orange,
13 : Panasonic Holdings Corporation, Qualcomm Technologies, Inc., VoiceAge Corporation, and other
14 : contributors to this repository retain full ownership rights in their respective contributions in
15 : the software. This notice grants no license of any kind, including but not limited to patent
16 : license, nor is any license granted by implication, estoppel or otherwise.
17 :
18 : Contributors are required to enter into the IVAS codec Public Collaboration agreement before making
19 : contributions.
20 :
21 : This software is provided "AS IS", without any express or implied warranties. The software is in the
22 : development stage. It is intended exclusively for experts who have experience with such software and
23 : solely for the purpose of inspection. All implied warranties of non-infringement, merchantability
24 : and fitness for a particular purpose are hereby disclaimed and excluded.
25 :
26 : Any dispute, controversy or claim arising under or in relation to providing this software shall be
27 : submitted to and settled by the final, binding jurisdiction of the courts of Munich, Germany in
28 : accordance with the laws of the Federal Republic of Germany excluding its conflict of law rules and
29 : the United Nations Convention on Contracts on the International Sales of Goods.
30 :
31 : *******************************************************************************************************/
32 :
33 : /*====================================================================================
34 : EVS Codec 3GPP TS26.443 Nov 04, 2021. Version 12.14.0 / 13.10.0 / 14.6.0 / 15.4.0 / 16.3.0
35 : ====================================================================================*/
36 :
37 : #include <stdint.h>
38 : #include "options.h"
39 : #ifdef DEBUGGING
40 : #include "debug.h"
41 : #endif
42 : #include "prot.h"
43 : #include "wmc_auto.h"
44 :
45 :
46 : /*--------------------------------------------------------------------------
47 : re8_dec(n, I, k, y)
48 :
49 : MULTI-RATE INDEXING OF A POINT y in THE LATTICE RE8 (INDEX DECODING)
50 : -------------------------------------------------------------------------*/
51 :
52 5602956 : void re8_dec(
53 : int16_t n, /* i : codebook number (*n is an integer defined in {0,2,3,4,..,n_max}) */
54 : const uint16_t I, /* i : index of c (pointer to unsigned 16-bit word) */
55 : const int16_t k[], /* i : index of v (8-dimensional vector of binary indices) = Voronoi index */
56 : int16_t y[] /* o : point in RE8 (8-dimensional integer vector) */
57 : )
58 : {
59 : int16_t i, m, v[8];
60 :
61 : /*------------------------------------------------------------------------*
62 : * decode the sub-indices I and kv[] according to the codebook number n:
63 : * if n=0,2,3,4, decode I (no Voronoi extension)
64 : * if n>4, Voronoi extension is used, decode I and kv[]
65 : *------------------------------------------------------------------------*/
66 :
67 5602956 : if ( n <= 4 )
68 : {
69 5340861 : re8_decode_base_index( n, I, y );
70 : }
71 : else
72 : {
73 : /*--------------------------------------------------------------------*
74 : * compute the Voronoi modulo m = 2^r where r is extension order
75 : *--------------------------------------------------------------------*/
76 :
77 262095 : m = 1;
78 529131 : while ( n > 4 )
79 : {
80 267036 : m *= 2;
81 267036 : n -= 2;
82 : }
83 :
84 : /*--------------------------------------------------------------------*
85 : * decode base codebook index I into c (c is an element of Q3 or Q4)
86 : * [here c is stored in y to save memory]
87 : *--------------------------------------------------------------------*/
88 :
89 262095 : re8_decode_base_index( n, I, y );
90 :
91 : /*--------------------------------------------------------------------*
92 : * decode Voronoi index k[] into v
93 : *--------------------------------------------------------------------*/
94 :
95 262095 : re8_k2y( k, m, v );
96 :
97 : /*--------------------------------------------------------------------*
98 : * reconstruct y as y = m c + v (with m=2^r, r integer >=1)
99 : *--------------------------------------------------------------------*/
100 :
101 2358855 : for ( i = 0; i < 8; i++ )
102 : {
103 2096760 : y[i] = m * y[i] + v[i];
104 : }
105 : }
106 :
107 5602956 : return;
108 : }
|