Merge pull request #2702 from signalwire/isac
[mod_isac] Remove from tree
This commit is contained in:
Andrey Volk
GitHub
commit
122c589815
|
|
@ -219,8 +219,6 @@ Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "pthread", "libs\win32\pthre
|
||||||
EndProject
|
EndProject
|
||||||
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "mod_g723_1", "src\mod\codecs\mod_g723_1\mod_g723_1.2017.vcxproj", "{FEA1EEF7-876F-48DE-88BF-C0E3E606D758}"
|
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "mod_g723_1", "src\mod\codecs\mod_g723_1\mod_g723_1.2017.vcxproj", "{FEA1EEF7-876F-48DE-88BF-C0E3E606D758}"
|
||||||
EndProject
|
EndProject
|
||||||
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "mod_iSAC", "src\mod\codecs\mod_isac\mod_iSAC.2017.vcxproj", "{7F1610F1-DD5A-4CF7-8610-30AB12C60ADD}"
|
|
||||||
EndProject
|
|
||||||
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "mod_native_file", "src\mod\formats\mod_native_file\mod_native_file.2017.vcxproj", "{9254C4B0-6F60-42B6-BB3A-36D63FC001C7}"
|
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "mod_native_file", "src\mod\formats\mod_native_file\mod_native_file.2017.vcxproj", "{9254C4B0-6F60-42B6-BB3A-36D63FC001C7}"
|
||||||
EndProject
|
EndProject
|
||||||
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libudns", "libs\win32\udns\libudns.2017.vcxproj", "{4043FC6A-9A30-4577-8AD5-9B233C9575D8}"
|
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libudns", "libs\win32\udns\libudns.2017.vcxproj", "{4043FC6A-9A30-4577-8AD5-9B233C9575D8}"
|
||||||
|
|
@ -832,17 +830,6 @@ Global
|
||||||
{FEA1EEF7-876F-48DE-88BF-C0E3E606D758}.Release|Win32.Build.0 = Release Passthrough|Win32
|
{FEA1EEF7-876F-48DE-88BF-C0E3E606D758}.Release|Win32.Build.0 = Release Passthrough|Win32
|
||||||
{FEA1EEF7-876F-48DE-88BF-C0E3E606D758}.Release|x64.ActiveCfg = Release Passthrough|x64
|
{FEA1EEF7-876F-48DE-88BF-C0E3E606D758}.Release|x64.ActiveCfg = Release Passthrough|x64
|
||||||
{FEA1EEF7-876F-48DE-88BF-C0E3E606D758}.Release|x64.Build.0 = Release Passthrough|x64
|
{FEA1EEF7-876F-48DE-88BF-C0E3E606D758}.Release|x64.Build.0 = Release Passthrough|x64
|
||||||
{7F1610F1-DD5A-4CF7-8610-30AB12C60ADD}.All|Win32.ActiveCfg = Release|x64
|
|
||||||
{7F1610F1-DD5A-4CF7-8610-30AB12C60ADD}.All|x64.ActiveCfg = Release|x64
|
|
||||||
{7F1610F1-DD5A-4CF7-8610-30AB12C60ADD}.All|x64.Build.0 = Release|x64
|
|
||||||
{7F1610F1-DD5A-4CF7-8610-30AB12C60ADD}.Debug|Win32.ActiveCfg = Debug|Win32
|
|
||||||
{7F1610F1-DD5A-4CF7-8610-30AB12C60ADD}.Debug|Win32.Build.0 = Debug|Win32
|
|
||||||
{7F1610F1-DD5A-4CF7-8610-30AB12C60ADD}.Debug|x64.ActiveCfg = Debug|x64
|
|
||||||
{7F1610F1-DD5A-4CF7-8610-30AB12C60ADD}.Debug|x64.Build.0 = Debug|x64
|
|
||||||
{7F1610F1-DD5A-4CF7-8610-30AB12C60ADD}.Release|Win32.ActiveCfg = Release|Win32
|
|
||||||
{7F1610F1-DD5A-4CF7-8610-30AB12C60ADD}.Release|Win32.Build.0 = Release|Win32
|
|
||||||
{7F1610F1-DD5A-4CF7-8610-30AB12C60ADD}.Release|x64.ActiveCfg = Release|x64
|
|
||||||
{7F1610F1-DD5A-4CF7-8610-30AB12C60ADD}.Release|x64.Build.0 = Release|x64
|
|
||||||
{9254C4B0-6F60-42B6-BB3A-36D63FC001C7}.All|Win32.ActiveCfg = Release|x64
|
{9254C4B0-6F60-42B6-BB3A-36D63FC001C7}.All|Win32.ActiveCfg = Release|x64
|
||||||
{9254C4B0-6F60-42B6-BB3A-36D63FC001C7}.All|x64.ActiveCfg = Release|x64
|
{9254C4B0-6F60-42B6-BB3A-36D63FC001C7}.All|x64.ActiveCfg = Release|x64
|
||||||
{9254C4B0-6F60-42B6-BB3A-36D63FC001C7}.All|x64.Build.0 = Release|x64
|
{9254C4B0-6F60-42B6-BB3A-36D63FC001C7}.All|x64.Build.0 = Release|x64
|
||||||
|
|
@ -2516,7 +2503,6 @@ Global
|
||||||
{0DF3ABD0-DDC0-4265-B778-07C66780979B} = {9460B5F1-0A95-41C4-BEB7-9C2C96459A7C}
|
{0DF3ABD0-DDC0-4265-B778-07C66780979B} = {9460B5F1-0A95-41C4-BEB7-9C2C96459A7C}
|
||||||
{DF018947-0FFF-4EB3-BDEE-441DC81DA7A4} = {EB910B0D-F27D-4B62-B67B-DE834C99AC5B}
|
{DF018947-0FFF-4EB3-BDEE-441DC81DA7A4} = {EB910B0D-F27D-4B62-B67B-DE834C99AC5B}
|
||||||
{FEA1EEF7-876F-48DE-88BF-C0E3E606D758} = {F881ADA2-2F1A-4046-9FEB-191D9422D781}
|
{FEA1EEF7-876F-48DE-88BF-C0E3E606D758} = {F881ADA2-2F1A-4046-9FEB-191D9422D781}
|
||||||
{7F1610F1-DD5A-4CF7-8610-30AB12C60ADD} = {F881ADA2-2F1A-4046-9FEB-191D9422D781}
|
|
||||||
{9254C4B0-6F60-42B6-BB3A-36D63FC001C7} = {A5A27244-AD24-46E5-B01B-840CD296C91D}
|
{9254C4B0-6F60-42B6-BB3A-36D63FC001C7} = {A5A27244-AD24-46E5-B01B-840CD296C91D}
|
||||||
{4043FC6A-9A30-4577-8AD5-9B233C9575D8} = {EB910B0D-F27D-4B62-B67B-DE834C99AC5B}
|
{4043FC6A-9A30-4577-8AD5-9B233C9575D8} = {EB910B0D-F27D-4B62-B67B-DE834C99AC5B}
|
||||||
{71A967D5-0E99-4CEF-A587-98836EE6F2EF} = {E72B5BCB-6462-4D23-B419-3AF1A4AC3D78}
|
{71A967D5-0E99-4CEF-A587-98836EE6F2EF} = {E72B5BCB-6462-4D23-B419-3AF1A4AC3D78}
|
||||||
|
|
|
||||||
8
LICENSE
8
LICENSE
|
|
@ -1578,14 +1578,6 @@ Files: src/include/switch_profile.h
|
||||||
Copyright: 2009,2010, Sangoma Technologies
|
Copyright: 2009,2010, Sangoma Technologies
|
||||||
License: BSD-3-clause
|
License: BSD-3-clause
|
||||||
|
|
||||||
Files: src/mod/codecs/mod_isac/*
|
|
||||||
Copyright: 2011-2012 The WebRTC project authors
|
|
||||||
License: BSD-3-clause
|
|
||||||
|
|
||||||
Files: src/mod/codecs/mod_isac/mod_isac.c
|
|
||||||
Copyright: 2005-2014, Anthony Minessale II <anthm@freeswitch.org>
|
|
||||||
License: MPL-1.1
|
|
||||||
|
|
||||||
Files: libs/srtp/*
|
Files: libs/srtp/*
|
||||||
Copyright: 2001-2006, Cisco Systems, Inc.
|
Copyright: 2001-2006, Cisco Systems, Inc.
|
||||||
2005 Ingate Systems AB
|
2005 Ingate Systems AB
|
||||||
|
|
|
||||||
|
|
@ -66,7 +66,6 @@ codecs/mod_g723_1
|
||||||
codecs/mod_g729
|
codecs/mod_g729
|
||||||
codecs/mod_h26x
|
codecs/mod_h26x
|
||||||
#codecs/mod_ilbc
|
#codecs/mod_ilbc
|
||||||
#codecs/mod_isac
|
|
||||||
codecs/mod_opus
|
codecs/mod_opus
|
||||||
#codecs/mod_silk
|
#codecs/mod_silk
|
||||||
#codecs/mod_siren
|
#codecs/mod_siren
|
||||||
|
|
|
||||||
|
|
@ -65,7 +65,6 @@ codecs/mod_g723_1
|
||||||
codecs/mod_g729
|
codecs/mod_g729
|
||||||
codecs/mod_h26x
|
codecs/mod_h26x
|
||||||
codecs/mod_ilbc
|
codecs/mod_ilbc
|
||||||
codecs/mod_isac
|
|
||||||
codecs/mod_opus
|
codecs/mod_opus
|
||||||
codecs/mod_silk
|
codecs/mod_silk
|
||||||
codecs/mod_siren
|
codecs/mod_siren
|
||||||
|
|
|
||||||
1
ci.sh
1
ci.sh
|
|
@ -92,7 +92,6 @@ configure_freeswitch()
|
||||||
# "Disable"/"Comment out" mods
|
# "Disable"/"Comment out" mods
|
||||||
sed -i \
|
sed -i \
|
||||||
-e '/mod_ilbc/s/^/#/g' \
|
-e '/mod_ilbc/s/^/#/g' \
|
||||||
-e '/mod_isac/s/^/#/g' \
|
|
||||||
-e '/mod_mongo/s/^/#/g' \
|
-e '/mod_mongo/s/^/#/g' \
|
||||||
-e '/mod_pocketsphinx/s/^/#/g' \
|
-e '/mod_pocketsphinx/s/^/#/g' \
|
||||||
-e '/mod_siren/s/^/#/g' \
|
-e '/mod_siren/s/^/#/g' \
|
||||||
|
|
|
||||||
|
|
@ -93,7 +93,6 @@
|
||||||
<!--<load module="mod_h26x"/>-->
|
<!--<load module="mod_h26x"/>-->
|
||||||
<load module="mod_b64"/>
|
<load module="mod_b64"/>
|
||||||
<!--<load module="mod_siren"/>-->
|
<!--<load module="mod_siren"/>-->
|
||||||
<!--<load module="mod_isac"/>-->
|
|
||||||
<load module="mod_opus"/>
|
<load module="mod_opus"/>
|
||||||
|
|
||||||
<!-- File Format Interfaces -->
|
<!-- File Format Interfaces -->
|
||||||
|
|
|
||||||
|
|
@ -2157,7 +2157,6 @@ AC_CONFIG_FILES([Makefile
|
||||||
src/mod/codecs/mod_g729/Makefile
|
src/mod/codecs/mod_g729/Makefile
|
||||||
src/mod/codecs/mod_h26x/Makefile
|
src/mod/codecs/mod_h26x/Makefile
|
||||||
src/mod/codecs/mod_ilbc/Makefile
|
src/mod/codecs/mod_ilbc/Makefile
|
||||||
src/mod/codecs/mod_isac/Makefile
|
|
||||||
src/mod/codecs/mod_opus/Makefile
|
src/mod/codecs/mod_opus/Makefile
|
||||||
src/mod/codecs/mod_openh264/Makefile
|
src/mod/codecs/mod_openh264/Makefile
|
||||||
src/mod/codecs/mod_silk/Makefile
|
src/mod/codecs/mod_silk/Makefile
|
||||||
|
|
|
||||||
|
|
@ -709,7 +709,6 @@ Depends: \${misc:Depends}, freeswitch (= \${binary:Version}),
|
||||||
freeswitch-mod-g723-1 (= \${binary:Version}),
|
freeswitch-mod-g723-1 (= \${binary:Version}),
|
||||||
freeswitch-mod-g729 (= \${binary:Version}),
|
freeswitch-mod-g729 (= \${binary:Version}),
|
||||||
freeswitch-mod-h26x (= \${binary:Version}),
|
freeswitch-mod-h26x (= \${binary:Version}),
|
||||||
freeswitch-mod-isac (= \${binary:Version}),
|
|
||||||
freeswitch-mod-opus (= \${binary:Version}),
|
freeswitch-mod-opus (= \${binary:Version}),
|
||||||
freeswitch-mod-silk (= \${binary:Version}),
|
freeswitch-mod-silk (= \${binary:Version}),
|
||||||
freeswitch-mod-spandsp (= \${binary:Version}),
|
freeswitch-mod-spandsp (= \${binary:Version}),
|
||||||
|
|
@ -734,7 +733,6 @@ Depends: \${misc:Depends}, freeswitch (= \${binary:Version}),
|
||||||
freeswitch-mod-g723-1-dbg (= \${binary:Version}),
|
freeswitch-mod-g723-1-dbg (= \${binary:Version}),
|
||||||
freeswitch-mod-g729-dbg (= \${binary:Version}),
|
freeswitch-mod-g729-dbg (= \${binary:Version}),
|
||||||
freeswitch-mod-h26x-dbg (= \${binary:Version}),
|
freeswitch-mod-h26x-dbg (= \${binary:Version}),
|
||||||
freeswitch-mod-isac-dbg (= \${binary:Version}),
|
|
||||||
freeswitch-mod-opus-dbg (= \${binary:Version}),
|
freeswitch-mod-opus-dbg (= \${binary:Version}),
|
||||||
freeswitch-mod-silk-dbg (= \${binary:Version}),
|
freeswitch-mod-silk-dbg (= \${binary:Version}),
|
||||||
freeswitch-mod-spandsp-dbg (= \${binary:Version}),
|
freeswitch-mod-spandsp-dbg (= \${binary:Version}),
|
||||||
|
|
|
||||||
|
|
@ -319,10 +319,6 @@ Description: mod_ilbc
|
||||||
Adds mod_ilbc.
|
Adds mod_ilbc.
|
||||||
Build-Depends: libilbc-dev
|
Build-Depends: libilbc-dev
|
||||||
|
|
||||||
Module: codecs/mod_isac
|
|
||||||
Description: mod_isac
|
|
||||||
Adds mod_isac.
|
|
||||||
|
|
||||||
Module: codecs/mod_openh264
|
Module: codecs/mod_openh264
|
||||||
Description: Adds mod_openh264
|
Description: Adds mod_openh264
|
||||||
Adds mod_openh264.
|
Adds mod_openh264.
|
||||||
|
|
|
||||||
|
|
@ -1573,14 +1573,6 @@ Files: libs/libcodec2/src/pack.c
|
||||||
Copyright: 2010 Perens LLC <bruce@perens.com>
|
Copyright: 2010 Perens LLC <bruce@perens.com>
|
||||||
License: GPL-3+
|
License: GPL-3+
|
||||||
|
|
||||||
Files: src/mod/codecs/mod_isac/*
|
|
||||||
Copyright: 2011-2012 The WebRTC project authors
|
|
||||||
License: BSD-3-clause
|
|
||||||
|
|
||||||
Files: src/mod/codecs/mod_isac/mod_isac.c
|
|
||||||
Copyright: 2005-2014, Anthony Minessale II <anthm@freeswitch.org>
|
|
||||||
License: MPL-1.1
|
|
||||||
|
|
||||||
Files: libs/srtp/*
|
Files: libs/srtp/*
|
||||||
Copyright: 2001-2006, Cisco Systems, Inc.
|
Copyright: 2001-2006, Cisco Systems, Inc.
|
||||||
2005 Ingate Systems AB
|
2005 Ingate Systems AB
|
||||||
|
|
|
||||||
|
|
@ -706,21 +706,13 @@ BuildRequires: ilbc2-devel
|
||||||
%description codec-ilbc
|
%description codec-ilbc
|
||||||
iLBC Codec support for FreeSWITCH open source telephony platform
|
iLBC Codec support for FreeSWITCH open source telephony platform
|
||||||
|
|
||||||
%package codec-isac
|
|
||||||
Summary: iSAC Codec support for FreeSWITCH open source telephony platform
|
|
||||||
Group: System/Libraries
|
|
||||||
Requires: %{name} = %{version}-%{release}
|
|
||||||
|
|
||||||
%description codec-isac
|
|
||||||
iSAC Codec support for FreeSWITCH open source telephony platform
|
|
||||||
|
|
||||||
%package codec-vpx
|
%package codec-vpx
|
||||||
Summary: vp8 Codec support for FreeSWITCH open source telephony platform
|
Summary: vp8 Codec support for FreeSWITCH open source telephony platform
|
||||||
Group: System/Libraries
|
Group: System/Libraries
|
||||||
Requires: %{name} = %{version}-%{release}
|
Requires: %{name} = %{version}-%{release}
|
||||||
|
|
||||||
%description codec-vpx
|
%description codec-vpx
|
||||||
iSAC Codec support for FreeSWITCH open source telephony platform
|
VP8 Codec support for FreeSWITCH open source telephony platform
|
||||||
|
|
||||||
%package codec-opus
|
%package codec-opus
|
||||||
Summary: Opus Codec support for FreeSWITCH open source telephony platform
|
Summary: Opus Codec support for FreeSWITCH open source telephony platform
|
||||||
|
|
@ -1343,7 +1335,7 @@ ASR_TTS_MODULES="asr_tts/mod_flite asr_tts/mod_pocketsphinx asr_tts/mod_tts_comm
|
||||||
#
|
#
|
||||||
######################################################################################################################
|
######################################################################################################################
|
||||||
CODECS_MODULES="codecs/mod_amr codecs/mod_amrwb codecs/mod_bv codecs/mod_codec2 codecs/mod_g723_1 \
|
CODECS_MODULES="codecs/mod_amr codecs/mod_amrwb codecs/mod_bv codecs/mod_codec2 codecs/mod_g723_1 \
|
||||||
codecs/mod_g729 codecs/mod_h26x codecs/mod_ilbc codecs/mod_isac codecs/mod_opus codecs/mod_silk \
|
codecs/mod_g729 codecs/mod_h26x codecs/mod_ilbc codecs/mod_opus codecs/mod_silk \
|
||||||
codecs/mod_siren codecs/mod_theora"
|
codecs/mod_siren codecs/mod_theora"
|
||||||
#
|
#
|
||||||
|
|
||||||
|
|
@ -2064,9 +2056,6 @@ fi
|
||||||
%files codec-ilbc
|
%files codec-ilbc
|
||||||
%{MODINSTDIR}/mod_ilbc.so*
|
%{MODINSTDIR}/mod_ilbc.so*
|
||||||
|
|
||||||
%files codec-isac
|
|
||||||
%{MODINSTDIR}/mod_isac.so*
|
|
||||||
|
|
||||||
%files codec-opus
|
%files codec-opus
|
||||||
%{MODINSTDIR}/mod_opus.so*
|
%{MODINSTDIR}/mod_opus.so*
|
||||||
%config(noreplace) %attr(0640, freeswitch, daemon) %{sysconfdir}/autoload_configs/opus.conf.xml
|
%config(noreplace) %attr(0640, freeswitch, daemon) %{sysconfdir}/autoload_configs/opus.conf.xml
|
||||||
|
|
|
||||||
|
|
@ -1,29 +0,0 @@
|
||||||
Copyright (c) 2011, The WebRTC project authors. All rights reserved.
|
|
||||||
|
|
||||||
Redistribution and use in source and binary forms, with or without
|
|
||||||
modification, are permitted provided that the following conditions are
|
|
||||||
met:
|
|
||||||
|
|
||||||
* Redistributions of source code must retain the above copyright
|
|
||||||
notice, this list of conditions and the following disclaimer.
|
|
||||||
|
|
||||||
* Redistributions in binary form must reproduce the above copyright
|
|
||||||
notice, this list of conditions and the following disclaimer in
|
|
||||||
the documentation and/or other materials provided with the
|
|
||||||
distribution.
|
|
||||||
|
|
||||||
* Neither the name of Google nor the names of its contributors may
|
|
||||||
be used to endorse or promote products derived from this software
|
|
||||||
without specific prior written permission.
|
|
||||||
|
|
||||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
||||||
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
||||||
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
||||||
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
||||||
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
||||||
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
||||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
||||||
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
||||||
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
||||||
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
||||||
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
||||||
|
|
@ -1,17 +0,0 @@
|
||||||
include $(top_srcdir)/build/modmake.rulesam
|
|
||||||
MODNAME=mod_isac
|
|
||||||
|
|
||||||
mod_LTLIBRARIES = mod_isac.la
|
|
||||||
mod_isac_la_SOURCES = mod_isac.c arith_routines.c arith_routines_hist.c arith_routines_logist.c auto_correlation.c auto_corr_to_refl_coef.c
|
|
||||||
mod_isac_la_SOURCES += bandwidth_estimator.c complex_bit_reverse.c complex_fft.c copy_set_operations.c crc.c cross_correlation.c decode_bwe.c
|
|
||||||
mod_isac_la_SOURCES += decode.c division_operations.c dot_product_with_scale.c downsample_fast.c encode.c encode_lpc_swb.c energy.c entropy_coding.c
|
|
||||||
mod_isac_la_SOURCES += fft.c filter_ar.c filter_ar_fast_q12.c filterbanks.c filterbank_tables.c filter_functions.c filter_ma_fast_q12.c
|
|
||||||
mod_isac_la_SOURCES += get_hanning_window.c get_scaling_square.c ilbc_specific_functions.c intialize.c isac.c lattice.c levinson_durbin.c
|
|
||||||
mod_isac_la_SOURCES += lpc_analysis.c lpc_gain_swb_tables.c lpc_shape_swb12_tables.c lpc_shape_swb16_tables.c lpc_tables.c
|
|
||||||
mod_isac_la_SOURCES += lpc_to_refl_coef.c min_max_operations.c min_max_operations_neon.c pitch_estimator.c pitch_filter.c pitch_gain_tables.c
|
|
||||||
mod_isac_la_SOURCES += pitch_lag_tables.c randomization_functions.c refl_coef_to_lpc.c resample_48khz.c resample_by_2.c resample_by_2_internal.c
|
|
||||||
mod_isac_la_SOURCES += resample.c resample_fractional.c spectrum_ar_model_tables.c splitting_filter.c spl_sqrt.c spl_sqrt_floor.c spl_version.c
|
|
||||||
mod_isac_la_SOURCES += sqrt_of_one_minus_x_squared.c transform.c vector_scaling_operations.c webrtc_fft_t_1024_8.c webrtc_fft_t_rad.c
|
|
||||||
mod_isac_la_CFLAGS = $(AM_CFLAGS) -w -I.
|
|
||||||
mod_isac_la_LIBADD = $(switch_builddir)/libfreeswitch.la
|
|
||||||
mod_isac_la_LDFLAGS = -avoid-version -module -no-undefined -shared
|
|
||||||
|
|
@ -1,24 +0,0 @@
|
||||||
Additional IP Rights Grant (Patents)
|
|
||||||
|
|
||||||
"This implementation" means the copyrightable works distributed by
|
|
||||||
Google as part of the WebRTC code package.
|
|
||||||
|
|
||||||
Google hereby grants to you a perpetual, worldwide, non-exclusive,
|
|
||||||
no-charge, irrevocable (except as stated in this section) patent
|
|
||||||
license to make, have made, use, offer to sell, sell, import,
|
|
||||||
transfer, and otherwise run, modify and propagate the contents of this
|
|
||||||
implementation of the WebRTC code package, where such license applies
|
|
||||||
only to those patent claims, both currently owned by Google and
|
|
||||||
acquired in the future, licensable by Google that are necessarily
|
|
||||||
infringed by this implementation of the WebRTC code package. This
|
|
||||||
grant does not include claims that would be infringed only as a
|
|
||||||
consequence of further modification of this implementation. If you or
|
|
||||||
your agent or exclusive licensee institute or order or agree to the
|
|
||||||
institution of patent litigation against any entity (including a
|
|
||||||
cross-claim or counterclaim in a lawsuit) alleging that this
|
|
||||||
implementation of the WebRTC code package or any code incorporated
|
|
||||||
within this implementation of the WebRTC code package constitutes
|
|
||||||
direct or contributory patent infringement, or inducement of patent
|
|
||||||
infringement, then any patent rights granted to you under this License
|
|
||||||
for this implementation of the WebRTC code package shall terminate as
|
|
||||||
of the date such litigation is filed.
|
|
||||||
|
|
@ -1,60 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "arith_routines.h"
|
|
||||||
#include "settings.h"
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* terminate and return byte stream;
|
|
||||||
* returns the number of bytes in the stream
|
|
||||||
*/
|
|
||||||
int WebRtcIsac_EncTerminate(Bitstr *streamdata) /* in-/output struct containing bitstream */
|
|
||||||
{
|
|
||||||
WebRtc_UWord8 *stream_ptr;
|
|
||||||
|
|
||||||
|
|
||||||
/* point to the right place in the stream buffer */
|
|
||||||
stream_ptr = streamdata->stream + streamdata->stream_index;
|
|
||||||
|
|
||||||
/* find minimum length (determined by current interval width) */
|
|
||||||
if ( streamdata->W_upper > 0x01FFFFFF )
|
|
||||||
{
|
|
||||||
streamdata->streamval += 0x01000000;
|
|
||||||
/* add carry to buffer */
|
|
||||||
if (streamdata->streamval < 0x01000000)
|
|
||||||
{
|
|
||||||
/* propagate carry */
|
|
||||||
while ( !(++(*--stream_ptr)) );
|
|
||||||
/* put pointer back to the old value */
|
|
||||||
stream_ptr = streamdata->stream + streamdata->stream_index;
|
|
||||||
}
|
|
||||||
/* write remaining data to bitstream */
|
|
||||||
*stream_ptr++ = (WebRtc_UWord8) (streamdata->streamval >> 24);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
streamdata->streamval += 0x00010000;
|
|
||||||
/* add carry to buffer */
|
|
||||||
if (streamdata->streamval < 0x00010000)
|
|
||||||
{
|
|
||||||
/* propagate carry */
|
|
||||||
while ( !(++(*--stream_ptr)) );
|
|
||||||
/* put pointer back to the old value */
|
|
||||||
stream_ptr = streamdata->stream + streamdata->stream_index;
|
|
||||||
}
|
|
||||||
/* write remaining data to bitstream */
|
|
||||||
*stream_ptr++ = (WebRtc_UWord8) (streamdata->streamval >> 24);
|
|
||||||
*stream_ptr++ = (WebRtc_UWord8) ((streamdata->streamval >> 16) & 0x00FF);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* calculate stream length */
|
|
||||||
return (int)(stream_ptr - streamdata->stream);
|
|
||||||
}
|
|
||||||
|
|
@ -1,63 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* arith_routines.h
|
|
||||||
*
|
|
||||||
* Functions for arithmetic coding.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_ARITH_ROUTINES_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_ARITH_ROUTINES_H_
|
|
||||||
|
|
||||||
#include "structs.h"
|
|
||||||
|
|
||||||
|
|
||||||
int WebRtcIsac_EncLogisticMulti2(
|
|
||||||
Bitstr *streamdata, /* in-/output struct containing bitstream */
|
|
||||||
WebRtc_Word16 *dataQ7, /* input: data vector */
|
|
||||||
const WebRtc_UWord16 *env, /* input: side info vector defining the width of the pdf */
|
|
||||||
const int N, /* input: data vector length */
|
|
||||||
const WebRtc_Word16 isSWB12kHz); /* if the codec is working in 12kHz bandwidth */
|
|
||||||
|
|
||||||
/* returns the number of bytes in the stream */
|
|
||||||
int WebRtcIsac_EncTerminate(Bitstr *streamdata); /* in-/output struct containing bitstream */
|
|
||||||
|
|
||||||
/* returns the number of bytes in the stream so far */
|
|
||||||
int WebRtcIsac_DecLogisticMulti2(
|
|
||||||
WebRtc_Word16 *data, /* output: data vector */
|
|
||||||
Bitstr *streamdata, /* in-/output struct containing bitstream */
|
|
||||||
const WebRtc_UWord16 *env, /* input: side info vector defining the width of the pdf */
|
|
||||||
const WebRtc_Word16 *dither, /* input: dither vector */
|
|
||||||
const int N, /* input: data vector length */
|
|
||||||
const WebRtc_Word16 isSWB12kHz); /* if the codec is working in 12kHz bandwidth */
|
|
||||||
|
|
||||||
void WebRtcIsac_EncHistMulti(
|
|
||||||
Bitstr *streamdata, /* in-/output struct containing bitstream */
|
|
||||||
const int *data, /* input: data vector */
|
|
||||||
const WebRtc_UWord16 **cdf, /* input: array of cdf arrays */
|
|
||||||
const int N); /* input: data vector length */
|
|
||||||
|
|
||||||
int WebRtcIsac_DecHistBisectMulti(
|
|
||||||
int *data, /* output: data vector */
|
|
||||||
Bitstr *streamdata, /* in-/output struct containing bitstream */
|
|
||||||
const WebRtc_UWord16 **cdf, /* input: array of cdf arrays */
|
|
||||||
const WebRtc_UWord16 *cdf_size, /* input: array of cdf table sizes+1 (power of two: 2^k) */
|
|
||||||
const int N); /* input: data vector length */
|
|
||||||
|
|
||||||
int WebRtcIsac_DecHistOneStepMulti(
|
|
||||||
int *data, /* output: data vector */
|
|
||||||
Bitstr *streamdata, /* in-/output struct containing bitstream */
|
|
||||||
const WebRtc_UWord16 **cdf, /* input: array of cdf arrays */
|
|
||||||
const WebRtc_UWord16 *init_index,/* input: vector of initial cdf table search entries */
|
|
||||||
const int N); /* input: data vector length */
|
|
||||||
|
|
||||||
#endif /* WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_ARITH_ROUTINES_H_ */
|
|
||||||
|
|
@ -1,291 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "settings.h"
|
|
||||||
#include "arith_routines.h"
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* code symbols into arithmetic bytestream
|
|
||||||
*/
|
|
||||||
void WebRtcIsac_EncHistMulti(Bitstr *streamdata, /* in-/output struct containing bitstream */
|
|
||||||
const int *data, /* input: data vector */
|
|
||||||
const WebRtc_UWord16 **cdf, /* input: array of cdf arrays */
|
|
||||||
const int N) /* input: data vector length */
|
|
||||||
{
|
|
||||||
WebRtc_UWord32 W_lower, W_upper;
|
|
||||||
WebRtc_UWord32 W_upper_LSB, W_upper_MSB;
|
|
||||||
WebRtc_UWord8 *stream_ptr;
|
|
||||||
WebRtc_UWord8 *stream_ptr_carry;
|
|
||||||
WebRtc_UWord32 cdf_lo, cdf_hi;
|
|
||||||
int k;
|
|
||||||
|
|
||||||
|
|
||||||
/* point to beginning of stream buffer */
|
|
||||||
stream_ptr = streamdata->stream + streamdata->stream_index;
|
|
||||||
W_upper = streamdata->W_upper;
|
|
||||||
|
|
||||||
for (k=N; k>0; k--)
|
|
||||||
{
|
|
||||||
/* fetch cdf_lower and cdf_upper from cdf tables */
|
|
||||||
cdf_lo = (WebRtc_UWord32) *(*cdf + *data);
|
|
||||||
cdf_hi = (WebRtc_UWord32) *(*cdf++ + *data++ + 1);
|
|
||||||
|
|
||||||
/* update interval */
|
|
||||||
W_upper_LSB = W_upper & 0x0000FFFF;
|
|
||||||
W_upper_MSB = W_upper >> 16;
|
|
||||||
W_lower = W_upper_MSB * cdf_lo;
|
|
||||||
W_lower += (W_upper_LSB * cdf_lo) >> 16;
|
|
||||||
W_upper = W_upper_MSB * cdf_hi;
|
|
||||||
W_upper += (W_upper_LSB * cdf_hi) >> 16;
|
|
||||||
|
|
||||||
/* shift interval such that it begins at zero */
|
|
||||||
W_upper -= ++W_lower;
|
|
||||||
|
|
||||||
/* add integer to bitstream */
|
|
||||||
streamdata->streamval += W_lower;
|
|
||||||
|
|
||||||
/* handle carry */
|
|
||||||
if (streamdata->streamval < W_lower)
|
|
||||||
{
|
|
||||||
/* propagate carry */
|
|
||||||
stream_ptr_carry = stream_ptr;
|
|
||||||
while (!(++(*--stream_ptr_carry)));
|
|
||||||
}
|
|
||||||
|
|
||||||
/* renormalize interval, store most significant byte of streamval and update streamval */
|
|
||||||
while ( !(W_upper & 0xFF000000) ) /* W_upper < 2^24 */
|
|
||||||
{
|
|
||||||
W_upper <<= 8;
|
|
||||||
*stream_ptr++ = (WebRtc_UWord8) (streamdata->streamval >> 24);
|
|
||||||
streamdata->streamval <<= 8;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* calculate new stream_index */
|
|
||||||
streamdata->stream_index = (int)(stream_ptr - streamdata->stream);
|
|
||||||
streamdata->W_upper = W_upper;
|
|
||||||
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* function to decode more symbols from the arithmetic bytestream, using method of bisection
|
|
||||||
* cdf tables should be of size 2^k-1 (which corresponds to an alphabet size of 2^k-2)
|
|
||||||
*/
|
|
||||||
int WebRtcIsac_DecHistBisectMulti(int *data, /* output: data vector */
|
|
||||||
Bitstr *streamdata, /* in-/output struct containing bitstream */
|
|
||||||
const WebRtc_UWord16 **cdf, /* input: array of cdf arrays */
|
|
||||||
const WebRtc_UWord16 *cdf_size, /* input: array of cdf table sizes+1 (power of two: 2^k) */
|
|
||||||
const int N) /* input: data vector length */
|
|
||||||
{
|
|
||||||
WebRtc_UWord32 W_lower, W_upper;
|
|
||||||
WebRtc_UWord32 W_tmp;
|
|
||||||
WebRtc_UWord32 W_upper_LSB, W_upper_MSB;
|
|
||||||
WebRtc_UWord32 streamval;
|
|
||||||
const WebRtc_UWord8 *stream_ptr;
|
|
||||||
const WebRtc_UWord16 *cdf_ptr;
|
|
||||||
int size_tmp;
|
|
||||||
int k;
|
|
||||||
|
|
||||||
W_lower = 0; //to remove warning -DH
|
|
||||||
stream_ptr = streamdata->stream + streamdata->stream_index;
|
|
||||||
W_upper = streamdata->W_upper;
|
|
||||||
if (W_upper == 0)
|
|
||||||
/* Should not be possible in normal operation */
|
|
||||||
return -2;
|
|
||||||
|
|
||||||
if (streamdata->stream_index == 0) /* first time decoder is called for this stream */
|
|
||||||
{
|
|
||||||
/* read first word from bytestream */
|
|
||||||
streamval = *stream_ptr << 24;
|
|
||||||
streamval |= *++stream_ptr << 16;
|
|
||||||
streamval |= *++stream_ptr << 8;
|
|
||||||
streamval |= *++stream_ptr;
|
|
||||||
} else {
|
|
||||||
streamval = streamdata->streamval;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (k=N; k>0; k--)
|
|
||||||
{
|
|
||||||
/* find the integer *data for which streamval lies in [W_lower+1, W_upper] */
|
|
||||||
W_upper_LSB = W_upper & 0x0000FFFF;
|
|
||||||
W_upper_MSB = W_upper >> 16;
|
|
||||||
|
|
||||||
/* start halfway the cdf range */
|
|
||||||
size_tmp = *cdf_size++ >> 1;
|
|
||||||
cdf_ptr = *cdf + (size_tmp - 1);
|
|
||||||
|
|
||||||
/* method of bisection */
|
|
||||||
for ( ;; )
|
|
||||||
{
|
|
||||||
W_tmp = W_upper_MSB * *cdf_ptr;
|
|
||||||
W_tmp += (W_upper_LSB * *cdf_ptr) >> 16;
|
|
||||||
size_tmp >>= 1;
|
|
||||||
if (size_tmp == 0) break;
|
|
||||||
if (streamval > W_tmp)
|
|
||||||
{
|
|
||||||
W_lower = W_tmp;
|
|
||||||
cdf_ptr += size_tmp;
|
|
||||||
} else {
|
|
||||||
W_upper = W_tmp;
|
|
||||||
cdf_ptr -= size_tmp;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (streamval > W_tmp)
|
|
||||||
{
|
|
||||||
W_lower = W_tmp;
|
|
||||||
*data++ = (int)(cdf_ptr - *cdf++);
|
|
||||||
} else {
|
|
||||||
W_upper = W_tmp;
|
|
||||||
*data++ = (int)(cdf_ptr - *cdf++ - 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* shift interval to start at zero */
|
|
||||||
W_upper -= ++W_lower;
|
|
||||||
|
|
||||||
/* add integer to bitstream */
|
|
||||||
streamval -= W_lower;
|
|
||||||
|
|
||||||
/* renormalize interval and update streamval */
|
|
||||||
while ( !(W_upper & 0xFF000000) ) /* W_upper < 2^24 */
|
|
||||||
{
|
|
||||||
/* read next byte from stream */
|
|
||||||
streamval = (streamval << 8) | *++stream_ptr;
|
|
||||||
W_upper <<= 8;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (W_upper == 0)
|
|
||||||
/* Should not be possible in normal operation */
|
|
||||||
return -2;
|
|
||||||
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
streamdata->stream_index = (int)(stream_ptr - streamdata->stream);
|
|
||||||
streamdata->W_upper = W_upper;
|
|
||||||
streamdata->streamval = streamval;
|
|
||||||
|
|
||||||
|
|
||||||
/* find number of bytes in original stream (determined by current interval width) */
|
|
||||||
if ( W_upper > 0x01FFFFFF )
|
|
||||||
return streamdata->stream_index - 2;
|
|
||||||
else
|
|
||||||
return streamdata->stream_index - 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* function to decode more symbols from the arithmetic bytestream, taking single step up or
|
|
||||||
* down at a time
|
|
||||||
* cdf tables can be of arbitrary size, but large tables may take a lot of iterations
|
|
||||||
*/
|
|
||||||
int WebRtcIsac_DecHistOneStepMulti(int *data, /* output: data vector */
|
|
||||||
Bitstr *streamdata, /* in-/output struct containing bitstream */
|
|
||||||
const WebRtc_UWord16 **cdf, /* input: array of cdf arrays */
|
|
||||||
const WebRtc_UWord16 *init_index, /* input: vector of initial cdf table search entries */
|
|
||||||
const int N) /* input: data vector length */
|
|
||||||
{
|
|
||||||
WebRtc_UWord32 W_lower, W_upper;
|
|
||||||
WebRtc_UWord32 W_tmp;
|
|
||||||
WebRtc_UWord32 W_upper_LSB, W_upper_MSB;
|
|
||||||
WebRtc_UWord32 streamval;
|
|
||||||
const WebRtc_UWord8 *stream_ptr;
|
|
||||||
const WebRtc_UWord16 *cdf_ptr;
|
|
||||||
int k;
|
|
||||||
|
|
||||||
|
|
||||||
stream_ptr = streamdata->stream + streamdata->stream_index;
|
|
||||||
W_upper = streamdata->W_upper;
|
|
||||||
if (W_upper == 0)
|
|
||||||
/* Should not be possible in normal operation */
|
|
||||||
return -2;
|
|
||||||
|
|
||||||
if (streamdata->stream_index == 0) /* first time decoder is called for this stream */
|
|
||||||
{
|
|
||||||
/* read first word from bytestream */
|
|
||||||
streamval = *stream_ptr << 24;
|
|
||||||
streamval |= *++stream_ptr << 16;
|
|
||||||
streamval |= *++stream_ptr << 8;
|
|
||||||
streamval |= *++stream_ptr;
|
|
||||||
} else {
|
|
||||||
streamval = streamdata->streamval;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
for (k=N; k>0; k--)
|
|
||||||
{
|
|
||||||
/* find the integer *data for which streamval lies in [W_lower+1, W_upper] */
|
|
||||||
W_upper_LSB = W_upper & 0x0000FFFF;
|
|
||||||
W_upper_MSB = W_upper >> 16;
|
|
||||||
|
|
||||||
/* start at the specified table entry */
|
|
||||||
cdf_ptr = *cdf + (*init_index++);
|
|
||||||
W_tmp = W_upper_MSB * *cdf_ptr;
|
|
||||||
W_tmp += (W_upper_LSB * *cdf_ptr) >> 16;
|
|
||||||
if (streamval > W_tmp)
|
|
||||||
{
|
|
||||||
for ( ;; )
|
|
||||||
{
|
|
||||||
W_lower = W_tmp;
|
|
||||||
if (cdf_ptr[0]==65535)
|
|
||||||
/* range check */
|
|
||||||
return -3;
|
|
||||||
W_tmp = W_upper_MSB * *++cdf_ptr;
|
|
||||||
W_tmp += (W_upper_LSB * *cdf_ptr) >> 16;
|
|
||||||
if (streamval <= W_tmp) break;
|
|
||||||
}
|
|
||||||
W_upper = W_tmp;
|
|
||||||
*data++ = (int)(cdf_ptr - *cdf++ - 1);
|
|
||||||
} else {
|
|
||||||
for ( ;; )
|
|
||||||
{
|
|
||||||
W_upper = W_tmp;
|
|
||||||
--cdf_ptr;
|
|
||||||
if (cdf_ptr<*cdf) {
|
|
||||||
/* range check */
|
|
||||||
return -3;
|
|
||||||
}
|
|
||||||
W_tmp = W_upper_MSB * *cdf_ptr;
|
|
||||||
W_tmp += (W_upper_LSB * *cdf_ptr) >> 16;
|
|
||||||
if (streamval > W_tmp) break;
|
|
||||||
}
|
|
||||||
W_lower = W_tmp;
|
|
||||||
*data++ = (int)(cdf_ptr - *cdf++);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* shift interval to start at zero */
|
|
||||||
W_upper -= ++W_lower;
|
|
||||||
/* add integer to bitstream */
|
|
||||||
streamval -= W_lower;
|
|
||||||
|
|
||||||
/* renormalize interval and update streamval */
|
|
||||||
while ( !(W_upper & 0xFF000000) ) /* W_upper < 2^24 */
|
|
||||||
{
|
|
||||||
/* read next byte from stream */
|
|
||||||
streamval = (streamval << 8) | *++stream_ptr;
|
|
||||||
W_upper <<= 8;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
streamdata->stream_index = (int)(stream_ptr - streamdata->stream);
|
|
||||||
streamdata->W_upper = W_upper;
|
|
||||||
streamdata->streamval = streamval;
|
|
||||||
|
|
||||||
|
|
||||||
/* find number of bytes in original stream (determined by current interval width) */
|
|
||||||
if ( W_upper > 0x01FFFFFF )
|
|
||||||
return streamdata->stream_index - 2;
|
|
||||||
else
|
|
||||||
return streamdata->stream_index - 1;
|
|
||||||
}
|
|
||||||
|
|
@ -1,294 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* arith_routines.h
|
|
||||||
*
|
|
||||||
* This file contains functions for arithmatically encoding and
|
|
||||||
* decoding DFT coefficients.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
#include "arith_routines.h"
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
static const WebRtc_Word32 kHistEdgesQ15[51] = {
|
|
||||||
-327680, -314573, -301466, -288359, -275252, -262144, -249037, -235930, -222823, -209716,
|
|
||||||
-196608, -183501, -170394, -157287, -144180, -131072, -117965, -104858, -91751, -78644,
|
|
||||||
-65536, -52429, -39322, -26215, -13108, 0, 13107, 26214, 39321, 52428,
|
|
||||||
65536, 78643, 91750, 104857, 117964, 131072, 144179, 157286, 170393, 183500,
|
|
||||||
196608, 209715, 222822, 235929, 249036, 262144, 275251, 288358, 301465, 314572,
|
|
||||||
327680};
|
|
||||||
|
|
||||||
|
|
||||||
static const int kCdfSlopeQ0[51] = { /* Q0 */
|
|
||||||
5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
|
|
||||||
5, 5, 13, 23, 47, 87, 154, 315, 700, 1088,
|
|
||||||
2471, 6064, 14221, 21463, 36634, 36924, 19750, 13270, 5806, 2312,
|
|
||||||
1095, 660, 316, 145, 86, 41, 32, 5, 5, 5,
|
|
||||||
5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 0};
|
|
||||||
|
|
||||||
|
|
||||||
static const int kCdfQ16[51] = { /* Q16 */
|
|
||||||
0, 2, 4, 6, 8, 10, 12, 14, 16, 18,
|
|
||||||
20, 22, 24, 29, 38, 57, 92, 153, 279, 559,
|
|
||||||
994, 1983, 4408, 10097, 18682, 33336, 48105, 56005, 61313, 63636,
|
|
||||||
64560, 64998, 65262, 65389, 65447, 65481, 65497, 65510, 65512, 65514,
|
|
||||||
65516, 65518, 65520, 65522, 65524, 65526, 65528, 65530, 65532, 65534,
|
|
||||||
65535};
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* function to be converted to fixed point */
|
|
||||||
static __inline WebRtc_UWord32 piecewise(WebRtc_Word32 xinQ15) {
|
|
||||||
|
|
||||||
WebRtc_Word32 ind, qtmp1, qtmp2, qtmp3;
|
|
||||||
WebRtc_UWord32 tmpUW32;
|
|
||||||
|
|
||||||
|
|
||||||
qtmp2 = xinQ15;
|
|
||||||
|
|
||||||
if (qtmp2 < kHistEdgesQ15[0]) {
|
|
||||||
qtmp2 = kHistEdgesQ15[0];
|
|
||||||
}
|
|
||||||
if (qtmp2 > kHistEdgesQ15[50]) {
|
|
||||||
qtmp2 = kHistEdgesQ15[50];
|
|
||||||
}
|
|
||||||
|
|
||||||
qtmp1 = qtmp2 - kHistEdgesQ15[0]; /* Q15 - Q15 = Q15 */
|
|
||||||
ind = (qtmp1 * 5) >> 16; /* 2^16 / 5 = 0.4 in Q15 */
|
|
||||||
/* Q15 -> Q0 */
|
|
||||||
qtmp1 = qtmp2 - kHistEdgesQ15[ind]; /* Q15 - Q15 = Q15 */
|
|
||||||
qtmp2 = kCdfSlopeQ0[ind] * qtmp1; /* Q0 * Q15 = Q15 */
|
|
||||||
qtmp3 = qtmp2>>15; /* Q15 -> Q0 */
|
|
||||||
|
|
||||||
tmpUW32 = kCdfQ16[ind] + qtmp3; /* Q0 + Q0 = Q0 */
|
|
||||||
return tmpUW32;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
int WebRtcIsac_EncLogisticMulti2(
|
|
||||||
Bitstr *streamdata, /* in-/output struct containing bitstream */
|
|
||||||
WebRtc_Word16 *dataQ7, /* input: data vector */
|
|
||||||
const WebRtc_UWord16 *envQ8, /* input: side info vector defining the width of the pdf */
|
|
||||||
const int N, /* input: data vector length / 2 */
|
|
||||||
const WebRtc_Word16 isSWB12kHz)
|
|
||||||
{
|
|
||||||
WebRtc_UWord32 W_lower, W_upper;
|
|
||||||
WebRtc_UWord32 W_upper_LSB, W_upper_MSB;
|
|
||||||
WebRtc_UWord8 *stream_ptr;
|
|
||||||
WebRtc_UWord8 *maxStreamPtr;
|
|
||||||
WebRtc_UWord8 *stream_ptr_carry;
|
|
||||||
WebRtc_UWord32 cdf_lo, cdf_hi;
|
|
||||||
int k;
|
|
||||||
|
|
||||||
/* point to beginning of stream buffer */
|
|
||||||
stream_ptr = streamdata->stream + streamdata->stream_index;
|
|
||||||
W_upper = streamdata->W_upper;
|
|
||||||
|
|
||||||
maxStreamPtr = streamdata->stream + STREAM_SIZE_MAX_60 - 1;
|
|
||||||
for (k = 0; k < N; k++)
|
|
||||||
{
|
|
||||||
/* compute cdf_lower and cdf_upper by evaluating the piecewise linear cdf */
|
|
||||||
cdf_lo = piecewise((*dataQ7 - 64) * *envQ8);
|
|
||||||
cdf_hi = piecewise((*dataQ7 + 64) * *envQ8);
|
|
||||||
|
|
||||||
/* test and clip if probability gets too small */
|
|
||||||
while (cdf_lo+1 >= cdf_hi) {
|
|
||||||
/* clip */
|
|
||||||
if (*dataQ7 > 0) {
|
|
||||||
*dataQ7 -= 128;
|
|
||||||
cdf_hi = cdf_lo;
|
|
||||||
cdf_lo = piecewise((*dataQ7 - 64) * *envQ8);
|
|
||||||
} else {
|
|
||||||
*dataQ7 += 128;
|
|
||||||
cdf_lo = cdf_hi;
|
|
||||||
cdf_hi = piecewise((*dataQ7 + 64) * *envQ8);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
dataQ7++;
|
|
||||||
// increment only once per 4 iterations for SWB-16kHz or WB
|
|
||||||
// increment only once per 2 iterations for SWB-12kHz
|
|
||||||
envQ8 += (isSWB12kHz)? (k & 1):((k & 1) & (k >> 1));
|
|
||||||
|
|
||||||
|
|
||||||
/* update interval */
|
|
||||||
W_upper_LSB = W_upper & 0x0000FFFF;
|
|
||||||
W_upper_MSB = W_upper >> 16;
|
|
||||||
W_lower = W_upper_MSB * cdf_lo;
|
|
||||||
W_lower += (W_upper_LSB * cdf_lo) >> 16;
|
|
||||||
W_upper = W_upper_MSB * cdf_hi;
|
|
||||||
W_upper += (W_upper_LSB * cdf_hi) >> 16;
|
|
||||||
|
|
||||||
/* shift interval such that it begins at zero */
|
|
||||||
W_upper -= ++W_lower;
|
|
||||||
|
|
||||||
/* add integer to bitstream */
|
|
||||||
streamdata->streamval += W_lower;
|
|
||||||
|
|
||||||
/* handle carry */
|
|
||||||
if (streamdata->streamval < W_lower)
|
|
||||||
{
|
|
||||||
/* propagate carry */
|
|
||||||
stream_ptr_carry = stream_ptr;
|
|
||||||
while (!(++(*--stream_ptr_carry)));
|
|
||||||
}
|
|
||||||
|
|
||||||
/* renormalize interval, store most significant byte of streamval and update streamval */
|
|
||||||
while ( !(W_upper & 0xFF000000) ) /* W_upper < 2^24 */
|
|
||||||
{
|
|
||||||
W_upper <<= 8;
|
|
||||||
*stream_ptr++ = (WebRtc_UWord8) (streamdata->streamval >> 24);
|
|
||||||
|
|
||||||
if(stream_ptr > maxStreamPtr)
|
|
||||||
{
|
|
||||||
return -ISAC_DISALLOWED_BITSTREAM_LENGTH;
|
|
||||||
}
|
|
||||||
streamdata->streamval <<= 8;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* calculate new stream_index */
|
|
||||||
streamdata->stream_index = (int)(stream_ptr - streamdata->stream);
|
|
||||||
streamdata->W_upper = W_upper;
|
|
||||||
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
int WebRtcIsac_DecLogisticMulti2(
|
|
||||||
WebRtc_Word16 *dataQ7, /* output: data vector */
|
|
||||||
Bitstr *streamdata, /* in-/output struct containing bitstream */
|
|
||||||
const WebRtc_UWord16 *envQ8, /* input: side info vector defining the width of the pdf */
|
|
||||||
const WebRtc_Word16 *ditherQ7,/* input: dither vector */
|
|
||||||
const int N, /* input: data vector length */
|
|
||||||
const WebRtc_Word16 isSWB12kHz)
|
|
||||||
{
|
|
||||||
WebRtc_UWord32 W_lower, W_upper;
|
|
||||||
WebRtc_UWord32 W_tmp;
|
|
||||||
WebRtc_UWord32 W_upper_LSB, W_upper_MSB;
|
|
||||||
WebRtc_UWord32 streamval;
|
|
||||||
const WebRtc_UWord8 *stream_ptr;
|
|
||||||
WebRtc_UWord32 cdf_tmp;
|
|
||||||
WebRtc_Word16 candQ7;
|
|
||||||
int k;
|
|
||||||
|
|
||||||
stream_ptr = streamdata->stream + streamdata->stream_index;
|
|
||||||
W_upper = streamdata->W_upper;
|
|
||||||
if (streamdata->stream_index == 0) /* first time decoder is called for this stream */
|
|
||||||
{
|
|
||||||
/* read first word from bytestream */
|
|
||||||
streamval = *stream_ptr << 24;
|
|
||||||
streamval |= *++stream_ptr << 16;
|
|
||||||
streamval |= *++stream_ptr << 8;
|
|
||||||
streamval |= *++stream_ptr;
|
|
||||||
} else {
|
|
||||||
streamval = streamdata->streamval;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
for (k = 0; k < N; k++)
|
|
||||||
{
|
|
||||||
/* find the integer *data for which streamval lies in [W_lower+1, W_upper] */
|
|
||||||
W_upper_LSB = W_upper & 0x0000FFFF;
|
|
||||||
W_upper_MSB = W_upper >> 16;
|
|
||||||
|
|
||||||
/* find first candidate by inverting the logistic cdf */
|
|
||||||
candQ7 = - *ditherQ7 + 64;
|
|
||||||
cdf_tmp = piecewise(candQ7 * *envQ8);
|
|
||||||
|
|
||||||
W_tmp = W_upper_MSB * cdf_tmp;
|
|
||||||
W_tmp += (W_upper_LSB * cdf_tmp) >> 16;
|
|
||||||
if (streamval > W_tmp)
|
|
||||||
{
|
|
||||||
W_lower = W_tmp;
|
|
||||||
candQ7 += 128;
|
|
||||||
cdf_tmp = piecewise(candQ7 * *envQ8);
|
|
||||||
|
|
||||||
W_tmp = W_upper_MSB * cdf_tmp;
|
|
||||||
W_tmp += (W_upper_LSB * cdf_tmp) >> 16;
|
|
||||||
while (streamval > W_tmp)
|
|
||||||
{
|
|
||||||
W_lower = W_tmp;
|
|
||||||
candQ7 += 128;
|
|
||||||
cdf_tmp = piecewise(candQ7 * *envQ8);
|
|
||||||
|
|
||||||
W_tmp = W_upper_MSB * cdf_tmp;
|
|
||||||
W_tmp += (W_upper_LSB * cdf_tmp) >> 16;
|
|
||||||
|
|
||||||
/* error check */
|
|
||||||
if (W_lower == W_tmp) return -1;
|
|
||||||
}
|
|
||||||
W_upper = W_tmp;
|
|
||||||
|
|
||||||
/* another sample decoded */
|
|
||||||
*dataQ7 = candQ7 - 64;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
W_upper = W_tmp;
|
|
||||||
candQ7 -= 128;
|
|
||||||
cdf_tmp = piecewise(candQ7 * *envQ8);
|
|
||||||
|
|
||||||
W_tmp = W_upper_MSB * cdf_tmp;
|
|
||||||
W_tmp += (W_upper_LSB * cdf_tmp) >> 16;
|
|
||||||
while ( !(streamval > W_tmp) )
|
|
||||||
{
|
|
||||||
W_upper = W_tmp;
|
|
||||||
candQ7 -= 128;
|
|
||||||
cdf_tmp = piecewise(candQ7 * *envQ8);
|
|
||||||
|
|
||||||
W_tmp = W_upper_MSB * cdf_tmp;
|
|
||||||
W_tmp += (W_upper_LSB * cdf_tmp) >> 16;
|
|
||||||
|
|
||||||
/* error check */
|
|
||||||
if (W_upper == W_tmp) return -1;
|
|
||||||
}
|
|
||||||
W_lower = W_tmp;
|
|
||||||
|
|
||||||
/* another sample decoded */
|
|
||||||
*dataQ7 = candQ7 + 64;
|
|
||||||
}
|
|
||||||
ditherQ7++;
|
|
||||||
dataQ7++;
|
|
||||||
// increment only once per 4 iterations for SWB-16kHz or WB
|
|
||||||
// increment only once per 2 iterations for SWB-12kHz
|
|
||||||
envQ8 += (isSWB12kHz)? (k & 1):((k & 1) & (k >> 1));
|
|
||||||
|
|
||||||
/* shift interval to start at zero */
|
|
||||||
W_upper -= ++W_lower;
|
|
||||||
|
|
||||||
/* add integer to bitstream */
|
|
||||||
streamval -= W_lower;
|
|
||||||
|
|
||||||
/* renormalize interval and update streamval */
|
|
||||||
while ( !(W_upper & 0xFF000000) ) /* W_upper < 2^24 */
|
|
||||||
{
|
|
||||||
/* read next byte from stream */
|
|
||||||
streamval = (streamval << 8) | *++stream_ptr;
|
|
||||||
W_upper <<= 8;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
streamdata->stream_index = (int)(stream_ptr - streamdata->stream);
|
|
||||||
streamdata->W_upper = W_upper;
|
|
||||||
streamdata->streamval = streamval;
|
|
||||||
|
|
||||||
/* find number of bytes in original stream (determined by current interval width) */
|
|
||||||
if ( W_upper > 0x01FFFFFF )
|
|
||||||
return streamdata->stream_index - 2;
|
|
||||||
else
|
|
||||||
return streamdata->stream_index - 1;
|
|
||||||
}
|
|
||||||
|
|
@ -1,103 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_AutoCorrToReflCoef().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
void WebRtcSpl_AutoCorrToReflCoef(G_CONST WebRtc_Word32 *R, int use_order, WebRtc_Word16 *K)
|
|
||||||
{
|
|
||||||
int i, n;
|
|
||||||
WebRtc_Word16 tmp;
|
|
||||||
G_CONST WebRtc_Word32 *rptr;
|
|
||||||
WebRtc_Word32 L_num, L_den;
|
|
||||||
WebRtc_Word16 *acfptr, *pptr, *wptr, *p1ptr, *w1ptr, ACF[WEBRTC_SPL_MAX_LPC_ORDER],
|
|
||||||
P[WEBRTC_SPL_MAX_LPC_ORDER], W[WEBRTC_SPL_MAX_LPC_ORDER];
|
|
||||||
|
|
||||||
// Initialize loop and pointers.
|
|
||||||
acfptr = ACF;
|
|
||||||
rptr = R;
|
|
||||||
pptr = P;
|
|
||||||
p1ptr = &P[1];
|
|
||||||
w1ptr = &W[1];
|
|
||||||
wptr = w1ptr;
|
|
||||||
|
|
||||||
// First loop; n=0. Determine shifting.
|
|
||||||
tmp = WebRtcSpl_NormW32(*R);
|
|
||||||
*acfptr = (WebRtc_Word16)((*rptr++ << tmp) >> 16);
|
|
||||||
*pptr++ = *acfptr++;
|
|
||||||
|
|
||||||
// Initialize ACF, P and W.
|
|
||||||
for (i = 1; i <= use_order; i++)
|
|
||||||
{
|
|
||||||
*acfptr = (WebRtc_Word16)((*rptr++ << tmp) >> 16);
|
|
||||||
*wptr++ = *acfptr;
|
|
||||||
*pptr++ = *acfptr++;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Compute reflection coefficients.
|
|
||||||
for (n = 1; n <= use_order; n++, K++)
|
|
||||||
{
|
|
||||||
tmp = WEBRTC_SPL_ABS_W16(*p1ptr);
|
|
||||||
if (*P < tmp)
|
|
||||||
{
|
|
||||||
for (i = n; i <= use_order; i++)
|
|
||||||
*K++ = 0;
|
|
||||||
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Division: WebRtcSpl_div(tmp, *P)
|
|
||||||
*K = 0;
|
|
||||||
if (tmp != 0)
|
|
||||||
{
|
|
||||||
L_num = tmp;
|
|
||||||
L_den = *P;
|
|
||||||
i = 15;
|
|
||||||
while (i--)
|
|
||||||
{
|
|
||||||
(*K) <<= 1;
|
|
||||||
L_num <<= 1;
|
|
||||||
if (L_num >= L_den)
|
|
||||||
{
|
|
||||||
L_num -= L_den;
|
|
||||||
(*K)++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (*p1ptr > 0)
|
|
||||||
*K = -*K;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Last iteration; don't do Schur recursion.
|
|
||||||
if (n == use_order)
|
|
||||||
return;
|
|
||||||
|
|
||||||
// Schur recursion.
|
|
||||||
pptr = P;
|
|
||||||
wptr = w1ptr;
|
|
||||||
tmp = (WebRtc_Word16)(((WebRtc_Word32)*p1ptr * (WebRtc_Word32)*K + 16384) >> 15);
|
|
||||||
*pptr = WEBRTC_SPL_ADD_SAT_W16( *pptr, tmp );
|
|
||||||
pptr++;
|
|
||||||
for (i = 1; i <= use_order - n; i++)
|
|
||||||
{
|
|
||||||
tmp = (WebRtc_Word16)(((WebRtc_Word32)*wptr * (WebRtc_Word32)*K + 16384) >> 15);
|
|
||||||
*pptr = WEBRTC_SPL_ADD_SAT_W16( *(pptr+1), tmp );
|
|
||||||
pptr++;
|
|
||||||
tmp = (WebRtc_Word16)(((WebRtc_Word32)*pptr * (WebRtc_Word32)*K + 16384) >> 15);
|
|
||||||
*wptr = WEBRTC_SPL_ADD_SAT_W16( *wptr, tmp );
|
|
||||||
wptr++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
@ -1,141 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_AutoCorrelation().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
int WebRtcSpl_AutoCorrelation(G_CONST WebRtc_Word16* in_vector,
|
|
||||||
int in_vector_length,
|
|
||||||
int order,
|
|
||||||
WebRtc_Word32* result,
|
|
||||||
int* scale)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 sum;
|
|
||||||
int i, j;
|
|
||||||
WebRtc_Word16 smax; // Sample max
|
|
||||||
G_CONST WebRtc_Word16* xptr1;
|
|
||||||
G_CONST WebRtc_Word16* xptr2;
|
|
||||||
WebRtc_Word32* resultptr;
|
|
||||||
int scaling = 0;
|
|
||||||
|
|
||||||
#ifdef _ARM_OPT_
|
|
||||||
#pragma message("NOTE: _ARM_OPT_ optimizations are used")
|
|
||||||
WebRtc_Word16 loops4;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
if (order < 0)
|
|
||||||
order = in_vector_length;
|
|
||||||
|
|
||||||
// Find the max. sample
|
|
||||||
smax = WebRtcSpl_MaxAbsValueW16(in_vector, in_vector_length);
|
|
||||||
|
|
||||||
// In order to avoid overflow when computing the sum we should scale the samples so that
|
|
||||||
// (in_vector_length * smax * smax) will not overflow.
|
|
||||||
|
|
||||||
if (smax == 0)
|
|
||||||
{
|
|
||||||
scaling = 0;
|
|
||||||
} else
|
|
||||||
{
|
|
||||||
int nbits = WebRtcSpl_GetSizeInBits(in_vector_length); // # of bits in the sum loop
|
|
||||||
int t = WebRtcSpl_NormW32(WEBRTC_SPL_MUL(smax, smax)); // # of bits to normalize smax
|
|
||||||
|
|
||||||
if (t > nbits)
|
|
||||||
{
|
|
||||||
scaling = 0;
|
|
||||||
} else
|
|
||||||
{
|
|
||||||
scaling = nbits - t;
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
resultptr = result;
|
|
||||||
|
|
||||||
// Perform the actual correlation calculation
|
|
||||||
for (i = 0; i < order + 1; i++)
|
|
||||||
{
|
|
||||||
int loops = (in_vector_length - i);
|
|
||||||
sum = 0;
|
|
||||||
xptr1 = in_vector;
|
|
||||||
xptr2 = &in_vector[i];
|
|
||||||
#ifndef _ARM_OPT_
|
|
||||||
for (j = loops; j > 0; j--)
|
|
||||||
{
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16_RSFT(*xptr1++, *xptr2++, scaling);
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
loops4 = (loops >> 2) << 2;
|
|
||||||
|
|
||||||
if (scaling == 0)
|
|
||||||
{
|
|
||||||
for (j = 0; j < loops4; j = j + 4)
|
|
||||||
{
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16(*xptr1, *xptr2);
|
|
||||||
xptr1++;
|
|
||||||
xptr2++;
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16(*xptr1, *xptr2);
|
|
||||||
xptr1++;
|
|
||||||
xptr2++;
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16(*xptr1, *xptr2);
|
|
||||||
xptr1++;
|
|
||||||
xptr2++;
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16(*xptr1, *xptr2);
|
|
||||||
xptr1++;
|
|
||||||
xptr2++;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (j = loops4; j < loops; j++)
|
|
||||||
{
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16(*xptr1, *xptr2);
|
|
||||||
xptr1++;
|
|
||||||
xptr2++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
for (j = 0; j < loops4; j = j + 4)
|
|
||||||
{
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16_RSFT(*xptr1, *xptr2, scaling);
|
|
||||||
xptr1++;
|
|
||||||
xptr2++;
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16_RSFT(*xptr1, *xptr2, scaling);
|
|
||||||
xptr1++;
|
|
||||||
xptr2++;
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16_RSFT(*xptr1, *xptr2, scaling);
|
|
||||||
xptr1++;
|
|
||||||
xptr2++;
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16_RSFT(*xptr1, *xptr2, scaling);
|
|
||||||
xptr1++;
|
|
||||||
xptr2++;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (j = loops4; j < loops; j++)
|
|
||||||
{
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16_RSFT(*xptr1, *xptr2, scaling);
|
|
||||||
xptr1++;
|
|
||||||
xptr2++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif
|
|
||||||
*resultptr++ = sum;
|
|
||||||
}
|
|
||||||
|
|
||||||
*scale = scaling;
|
|
||||||
|
|
||||||
return order + 1;
|
|
||||||
}
|
|
||||||
File diff suppressed because it is too large
Load Diff
|
|
@ -1,177 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* bandwidth_estimator.h
|
|
||||||
*
|
|
||||||
* This header file contains the API for the Bandwidth Estimator
|
|
||||||
* designed for iSAC.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_BANDWIDTH_ESTIMATOR_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_BANDWIDTH_ESTIMATOR_H_
|
|
||||||
|
|
||||||
#include "structs.h"
|
|
||||||
#include "settings.h"
|
|
||||||
|
|
||||||
|
|
||||||
#define MIN_ISAC_BW 10000
|
|
||||||
#define MIN_ISAC_BW_LB 10000
|
|
||||||
#define MIN_ISAC_BW_UB 25000
|
|
||||||
|
|
||||||
#define MAX_ISAC_BW 56000
|
|
||||||
#define MAX_ISAC_BW_UB 32000
|
|
||||||
#define MAX_ISAC_BW_LB 32000
|
|
||||||
|
|
||||||
#define MIN_ISAC_MD 5
|
|
||||||
#define MAX_ISAC_MD 25
|
|
||||||
|
|
||||||
// assumed header size, in bytes; we don't know the exact number
|
|
||||||
// (header compression may be used)
|
|
||||||
#define HEADER_SIZE 35
|
|
||||||
|
|
||||||
// Initial Frame-Size, in ms, for Wideband & Super-Wideband Mode
|
|
||||||
#define INIT_FRAME_LEN_WB 60
|
|
||||||
#define INIT_FRAME_LEN_SWB 30
|
|
||||||
|
|
||||||
// Initial Bottleneck Estimate, in bits/sec, for
|
|
||||||
// Wideband & Super-wideband mode
|
|
||||||
#define INIT_BN_EST_WB 20e3f
|
|
||||||
#define INIT_BN_EST_SWB 56e3f
|
|
||||||
|
|
||||||
// Initial Header rate (header rate depends on frame-size),
|
|
||||||
// in bits/sec, for Wideband & Super-Wideband mode.
|
|
||||||
#define INIT_HDR_RATE_WB \
|
|
||||||
((float)HEADER_SIZE * 8.0f * 1000.0f / (float)INIT_FRAME_LEN_WB)
|
|
||||||
#define INIT_HDR_RATE_SWB \
|
|
||||||
((float)HEADER_SIZE * 8.0f * 1000.0f / (float)INIT_FRAME_LEN_SWB)
|
|
||||||
|
|
||||||
// number of packets in a row for a high rate burst
|
|
||||||
#define BURST_LEN 3
|
|
||||||
|
|
||||||
// ms, max time between two full bursts
|
|
||||||
#define BURST_INTERVAL 500
|
|
||||||
|
|
||||||
// number of packets in a row for initial high rate burst
|
|
||||||
#define INIT_BURST_LEN 5
|
|
||||||
|
|
||||||
// bits/s, rate for the first BURST_LEN packets
|
|
||||||
#define INIT_RATE_WB INIT_BN_EST_WB
|
|
||||||
#define INIT_RATE_SWB INIT_BN_EST_SWB
|
|
||||||
|
|
||||||
|
|
||||||
#if defined(__cplusplus)
|
|
||||||
extern "C" {
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* This function initializes the struct */
|
|
||||||
/* to be called before using the struct for anything else */
|
|
||||||
/* returns 0 if everything went fine, -1 otherwise */
|
|
||||||
WebRtc_Word32 WebRtcIsac_InitBandwidthEstimator(
|
|
||||||
BwEstimatorstr* bwest_str,
|
|
||||||
enum IsacSamplingRate encoderSampRate,
|
|
||||||
enum IsacSamplingRate decoderSampRate);
|
|
||||||
|
|
||||||
/* This function updates the receiving estimate */
|
|
||||||
/* Parameters: */
|
|
||||||
/* rtp_number - value from RTP packet, from NetEq */
|
|
||||||
/* frame length - length of signal frame in ms, from iSAC decoder */
|
|
||||||
/* send_ts - value in RTP header giving send time in samples */
|
|
||||||
/* arr_ts - value given by timeGetTime() time of arrival in samples of packet from NetEq */
|
|
||||||
/* pksize - size of packet in bytes, from NetEq */
|
|
||||||
/* Index - integer (range 0...23) indicating bottle neck & jitter as estimated by other side */
|
|
||||||
/* returns 0 if everything went fine, -1 otherwise */
|
|
||||||
WebRtc_Word16 WebRtcIsac_UpdateBandwidthEstimator(
|
|
||||||
BwEstimatorstr* bwest_str,
|
|
||||||
const WebRtc_UWord16 rtp_number,
|
|
||||||
const WebRtc_Word32 frame_length,
|
|
||||||
const WebRtc_UWord32 send_ts,
|
|
||||||
const WebRtc_UWord32 arr_ts,
|
|
||||||
const WebRtc_Word32 pksize);
|
|
||||||
|
|
||||||
/* Update receiving estimates. Used when we only receive BWE index, no iSAC data packet. */
|
|
||||||
WebRtc_Word16 WebRtcIsac_UpdateUplinkBwImpl(
|
|
||||||
BwEstimatorstr* bwest_str,
|
|
||||||
WebRtc_Word16 Index,
|
|
||||||
enum IsacSamplingRate encoderSamplingFreq);
|
|
||||||
|
|
||||||
/* Returns the bandwidth/jitter estimation code (integer 0...23) to put in the sending iSAC payload */
|
|
||||||
WebRtc_UWord16 WebRtcIsac_GetDownlinkBwJitIndexImpl(
|
|
||||||
BwEstimatorstr* bwest_str,
|
|
||||||
WebRtc_Word16* bottleneckIndex,
|
|
||||||
WebRtc_Word16* jitterInfo,
|
|
||||||
enum IsacSamplingRate decoderSamplingFreq);
|
|
||||||
|
|
||||||
/* Returns the bandwidth estimation (in bps) */
|
|
||||||
WebRtc_Word32 WebRtcIsac_GetDownlinkBandwidth(
|
|
||||||
const BwEstimatorstr *bwest_str);
|
|
||||||
|
|
||||||
/* Returns the max delay (in ms) */
|
|
||||||
WebRtc_Word32 WebRtcIsac_GetDownlinkMaxDelay(
|
|
||||||
const BwEstimatorstr *bwest_str);
|
|
||||||
|
|
||||||
/* Returns the bandwidth that iSAC should send with in bps */
|
|
||||||
void WebRtcIsac_GetUplinkBandwidth(
|
|
||||||
const BwEstimatorstr* bwest_str,
|
|
||||||
WebRtc_Word32* bitRate);
|
|
||||||
|
|
||||||
/* Returns the max delay value from the other side in ms */
|
|
||||||
WebRtc_Word32 WebRtcIsac_GetUplinkMaxDelay(
|
|
||||||
const BwEstimatorstr *bwest_str);
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* update amount of data in bottle neck buffer and burst handling
|
|
||||||
* returns minimum payload size (bytes)
|
|
||||||
*/
|
|
||||||
int WebRtcIsac_GetMinBytes(
|
|
||||||
RateModel* State,
|
|
||||||
int StreamSize, /* bytes in bitstream */
|
|
||||||
const int FrameLen, /* ms per frame */
|
|
||||||
const double BottleNeck, /* bottle neck rate; excl headers (bps) */
|
|
||||||
const double DelayBuildUp, /* max delay from bottleneck buffering (ms) */
|
|
||||||
enum ISACBandwidth bandwidth
|
|
||||||
/*,WebRtc_Word16 frequentLargePackets*/);
|
|
||||||
|
|
||||||
/*
|
|
||||||
* update long-term average bitrate and amount of data in buffer
|
|
||||||
*/
|
|
||||||
void WebRtcIsac_UpdateRateModel(
|
|
||||||
RateModel* State,
|
|
||||||
int StreamSize, /* bytes in bitstream */
|
|
||||||
const int FrameSamples, /* samples per frame */
|
|
||||||
const double BottleNeck); /* bottle neck rate; excl headers (bps) */
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_InitRateModel(
|
|
||||||
RateModel *State);
|
|
||||||
|
|
||||||
/* Returns the new framelength value (input argument: bottle_neck) */
|
|
||||||
int WebRtcIsac_GetNewFrameLength(
|
|
||||||
double bottle_neck,
|
|
||||||
int current_framelength);
|
|
||||||
|
|
||||||
/* Returns the new SNR value (input argument: bottle_neck) */
|
|
||||||
double WebRtcIsac_GetSnr(
|
|
||||||
double bottle_neck,
|
|
||||||
int new_framelength);
|
|
||||||
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_UpdateUplinkJitter(
|
|
||||||
BwEstimatorstr* bwest_str,
|
|
||||||
WebRtc_Word32 index);
|
|
||||||
|
|
||||||
#if defined(__cplusplus)
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
|
|
||||||
#endif /* WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_BANDWIDTH_ESTIMATOR_H_ */
|
|
||||||
|
|
@ -1,292 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* codec.h
|
|
||||||
*
|
|
||||||
* This header file contains the calls to the internal encoder
|
|
||||||
* and decoder functions.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_CODEC_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_CODEC_H_
|
|
||||||
|
|
||||||
#include "structs.h"
|
|
||||||
|
|
||||||
int WebRtcIsac_EstimateBandwidth(
|
|
||||||
BwEstimatorstr* bwest_str,
|
|
||||||
Bitstr* streamdata,
|
|
||||||
WebRtc_Word32 packet_size,
|
|
||||||
WebRtc_UWord16 rtp_seq_number,
|
|
||||||
WebRtc_UWord32 send_ts,
|
|
||||||
WebRtc_UWord32 arr_ts,
|
|
||||||
enum IsacSamplingRate encoderSampRate,
|
|
||||||
enum IsacSamplingRate decoderSampRate);
|
|
||||||
|
|
||||||
int WebRtcIsac_DecodeLb(
|
|
||||||
float* signal_out,
|
|
||||||
ISACLBDecStruct* ISACdec_obj,
|
|
||||||
WebRtc_Word16* current_framesamples,
|
|
||||||
WebRtc_Word16 isRCUPayload);
|
|
||||||
|
|
||||||
int WebRtcIsac_DecodeRcuLb(
|
|
||||||
float* signal_out,
|
|
||||||
ISACLBDecStruct* ISACdec_obj,
|
|
||||||
WebRtc_Word16* current_framesamples);
|
|
||||||
|
|
||||||
int WebRtcIsac_EncodeLb(
|
|
||||||
float* in,
|
|
||||||
ISACLBEncStruct* ISACencLB_obj,
|
|
||||||
WebRtc_Word16 codingMode,
|
|
||||||
WebRtc_Word16 bottleneckIndex);
|
|
||||||
|
|
||||||
int WebRtcIsac_EncodeStoredDataLb(
|
|
||||||
const ISAC_SaveEncData_t* ISACSavedEnc_obj,
|
|
||||||
Bitstr* ISACBitStr_obj,
|
|
||||||
int BWnumber,
|
|
||||||
float scale);
|
|
||||||
|
|
||||||
|
|
||||||
int WebRtcIsac_EncodeStoredDataUb12(
|
|
||||||
const ISACUBSaveEncDataStruct* ISACSavedEnc_obj,
|
|
||||||
Bitstr* bitStream,
|
|
||||||
WebRtc_Word32 jitterInfo,
|
|
||||||
float scale);
|
|
||||||
|
|
||||||
int WebRtcIsac_EncodeStoredDataUb16(
|
|
||||||
const ISACUBSaveEncDataStruct* ISACSavedEnc_obj,
|
|
||||||
Bitstr* bitStream,
|
|
||||||
WebRtc_Word32 jitterInfo,
|
|
||||||
float scale);
|
|
||||||
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_GetRedPayloadUb(
|
|
||||||
const ISACUBSaveEncDataStruct* ISACSavedEncObj,
|
|
||||||
Bitstr* bitStreamObj,
|
|
||||||
enum ISACBandwidth bandwidth);
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_RateAllocation()
|
|
||||||
* Internal function to perform a rate-allocation for upper and lower-band,
|
|
||||||
* given a total rate.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - inRateBitPerSec : a total bit-rate in bits/sec.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - rateLBBitPerSec : a bit-rate allocated to the lower-band
|
|
||||||
* in bits/sec.
|
|
||||||
* - rateUBBitPerSec : a bit-rate allocated to the upper-band
|
|
||||||
* in bits/sec.
|
|
||||||
*
|
|
||||||
* Return value : 0 if rate allocation has been successful.
|
|
||||||
* -1 if failed to allocate rates.
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16
|
|
||||||
WebRtcIsac_RateAllocation(
|
|
||||||
WebRtc_Word32 inRateBitPerSec,
|
|
||||||
double* rateLBBitPerSec,
|
|
||||||
double* rateUBBitPerSec,
|
|
||||||
enum ISACBandwidth* bandwidthKHz);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecodeUb16()
|
|
||||||
*
|
|
||||||
* Decode the upper-band if the codec is in 0-16 kHz mode.
|
|
||||||
*
|
|
||||||
* Input/Output:
|
|
||||||
* -ISACdec_obj : pointer to the upper-band decoder object. The
|
|
||||||
* bit-stream is stored inside the decoder object.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -signal_out : decoded audio, 480 samples 30 ms.
|
|
||||||
*
|
|
||||||
* Return value : >0 number of decoded bytes.
|
|
||||||
* <0 if an error occurred.
|
|
||||||
*/
|
|
||||||
int WebRtcIsac_DecodeUb16(
|
|
||||||
float* signal_out,
|
|
||||||
ISACUBDecStruct* ISACdec_obj,
|
|
||||||
WebRtc_Word16 isRCUPayload);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecodeUb12()
|
|
||||||
*
|
|
||||||
* Decode the upper-band if the codec is in 0-12 kHz mode.
|
|
||||||
*
|
|
||||||
* Input/Output:
|
|
||||||
* -ISACdec_obj : pointer to the upper-band decoder object. The
|
|
||||||
* bit-stream is stored inside the decoder object.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -signal_out : decoded audio, 480 samples 30 ms.
|
|
||||||
*
|
|
||||||
* Return value : >0 number of decoded bytes.
|
|
||||||
* <0 if an error occurred.
|
|
||||||
*/
|
|
||||||
int WebRtcIsac_DecodeUb12(
|
|
||||||
float* signal_out,
|
|
||||||
ISACUBDecStruct* ISACdec_obj,
|
|
||||||
WebRtc_Word16 isRCUPayload);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_EncodeUb16()
|
|
||||||
*
|
|
||||||
* Encode the upper-band if the codec is in 0-16 kHz mode.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -in : upper-band audio, 160 samples (10 ms).
|
|
||||||
*
|
|
||||||
* Input/Output:
|
|
||||||
* -ISACdec_obj : pointer to the upper-band encoder object. The
|
|
||||||
* bit-stream is stored inside the encoder object.
|
|
||||||
*
|
|
||||||
* Return value : >0 number of encoded bytes.
|
|
||||||
* <0 if an error occurred.
|
|
||||||
*/
|
|
||||||
int WebRtcIsac_EncodeUb16(
|
|
||||||
float* in,
|
|
||||||
ISACUBEncStruct* ISACenc_obj,
|
|
||||||
WebRtc_Word32 jitterInfo);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_EncodeUb12()
|
|
||||||
*
|
|
||||||
* Encode the upper-band if the codec is in 0-12 kHz mode.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -in : upper-band audio, 160 samples (10 ms).
|
|
||||||
*
|
|
||||||
* Input/Output:
|
|
||||||
* -ISACdec_obj : pointer to the upper-band encoder object. The
|
|
||||||
* bit-stream is stored inside the encoder object.
|
|
||||||
*
|
|
||||||
* Return value : >0 number of encoded bytes.
|
|
||||||
* <0 if an error occurred.
|
|
||||||
*/
|
|
||||||
int WebRtcIsac_EncodeUb12(
|
|
||||||
float* in,
|
|
||||||
ISACUBEncStruct* ISACenc_obj,
|
|
||||||
WebRtc_Word32 jitterInfo);
|
|
||||||
|
|
||||||
/************************** initialization functions *************************/
|
|
||||||
|
|
||||||
void WebRtcIsac_InitMasking(MaskFiltstr *maskdata);
|
|
||||||
|
|
||||||
void WebRtcIsac_InitPreFilterbank(PreFiltBankstr *prefiltdata);
|
|
||||||
|
|
||||||
void WebRtcIsac_InitPostFilterbank(PostFiltBankstr *postfiltdata);
|
|
||||||
|
|
||||||
void WebRtcIsac_InitPitchFilter(PitchFiltstr *pitchfiltdata);
|
|
||||||
|
|
||||||
void WebRtcIsac_InitPitchAnalysis(PitchAnalysisStruct *State);
|
|
||||||
|
|
||||||
|
|
||||||
/**************************** transform functions ****************************/
|
|
||||||
|
|
||||||
void WebRtcIsac_InitTransform();
|
|
||||||
|
|
||||||
void WebRtcIsac_Time2Spec(double *inre1,
|
|
||||||
double *inre2,
|
|
||||||
WebRtc_Word16 *outre,
|
|
||||||
WebRtc_Word16 *outim,
|
|
||||||
FFTstr *fftstr_obj);
|
|
||||||
|
|
||||||
void WebRtcIsac_Spec2time(double *inre,
|
|
||||||
double *inim,
|
|
||||||
double *outre1,
|
|
||||||
double *outre2,
|
|
||||||
FFTstr *fftstr_obj);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************* filter functions ****************************/
|
|
||||||
|
|
||||||
void WebRtcIsac_AllPoleFilter(double *InOut,
|
|
||||||
double *Coef,
|
|
||||||
int lengthInOut,
|
|
||||||
int orderCoef);
|
|
||||||
|
|
||||||
void WebRtcIsac_AllZeroFilter(double *In,
|
|
||||||
double *Coef,
|
|
||||||
int lengthInOut,
|
|
||||||
int orderCoef,
|
|
||||||
double *Out);
|
|
||||||
|
|
||||||
void WebRtcIsac_ZeroPoleFilter(double *In,
|
|
||||||
double *ZeroCoef,
|
|
||||||
double *PoleCoef,
|
|
||||||
int lengthInOut,
|
|
||||||
int orderCoef,
|
|
||||||
double *Out);
|
|
||||||
|
|
||||||
|
|
||||||
/***************************** filterbank functions **************************/
|
|
||||||
|
|
||||||
void WebRtcIsac_SplitAndFilter(double *in,
|
|
||||||
double *LP,
|
|
||||||
double *HP,
|
|
||||||
double *LP_la,
|
|
||||||
double *HP_la,
|
|
||||||
PreFiltBankstr *prefiltdata);
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_FilterAndCombine(double *InLP,
|
|
||||||
double *InHP,
|
|
||||||
double *Out,
|
|
||||||
PostFiltBankstr *postfiltdata);
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_SplitAndFilterFloat(float *in,
|
|
||||||
float *LP,
|
|
||||||
float *HP,
|
|
||||||
double *LP_la,
|
|
||||||
double *HP_la,
|
|
||||||
PreFiltBankstr *prefiltdata);
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_FilterAndCombineFloat(float *InLP,
|
|
||||||
float *InHP,
|
|
||||||
float *Out,
|
|
||||||
PostFiltBankstr *postfiltdata);
|
|
||||||
|
|
||||||
|
|
||||||
/************************* normalized lattice filters ************************/
|
|
||||||
|
|
||||||
void WebRtcIsac_NormLatticeFilterMa(int orderCoef,
|
|
||||||
float *stateF,
|
|
||||||
float *stateG,
|
|
||||||
float *lat_in,
|
|
||||||
double *filtcoeflo,
|
|
||||||
double *lat_out);
|
|
||||||
|
|
||||||
void WebRtcIsac_NormLatticeFilterAr(int orderCoef,
|
|
||||||
float *stateF,
|
|
||||||
float *stateG,
|
|
||||||
double *lat_in,
|
|
||||||
double *lo_filt_coef,
|
|
||||||
float *lat_out);
|
|
||||||
|
|
||||||
void WebRtcIsac_Dir2Lat(double *a,
|
|
||||||
int orderCoef,
|
|
||||||
float *sth,
|
|
||||||
float *cth);
|
|
||||||
|
|
||||||
void WebRtcIsac_AutoCorr(double *r,
|
|
||||||
const double *x,
|
|
||||||
int N,
|
|
||||||
int order);
|
|
||||||
|
|
||||||
#endif /* WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_CODEC_H_ */
|
|
||||||
|
|
@ -1,51 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_ComplexBitReverse().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
void WebRtcSpl_ComplexBitReverse(WebRtc_Word16 frfi[], int stages)
|
|
||||||
{
|
|
||||||
int mr, nn, n, l, m;
|
|
||||||
WebRtc_Word16 tr, ti;
|
|
||||||
|
|
||||||
n = 1 << stages;
|
|
||||||
|
|
||||||
mr = 0;
|
|
||||||
nn = n - 1;
|
|
||||||
|
|
||||||
// decimation in time - re-order data
|
|
||||||
for (m = 1; m <= nn; ++m)
|
|
||||||
{
|
|
||||||
l = n;
|
|
||||||
do
|
|
||||||
{
|
|
||||||
l >>= 1;
|
|
||||||
} while (mr + l > nn);
|
|
||||||
mr = (mr & (l - 1)) + l;
|
|
||||||
|
|
||||||
if (mr <= m)
|
|
||||||
continue;
|
|
||||||
|
|
||||||
tr = frfi[2 * m];
|
|
||||||
frfi[2 * m] = frfi[2 * mr];
|
|
||||||
frfi[2 * mr] = tr;
|
|
||||||
|
|
||||||
ti = frfi[2 * m + 1];
|
|
||||||
frfi[2 * m + 1] = frfi[2 * mr + 1];
|
|
||||||
frfi[2 * mr + 1] = ti;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
@ -1,425 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_ComplexFFT().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
#define CFFTSFT 14
|
|
||||||
#define CFFTRND 1
|
|
||||||
#define CFFTRND2 16384
|
|
||||||
|
|
||||||
#define CIFFTSFT 14
|
|
||||||
#define CIFFTRND 1
|
|
||||||
|
|
||||||
static const WebRtc_Word16 kSinTable1024[] = {
|
|
||||||
0, 201, 402, 603, 804, 1005, 1206, 1406,
|
|
||||||
1607, 1808, 2009, 2209, 2410, 2610, 2811, 3011,
|
|
||||||
3211, 3411, 3611, 3811, 4011, 4210, 4409, 4608,
|
|
||||||
4807, 5006, 5205, 5403, 5601, 5799, 5997, 6195,
|
|
||||||
6392, 6589, 6786, 6982, 7179, 7375, 7571, 7766,
|
|
||||||
7961, 8156, 8351, 8545, 8739, 8932, 9126, 9319,
|
|
||||||
9511, 9703, 9895, 10087, 10278, 10469, 10659, 10849,
|
|
||||||
11038, 11227, 11416, 11604, 11792, 11980, 12166, 12353,
|
|
||||||
12539, 12724, 12909, 13094, 13278, 13462, 13645, 13827,
|
|
||||||
14009, 14191, 14372, 14552, 14732, 14911, 15090, 15268,
|
|
||||||
15446, 15623, 15799, 15975, 16150, 16325, 16499, 16672,
|
|
||||||
16845, 17017, 17189, 17360, 17530, 17699, 17868, 18036,
|
|
||||||
18204, 18371, 18537, 18702, 18867, 19031, 19194, 19357,
|
|
||||||
19519, 19680, 19840, 20000, 20159, 20317, 20474, 20631,
|
|
||||||
20787, 20942, 21096, 21249, 21402, 21554, 21705, 21855,
|
|
||||||
22004, 22153, 22301, 22448, 22594, 22739, 22883, 23027,
|
|
||||||
23169, 23311, 23452, 23592, 23731, 23869, 24006, 24143,
|
|
||||||
24278, 24413, 24546, 24679, 24811, 24942, 25072, 25201,
|
|
||||||
25329, 25456, 25582, 25707, 25831, 25954, 26077, 26198,
|
|
||||||
26318, 26437, 26556, 26673, 26789, 26905, 27019, 27132,
|
|
||||||
27244, 27355, 27466, 27575, 27683, 27790, 27896, 28001,
|
|
||||||
28105, 28208, 28309, 28410, 28510, 28608, 28706, 28802,
|
|
||||||
28897, 28992, 29085, 29177, 29268, 29358, 29446, 29534,
|
|
||||||
29621, 29706, 29790, 29873, 29955, 30036, 30116, 30195,
|
|
||||||
30272, 30349, 30424, 30498, 30571, 30643, 30713, 30783,
|
|
||||||
30851, 30918, 30984, 31049,
|
|
||||||
31113, 31175, 31236, 31297,
|
|
||||||
31356, 31413, 31470, 31525, 31580, 31633, 31684, 31735,
|
|
||||||
31785, 31833, 31880, 31926, 31970, 32014, 32056, 32097,
|
|
||||||
32137, 32176, 32213, 32249, 32284, 32318, 32350, 32382,
|
|
||||||
32412, 32441, 32468, 32495, 32520, 32544, 32567, 32588,
|
|
||||||
32609, 32628, 32646, 32662, 32678, 32692, 32705, 32717,
|
|
||||||
32727, 32736, 32744, 32751, 32757, 32761, 32764, 32766,
|
|
||||||
32767, 32766, 32764, 32761, 32757, 32751, 32744, 32736,
|
|
||||||
32727, 32717, 32705, 32692, 32678, 32662, 32646, 32628,
|
|
||||||
32609, 32588, 32567, 32544, 32520, 32495, 32468, 32441,
|
|
||||||
32412, 32382, 32350, 32318, 32284, 32249, 32213, 32176,
|
|
||||||
32137, 32097, 32056, 32014, 31970, 31926, 31880, 31833,
|
|
||||||
31785, 31735, 31684, 31633, 31580, 31525, 31470, 31413,
|
|
||||||
31356, 31297, 31236, 31175, 31113, 31049, 30984, 30918,
|
|
||||||
30851, 30783, 30713, 30643, 30571, 30498, 30424, 30349,
|
|
||||||
30272, 30195, 30116, 30036, 29955, 29873, 29790, 29706,
|
|
||||||
29621, 29534, 29446, 29358, 29268, 29177, 29085, 28992,
|
|
||||||
28897, 28802, 28706, 28608, 28510, 28410, 28309, 28208,
|
|
||||||
28105, 28001, 27896, 27790, 27683, 27575, 27466, 27355,
|
|
||||||
27244, 27132, 27019, 26905, 26789, 26673, 26556, 26437,
|
|
||||||
26318, 26198, 26077, 25954, 25831, 25707, 25582, 25456,
|
|
||||||
25329, 25201, 25072, 24942, 24811, 24679, 24546, 24413,
|
|
||||||
24278, 24143, 24006, 23869, 23731, 23592, 23452, 23311,
|
|
||||||
23169, 23027, 22883, 22739, 22594, 22448, 22301, 22153,
|
|
||||||
22004, 21855, 21705, 21554, 21402, 21249, 21096, 20942,
|
|
||||||
20787, 20631, 20474, 20317, 20159, 20000, 19840, 19680,
|
|
||||||
19519, 19357, 19194, 19031, 18867, 18702, 18537, 18371,
|
|
||||||
18204, 18036, 17868, 17699, 17530, 17360, 17189, 17017,
|
|
||||||
16845, 16672, 16499, 16325, 16150, 15975, 15799, 15623,
|
|
||||||
15446, 15268, 15090, 14911, 14732, 14552, 14372, 14191,
|
|
||||||
14009, 13827, 13645, 13462, 13278, 13094, 12909, 12724,
|
|
||||||
12539, 12353, 12166, 11980, 11792, 11604, 11416, 11227,
|
|
||||||
11038, 10849, 10659, 10469, 10278, 10087, 9895, 9703,
|
|
||||||
9511, 9319, 9126, 8932, 8739, 8545, 8351, 8156,
|
|
||||||
7961, 7766, 7571, 7375, 7179, 6982, 6786, 6589,
|
|
||||||
6392, 6195, 5997, 5799, 5601, 5403, 5205, 5006,
|
|
||||||
4807, 4608, 4409, 4210, 4011, 3811, 3611, 3411,
|
|
||||||
3211, 3011, 2811, 2610, 2410, 2209, 2009, 1808,
|
|
||||||
1607, 1406, 1206, 1005, 804, 603, 402, 201,
|
|
||||||
0, -201, -402, -603, -804, -1005, -1206, -1406,
|
|
||||||
-1607, -1808, -2009, -2209, -2410, -2610, -2811, -3011,
|
|
||||||
-3211, -3411, -3611, -3811, -4011, -4210, -4409, -4608,
|
|
||||||
-4807, -5006, -5205, -5403, -5601, -5799, -5997, -6195,
|
|
||||||
-6392, -6589, -6786, -6982, -7179, -7375, -7571, -7766,
|
|
||||||
-7961, -8156, -8351, -8545, -8739, -8932, -9126, -9319,
|
|
||||||
-9511, -9703, -9895, -10087, -10278, -10469, -10659, -10849,
|
|
||||||
-11038, -11227, -11416, -11604, -11792, -11980, -12166, -12353,
|
|
||||||
-12539, -12724, -12909, -13094, -13278, -13462, -13645, -13827,
|
|
||||||
-14009, -14191, -14372, -14552, -14732, -14911, -15090, -15268,
|
|
||||||
-15446, -15623, -15799, -15975, -16150, -16325, -16499, -16672,
|
|
||||||
-16845, -17017, -17189, -17360, -17530, -17699, -17868, -18036,
|
|
||||||
-18204, -18371, -18537, -18702, -18867, -19031, -19194, -19357,
|
|
||||||
-19519, -19680, -19840, -20000, -20159, -20317, -20474, -20631,
|
|
||||||
-20787, -20942, -21096, -21249, -21402, -21554, -21705, -21855,
|
|
||||||
-22004, -22153, -22301, -22448, -22594, -22739, -22883, -23027,
|
|
||||||
-23169, -23311, -23452, -23592, -23731, -23869, -24006, -24143,
|
|
||||||
-24278, -24413, -24546, -24679, -24811, -24942, -25072, -25201,
|
|
||||||
-25329, -25456, -25582, -25707, -25831, -25954, -26077, -26198,
|
|
||||||
-26318, -26437, -26556, -26673, -26789, -26905, -27019, -27132,
|
|
||||||
-27244, -27355, -27466, -27575, -27683, -27790, -27896, -28001,
|
|
||||||
-28105, -28208, -28309, -28410, -28510, -28608, -28706, -28802,
|
|
||||||
-28897, -28992, -29085, -29177, -29268, -29358, -29446, -29534,
|
|
||||||
-29621, -29706, -29790, -29873, -29955, -30036, -30116, -30195,
|
|
||||||
-30272, -30349, -30424, -30498, -30571, -30643, -30713, -30783,
|
|
||||||
-30851, -30918, -30984, -31049, -31113, -31175, -31236, -31297,
|
|
||||||
-31356, -31413, -31470, -31525, -31580, -31633, -31684, -31735,
|
|
||||||
-31785, -31833, -31880, -31926, -31970, -32014, -32056, -32097,
|
|
||||||
-32137, -32176, -32213, -32249, -32284, -32318, -32350, -32382,
|
|
||||||
-32412, -32441, -32468, -32495, -32520, -32544, -32567, -32588,
|
|
||||||
-32609, -32628, -32646, -32662, -32678, -32692, -32705, -32717,
|
|
||||||
-32727, -32736, -32744, -32751, -32757, -32761, -32764, -32766,
|
|
||||||
-32767, -32766, -32764, -32761, -32757, -32751, -32744, -32736,
|
|
||||||
-32727, -32717, -32705, -32692, -32678, -32662, -32646, -32628,
|
|
||||||
-32609, -32588, -32567, -32544, -32520, -32495, -32468, -32441,
|
|
||||||
-32412, -32382, -32350, -32318, -32284, -32249, -32213, -32176,
|
|
||||||
-32137, -32097, -32056, -32014, -31970, -31926, -31880, -31833,
|
|
||||||
-31785, -31735, -31684, -31633, -31580, -31525, -31470, -31413,
|
|
||||||
-31356, -31297, -31236, -31175, -31113, -31049, -30984, -30918,
|
|
||||||
-30851, -30783, -30713, -30643, -30571, -30498, -30424, -30349,
|
|
||||||
-30272, -30195, -30116, -30036, -29955, -29873, -29790, -29706,
|
|
||||||
-29621, -29534, -29446, -29358, -29268, -29177, -29085, -28992,
|
|
||||||
-28897, -28802, -28706, -28608, -28510, -28410, -28309, -28208,
|
|
||||||
-28105, -28001, -27896, -27790, -27683, -27575, -27466, -27355,
|
|
||||||
-27244, -27132, -27019, -26905, -26789, -26673, -26556, -26437,
|
|
||||||
-26318, -26198, -26077, -25954, -25831, -25707, -25582, -25456,
|
|
||||||
-25329, -25201, -25072, -24942, -24811, -24679, -24546, -24413,
|
|
||||||
-24278, -24143, -24006, -23869, -23731, -23592, -23452, -23311,
|
|
||||||
-23169, -23027, -22883, -22739, -22594, -22448, -22301, -22153,
|
|
||||||
-22004, -21855, -21705, -21554, -21402, -21249, -21096, -20942,
|
|
||||||
-20787, -20631, -20474, -20317, -20159, -20000, -19840, -19680,
|
|
||||||
-19519, -19357, -19194, -19031, -18867, -18702, -18537, -18371,
|
|
||||||
-18204, -18036, -17868, -17699, -17530, -17360, -17189, -17017,
|
|
||||||
-16845, -16672, -16499, -16325, -16150, -15975, -15799, -15623,
|
|
||||||
-15446, -15268, -15090, -14911, -14732, -14552, -14372, -14191,
|
|
||||||
-14009, -13827, -13645, -13462, -13278, -13094, -12909, -12724,
|
|
||||||
-12539, -12353, -12166, -11980, -11792, -11604, -11416, -11227,
|
|
||||||
-11038, -10849, -10659, -10469, -10278, -10087, -9895, -9703,
|
|
||||||
-9511, -9319, -9126, -8932, -8739, -8545, -8351, -8156,
|
|
||||||
-7961, -7766, -7571, -7375, -7179, -6982, -6786, -6589,
|
|
||||||
-6392, -6195, -5997, -5799, -5601, -5403, -5205, -5006,
|
|
||||||
-4807, -4608, -4409, -4210, -4011, -3811, -3611, -3411,
|
|
||||||
-3211, -3011, -2811, -2610, -2410, -2209, -2009, -1808,
|
|
||||||
-1607, -1406, -1206, -1005, -804, -603, -402, -201
|
|
||||||
};
|
|
||||||
|
|
||||||
int WebRtcSpl_ComplexFFT(WebRtc_Word16 frfi[], int stages, int mode)
|
|
||||||
{
|
|
||||||
int i, j, l, k, istep, n, m;
|
|
||||||
WebRtc_Word16 wr, wi;
|
|
||||||
WebRtc_Word32 tr32, ti32, qr32, qi32;
|
|
||||||
|
|
||||||
/* The 1024-value is a constant given from the size of kSinTable1024[],
|
|
||||||
* and should not be changed depending on the input parameter 'stages'
|
|
||||||
*/
|
|
||||||
n = 1 << stages;
|
|
||||||
if (n > 1024)
|
|
||||||
return -1;
|
|
||||||
|
|
||||||
l = 1;
|
|
||||||
k = 10 - 1; /* Constant for given kSinTable1024[]. Do not change
|
|
||||||
depending on the input parameter 'stages' */
|
|
||||||
|
|
||||||
if (mode == 0)
|
|
||||||
{
|
|
||||||
// mode==0: Low-complexity and Low-accuracy mode
|
|
||||||
while (l < n)
|
|
||||||
{
|
|
||||||
istep = l << 1;
|
|
||||||
|
|
||||||
for (m = 0; m < l; ++m)
|
|
||||||
{
|
|
||||||
j = m << k;
|
|
||||||
|
|
||||||
/* The 256-value is a constant given as 1/4 of the size of
|
|
||||||
* kSinTable1024[], and should not be changed depending on the input
|
|
||||||
* parameter 'stages'. It will result in 0 <= j < N_SINE_WAVE/2
|
|
||||||
*/
|
|
||||||
wr = kSinTable1024[j + 256];
|
|
||||||
wi = -kSinTable1024[j];
|
|
||||||
|
|
||||||
for (i = m; i < n; i += istep)
|
|
||||||
{
|
|
||||||
j = i + l;
|
|
||||||
|
|
||||||
tr32 = WEBRTC_SPL_RSHIFT_W32((WEBRTC_SPL_MUL_16_16(wr, frfi[2 * j])
|
|
||||||
- WEBRTC_SPL_MUL_16_16(wi, frfi[2 * j + 1])), 15);
|
|
||||||
|
|
||||||
ti32 = WEBRTC_SPL_RSHIFT_W32((WEBRTC_SPL_MUL_16_16(wr, frfi[2 * j + 1])
|
|
||||||
+ WEBRTC_SPL_MUL_16_16(wi, frfi[2 * j])), 15);
|
|
||||||
|
|
||||||
qr32 = (WebRtc_Word32)frfi[2 * i];
|
|
||||||
qi32 = (WebRtc_Word32)frfi[2 * i + 1];
|
|
||||||
frfi[2 * j] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(qr32 - tr32, 1);
|
|
||||||
frfi[2 * j + 1] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(qi32 - ti32, 1);
|
|
||||||
frfi[2 * i] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(qr32 + tr32, 1);
|
|
||||||
frfi[2 * i + 1] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(qi32 + ti32, 1);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
--k;
|
|
||||||
l = istep;
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
} else
|
|
||||||
{
|
|
||||||
// mode==1: High-complexity and High-accuracy mode
|
|
||||||
while (l < n)
|
|
||||||
{
|
|
||||||
istep = l << 1;
|
|
||||||
|
|
||||||
for (m = 0; m < l; ++m)
|
|
||||||
{
|
|
||||||
j = m << k;
|
|
||||||
|
|
||||||
/* The 256-value is a constant given as 1/4 of the size of
|
|
||||||
* kSinTable1024[], and should not be changed depending on the input
|
|
||||||
* parameter 'stages'. It will result in 0 <= j < N_SINE_WAVE/2
|
|
||||||
*/
|
|
||||||
wr = kSinTable1024[j + 256];
|
|
||||||
wi = -kSinTable1024[j];
|
|
||||||
|
|
||||||
#ifdef WEBRTC_ARCH_ARM_V7A
|
|
||||||
WebRtc_Word32 wri;
|
|
||||||
WebRtc_Word32 frfi_r;
|
|
||||||
__asm__("pkhbt %0, %1, %2, lsl #16" : "=r"(wri) :
|
|
||||||
"r"((WebRtc_Word32)wr), "r"((WebRtc_Word32)wi));
|
|
||||||
#endif
|
|
||||||
|
|
||||||
for (i = m; i < n; i += istep)
|
|
||||||
{
|
|
||||||
j = i + l;
|
|
||||||
|
|
||||||
#ifdef WEBRTC_ARCH_ARM_V7A
|
|
||||||
__asm__("pkhbt %0, %1, %2, lsl #16" : "=r"(frfi_r) :
|
|
||||||
"r"((WebRtc_Word32)frfi[2*j]), "r"((WebRtc_Word32)frfi[2*j +1]));
|
|
||||||
__asm__("smlsd %0, %1, %2, %3" : "=r"(tr32) :
|
|
||||||
"r"(wri), "r"(frfi_r), "r"(CFFTRND));
|
|
||||||
__asm__("smladx %0, %1, %2, %3" : "=r"(ti32) :
|
|
||||||
"r"(wri), "r"(frfi_r), "r"(CFFTRND));
|
|
||||||
|
|
||||||
#else
|
|
||||||
tr32 = WEBRTC_SPL_MUL_16_16(wr, frfi[2 * j])
|
|
||||||
- WEBRTC_SPL_MUL_16_16(wi, frfi[2 * j + 1]) + CFFTRND;
|
|
||||||
|
|
||||||
ti32 = WEBRTC_SPL_MUL_16_16(wr, frfi[2 * j + 1])
|
|
||||||
+ WEBRTC_SPL_MUL_16_16(wi, frfi[2 * j]) + CFFTRND;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
tr32 = WEBRTC_SPL_RSHIFT_W32(tr32, 15 - CFFTSFT);
|
|
||||||
ti32 = WEBRTC_SPL_RSHIFT_W32(ti32, 15 - CFFTSFT);
|
|
||||||
|
|
||||||
qr32 = ((WebRtc_Word32)frfi[2 * i]) << CFFTSFT;
|
|
||||||
qi32 = ((WebRtc_Word32)frfi[2 * i + 1]) << CFFTSFT;
|
|
||||||
|
|
||||||
frfi[2 * j] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(
|
|
||||||
(qr32 - tr32 + CFFTRND2), 1 + CFFTSFT);
|
|
||||||
frfi[2 * j + 1] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(
|
|
||||||
(qi32 - ti32 + CFFTRND2), 1 + CFFTSFT);
|
|
||||||
frfi[2 * i] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(
|
|
||||||
(qr32 + tr32 + CFFTRND2), 1 + CFFTSFT);
|
|
||||||
frfi[2 * i + 1] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(
|
|
||||||
(qi32 + ti32 + CFFTRND2), 1 + CFFTSFT);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
--k;
|
|
||||||
l = istep;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
int WebRtcSpl_ComplexIFFT(WebRtc_Word16 frfi[], int stages, int mode)
|
|
||||||
{
|
|
||||||
int i, j, l, k, istep, n, m, scale, shift;
|
|
||||||
WebRtc_Word16 wr, wi;
|
|
||||||
WebRtc_Word32 tr32, ti32, qr32, qi32;
|
|
||||||
WebRtc_Word32 tmp32, round2;
|
|
||||||
|
|
||||||
/* The 1024-value is a constant given from the size of kSinTable1024[],
|
|
||||||
* and should not be changed depending on the input parameter 'stages'
|
|
||||||
*/
|
|
||||||
n = 1 << stages;
|
|
||||||
if (n > 1024)
|
|
||||||
return -1;
|
|
||||||
|
|
||||||
scale = 0;
|
|
||||||
|
|
||||||
l = 1;
|
|
||||||
k = 10 - 1; /* Constant for given kSinTable1024[]. Do not change
|
|
||||||
depending on the input parameter 'stages' */
|
|
||||||
|
|
||||||
while (l < n)
|
|
||||||
{
|
|
||||||
// variable scaling, depending upon data
|
|
||||||
shift = 0;
|
|
||||||
round2 = 8192;
|
|
||||||
|
|
||||||
tmp32 = (WebRtc_Word32)WebRtcSpl_MaxAbsValueW16(frfi, 2 * n);
|
|
||||||
if (tmp32 > 13573)
|
|
||||||
{
|
|
||||||
shift++;
|
|
||||||
scale++;
|
|
||||||
round2 <<= 1;
|
|
||||||
}
|
|
||||||
if (tmp32 > 27146)
|
|
||||||
{
|
|
||||||
shift++;
|
|
||||||
scale++;
|
|
||||||
round2 <<= 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
istep = l << 1;
|
|
||||||
|
|
||||||
if (mode == 0)
|
|
||||||
{
|
|
||||||
// mode==0: Low-complexity and Low-accuracy mode
|
|
||||||
for (m = 0; m < l; ++m)
|
|
||||||
{
|
|
||||||
j = m << k;
|
|
||||||
|
|
||||||
/* The 256-value is a constant given as 1/4 of the size of
|
|
||||||
* kSinTable1024[], and should not be changed depending on the input
|
|
||||||
* parameter 'stages'. It will result in 0 <= j < N_SINE_WAVE/2
|
|
||||||
*/
|
|
||||||
wr = kSinTable1024[j + 256];
|
|
||||||
wi = kSinTable1024[j];
|
|
||||||
|
|
||||||
for (i = m; i < n; i += istep)
|
|
||||||
{
|
|
||||||
j = i + l;
|
|
||||||
|
|
||||||
tr32 = WEBRTC_SPL_RSHIFT_W32((WEBRTC_SPL_MUL_16_16_RSFT(wr, frfi[2 * j], 0)
|
|
||||||
- WEBRTC_SPL_MUL_16_16_RSFT(wi, frfi[2 * j + 1], 0)), 15);
|
|
||||||
|
|
||||||
ti32 = WEBRTC_SPL_RSHIFT_W32(
|
|
||||||
(WEBRTC_SPL_MUL_16_16_RSFT(wr, frfi[2 * j + 1], 0)
|
|
||||||
+ WEBRTC_SPL_MUL_16_16_RSFT(wi,frfi[2*j],0)), 15);
|
|
||||||
|
|
||||||
qr32 = (WebRtc_Word32)frfi[2 * i];
|
|
||||||
qi32 = (WebRtc_Word32)frfi[2 * i + 1];
|
|
||||||
frfi[2 * j] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(qr32 - tr32, shift);
|
|
||||||
frfi[2 * j + 1] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(qi32 - ti32, shift);
|
|
||||||
frfi[2 * i] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(qr32 + tr32, shift);
|
|
||||||
frfi[2 * i + 1] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(qi32 + ti32, shift);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
} else
|
|
||||||
{
|
|
||||||
// mode==1: High-complexity and High-accuracy mode
|
|
||||||
|
|
||||||
for (m = 0; m < l; ++m)
|
|
||||||
{
|
|
||||||
j = m << k;
|
|
||||||
|
|
||||||
/* The 256-value is a constant given as 1/4 of the size of
|
|
||||||
* kSinTable1024[], and should not be changed depending on the input
|
|
||||||
* parameter 'stages'. It will result in 0 <= j < N_SINE_WAVE/2
|
|
||||||
*/
|
|
||||||
wr = kSinTable1024[j + 256];
|
|
||||||
wi = kSinTable1024[j];
|
|
||||||
|
|
||||||
#ifdef WEBRTC_ARCH_ARM_V7A
|
|
||||||
WebRtc_Word32 wri;
|
|
||||||
WebRtc_Word32 frfi_r;
|
|
||||||
__asm__("pkhbt %0, %1, %2, lsl #16" : "=r"(wri) :
|
|
||||||
"r"((WebRtc_Word32)wr), "r"((WebRtc_Word32)wi));
|
|
||||||
#endif
|
|
||||||
|
|
||||||
for (i = m; i < n; i += istep)
|
|
||||||
{
|
|
||||||
j = i + l;
|
|
||||||
|
|
||||||
#ifdef WEBRTC_ARCH_ARM_V7A
|
|
||||||
__asm__("pkhbt %0, %1, %2, lsl #16" : "=r"(frfi_r) :
|
|
||||||
"r"((WebRtc_Word32)frfi[2*j]), "r"((WebRtc_Word32)frfi[2*j +1]));
|
|
||||||
__asm__("smlsd %0, %1, %2, %3" : "=r"(tr32) :
|
|
||||||
"r"(wri), "r"(frfi_r), "r"(CIFFTRND));
|
|
||||||
__asm__("smladx %0, %1, %2, %3" : "=r"(ti32) :
|
|
||||||
"r"(wri), "r"(frfi_r), "r"(CIFFTRND));
|
|
||||||
#else
|
|
||||||
|
|
||||||
tr32 = WEBRTC_SPL_MUL_16_16(wr, frfi[2 * j])
|
|
||||||
- WEBRTC_SPL_MUL_16_16(wi, frfi[2 * j + 1]) + CIFFTRND;
|
|
||||||
|
|
||||||
ti32 = WEBRTC_SPL_MUL_16_16(wr, frfi[2 * j + 1])
|
|
||||||
+ WEBRTC_SPL_MUL_16_16(wi, frfi[2 * j]) + CIFFTRND;
|
|
||||||
#endif
|
|
||||||
tr32 = WEBRTC_SPL_RSHIFT_W32(tr32, 15 - CIFFTSFT);
|
|
||||||
ti32 = WEBRTC_SPL_RSHIFT_W32(ti32, 15 - CIFFTSFT);
|
|
||||||
|
|
||||||
qr32 = ((WebRtc_Word32)frfi[2 * i]) << CIFFTSFT;
|
|
||||||
qi32 = ((WebRtc_Word32)frfi[2 * i + 1]) << CIFFTSFT;
|
|
||||||
|
|
||||||
frfi[2 * j] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((qr32 - tr32+round2),
|
|
||||||
shift+CIFFTSFT);
|
|
||||||
frfi[2 * j + 1] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(
|
|
||||||
(qi32 - ti32 + round2), shift + CIFFTSFT);
|
|
||||||
frfi[2 * i] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((qr32 + tr32 + round2),
|
|
||||||
shift + CIFFTSFT);
|
|
||||||
frfi[2 * i + 1] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(
|
|
||||||
(qi32 + ti32 + round2), shift + CIFFTSFT);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
||||||
--k;
|
|
||||||
l = istep;
|
|
||||||
}
|
|
||||||
return scale;
|
|
||||||
}
|
|
||||||
|
|
@ -1,108 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the implementation of functions
|
|
||||||
* WebRtcSpl_MemSetW16()
|
|
||||||
* WebRtcSpl_MemSetW32()
|
|
||||||
* WebRtcSpl_MemCpyReversedOrder()
|
|
||||||
* WebRtcSpl_CopyFromEndW16()
|
|
||||||
* WebRtcSpl_ZerosArrayW16()
|
|
||||||
* WebRtcSpl_ZerosArrayW32()
|
|
||||||
* WebRtcSpl_OnesArrayW16()
|
|
||||||
* WebRtcSpl_OnesArrayW32()
|
|
||||||
*
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <string.h>
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcSpl_MemSetW16(WebRtc_Word16 *ptr, WebRtc_Word16 set_value, int length)
|
|
||||||
{
|
|
||||||
int j;
|
|
||||||
WebRtc_Word16 *arrptr = ptr;
|
|
||||||
|
|
||||||
for (j = length; j > 0; j--)
|
|
||||||
{
|
|
||||||
*arrptr++ = set_value;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcSpl_MemSetW32(WebRtc_Word32 *ptr, WebRtc_Word32 set_value, int length)
|
|
||||||
{
|
|
||||||
int j;
|
|
||||||
WebRtc_Word32 *arrptr = ptr;
|
|
||||||
|
|
||||||
for (j = length; j > 0; j--)
|
|
||||||
{
|
|
||||||
*arrptr++ = set_value;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcSpl_MemCpyReversedOrder(WebRtc_Word16* dest, WebRtc_Word16* source, int length)
|
|
||||||
{
|
|
||||||
int j;
|
|
||||||
WebRtc_Word16* destPtr = dest;
|
|
||||||
WebRtc_Word16* sourcePtr = source;
|
|
||||||
|
|
||||||
for (j = 0; j < length; j++)
|
|
||||||
{
|
|
||||||
*destPtr-- = *sourcePtr++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcSpl_CopyFromEndW16(G_CONST WebRtc_Word16 *vector_in,
|
|
||||||
WebRtc_Word16 length,
|
|
||||||
WebRtc_Word16 samples,
|
|
||||||
WebRtc_Word16 *vector_out)
|
|
||||||
{
|
|
||||||
// Copy the last <samples> of the input vector to vector_out
|
|
||||||
WEBRTC_SPL_MEMCPY_W16(vector_out, &vector_in[length - samples], samples);
|
|
||||||
|
|
||||||
return samples;
|
|
||||||
}
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcSpl_ZerosArrayW16(WebRtc_Word16 *vector, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtcSpl_MemSetW16(vector, 0, length);
|
|
||||||
return length;
|
|
||||||
}
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcSpl_ZerosArrayW32(WebRtc_Word32 *vector, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtcSpl_MemSetW32(vector, 0, length);
|
|
||||||
return length;
|
|
||||||
}
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcSpl_OnesArrayW16(WebRtc_Word16 *vector, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 i;
|
|
||||||
WebRtc_Word16 *tmpvec = vector;
|
|
||||||
for (i = 0; i < length; i++)
|
|
||||||
{
|
|
||||||
*tmpvec++ = 1;
|
|
||||||
}
|
|
||||||
return length;
|
|
||||||
}
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcSpl_OnesArrayW32(WebRtc_Word32 *vector, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 i;
|
|
||||||
WebRtc_Word32 *tmpvec = vector;
|
|
||||||
for (i = 0; i < length; i++)
|
|
||||||
{
|
|
||||||
*tmpvec++ = 1;
|
|
||||||
}
|
|
||||||
return length;
|
|
||||||
}
|
|
||||||
|
|
@ -1,110 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "crc.h"
|
|
||||||
#include <stdlib.h>
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
#define POLYNOMIAL 0x04c11db7L
|
|
||||||
|
|
||||||
|
|
||||||
static const WebRtc_UWord32 kCrcTable[256] = {
|
|
||||||
0, 0x4c11db7, 0x9823b6e, 0xd4326d9, 0x130476dc, 0x17c56b6b,
|
|
||||||
0x1a864db2, 0x1e475005, 0x2608edb8, 0x22c9f00f, 0x2f8ad6d6, 0x2b4bcb61,
|
|
||||||
0x350c9b64, 0x31cd86d3, 0x3c8ea00a, 0x384fbdbd, 0x4c11db70, 0x48d0c6c7,
|
|
||||||
0x4593e01e, 0x4152fda9, 0x5f15adac, 0x5bd4b01b, 0x569796c2, 0x52568b75,
|
|
||||||
0x6a1936c8, 0x6ed82b7f, 0x639b0da6, 0x675a1011, 0x791d4014, 0x7ddc5da3,
|
|
||||||
0x709f7b7a, 0x745e66cd, 0x9823b6e0, 0x9ce2ab57, 0x91a18d8e, 0x95609039,
|
|
||||||
0x8b27c03c, 0x8fe6dd8b, 0x82a5fb52, 0x8664e6e5, 0xbe2b5b58, 0xbaea46ef,
|
|
||||||
0xb7a96036, 0xb3687d81, 0xad2f2d84, 0xa9ee3033, 0xa4ad16ea, 0xa06c0b5d,
|
|
||||||
0xd4326d90, 0xd0f37027, 0xddb056fe, 0xd9714b49, 0xc7361b4c, 0xc3f706fb,
|
|
||||||
0xceb42022, 0xca753d95, 0xf23a8028, 0xf6fb9d9f, 0xfbb8bb46, 0xff79a6f1,
|
|
||||||
0xe13ef6f4, 0xe5ffeb43, 0xe8bccd9a, 0xec7dd02d, 0x34867077, 0x30476dc0,
|
|
||||||
0x3d044b19, 0x39c556ae, 0x278206ab, 0x23431b1c, 0x2e003dc5, 0x2ac12072,
|
|
||||||
0x128e9dcf, 0x164f8078, 0x1b0ca6a1, 0x1fcdbb16, 0x18aeb13, 0x54bf6a4,
|
|
||||||
0x808d07d, 0xcc9cdca, 0x7897ab07, 0x7c56b6b0, 0x71159069, 0x75d48dde,
|
|
||||||
0x6b93dddb, 0x6f52c06c, 0x6211e6b5, 0x66d0fb02, 0x5e9f46bf, 0x5a5e5b08,
|
|
||||||
0x571d7dd1, 0x53dc6066, 0x4d9b3063, 0x495a2dd4, 0x44190b0d, 0x40d816ba,
|
|
||||||
0xaca5c697, 0xa864db20, 0xa527fdf9, 0xa1e6e04e, 0xbfa1b04b, 0xbb60adfc,
|
|
||||||
0xb6238b25, 0xb2e29692, 0x8aad2b2f, 0x8e6c3698, 0x832f1041, 0x87ee0df6,
|
|
||||||
0x99a95df3, 0x9d684044, 0x902b669d, 0x94ea7b2a, 0xe0b41de7, 0xe4750050,
|
|
||||||
0xe9362689, 0xedf73b3e, 0xf3b06b3b, 0xf771768c, 0xfa325055, 0xfef34de2,
|
|
||||||
0xc6bcf05f, 0xc27dede8, 0xcf3ecb31, 0xcbffd686, 0xd5b88683, 0xd1799b34,
|
|
||||||
0xdc3abded, 0xd8fba05a, 0x690ce0ee, 0x6dcdfd59, 0x608edb80, 0x644fc637,
|
|
||||||
0x7a089632, 0x7ec98b85, 0x738aad5c, 0x774bb0eb, 0x4f040d56, 0x4bc510e1,
|
|
||||||
0x46863638, 0x42472b8f, 0x5c007b8a, 0x58c1663d, 0x558240e4, 0x51435d53,
|
|
||||||
0x251d3b9e, 0x21dc2629, 0x2c9f00f0, 0x285e1d47, 0x36194d42, 0x32d850f5,
|
|
||||||
0x3f9b762c, 0x3b5a6b9b, 0x315d626, 0x7d4cb91, 0xa97ed48, 0xe56f0ff,
|
|
||||||
0x1011a0fa, 0x14d0bd4d, 0x19939b94, 0x1d528623, 0xf12f560e, 0xf5ee4bb9,
|
|
||||||
0xf8ad6d60, 0xfc6c70d7, 0xe22b20d2, 0xe6ea3d65, 0xeba91bbc, 0xef68060b,
|
|
||||||
0xd727bbb6, 0xd3e6a601, 0xdea580d8, 0xda649d6f, 0xc423cd6a, 0xc0e2d0dd,
|
|
||||||
0xcda1f604, 0xc960ebb3, 0xbd3e8d7e, 0xb9ff90c9, 0xb4bcb610, 0xb07daba7,
|
|
||||||
0xae3afba2, 0xaafbe615, 0xa7b8c0cc, 0xa379dd7b, 0x9b3660c6, 0x9ff77d71,
|
|
||||||
0x92b45ba8, 0x9675461f, 0x8832161a, 0x8cf30bad, 0x81b02d74, 0x857130c3,
|
|
||||||
0x5d8a9099, 0x594b8d2e, 0x5408abf7, 0x50c9b640, 0x4e8ee645, 0x4a4ffbf2,
|
|
||||||
0x470cdd2b, 0x43cdc09c, 0x7b827d21, 0x7f436096, 0x7200464f, 0x76c15bf8,
|
|
||||||
0x68860bfd, 0x6c47164a, 0x61043093, 0x65c52d24, 0x119b4be9, 0x155a565e,
|
|
||||||
0x18197087, 0x1cd86d30, 0x29f3d35, 0x65e2082, 0xb1d065b, 0xfdc1bec,
|
|
||||||
0x3793a651, 0x3352bbe6, 0x3e119d3f, 0x3ad08088, 0x2497d08d, 0x2056cd3a,
|
|
||||||
0x2d15ebe3, 0x29d4f654, 0xc5a92679, 0xc1683bce, 0xcc2b1d17, 0xc8ea00a0,
|
|
||||||
0xd6ad50a5, 0xd26c4d12, 0xdf2f6bcb, 0xdbee767c, 0xe3a1cbc1, 0xe760d676,
|
|
||||||
0xea23f0af, 0xeee2ed18, 0xf0a5bd1d, 0xf464a0aa, 0xf9278673, 0xfde69bc4,
|
|
||||||
0x89b8fd09, 0x8d79e0be, 0x803ac667, 0x84fbdbd0, 0x9abc8bd5, 0x9e7d9662,
|
|
||||||
0x933eb0bb, 0x97ffad0c, 0xafb010b1, 0xab710d06, 0xa6322bdf, 0xa2f33668,
|
|
||||||
0xbcb4666d, 0xb8757bda, 0xb5365d03, 0xb1f740b4
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/****************************************************************************
|
|
||||||
* WebRtcIsac_GetCrc(...)
|
|
||||||
*
|
|
||||||
* This function returns a 32 bit CRC checksum of a bit stream
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - bitstream : payload bitstream
|
|
||||||
* - len_bitstream_in_bytes : number of 8-bit words in the bit stream
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - crc : checksum
|
|
||||||
*
|
|
||||||
* Return value : 0 - Ok
|
|
||||||
* -1 - Error
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_GetCrc(const WebRtc_Word16* bitstream,
|
|
||||||
WebRtc_Word16 len_bitstream_in_bytes,
|
|
||||||
WebRtc_UWord32* crc)
|
|
||||||
{
|
|
||||||
WebRtc_UWord8* bitstream_ptr_uw8;
|
|
||||||
WebRtc_UWord32 crc_state;
|
|
||||||
int byte_cntr;
|
|
||||||
int crc_tbl_indx;
|
|
||||||
|
|
||||||
/* Sanity Check. */
|
|
||||||
if (bitstream == NULL) {
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
/* cast to UWord8 pointer */
|
|
||||||
bitstream_ptr_uw8 = (WebRtc_UWord8 *)bitstream;
|
|
||||||
|
|
||||||
/* initialize */
|
|
||||||
crc_state = 0xFFFFFFFF;
|
|
||||||
|
|
||||||
for (byte_cntr = 0; byte_cntr < len_bitstream_in_bytes; byte_cntr++) {
|
|
||||||
crc_tbl_indx = (WEBRTC_SPL_RSHIFT_U32(crc_state, 24) ^
|
|
||||||
bitstream_ptr_uw8[byte_cntr]) & 0xFF;
|
|
||||||
crc_state = WEBRTC_SPL_LSHIFT_U32(crc_state, 8) ^ kCrcTable[crc_tbl_indx];
|
|
||||||
}
|
|
||||||
|
|
||||||
*crc = ~crc_state;
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
@ -1,46 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* crc.h
|
|
||||||
*
|
|
||||||
* Checksum functions
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_CRC_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_CRC_H_
|
|
||||||
|
|
||||||
#include "typedefs.h"
|
|
||||||
|
|
||||||
/****************************************************************************
|
|
||||||
* WebRtcIsac_GetCrc(...)
|
|
||||||
*
|
|
||||||
* This function returns a 32 bit CRC checksum of a bit stream
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - encoded : payload bit stream
|
|
||||||
* - no_of_word8s : number of 8-bit words in the bit stream
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - crc : checksum
|
|
||||||
*
|
|
||||||
* Return value : 0 - Ok
|
|
||||||
* -1 - Error
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_GetCrc(
|
|
||||||
const WebRtc_Word16* encoded,
|
|
||||||
WebRtc_Word16 no_of_word8s,
|
|
||||||
WebRtc_UWord32* crc);
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
#endif /* WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_CRC_H_ */
|
|
||||||
|
|
@ -1,271 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_CrossCorrelation().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
/* TODO(kma): Clean up the code in this file, and break it up for
|
|
||||||
* various platforms (Xscale, ARM/Neon etc.).
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
void WebRtcSpl_CrossCorrelation(WebRtc_Word32* cross_correlation, WebRtc_Word16* seq1,
|
|
||||||
WebRtc_Word16* seq2, WebRtc_Word16 dim_seq,
|
|
||||||
WebRtc_Word16 dim_cross_correlation,
|
|
||||||
WebRtc_Word16 right_shifts,
|
|
||||||
WebRtc_Word16 step_seq2)
|
|
||||||
{
|
|
||||||
int i, j;
|
|
||||||
WebRtc_Word16* seq1Ptr;
|
|
||||||
WebRtc_Word16* seq2Ptr;
|
|
||||||
WebRtc_Word32* CrossCorrPtr;
|
|
||||||
|
|
||||||
#ifdef _XSCALE_OPT_
|
|
||||||
|
|
||||||
#ifdef _WIN32
|
|
||||||
#pragma message("NOTE: _XSCALE_OPT_ optimizations are used (overrides _ARM_OPT_ and requires /QRxscale compiler flag)")
|
|
||||||
#endif
|
|
||||||
|
|
||||||
__int64 macc40;
|
|
||||||
|
|
||||||
int iseq1[250];
|
|
||||||
int iseq2[250];
|
|
||||||
int iseq3[250];
|
|
||||||
int * iseq1Ptr;
|
|
||||||
int * iseq2Ptr;
|
|
||||||
int * iseq3Ptr;
|
|
||||||
int len, i_len;
|
|
||||||
|
|
||||||
seq1Ptr = seq1;
|
|
||||||
iseq1Ptr = iseq1;
|
|
||||||
for(i = 0; i < ((dim_seq + 1) >> 1); i++)
|
|
||||||
{
|
|
||||||
*iseq1Ptr = (unsigned short)*seq1Ptr++;
|
|
||||||
*iseq1Ptr++ |= (WebRtc_Word32)*seq1Ptr++ << 16;
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
if(dim_seq%2)
|
|
||||||
{
|
|
||||||
*(iseq1Ptr-1) &= 0x0000ffff;
|
|
||||||
}
|
|
||||||
*iseq1Ptr = 0;
|
|
||||||
iseq1Ptr++;
|
|
||||||
*iseq1Ptr = 0;
|
|
||||||
iseq1Ptr++;
|
|
||||||
*iseq1Ptr = 0;
|
|
||||||
|
|
||||||
if(step_seq2 < 0)
|
|
||||||
{
|
|
||||||
seq2Ptr = seq2 - dim_cross_correlation + 1;
|
|
||||||
CrossCorrPtr = &cross_correlation[dim_cross_correlation - 1];
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
seq2Ptr = seq2;
|
|
||||||
CrossCorrPtr = cross_correlation;
|
|
||||||
}
|
|
||||||
|
|
||||||
len = dim_seq + dim_cross_correlation - 1;
|
|
||||||
i_len = (len + 1) >> 1;
|
|
||||||
iseq2Ptr = iseq2;
|
|
||||||
|
|
||||||
iseq3Ptr = iseq3;
|
|
||||||
for(i = 0; i < i_len; i++)
|
|
||||||
{
|
|
||||||
*iseq2Ptr = (unsigned short)*seq2Ptr++;
|
|
||||||
*iseq3Ptr = (unsigned short)*seq2Ptr;
|
|
||||||
*iseq2Ptr++ |= (WebRtc_Word32)*seq2Ptr++ << 16;
|
|
||||||
*iseq3Ptr++ |= (WebRtc_Word32)*seq2Ptr << 16;
|
|
||||||
}
|
|
||||||
|
|
||||||
if(len % 2)
|
|
||||||
{
|
|
||||||
iseq2[i_len - 1] &= 0x0000ffff;
|
|
||||||
iseq3[i_len - 1] = 0;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
iseq3[i_len - 1] &= 0x0000ffff;
|
|
||||||
|
|
||||||
iseq2[i_len] = 0;
|
|
||||||
iseq3[i_len] = 0;
|
|
||||||
iseq2[i_len + 1] = 0;
|
|
||||||
iseq3[i_len + 1] = 0;
|
|
||||||
iseq2[i_len + 2] = 0;
|
|
||||||
iseq3[i_len + 2] = 0;
|
|
||||||
|
|
||||||
// Set pointer to start value
|
|
||||||
iseq2Ptr = iseq2;
|
|
||||||
iseq3Ptr = iseq3;
|
|
||||||
|
|
||||||
i_len = (dim_seq + 7) >> 3;
|
|
||||||
for (i = 0; i < dim_cross_correlation; i++)
|
|
||||||
{
|
|
||||||
|
|
||||||
iseq1Ptr = iseq1;
|
|
||||||
|
|
||||||
macc40 = 0;
|
|
||||||
|
|
||||||
_WriteCoProcessor(macc40, 0);
|
|
||||||
|
|
||||||
if((i & 1))
|
|
||||||
{
|
|
||||||
iseq3Ptr = iseq3 + (i >> 1);
|
|
||||||
for (j = i_len; j > 0; j--)
|
|
||||||
{
|
|
||||||
_SmulAddPack_2SW_ACC(*iseq1Ptr++, *iseq3Ptr++);
|
|
||||||
_SmulAddPack_2SW_ACC(*iseq1Ptr++, *iseq3Ptr++);
|
|
||||||
_SmulAddPack_2SW_ACC(*iseq1Ptr++, *iseq3Ptr++);
|
|
||||||
_SmulAddPack_2SW_ACC(*iseq1Ptr++, *iseq3Ptr++);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
iseq2Ptr = iseq2 + (i >> 1);
|
|
||||||
for (j = i_len; j > 0; j--)
|
|
||||||
{
|
|
||||||
_SmulAddPack_2SW_ACC(*iseq1Ptr++, *iseq2Ptr++);
|
|
||||||
_SmulAddPack_2SW_ACC(*iseq1Ptr++, *iseq2Ptr++);
|
|
||||||
_SmulAddPack_2SW_ACC(*iseq1Ptr++, *iseq2Ptr++);
|
|
||||||
_SmulAddPack_2SW_ACC(*iseq1Ptr++, *iseq2Ptr++);
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
macc40 = _ReadCoProcessor(0);
|
|
||||||
*CrossCorrPtr = (WebRtc_Word32)(macc40 >> right_shifts);
|
|
||||||
CrossCorrPtr += step_seq2;
|
|
||||||
}
|
|
||||||
#else // #ifdef _XSCALE_OPT_
|
|
||||||
#ifdef _ARM_OPT_
|
|
||||||
WebRtc_Word16 dim_seq8 = (dim_seq >> 3) << 3;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
CrossCorrPtr = cross_correlation;
|
|
||||||
|
|
||||||
for (i = 0; i < dim_cross_correlation; i++)
|
|
||||||
{
|
|
||||||
// Set the pointer to the static vector, set the pointer to the sliding vector
|
|
||||||
// and initialize cross_correlation
|
|
||||||
seq1Ptr = seq1;
|
|
||||||
seq2Ptr = seq2 + (step_seq2 * i);
|
|
||||||
(*CrossCorrPtr) = 0;
|
|
||||||
|
|
||||||
#ifndef _ARM_OPT_
|
|
||||||
#ifdef _WIN32
|
|
||||||
#pragma message("NOTE: default implementation is used")
|
|
||||||
#endif
|
|
||||||
// Perform the cross correlation
|
|
||||||
for (j = 0; j < dim_seq; j++)
|
|
||||||
{
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16_RSFT((*seq1Ptr), (*seq2Ptr), right_shifts);
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
#ifdef _WIN32
|
|
||||||
#pragma message("NOTE: _ARM_OPT_ optimizations are used")
|
|
||||||
#endif
|
|
||||||
if (right_shifts == 0)
|
|
||||||
{
|
|
||||||
// Perform the optimized cross correlation
|
|
||||||
for (j = 0; j < dim_seq8; j = j + 8)
|
|
||||||
{
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16((*seq1Ptr), (*seq2Ptr));
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16((*seq1Ptr), (*seq2Ptr));
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16((*seq1Ptr), (*seq2Ptr));
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16((*seq1Ptr), (*seq2Ptr));
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16((*seq1Ptr), (*seq2Ptr));
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16((*seq1Ptr), (*seq2Ptr));
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16((*seq1Ptr), (*seq2Ptr));
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16((*seq1Ptr), (*seq2Ptr));
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (j = dim_seq8; j < dim_seq; j++)
|
|
||||||
{
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16((*seq1Ptr), (*seq2Ptr));
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else // right_shifts != 0
|
|
||||||
|
|
||||||
{
|
|
||||||
// Perform the optimized cross correlation
|
|
||||||
for (j = 0; j < dim_seq8; j = j + 8)
|
|
||||||
{
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16_RSFT((*seq1Ptr), (*seq2Ptr),
|
|
||||||
right_shifts);
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16_RSFT((*seq1Ptr), (*seq2Ptr),
|
|
||||||
right_shifts);
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16_RSFT((*seq1Ptr), (*seq2Ptr),
|
|
||||||
right_shifts);
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16_RSFT((*seq1Ptr), (*seq2Ptr),
|
|
||||||
right_shifts);
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16_RSFT((*seq1Ptr), (*seq2Ptr),
|
|
||||||
right_shifts);
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16_RSFT((*seq1Ptr), (*seq2Ptr),
|
|
||||||
right_shifts);
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16_RSFT((*seq1Ptr), (*seq2Ptr),
|
|
||||||
right_shifts);
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16_RSFT((*seq1Ptr), (*seq2Ptr),
|
|
||||||
right_shifts);
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (j = dim_seq8; j < dim_seq; j++)
|
|
||||||
{
|
|
||||||
(*CrossCorrPtr) += WEBRTC_SPL_MUL_16_16_RSFT((*seq1Ptr), (*seq2Ptr),
|
|
||||||
right_shifts);
|
|
||||||
seq1Ptr++;
|
|
||||||
seq2Ptr++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
CrossCorrPtr++;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
|
|
@ -1,330 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* decode_B.c
|
|
||||||
*
|
|
||||||
* This file contains definition of funtions for decoding.
|
|
||||||
* Decoding of lower-band, including normal-decoding and RCU decoding.
|
|
||||||
* Decoding of upper-band, including 8-12 kHz, when the bandwidth is
|
|
||||||
* 0-12 kHz, and 8-16 kHz, when the bandwidth is 0-16 kHz.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
#include "codec.h"
|
|
||||||
#include "entropy_coding.h"
|
|
||||||
#include "pitch_estimator.h"
|
|
||||||
#include "bandwidth_estimator.h"
|
|
||||||
#include "structs.h"
|
|
||||||
#include "settings.h"
|
|
||||||
|
|
||||||
#include <stdio.h>
|
|
||||||
#include <stdlib.h>
|
|
||||||
#include <string.h>
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* function to decode the bitstream
|
|
||||||
* returns the total number of bytes in the stream
|
|
||||||
*/
|
|
||||||
int
|
|
||||||
WebRtcIsac_DecodeLb(
|
|
||||||
float* signal_out,
|
|
||||||
ISACLBDecStruct* ISACdecLB_obj,
|
|
||||||
WebRtc_Word16* current_framesamples,
|
|
||||||
WebRtc_Word16 isRCUPayload)
|
|
||||||
{
|
|
||||||
int k, model;
|
|
||||||
int len, err;
|
|
||||||
WebRtc_Word16 bandwidthInd;
|
|
||||||
|
|
||||||
float LP_dec_float[FRAMESAMPLES_HALF];
|
|
||||||
float HP_dec_float[FRAMESAMPLES_HALF];
|
|
||||||
|
|
||||||
double LPw[FRAMESAMPLES_HALF];
|
|
||||||
double HPw[FRAMESAMPLES_HALF];
|
|
||||||
double LPw_pf[FRAMESAMPLES_HALF];
|
|
||||||
|
|
||||||
double lo_filt_coef[(ORDERLO+1)*SUBFRAMES];
|
|
||||||
double hi_filt_coef[(ORDERHI+1)*SUBFRAMES];
|
|
||||||
|
|
||||||
double real_f[FRAMESAMPLES_HALF];
|
|
||||||
double imag_f[FRAMESAMPLES_HALF];
|
|
||||||
|
|
||||||
double PitchLags[4];
|
|
||||||
double PitchGains[4];
|
|
||||||
double AvgPitchGain;
|
|
||||||
WebRtc_Word16 PitchGains_Q12[4];
|
|
||||||
WebRtc_Word16 AvgPitchGain_Q12;
|
|
||||||
|
|
||||||
float gain;
|
|
||||||
|
|
||||||
int frame_nb; /* counter */
|
|
||||||
int frame_mode; /* 0 for 20ms and 30ms, 1 for 60ms */
|
|
||||||
int processed_samples;
|
|
||||||
|
|
||||||
(ISACdecLB_obj->bitstr_obj).W_upper = 0xFFFFFFFF;
|
|
||||||
(ISACdecLB_obj->bitstr_obj).streamval = 0;
|
|
||||||
(ISACdecLB_obj->bitstr_obj).stream_index = 0;
|
|
||||||
|
|
||||||
len = 0;
|
|
||||||
|
|
||||||
/* decode framelength and BW estimation - not used,
|
|
||||||
only for stream pointer*/
|
|
||||||
err = WebRtcIsac_DecodeFrameLen(&ISACdecLB_obj->bitstr_obj,
|
|
||||||
current_framesamples);
|
|
||||||
if (err < 0) { // error check
|
|
||||||
return err;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* frame_mode: 0, or 1 */
|
|
||||||
frame_mode = *current_framesamples/MAX_FRAMESAMPLES;
|
|
||||||
/* processed_samples: either 320 (20ms) or 480 (30, 60 ms) */
|
|
||||||
processed_samples = *current_framesamples/(frame_mode+1);
|
|
||||||
|
|
||||||
err = WebRtcIsac_DecodeSendBW(&ISACdecLB_obj->bitstr_obj, &bandwidthInd);
|
|
||||||
if (err < 0) { // error check
|
|
||||||
return err;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* one loop if it's one frame (20 or 30ms), 2 loops if 2 frames
|
|
||||||
bundled together (60ms) */
|
|
||||||
for (frame_nb = 0; frame_nb <= frame_mode; frame_nb++) {
|
|
||||||
/* decode & dequantize pitch parameters */
|
|
||||||
err = WebRtcIsac_DecodePitchGain(&(ISACdecLB_obj->bitstr_obj),
|
|
||||||
PitchGains_Q12);
|
|
||||||
if (err < 0) { // error check
|
|
||||||
return err;
|
|
||||||
}
|
|
||||||
|
|
||||||
err = WebRtcIsac_DecodePitchLag(&ISACdecLB_obj->bitstr_obj,
|
|
||||||
PitchGains_Q12, PitchLags);
|
|
||||||
if (err < 0) { // error check
|
|
||||||
return err;
|
|
||||||
}
|
|
||||||
|
|
||||||
AvgPitchGain_Q12 = (PitchGains_Q12[0] + PitchGains_Q12[1] +
|
|
||||||
PitchGains_Q12[2] + PitchGains_Q12[3])>>2;
|
|
||||||
|
|
||||||
/* decode & dequantize FiltCoef */
|
|
||||||
err = WebRtcIsac_DecodeLpc(&ISACdecLB_obj->bitstr_obj,
|
|
||||||
lo_filt_coef,hi_filt_coef, &model);
|
|
||||||
if (err < 0) { // error check
|
|
||||||
return err;
|
|
||||||
}
|
|
||||||
/* decode & dequantize spectrum */
|
|
||||||
len = WebRtcIsac_DecodeSpecLb(&ISACdecLB_obj->bitstr_obj,
|
|
||||||
real_f, imag_f, AvgPitchGain_Q12);
|
|
||||||
if (len < 0) { // error check
|
|
||||||
return len;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* inverse transform */
|
|
||||||
WebRtcIsac_Spec2time(real_f, imag_f, LPw, HPw,
|
|
||||||
&ISACdecLB_obj->fftstr_obj);
|
|
||||||
|
|
||||||
/* convert PitchGains back to FLOAT for pitchfilter_post */
|
|
||||||
for (k = 0; k < 4; k++) {
|
|
||||||
PitchGains[k] = ((float)PitchGains_Q12[k])/4096;
|
|
||||||
}
|
|
||||||
|
|
||||||
if(isRCUPayload)
|
|
||||||
{
|
|
||||||
for (k = 0; k < 240; k++) {
|
|
||||||
LPw[k] *= RCU_TRANSCODING_SCALE_INVERSE;
|
|
||||||
HPw[k] *= RCU_TRANSCODING_SCALE_INVERSE;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* inverse pitch filter */
|
|
||||||
WebRtcIsac_PitchfilterPost(LPw, LPw_pf,
|
|
||||||
&ISACdecLB_obj->pitchfiltstr_obj, PitchLags, PitchGains);
|
|
||||||
/* convert AvgPitchGain back to FLOAT for computation of gain */
|
|
||||||
AvgPitchGain = ((float)AvgPitchGain_Q12)/4096;
|
|
||||||
gain = 1.0f - 0.45f * (float)AvgPitchGain;
|
|
||||||
|
|
||||||
for (k = 0; k < FRAMESAMPLES_HALF; k++) {
|
|
||||||
/* reduce gain to compensate for pitch enhancer */
|
|
||||||
LPw_pf[ k ] *= gain;
|
|
||||||
}
|
|
||||||
|
|
||||||
if(isRCUPayload)
|
|
||||||
{
|
|
||||||
for (k = 0; k < FRAMESAMPLES_HALF; k++) {
|
|
||||||
/* compensation for transcoding gain changes*/
|
|
||||||
LPw_pf[k] *= RCU_TRANSCODING_SCALE;
|
|
||||||
HPw[k] *= RCU_TRANSCODING_SCALE;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* perceptual post-filtering (using normalized lattice filter) */
|
|
||||||
WebRtcIsac_NormLatticeFilterAr(ORDERLO,
|
|
||||||
ISACdecLB_obj->maskfiltstr_obj.PostStateLoF,
|
|
||||||
(ISACdecLB_obj->maskfiltstr_obj).PostStateLoG,
|
|
||||||
LPw_pf, lo_filt_coef, LP_dec_float);
|
|
||||||
WebRtcIsac_NormLatticeFilterAr(ORDERHI,
|
|
||||||
ISACdecLB_obj->maskfiltstr_obj.PostStateHiF,
|
|
||||||
(ISACdecLB_obj->maskfiltstr_obj).PostStateHiG,
|
|
||||||
HPw, hi_filt_coef, HP_dec_float);
|
|
||||||
|
|
||||||
/* recombine the 2 bands */
|
|
||||||
WebRtcIsac_FilterAndCombineFloat( LP_dec_float, HP_dec_float,
|
|
||||||
signal_out + frame_nb * processed_samples,
|
|
||||||
&ISACdecLB_obj->postfiltbankstr_obj);
|
|
||||||
}
|
|
||||||
|
|
||||||
return len;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This decode function is called when the codec is operating in 16 kHz
|
|
||||||
* bandwidth to decode the upperband, i.e. 8-16 kHz.
|
|
||||||
*
|
|
||||||
* Contrary to lower-band, the upper-band (8-16 kHz) is not split in
|
|
||||||
* frequency, but split to 12 sub-frames, i.e. twice as lower-band.
|
|
||||||
*/
|
|
||||||
int
|
|
||||||
WebRtcIsac_DecodeUb16(
|
|
||||||
float* signal_out,
|
|
||||||
ISACUBDecStruct* ISACdecUB_obj,
|
|
||||||
WebRtc_Word16 isRCUPayload)
|
|
||||||
{
|
|
||||||
int len, err;
|
|
||||||
|
|
||||||
double halfFrameFirst[FRAMESAMPLES_HALF];
|
|
||||||
double halfFrameSecond[FRAMESAMPLES_HALF];
|
|
||||||
|
|
||||||
double percepFilterParam[(UB_LPC_ORDER+1) * (SUBFRAMES<<1) +
|
|
||||||
(UB_LPC_ORDER+1)];
|
|
||||||
|
|
||||||
double real_f[FRAMESAMPLES_HALF];
|
|
||||||
double imag_f[FRAMESAMPLES_HALF];
|
|
||||||
|
|
||||||
len = 0;
|
|
||||||
|
|
||||||
/* decode & dequantize FiltCoef */
|
|
||||||
memset(percepFilterParam, 0, sizeof(percepFilterParam));
|
|
||||||
err = WebRtcIsac_DecodeInterpolLpcUb(&ISACdecUB_obj->bitstr_obj,
|
|
||||||
percepFilterParam, isac16kHz);
|
|
||||||
if (err < 0) { // error check
|
|
||||||
return err;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* decode & dequantize spectrum */
|
|
||||||
len = WebRtcIsac_DecodeSpecUB16(&ISACdecUB_obj->bitstr_obj, real_f,
|
|
||||||
imag_f);
|
|
||||||
if (len < 0) { // error check
|
|
||||||
return len;
|
|
||||||
}
|
|
||||||
if(isRCUPayload)
|
|
||||||
{
|
|
||||||
int n;
|
|
||||||
for(n = 0; n < 240; n++)
|
|
||||||
{
|
|
||||||
real_f[n] *= RCU_TRANSCODING_SCALE_UB_INVERSE;
|
|
||||||
imag_f[n] *= RCU_TRANSCODING_SCALE_UB_INVERSE;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* inverse transform */
|
|
||||||
WebRtcIsac_Spec2time(real_f, imag_f, halfFrameFirst, halfFrameSecond,
|
|
||||||
&ISACdecUB_obj->fftstr_obj);
|
|
||||||
|
|
||||||
/* perceptual post-filtering (using normalized lattice filter) */
|
|
||||||
WebRtcIsac_NormLatticeFilterAr(UB_LPC_ORDER,
|
|
||||||
ISACdecUB_obj->maskfiltstr_obj.PostStateLoF,
|
|
||||||
(ISACdecUB_obj->maskfiltstr_obj).PostStateLoG, halfFrameFirst,
|
|
||||||
&percepFilterParam[(UB_LPC_ORDER+1)], signal_out);
|
|
||||||
|
|
||||||
WebRtcIsac_NormLatticeFilterAr(UB_LPC_ORDER,
|
|
||||||
ISACdecUB_obj->maskfiltstr_obj.PostStateLoF,
|
|
||||||
(ISACdecUB_obj->maskfiltstr_obj).PostStateLoG, halfFrameSecond,
|
|
||||||
&percepFilterParam[(UB_LPC_ORDER + 1) * SUBFRAMES + (UB_LPC_ORDER+1)],
|
|
||||||
&signal_out[FRAMESAMPLES_HALF]);
|
|
||||||
|
|
||||||
return len;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This decode function is called when the codec operates at 0-12 kHz
|
|
||||||
* bandwidth to decode the upperband, i.e. 8-12 kHz.
|
|
||||||
*
|
|
||||||
* At the encoder the upper-band is split into two band, 8-12 kHz & 12-16
|
|
||||||
* kHz, and only 8-12 kHz is encoded. At the decoder, 8-12 kHz band is
|
|
||||||
* reconstructed and 12-16 kHz replaced with zeros. Then two bands
|
|
||||||
* are combined, to reconstruct the upperband 8-16 kHz.
|
|
||||||
*/
|
|
||||||
int
|
|
||||||
WebRtcIsac_DecodeUb12(
|
|
||||||
float* signal_out,
|
|
||||||
ISACUBDecStruct* ISACdecUB_obj,
|
|
||||||
WebRtc_Word16 isRCUPayload)
|
|
||||||
{
|
|
||||||
int len, err;
|
|
||||||
|
|
||||||
float LP_dec_float[FRAMESAMPLES_HALF];
|
|
||||||
float HP_dec_float[FRAMESAMPLES_HALF];
|
|
||||||
|
|
||||||
double LPw[FRAMESAMPLES_HALF];
|
|
||||||
double HPw[FRAMESAMPLES_HALF];
|
|
||||||
|
|
||||||
double percepFilterParam[(UB_LPC_ORDER+1)*SUBFRAMES];
|
|
||||||
|
|
||||||
double real_f[FRAMESAMPLES_HALF];
|
|
||||||
double imag_f[FRAMESAMPLES_HALF];
|
|
||||||
|
|
||||||
len = 0;
|
|
||||||
|
|
||||||
/* decode & dequantize FiltCoef */
|
|
||||||
err = WebRtcIsac_DecodeInterpolLpcUb(&ISACdecUB_obj->bitstr_obj,
|
|
||||||
percepFilterParam, isac12kHz);
|
|
||||||
if(err < 0) { // error check
|
|
||||||
return err;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* decode & dequantize spectrum */
|
|
||||||
len = WebRtcIsac_DecodeSpecUB12(&ISACdecUB_obj->bitstr_obj,
|
|
||||||
real_f, imag_f);
|
|
||||||
if(len < 0) { // error check
|
|
||||||
return len;
|
|
||||||
}
|
|
||||||
|
|
||||||
if(isRCUPayload)
|
|
||||||
{
|
|
||||||
int n;
|
|
||||||
for(n = 0; n < 240; n++)
|
|
||||||
{
|
|
||||||
real_f[n] *= RCU_TRANSCODING_SCALE_UB_INVERSE;
|
|
||||||
imag_f[n] *= RCU_TRANSCODING_SCALE_UB_INVERSE;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* inverse transform */
|
|
||||||
WebRtcIsac_Spec2time(real_f, imag_f, LPw, HPw, &ISACdecUB_obj->fftstr_obj);
|
|
||||||
|
|
||||||
/* perceptual post-filtering (using normalized lattice filter) */
|
|
||||||
WebRtcIsac_NormLatticeFilterAr(UB_LPC_ORDER,
|
|
||||||
ISACdecUB_obj->maskfiltstr_obj.PostStateLoF,
|
|
||||||
(ISACdecUB_obj->maskfiltstr_obj).PostStateLoG, LPw,
|
|
||||||
percepFilterParam, LP_dec_float);
|
|
||||||
|
|
||||||
/* Zerro for upper-band */
|
|
||||||
memset(HP_dec_float, 0, sizeof(float) * (FRAMESAMPLES_HALF));
|
|
||||||
|
|
||||||
/* recombine the 2 bands */
|
|
||||||
WebRtcIsac_FilterAndCombineFloat(HP_dec_float, LP_dec_float, signal_out,
|
|
||||||
&ISACdecUB_obj->postfiltbankstr_obj);
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
return len;
|
|
||||||
}
|
|
||||||
|
|
@ -1,88 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "structs.h"
|
|
||||||
#include "bandwidth_estimator.h"
|
|
||||||
#include "entropy_coding.h"
|
|
||||||
#include "codec.h"
|
|
||||||
|
|
||||||
|
|
||||||
int
|
|
||||||
WebRtcIsac_EstimateBandwidth(
|
|
||||||
BwEstimatorstr* bwest_str,
|
|
||||||
Bitstr* streamdata,
|
|
||||||
WebRtc_Word32 packet_size,
|
|
||||||
WebRtc_UWord16 rtp_seq_number,
|
|
||||||
WebRtc_UWord32 send_ts,
|
|
||||||
WebRtc_UWord32 arr_ts,
|
|
||||||
enum IsacSamplingRate encoderSampRate,
|
|
||||||
enum IsacSamplingRate decoderSampRate)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 index;
|
|
||||||
WebRtc_Word16 frame_samples;
|
|
||||||
WebRtc_UWord32 sendTimestampIn16kHz;
|
|
||||||
WebRtc_UWord32 arrivalTimestampIn16kHz;
|
|
||||||
WebRtc_UWord32 diffSendTime;
|
|
||||||
WebRtc_UWord32 diffArrivalTime;
|
|
||||||
int err;
|
|
||||||
|
|
||||||
/* decode framelength and BW estimation */
|
|
||||||
err = WebRtcIsac_DecodeFrameLen(streamdata, &frame_samples);
|
|
||||||
if(err < 0) // error check
|
|
||||||
{
|
|
||||||
return err;
|
|
||||||
}
|
|
||||||
err = WebRtcIsac_DecodeSendBW(streamdata, &index);
|
|
||||||
if(err < 0) // error check
|
|
||||||
{
|
|
||||||
return err;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* UPDATE ESTIMATES FROM OTHER SIDE */
|
|
||||||
err = WebRtcIsac_UpdateUplinkBwImpl(bwest_str, index, encoderSampRate);
|
|
||||||
if(err < 0)
|
|
||||||
{
|
|
||||||
return err;
|
|
||||||
}
|
|
||||||
|
|
||||||
// We like BWE to work at 16 kHz sampling rate,
|
|
||||||
// therefore, we have to change the timestamps accordingly.
|
|
||||||
// translate the send timestamp if required
|
|
||||||
diffSendTime = (WebRtc_UWord32)((WebRtc_UWord32)send_ts -
|
|
||||||
(WebRtc_UWord32)bwest_str->senderTimestamp);
|
|
||||||
bwest_str->senderTimestamp = send_ts;
|
|
||||||
|
|
||||||
diffArrivalTime = (WebRtc_UWord32)((WebRtc_UWord32)arr_ts -
|
|
||||||
(WebRtc_UWord32)bwest_str->receiverTimestamp);
|
|
||||||
bwest_str->receiverTimestamp = arr_ts;
|
|
||||||
|
|
||||||
if(decoderSampRate == kIsacSuperWideband)
|
|
||||||
{
|
|
||||||
diffArrivalTime = (WebRtc_UWord32)diffArrivalTime >> 1;
|
|
||||||
diffSendTime = (WebRtc_UWord32)diffSendTime >> 1;
|
|
||||||
}
|
|
||||||
// arrival timestamp in 16 kHz
|
|
||||||
arrivalTimestampIn16kHz = (WebRtc_UWord32)((WebRtc_UWord32)
|
|
||||||
bwest_str->prev_rec_arr_ts + (WebRtc_UWord32)diffArrivalTime);
|
|
||||||
// send timestamp in 16 kHz
|
|
||||||
sendTimestampIn16kHz = (WebRtc_UWord32)((WebRtc_UWord32)
|
|
||||||
bwest_str->prev_rec_send_ts + (WebRtc_UWord32)diffSendTime);
|
|
||||||
|
|
||||||
err = WebRtcIsac_UpdateBandwidthEstimator(bwest_str, rtp_seq_number,
|
|
||||||
(frame_samples * 1000) / FS, sendTimestampIn16kHz,
|
|
||||||
arrivalTimestampIn16kHz, packet_size);
|
|
||||||
// error check
|
|
||||||
if(err < 0)
|
|
||||||
{
|
|
||||||
return err;
|
|
||||||
}
|
|
||||||
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
@ -1,144 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains implementations of the divisions
|
|
||||||
* WebRtcSpl_DivU32U16()
|
|
||||||
* WebRtcSpl_DivW32W16()
|
|
||||||
* WebRtcSpl_DivW32W16ResW16()
|
|
||||||
* WebRtcSpl_DivResultInQ31()
|
|
||||||
* WebRtcSpl_DivW32HiLow()
|
|
||||||
*
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
WebRtc_UWord32 WebRtcSpl_DivU32U16(WebRtc_UWord32 num, WebRtc_UWord16 den)
|
|
||||||
{
|
|
||||||
// Guard against division with 0
|
|
||||||
if (den != 0)
|
|
||||||
{
|
|
||||||
return (WebRtc_UWord32)(num / den);
|
|
||||||
} else
|
|
||||||
{
|
|
||||||
return (WebRtc_UWord32)0xFFFFFFFF;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
WebRtc_Word32 WebRtcSpl_DivW32W16(WebRtc_Word32 num, WebRtc_Word16 den)
|
|
||||||
{
|
|
||||||
// Guard against division with 0
|
|
||||||
if (den != 0)
|
|
||||||
{
|
|
||||||
return (WebRtc_Word32)(num / den);
|
|
||||||
} else
|
|
||||||
{
|
|
||||||
return (WebRtc_Word32)0x7FFFFFFF;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcSpl_DivW32W16ResW16(WebRtc_Word32 num, WebRtc_Word16 den)
|
|
||||||
{
|
|
||||||
// Guard against division with 0
|
|
||||||
if (den != 0)
|
|
||||||
{
|
|
||||||
return (WebRtc_Word16)(num / den);
|
|
||||||
} else
|
|
||||||
{
|
|
||||||
return (WebRtc_Word16)0x7FFF;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
WebRtc_Word32 WebRtcSpl_DivResultInQ31(WebRtc_Word32 num, WebRtc_Word32 den)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 L_num = num;
|
|
||||||
WebRtc_Word32 L_den = den;
|
|
||||||
WebRtc_Word32 div = 0;
|
|
||||||
int k = 31;
|
|
||||||
int change_sign = 0;
|
|
||||||
|
|
||||||
if (num == 0)
|
|
||||||
return 0;
|
|
||||||
|
|
||||||
if (num < 0)
|
|
||||||
{
|
|
||||||
change_sign++;
|
|
||||||
L_num = -num;
|
|
||||||
}
|
|
||||||
if (den < 0)
|
|
||||||
{
|
|
||||||
change_sign++;
|
|
||||||
L_den = -den;
|
|
||||||
}
|
|
||||||
while (k--)
|
|
||||||
{
|
|
||||||
div <<= 1;
|
|
||||||
L_num <<= 1;
|
|
||||||
if (L_num >= L_den)
|
|
||||||
{
|
|
||||||
L_num -= L_den;
|
|
||||||
div++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (change_sign == 1)
|
|
||||||
{
|
|
||||||
div = -div;
|
|
||||||
}
|
|
||||||
return div;
|
|
||||||
}
|
|
||||||
|
|
||||||
WebRtc_Word32 WebRtcSpl_DivW32HiLow(WebRtc_Word32 num, WebRtc_Word16 den_hi,
|
|
||||||
WebRtc_Word16 den_low)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 approx, tmp_hi, tmp_low, num_hi, num_low;
|
|
||||||
WebRtc_Word32 tmpW32;
|
|
||||||
|
|
||||||
approx = (WebRtc_Word16)WebRtcSpl_DivW32W16((WebRtc_Word32)0x1FFFFFFF, den_hi);
|
|
||||||
// result in Q14 (Note: 3FFFFFFF = 0.5 in Q30)
|
|
||||||
|
|
||||||
// tmpW32 = 1/den = approx * (2.0 - den * approx) (in Q30)
|
|
||||||
tmpW32 = (WEBRTC_SPL_MUL_16_16(den_hi, approx) << 1)
|
|
||||||
+ ((WEBRTC_SPL_MUL_16_16(den_low, approx) >> 15) << 1);
|
|
||||||
// tmpW32 = den * approx
|
|
||||||
|
|
||||||
tmpW32 = (WebRtc_Word32)0x7fffffffL - tmpW32; // result in Q30 (tmpW32 = 2.0-(den*approx))
|
|
||||||
|
|
||||||
// Store tmpW32 in hi and low format
|
|
||||||
tmp_hi = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(tmpW32, 16);
|
|
||||||
tmp_low = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((tmpW32
|
|
||||||
- WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)tmp_hi, 16)), 1);
|
|
||||||
|
|
||||||
// tmpW32 = 1/den in Q29
|
|
||||||
tmpW32 = ((WEBRTC_SPL_MUL_16_16(tmp_hi, approx) + (WEBRTC_SPL_MUL_16_16(tmp_low, approx)
|
|
||||||
>> 15)) << 1);
|
|
||||||
|
|
||||||
// 1/den in hi and low format
|
|
||||||
tmp_hi = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(tmpW32, 16);
|
|
||||||
tmp_low = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((tmpW32
|
|
||||||
- WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)tmp_hi, 16)), 1);
|
|
||||||
|
|
||||||
// Store num in hi and low format
|
|
||||||
num_hi = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(num, 16);
|
|
||||||
num_low = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((num
|
|
||||||
- WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)num_hi, 16)), 1);
|
|
||||||
|
|
||||||
// num * (1/den) by 32 bit multiplication (result in Q28)
|
|
||||||
|
|
||||||
tmpW32 = (WEBRTC_SPL_MUL_16_16(num_hi, tmp_hi) + (WEBRTC_SPL_MUL_16_16(num_hi, tmp_low)
|
|
||||||
>> 15) + (WEBRTC_SPL_MUL_16_16(num_low, tmp_hi) >> 15));
|
|
||||||
|
|
||||||
// Put result in Q31 (convert from Q28)
|
|
||||||
tmpW32 = WEBRTC_SPL_LSHIFT_W32(tmpW32, 3);
|
|
||||||
|
|
||||||
return tmpW32;
|
|
||||||
}
|
|
||||||
|
|
@ -1,91 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_DotProductWithScale().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
WebRtc_Word32 WebRtcSpl_DotProductWithScale(WebRtc_Word16 *vector1, WebRtc_Word16 *vector2,
|
|
||||||
int length, int scaling)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 sum;
|
|
||||||
int i;
|
|
||||||
#ifdef _ARM_OPT_
|
|
||||||
#pragma message("NOTE: _ARM_OPT_ optimizations are used")
|
|
||||||
WebRtc_Word16 len4 = (length >> 2) << 2;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
sum = 0;
|
|
||||||
|
|
||||||
#ifndef _ARM_OPT_
|
|
||||||
for (i = 0; i < length; i++)
|
|
||||||
{
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16_RSFT(*vector1++, *vector2++, scaling);
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
if (scaling == 0)
|
|
||||||
{
|
|
||||||
for (i = 0; i < len4; i = i + 4)
|
|
||||||
{
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16(*vector1, *vector2);
|
|
||||||
vector1++;
|
|
||||||
vector2++;
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16(*vector1, *vector2);
|
|
||||||
vector1++;
|
|
||||||
vector2++;
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16(*vector1, *vector2);
|
|
||||||
vector1++;
|
|
||||||
vector2++;
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16(*vector1, *vector2);
|
|
||||||
vector1++;
|
|
||||||
vector2++;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (i = len4; i < length; i++)
|
|
||||||
{
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16(*vector1, *vector2);
|
|
||||||
vector1++;
|
|
||||||
vector2++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
for (i = 0; i < len4; i = i + 4)
|
|
||||||
{
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16_RSFT(*vector1, *vector2, scaling);
|
|
||||||
vector1++;
|
|
||||||
vector2++;
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16_RSFT(*vector1, *vector2, scaling);
|
|
||||||
vector1++;
|
|
||||||
vector2++;
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16_RSFT(*vector1, *vector2, scaling);
|
|
||||||
vector1++;
|
|
||||||
vector2++;
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16_RSFT(*vector1, *vector2, scaling);
|
|
||||||
vector1++;
|
|
||||||
vector2++;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (i = len4; i < length; i++)
|
|
||||||
{
|
|
||||||
sum += WEBRTC_SPL_MUL_16_16_RSFT(*vector1, *vector2, scaling);
|
|
||||||
vector1++;
|
|
||||||
vector2++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
return sum;
|
|
||||||
}
|
|
||||||
|
|
@ -1,59 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_DownsampleFast().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
int WebRtcSpl_DownsampleFast(WebRtc_Word16 *in_ptr, WebRtc_Word16 in_length,
|
|
||||||
WebRtc_Word16 *out_ptr, WebRtc_Word16 out_length,
|
|
||||||
WebRtc_Word16 *B, WebRtc_Word16 B_length, WebRtc_Word16 factor,
|
|
||||||
WebRtc_Word16 delay)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 o;
|
|
||||||
int i, j;
|
|
||||||
|
|
||||||
WebRtc_Word16 *downsampled_ptr = out_ptr;
|
|
||||||
WebRtc_Word16 *b_ptr;
|
|
||||||
WebRtc_Word16 *x_ptr;
|
|
||||||
WebRtc_Word16 endpos = delay
|
|
||||||
+ (WebRtc_Word16)WEBRTC_SPL_MUL_16_16(factor, (out_length - 1)) + 1;
|
|
||||||
|
|
||||||
if (in_length < endpos)
|
|
||||||
{
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (i = delay; i < endpos; i += factor)
|
|
||||||
{
|
|
||||||
b_ptr = &B[0];
|
|
||||||
x_ptr = &in_ptr[i];
|
|
||||||
|
|
||||||
o = (WebRtc_Word32)2048; // Round val
|
|
||||||
|
|
||||||
for (j = 0; j < B_length; j++)
|
|
||||||
{
|
|
||||||
o += WEBRTC_SPL_MUL_16_16(*b_ptr++, *x_ptr--);
|
|
||||||
}
|
|
||||||
|
|
||||||
o = WEBRTC_SPL_RSHIFT_W32(o, 12);
|
|
||||||
|
|
||||||
// If output is higher than 32768, saturate it. Same with negative side
|
|
||||||
|
|
||||||
*downsampled_ptr++ = WebRtcSpl_SatW32ToW16(o);
|
|
||||||
}
|
|
||||||
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
File diff suppressed because it is too large
Load Diff
|
|
@ -1,708 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* code_LPC_UB.c
|
|
||||||
*
|
|
||||||
* This file contains definition of functions used to
|
|
||||||
* encode LPC parameters (Shape & gain) of the upper band.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "encode_lpc_swb.h"
|
|
||||||
#include "typedefs.h"
|
|
||||||
#include "settings.h"
|
|
||||||
|
|
||||||
#include "lpc_shape_swb12_tables.h"
|
|
||||||
#include "lpc_shape_swb16_tables.h"
|
|
||||||
#include "lpc_gain_swb_tables.h"
|
|
||||||
|
|
||||||
#include <stdio.h>
|
|
||||||
#include <string.h>
|
|
||||||
#include <math.h>
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_RemoveLarMean()
|
|
||||||
*
|
|
||||||
* Remove the means from LAR coefficients.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -lar : pointer to lar vectors. LAR vectors are
|
|
||||||
* concatenated.
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -lar : pointer to mean-removed LAR:s.
|
|
||||||
*
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
WebRtc_Word16
|
|
||||||
WebRtcIsac_RemoveLarMean(
|
|
||||||
double* lar,
|
|
||||||
WebRtc_Word16 bandwidth)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 coeffCntr;
|
|
||||||
WebRtc_Word16 vecCntr;
|
|
||||||
WebRtc_Word16 numVec;
|
|
||||||
const double* meanLAR;
|
|
||||||
switch(bandwidth)
|
|
||||||
{
|
|
||||||
case isac12kHz:
|
|
||||||
{
|
|
||||||
numVec = UB_LPC_VEC_PER_FRAME;
|
|
||||||
meanLAR = WebRtcIsac_kMeanLarUb12;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
case isac16kHz:
|
|
||||||
{
|
|
||||||
numVec = UB16_LPC_VEC_PER_FRAME;
|
|
||||||
meanLAR = WebRtcIsac_kMeanLarUb16;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
default:
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
for(vecCntr = 0; vecCntr < numVec; vecCntr++)
|
|
||||||
{
|
|
||||||
for(coeffCntr = 0; coeffCntr < UB_LPC_ORDER; coeffCntr++)
|
|
||||||
{
|
|
||||||
// REMOVE MEAN
|
|
||||||
*lar++ -= meanLAR[coeffCntr];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecorrelateIntraVec()
|
|
||||||
*
|
|
||||||
* Remove the correlation amonge the components of LAR vectors. If LAR vectors
|
|
||||||
* of one frame are put in a matrix where each column is a LAR vector of a
|
|
||||||
* sub-frame, then this is equivalent to multiplying the LAR matrix with
|
|
||||||
* a decorrelting mtrix from left.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -inLar : pointer to mean-removed LAR vecrtors.
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -out : decorrelated LAR vectors.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16
|
|
||||||
WebRtcIsac_DecorrelateIntraVec(
|
|
||||||
const double* data,
|
|
||||||
double* out,
|
|
||||||
WebRtc_Word16 bandwidth)
|
|
||||||
{
|
|
||||||
const double* ptrData;
|
|
||||||
const double* ptrRow;
|
|
||||||
WebRtc_Word16 rowCntr;
|
|
||||||
WebRtc_Word16 colCntr;
|
|
||||||
WebRtc_Word16 larVecCntr;
|
|
||||||
WebRtc_Word16 numVec;
|
|
||||||
const double* decorrMat;
|
|
||||||
switch(bandwidth)
|
|
||||||
{
|
|
||||||
case isac12kHz:
|
|
||||||
{
|
|
||||||
decorrMat = &WebRtcIsac_kIntraVecDecorrMatUb12[0][0];
|
|
||||||
numVec = UB_LPC_VEC_PER_FRAME;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
case isac16kHz:
|
|
||||||
{
|
|
||||||
decorrMat = &WebRtcIsac_kIintraVecDecorrMatUb16[0][0];
|
|
||||||
numVec = UB16_LPC_VEC_PER_FRAME;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
default:
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
//
|
|
||||||
// decorrMat * data
|
|
||||||
//
|
|
||||||
// data is assumed to contain 'numVec' of LAR
|
|
||||||
// vectors (mean removed) each of dimension 'UB_LPC_ORDER'
|
|
||||||
// concatenated one after the other.
|
|
||||||
//
|
|
||||||
|
|
||||||
ptrData = data;
|
|
||||||
for(larVecCntr = 0; larVecCntr < numVec; larVecCntr++)
|
|
||||||
{
|
|
||||||
for(rowCntr = 0; rowCntr < UB_LPC_ORDER; rowCntr++)
|
|
||||||
{
|
|
||||||
ptrRow = &decorrMat[rowCntr * UB_LPC_ORDER];
|
|
||||||
*out = 0;
|
|
||||||
for(colCntr = 0; colCntr < UB_LPC_ORDER; colCntr++)
|
|
||||||
{
|
|
||||||
*out += ptrData[colCntr] * ptrRow[colCntr];
|
|
||||||
}
|
|
||||||
out++;
|
|
||||||
}
|
|
||||||
ptrData += UB_LPC_ORDER;
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecorrelateInterVec()
|
|
||||||
*
|
|
||||||
* Remover the correlation among mean-removed LAR vectors. If LAR vectors
|
|
||||||
* of one frame are put in a matrix where each column is a LAR vector of a
|
|
||||||
* sub-frame, then this is equivalent to multiplying the LAR matrix with
|
|
||||||
* a decorrelting mtrix from right.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -data : pointer to matrix of LAR vectors. The matrix
|
|
||||||
* is stored column-wise.
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -out : decorrelated LAR vectors.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16
|
|
||||||
WebRtcIsac_DecorrelateInterVec(
|
|
||||||
const double* data,
|
|
||||||
double* out,
|
|
||||||
WebRtc_Word16 bandwidth)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 coeffCntr;
|
|
||||||
WebRtc_Word16 rowCntr;
|
|
||||||
WebRtc_Word16 colCntr;
|
|
||||||
const double* decorrMat;
|
|
||||||
WebRtc_Word16 interVecDim;
|
|
||||||
|
|
||||||
switch(bandwidth)
|
|
||||||
{
|
|
||||||
case isac12kHz:
|
|
||||||
{
|
|
||||||
decorrMat = &WebRtcIsac_kInterVecDecorrMatUb12[0][0];
|
|
||||||
interVecDim = UB_LPC_VEC_PER_FRAME;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
case isac16kHz:
|
|
||||||
{
|
|
||||||
decorrMat = &WebRtcIsac_kInterVecDecorrMatUb16[0][0];
|
|
||||||
interVecDim = UB16_LPC_VEC_PER_FRAME;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
default:
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
//
|
|
||||||
// data * decorrMat
|
|
||||||
//
|
|
||||||
// data is of size 'interVecDim' * 'UB_LPC_ORDER'
|
|
||||||
// That is 'interVecDim' of LAR vectors (mean removed)
|
|
||||||
// in columns each of dimension 'UB_LPC_ORDER'.
|
|
||||||
// matrix is stored column-wise.
|
|
||||||
//
|
|
||||||
|
|
||||||
for(coeffCntr = 0; coeffCntr < UB_LPC_ORDER; coeffCntr++)
|
|
||||||
{
|
|
||||||
for(colCntr = 0; colCntr < interVecDim; colCntr++)
|
|
||||||
{
|
|
||||||
out[coeffCntr + colCntr * UB_LPC_ORDER] = 0;
|
|
||||||
for(rowCntr = 0; rowCntr < interVecDim; rowCntr++)
|
|
||||||
{
|
|
||||||
out[coeffCntr + colCntr * UB_LPC_ORDER] +=
|
|
||||||
data[coeffCntr + rowCntr * UB_LPC_ORDER] *
|
|
||||||
decorrMat[rowCntr * interVecDim + colCntr];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_QuantizeUncorrLar()
|
|
||||||
*
|
|
||||||
* Quantize the uncorrelated parameters.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -data : uncorrelated LAR vectors.
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -data : quantized version of the input.
|
|
||||||
* -idx : pointer to quantization indices.
|
|
||||||
*/
|
|
||||||
double
|
|
||||||
WebRtcIsac_QuantizeUncorrLar(
|
|
||||||
double* data,
|
|
||||||
int* recIdx,
|
|
||||||
WebRtc_Word16 bandwidth)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 cntr;
|
|
||||||
WebRtc_Word32 idx;
|
|
||||||
WebRtc_Word16 interVecDim;
|
|
||||||
const double* leftRecPoint;
|
|
||||||
double quantizationStepSize;
|
|
||||||
const WebRtc_Word16* numQuantCell;
|
|
||||||
switch(bandwidth)
|
|
||||||
{
|
|
||||||
case isac12kHz:
|
|
||||||
{
|
|
||||||
leftRecPoint = WebRtcIsac_kLpcShapeLeftRecPointUb12;
|
|
||||||
quantizationStepSize = WebRtcIsac_kLpcShapeQStepSizeUb12;
|
|
||||||
numQuantCell = WebRtcIsac_kLpcShapeNumRecPointUb12;
|
|
||||||
interVecDim = UB_LPC_VEC_PER_FRAME;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
case isac16kHz:
|
|
||||||
{
|
|
||||||
leftRecPoint = WebRtcIsac_kLpcShapeLeftRecPointUb16;
|
|
||||||
quantizationStepSize = WebRtcIsac_kLpcShapeQStepSizeUb16;
|
|
||||||
numQuantCell = WebRtcIsac_kLpcShapeNumRecPointUb16;
|
|
||||||
interVecDim = UB16_LPC_VEC_PER_FRAME;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
default:
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
//
|
|
||||||
// Quantize the parametrs.
|
|
||||||
//
|
|
||||||
for(cntr = 0; cntr < UB_LPC_ORDER * interVecDim; cntr++)
|
|
||||||
{
|
|
||||||
idx = (WebRtc_Word32)floor((*data - leftRecPoint[cntr]) /
|
|
||||||
quantizationStepSize + 0.5);
|
|
||||||
if(idx < 0)
|
|
||||||
{
|
|
||||||
idx = 0;
|
|
||||||
}
|
|
||||||
else if(idx >= numQuantCell[cntr])
|
|
||||||
{
|
|
||||||
idx = numQuantCell[cntr] - 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
*data++ = leftRecPoint[cntr] + idx * quantizationStepSize;
|
|
||||||
*recIdx++ = idx;
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DequantizeLpcParam()
|
|
||||||
*
|
|
||||||
* Get the quantized value of uncorrelated LARs given the quantization indices.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -idx : pointer to quantiztion indices.
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -out : pointer to quantized values.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16
|
|
||||||
WebRtcIsac_DequantizeLpcParam(
|
|
||||||
const int* idx,
|
|
||||||
double* out,
|
|
||||||
WebRtc_Word16 bandwidth)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 cntr;
|
|
||||||
WebRtc_Word16 interVecDim;
|
|
||||||
const double* leftRecPoint;
|
|
||||||
double quantizationStepSize;
|
|
||||||
|
|
||||||
switch(bandwidth)
|
|
||||||
{
|
|
||||||
case isac12kHz:
|
|
||||||
{
|
|
||||||
leftRecPoint = WebRtcIsac_kLpcShapeLeftRecPointUb12;
|
|
||||||
quantizationStepSize = WebRtcIsac_kLpcShapeQStepSizeUb12;
|
|
||||||
interVecDim = UB_LPC_VEC_PER_FRAME;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
case isac16kHz:
|
|
||||||
{
|
|
||||||
leftRecPoint = WebRtcIsac_kLpcShapeLeftRecPointUb16;
|
|
||||||
quantizationStepSize = WebRtcIsac_kLpcShapeQStepSizeUb16;
|
|
||||||
interVecDim = UB16_LPC_VEC_PER_FRAME;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
default:
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
//
|
|
||||||
// Dequantize given the quantization indices
|
|
||||||
//
|
|
||||||
|
|
||||||
for(cntr = 0; cntr < UB_LPC_ORDER * interVecDim; cntr++)
|
|
||||||
{
|
|
||||||
*out++ = leftRecPoint[cntr] + *idx++ * quantizationStepSize;
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_CorrelateIntraVec()
|
|
||||||
*
|
|
||||||
* This is the inverse of WebRtcIsac_DecorrelateIntraVec().
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -data : uncorrelated parameters.
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -out : correlated parametrs.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16
|
|
||||||
WebRtcIsac_CorrelateIntraVec(
|
|
||||||
const double* data,
|
|
||||||
double* out,
|
|
||||||
WebRtc_Word16 bandwidth)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 vecCntr;
|
|
||||||
WebRtc_Word16 rowCntr;
|
|
||||||
WebRtc_Word16 colCntr;
|
|
||||||
WebRtc_Word16 numVec;
|
|
||||||
const double* ptrData;
|
|
||||||
const double* intraVecDecorrMat;
|
|
||||||
|
|
||||||
switch(bandwidth)
|
|
||||||
{
|
|
||||||
case isac12kHz:
|
|
||||||
{
|
|
||||||
numVec = UB_LPC_VEC_PER_FRAME;
|
|
||||||
intraVecDecorrMat = &WebRtcIsac_kIntraVecDecorrMatUb12[0][0];
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
case isac16kHz:
|
|
||||||
{
|
|
||||||
numVec = UB16_LPC_VEC_PER_FRAME;
|
|
||||||
intraVecDecorrMat = &WebRtcIsac_kIintraVecDecorrMatUb16[0][0];
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
default:
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
ptrData = data;
|
|
||||||
for(vecCntr = 0; vecCntr < numVec; vecCntr++)
|
|
||||||
{
|
|
||||||
for(colCntr = 0; colCntr < UB_LPC_ORDER; colCntr++)
|
|
||||||
{
|
|
||||||
*out = 0;
|
|
||||||
for(rowCntr = 0; rowCntr < UB_LPC_ORDER; rowCntr++)
|
|
||||||
{
|
|
||||||
*out += ptrData[rowCntr] *
|
|
||||||
intraVecDecorrMat[rowCntr * UB_LPC_ORDER + colCntr];
|
|
||||||
}
|
|
||||||
out++;
|
|
||||||
}
|
|
||||||
ptrData += UB_LPC_ORDER;
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_CorrelateInterVec()
|
|
||||||
*
|
|
||||||
* This is the inverse of WebRtcIsac_DecorrelateInterVec().
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -data
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -out : correlated parametrs.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16
|
|
||||||
WebRtcIsac_CorrelateInterVec(
|
|
||||||
const double* data,
|
|
||||||
double* out,
|
|
||||||
WebRtc_Word16 bandwidth)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 coeffCntr;
|
|
||||||
WebRtc_Word16 rowCntr;
|
|
||||||
WebRtc_Word16 colCntr;
|
|
||||||
WebRtc_Word16 interVecDim;
|
|
||||||
double myVec[UB16_LPC_VEC_PER_FRAME];
|
|
||||||
const double* interVecDecorrMat;
|
|
||||||
|
|
||||||
switch(bandwidth)
|
|
||||||
{
|
|
||||||
case isac12kHz:
|
|
||||||
{
|
|
||||||
interVecDim = UB_LPC_VEC_PER_FRAME;
|
|
||||||
interVecDecorrMat = &WebRtcIsac_kInterVecDecorrMatUb12[0][0];
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
case isac16kHz:
|
|
||||||
{
|
|
||||||
interVecDim = UB16_LPC_VEC_PER_FRAME;
|
|
||||||
interVecDecorrMat = &WebRtcIsac_kInterVecDecorrMatUb16[0][0];
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
default:
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
for(coeffCntr = 0; coeffCntr < UB_LPC_ORDER; coeffCntr++)
|
|
||||||
{
|
|
||||||
for(rowCntr = 0; rowCntr < interVecDim; rowCntr++)
|
|
||||||
{
|
|
||||||
myVec[rowCntr] = 0;
|
|
||||||
for(colCntr = 0; colCntr < interVecDim; colCntr++)
|
|
||||||
{
|
|
||||||
myVec[rowCntr] += data[coeffCntr + colCntr * UB_LPC_ORDER] * //*ptrData *
|
|
||||||
interVecDecorrMat[rowCntr * interVecDim + colCntr];
|
|
||||||
//ptrData += UB_LPC_ORDER;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
for(rowCntr = 0; rowCntr < interVecDim; rowCntr++)
|
|
||||||
{
|
|
||||||
out[coeffCntr + rowCntr * UB_LPC_ORDER] = myVec[rowCntr];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_AddLarMean()
|
|
||||||
*
|
|
||||||
* This is the inverse of WebRtcIsac_RemoveLarMean()
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -data : pointer to mean-removed LAR:s.
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -data : pointer to LARs.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16
|
|
||||||
WebRtcIsac_AddLarMean(
|
|
||||||
double* data,
|
|
||||||
WebRtc_Word16 bandwidth)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 coeffCntr;
|
|
||||||
WebRtc_Word16 vecCntr;
|
|
||||||
WebRtc_Word16 numVec;
|
|
||||||
const double* meanLAR;
|
|
||||||
|
|
||||||
switch(bandwidth)
|
|
||||||
{
|
|
||||||
case isac12kHz:
|
|
||||||
{
|
|
||||||
numVec = UB_LPC_VEC_PER_FRAME;
|
|
||||||
meanLAR = WebRtcIsac_kMeanLarUb12;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
case isac16kHz:
|
|
||||||
{
|
|
||||||
numVec = UB16_LPC_VEC_PER_FRAME;
|
|
||||||
meanLAR = WebRtcIsac_kMeanLarUb16;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
default:
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
for(vecCntr = 0; vecCntr < numVec; vecCntr++)
|
|
||||||
{
|
|
||||||
for(coeffCntr = 0; coeffCntr < UB_LPC_ORDER; coeffCntr++)
|
|
||||||
{
|
|
||||||
*data++ += meanLAR[coeffCntr];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_ToLogDomainRemoveMean()
|
|
||||||
*
|
|
||||||
* Transform the LPC gain to log domain then remove the mean value.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -lpcGain : pointer to LPC Gain, expecting 6 LPC gains
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -lpcGain : mean-removed in log domain.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16
|
|
||||||
WebRtcIsac_ToLogDomainRemoveMean(
|
|
||||||
double* data)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 coeffCntr;
|
|
||||||
for(coeffCntr = 0; coeffCntr < UB_LPC_GAIN_DIM; coeffCntr++)
|
|
||||||
{
|
|
||||||
data[coeffCntr] = log(data[coeffCntr]) - WebRtcIsac_kMeanLpcGain;
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecorrelateLPGain()
|
|
||||||
*
|
|
||||||
* Decorrelate LPC gains. There are 6 LPC Gains per frame. This is like
|
|
||||||
* multiplying gain vector with decorrelating matrix.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -data : LPC gain in log-domain with mean removed.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -out : decorrelated parameters.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_DecorrelateLPGain(
|
|
||||||
const double* data,
|
|
||||||
double* out)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 rowCntr;
|
|
||||||
WebRtc_Word16 colCntr;
|
|
||||||
|
|
||||||
for(colCntr = 0; colCntr < UB_LPC_GAIN_DIM; colCntr++)
|
|
||||||
{
|
|
||||||
*out = 0;
|
|
||||||
for(rowCntr = 0; rowCntr < UB_LPC_GAIN_DIM; rowCntr++)
|
|
||||||
{
|
|
||||||
*out += data[rowCntr] * WebRtcIsac_kLpcGainDecorrMat[rowCntr][colCntr];
|
|
||||||
}
|
|
||||||
out++;
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_QuantizeLpcGain()
|
|
||||||
*
|
|
||||||
* Quantize the decorrelated log-domain gains.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -lpcGain : uncorrelated LPC gains.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -idx : quantization indices
|
|
||||||
* -lpcGain : quantized value of the inpt.
|
|
||||||
*/
|
|
||||||
double WebRtcIsac_QuantizeLpcGain(
|
|
||||||
double* data,
|
|
||||||
int* idx)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 coeffCntr;
|
|
||||||
for(coeffCntr = 0; coeffCntr < UB_LPC_GAIN_DIM; coeffCntr++)
|
|
||||||
{
|
|
||||||
*idx = (int)floor((*data - WebRtcIsac_kLeftRecPointLpcGain[coeffCntr]) /
|
|
||||||
WebRtcIsac_kQSizeLpcGain + 0.5);
|
|
||||||
|
|
||||||
if(*idx < 0)
|
|
||||||
{
|
|
||||||
*idx = 0;
|
|
||||||
}
|
|
||||||
else if(*idx >= WebRtcIsac_kNumQCellLpcGain[coeffCntr])
|
|
||||||
{
|
|
||||||
*idx = WebRtcIsac_kNumQCellLpcGain[coeffCntr] - 1;
|
|
||||||
}
|
|
||||||
*data = WebRtcIsac_kLeftRecPointLpcGain[coeffCntr] + *idx *
|
|
||||||
WebRtcIsac_kQSizeLpcGain;
|
|
||||||
|
|
||||||
data++;
|
|
||||||
idx++;
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DequantizeLpcGain()
|
|
||||||
*
|
|
||||||
* Get the quantized values given the quantization indices.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -idx : pointer to quantization indices.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -lpcGains : quantized values of the given parametes.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_DequantizeLpcGain(
|
|
||||||
const int* idx,
|
|
||||||
double* out)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 coeffCntr;
|
|
||||||
for(coeffCntr = 0; coeffCntr < UB_LPC_GAIN_DIM; coeffCntr++)
|
|
||||||
{
|
|
||||||
*out = WebRtcIsac_kLeftRecPointLpcGain[coeffCntr] + *idx *
|
|
||||||
WebRtcIsac_kQSizeLpcGain;
|
|
||||||
out++;
|
|
||||||
idx++;
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_CorrelateLpcGain()
|
|
||||||
*
|
|
||||||
* This is the inverse of WebRtcIsac_DecorrelateLPGain().
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -data : decorrelated parameters.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -out : correlated parameters.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_CorrelateLpcGain(
|
|
||||||
const double* data,
|
|
||||||
double* out)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 rowCntr;
|
|
||||||
WebRtc_Word16 colCntr;
|
|
||||||
|
|
||||||
for(rowCntr = 0; rowCntr < UB_LPC_GAIN_DIM; rowCntr++)
|
|
||||||
{
|
|
||||||
*out = 0;
|
|
||||||
for(colCntr = 0; colCntr < UB_LPC_GAIN_DIM; colCntr++)
|
|
||||||
{
|
|
||||||
*out += WebRtcIsac_kLpcGainDecorrMat[rowCntr][colCntr] * data[colCntr];
|
|
||||||
}
|
|
||||||
out++;
|
|
||||||
}
|
|
||||||
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_AddMeanToLinearDomain()
|
|
||||||
*
|
|
||||||
* This is the inverse of WebRtcIsac_ToLogDomainRemoveMean().
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -lpcGain : LPC gain in log-domain & mean removed
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -lpcGain : LPC gain in normal domain.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_AddMeanToLinearDomain(
|
|
||||||
double* lpcGains)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 coeffCntr;
|
|
||||||
for(coeffCntr = 0; coeffCntr < UB_LPC_GAIN_DIM; coeffCntr++)
|
|
||||||
{
|
|
||||||
lpcGains[coeffCntr] = exp(lpcGains[coeffCntr] + WebRtcIsac_kMeanLpcGain);
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
@ -1,283 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* encode_lpc_swb.h
|
|
||||||
*
|
|
||||||
* This file contains declaration of functions used to
|
|
||||||
* encode LPC parameters (Shape & gain) of the upper band.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_ENCODE_LPC_SWB_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_ENCODE_LPC_SWB_H_
|
|
||||||
|
|
||||||
#include "typedefs.h"
|
|
||||||
#include "settings.h"
|
|
||||||
#include "structs.h"
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_RemoveLarMean()
|
|
||||||
*
|
|
||||||
* Remove the means from LAR coefficients.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -lar : pointer to lar vectors. LAR vectors are
|
|
||||||
* concatenated.
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -lar : pointer to mean-removed LAR:s.
|
|
||||||
*
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_RemoveLarMean(
|
|
||||||
double* lar,
|
|
||||||
WebRtc_Word16 bandwidth);
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecorrelateIntraVec()
|
|
||||||
*
|
|
||||||
* Remove the correlation amonge the components of LAR vectors. If LAR vectors
|
|
||||||
* of one frame are put in a matrix where each column is a LAR vector of a
|
|
||||||
* sub-frame, then this is equivalent to multiplying the LAR matrix with
|
|
||||||
* a decorrelting mtrix from left.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -inLar : pointer to mean-removed LAR vecrtors.
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -out : decorrelated LAR vectors.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_DecorrelateIntraVec(
|
|
||||||
const double* inLAR,
|
|
||||||
double* out,
|
|
||||||
WebRtc_Word16 bandwidth);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecorrelateInterVec()
|
|
||||||
*
|
|
||||||
* Remover the correlation among mean-removed LAR vectors. If LAR vectors
|
|
||||||
* of one frame are put in a matrix where each column is a LAR vector of a
|
|
||||||
* sub-frame, then this is equivalent to multiplying the LAR matrix with
|
|
||||||
* a decorrelting mtrix from right.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -data : pointer to matrix of LAR vectors. The matrix
|
|
||||||
* is stored column-wise.
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -out : decorrelated LAR vectors.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_DecorrelateInterVec(
|
|
||||||
const double* data,
|
|
||||||
double* out,
|
|
||||||
WebRtc_Word16 bandwidth);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_QuantizeUncorrLar()
|
|
||||||
*
|
|
||||||
* Quantize the uncorrelated parameters.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -data : uncorrelated LAR vectors.
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -data : quantized version of the input.
|
|
||||||
* -idx : pointer to quantization indices.
|
|
||||||
*/
|
|
||||||
double WebRtcIsac_QuantizeUncorrLar(
|
|
||||||
double* data,
|
|
||||||
int* idx,
|
|
||||||
WebRtc_Word16 bandwidth);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_CorrelateIntraVec()
|
|
||||||
*
|
|
||||||
* This is the inverse of WebRtcIsac_DecorrelateIntraVec().
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -data : uncorrelated parameters.
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -out : correlated parametrs.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_CorrelateIntraVec(
|
|
||||||
const double* data,
|
|
||||||
double* out,
|
|
||||||
WebRtc_Word16 bandwidth);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_CorrelateInterVec()
|
|
||||||
*
|
|
||||||
* This is the inverse of WebRtcIsac_DecorrelateInterVec().
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -data
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -out : correlated parametrs.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_CorrelateInterVec(
|
|
||||||
const double* data,
|
|
||||||
double* out,
|
|
||||||
WebRtc_Word16 bandwidth);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_AddLarMean()
|
|
||||||
*
|
|
||||||
* This is the inverse of WebRtcIsac_RemoveLarMean()
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -data : pointer to mean-removed LAR:s.
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -data : pointer to LARs.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_AddLarMean(
|
|
||||||
double* data,
|
|
||||||
WebRtc_Word16 bandwidth);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DequantizeLpcParam()
|
|
||||||
*
|
|
||||||
* Get the quantized value of uncorrelated LARs given the quantization indices.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -idx : pointer to quantiztion indices.
|
|
||||||
* -bandwidth : indicates if the given LAR vectors belong
|
|
||||||
* to SWB-12kHz or SWB-16kHz.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -out : pointer to quantized values.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_DequantizeLpcParam(
|
|
||||||
const int* idx,
|
|
||||||
double* out,
|
|
||||||
WebRtc_Word16 bandwidth);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_ToLogDomainRemoveMean()
|
|
||||||
*
|
|
||||||
* Transform the LPC gain to log domain then remove the mean value.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -lpcGain : pointer to LPC Gain, expecting 6 LPC gains
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -lpcGain : mean-removed in log domain.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_ToLogDomainRemoveMean(
|
|
||||||
double* lpGains);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecorrelateLPGain()
|
|
||||||
*
|
|
||||||
* Decorrelate LPC gains. There are 6 LPC Gains per frame. This is like
|
|
||||||
* multiplying gain vector with decorrelating matrix.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -data : LPC gain in log-domain with mean removed.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -out : decorrelated parameters.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_DecorrelateLPGain(
|
|
||||||
const double* data,
|
|
||||||
double* out);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_QuantizeLpcGain()
|
|
||||||
*
|
|
||||||
* Quantize the decorrelated log-domain gains.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -lpcGain : uncorrelated LPC gains.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -idx : quantization indices
|
|
||||||
* -lpcGain : quantized value of the inpt.
|
|
||||||
*/
|
|
||||||
double WebRtcIsac_QuantizeLpcGain(
|
|
||||||
double* lpGains,
|
|
||||||
int* idx);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DequantizeLpcGain()
|
|
||||||
*
|
|
||||||
* Get the quantized values given the quantization indices.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -idx : pointer to quantization indices.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -lpcGains : quantized values of the given parametes.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_DequantizeLpcGain(
|
|
||||||
const int* idx,
|
|
||||||
double* lpGains);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_CorrelateLpcGain()
|
|
||||||
*
|
|
||||||
* This is the inverse of WebRtcIsac_DecorrelateLPGain().
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -data : decorrelated parameters.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -out : correlated parameters.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_CorrelateLpcGain(
|
|
||||||
const double* data,
|
|
||||||
double* out);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_AddMeanToLinearDomain()
|
|
||||||
*
|
|
||||||
* This is the inverse of WebRtcIsac_ToLogDomainRemoveMean().
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -lpcGain : LPC gain in log-domain & mean removed
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -lpcGain : LPC gain in normal domain.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_AddMeanToLinearDomain(
|
|
||||||
double* lpcGains);
|
|
||||||
|
|
||||||
|
|
||||||
#endif // WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_ENCODE_LPC_SWB_H_
|
|
||||||
|
|
@ -1,36 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_Energy().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
WebRtc_Word32 WebRtcSpl_Energy(WebRtc_Word16* vector, int vector_length, int* scale_factor)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 en = 0;
|
|
||||||
int i;
|
|
||||||
int scaling = WebRtcSpl_GetScalingSquare(vector, vector_length, vector_length);
|
|
||||||
int looptimes = vector_length;
|
|
||||||
WebRtc_Word16 *vectorptr = vector;
|
|
||||||
|
|
||||||
for (i = 0; i < looptimes; i++)
|
|
||||||
{
|
|
||||||
en += WEBRTC_SPL_MUL_16_16_RSFT(*vectorptr, *vectorptr, scaling);
|
|
||||||
vectorptr++;
|
|
||||||
}
|
|
||||||
*scale_factor = scaling;
|
|
||||||
|
|
||||||
return en;
|
|
||||||
}
|
|
||||||
File diff suppressed because it is too large
Load Diff
|
|
@ -1,412 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* entropy_coding.h
|
|
||||||
*
|
|
||||||
* This header file declares all of the functions used to arithmetically
|
|
||||||
* encode the iSAC bistream
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_ENTROPY_CODING_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_ENTROPY_CODING_H_
|
|
||||||
|
|
||||||
#include "structs.h"
|
|
||||||
|
|
||||||
/* decode complex spectrum (return number of bytes in stream) */
|
|
||||||
int WebRtcIsac_DecodeSpecLb(Bitstr *streamdata,
|
|
||||||
double *fr,
|
|
||||||
double *fi,
|
|
||||||
WebRtc_Word16 AvgPitchGain_Q12);
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecodeSpecUB16()
|
|
||||||
* Decode real and imaginary part of the DFT coefficients, given a bit-stream.
|
|
||||||
* This function is called when the codec is in 0-16 kHz bandwidth.
|
|
||||||
* The decoded DFT coefficient can be transformed to time domain by
|
|
||||||
* WebRtcIsac_Time2Spec().
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - streamdata : pointer to a stucture containg the encoded
|
|
||||||
* data and theparameters needed for entropy
|
|
||||||
* coding.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -*fr : pointer to a buffer where the real part of DFT
|
|
||||||
* coefficients are written to.
|
|
||||||
* -*fi : pointer to a buffer where the imaginary part
|
|
||||||
* of DFT coefficients are written to.
|
|
||||||
*
|
|
||||||
* Return value : < 0 if an error occures
|
|
||||||
* 0 if succeeded.
|
|
||||||
*/
|
|
||||||
int WebRtcIsac_DecodeSpecUB16(
|
|
||||||
Bitstr* streamdata,
|
|
||||||
double* fr,
|
|
||||||
double* fi);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecodeSpecUB12()
|
|
||||||
* Decode real and imaginary part of the DFT coefficients, given a bit-stream.
|
|
||||||
* This function is called when the codec is in 0-12 kHz bandwidth.
|
|
||||||
* The decoded DFT coefficient can be transformed to time domain by
|
|
||||||
* WebRtcIsac_Time2Spec().
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - streamdata : pointer to a stucture containg the encoded
|
|
||||||
* data and theparameters needed for entropy
|
|
||||||
* coding.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* -*fr : pointer to a buffer where the real part of DFT
|
|
||||||
* coefficients are written to.
|
|
||||||
* -*fi : pointer to a buffer where the imaginary part
|
|
||||||
* of DFT coefficients are written to.
|
|
||||||
*
|
|
||||||
* Return value : < 0 if an error occures
|
|
||||||
* 0 if succeeded.
|
|
||||||
*/
|
|
||||||
int WebRtcIsac_DecodeSpecUB12(
|
|
||||||
Bitstr* streamdata,
|
|
||||||
double* fr,
|
|
||||||
double* fi);
|
|
||||||
|
|
||||||
|
|
||||||
/* encode complex spectrum */
|
|
||||||
int WebRtcIsac_EncodeSpecLb(const WebRtc_Word16* fr,
|
|
||||||
const WebRtc_Word16* fi,
|
|
||||||
Bitstr* streamdata,
|
|
||||||
WebRtc_Word16 AvgPitchGain_Q12);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_EncodeSpecUB16()
|
|
||||||
* Quantize and encode real and imaginary part of the DFT coefficients.
|
|
||||||
* This function is called when the codec is in 0-16 kHz bandwidth.
|
|
||||||
* The real and imaginary part are computed by calling WebRtcIsac_Time2Spec().
|
|
||||||
*
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -*fr : pointer to a buffer where the real part of DFT
|
|
||||||
* coefficients are stored.
|
|
||||||
* -*fi : pointer to a buffer where the imaginary part
|
|
||||||
* of DFT coefficients are stored.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - streamdata : pointer to a stucture containg the encoded
|
|
||||||
* data and theparameters needed for entropy
|
|
||||||
* coding.
|
|
||||||
*
|
|
||||||
* Return value : < 0 if an error occures
|
|
||||||
* 0 if succeeded.
|
|
||||||
*/
|
|
||||||
int WebRtcIsac_EncodeSpecUB16(
|
|
||||||
const WebRtc_Word16* fr,
|
|
||||||
const WebRtc_Word16* fi,
|
|
||||||
Bitstr* streamdata);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_EncodeSpecUB12()
|
|
||||||
* Quantize and encode real and imaginary part of the DFT coefficients.
|
|
||||||
* This function is called when the codec is in 0-12 kHz bandwidth.
|
|
||||||
* The real and imaginary part are computed by calling WebRtcIsac_Time2Spec().
|
|
||||||
*
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* -*fr : pointer to a buffer where the real part of DFT
|
|
||||||
* coefficients are stored.
|
|
||||||
* -*fi : pointer to a buffer where the imaginary part
|
|
||||||
* of DFT coefficients are stored.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - streamdata : pointer to a stucture containg the encoded
|
|
||||||
* data and theparameters needed for entropy
|
|
||||||
* coding.
|
|
||||||
*
|
|
||||||
* Return value : < 0 if an error occures
|
|
||||||
* 0 if succeeded.
|
|
||||||
*/
|
|
||||||
int WebRtcIsac_EncodeSpecUB12(
|
|
||||||
const WebRtc_Word16* fr,
|
|
||||||
const WebRtc_Word16* fi,
|
|
||||||
Bitstr* streamdata);
|
|
||||||
|
|
||||||
|
|
||||||
/* decode & dequantize LPC Coef */
|
|
||||||
int WebRtcIsac_DecodeLpcCoef(Bitstr *streamdata, double *LPCCoef, int *outmodel);
|
|
||||||
int WebRtcIsac_DecodeLpcCoefUB(
|
|
||||||
Bitstr* streamdata,
|
|
||||||
double* lpcVecs,
|
|
||||||
double* percepFilterGains,
|
|
||||||
WebRtc_Word16 bandwidth);
|
|
||||||
|
|
||||||
int WebRtcIsac_DecodeLpc(Bitstr *streamdata, double *LPCCoef_lo, double *LPCCoef_hi, int *outmodel);
|
|
||||||
|
|
||||||
/* quantize & code LPC Coef */
|
|
||||||
void WebRtcIsac_EncodeLpcLb(double *LPCCoef_lo, double *LPCCoef_hi, int *model, double *size, Bitstr *streamdata, ISAC_SaveEncData_t* encData);
|
|
||||||
void WebRtcIsac_EncodeLpcGainLb(double *LPCCoef_lo, double *LPCCoef_hi, int model, Bitstr *streamdata, ISAC_SaveEncData_t* encData);
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_EncodeLpcUB()
|
|
||||||
* Encode LPC parameters, given as A-polynomial, of upper-band. The encoding
|
|
||||||
* is performed in LAR domain.
|
|
||||||
* For the upper-band, we compute and encode LPC of some sub-frames, LPC of
|
|
||||||
* other sub-frames are computed by linear interpolation, in LAR domain. This
|
|
||||||
* function performs the interpolation and returns the LPC of all sub-frames.
|
|
||||||
*
|
|
||||||
* Inputs:
|
|
||||||
* - lpcCoef : a buffer containing A-polynomials of sub-frames
|
|
||||||
* (excluding first coefficient that is 1).
|
|
||||||
* - bandwidth : specifies if the codec is operating at 0-12 kHz
|
|
||||||
* or 0-16 kHz mode.
|
|
||||||
*
|
|
||||||
* Input/output:
|
|
||||||
* - streamdata : pointer to a stucture containg the encoded
|
|
||||||
* data and theparameters needed for entropy
|
|
||||||
* coding.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - interpolLPCCoeff : Decoded and interpolated LPC (A-polynomial)
|
|
||||||
* of all sub-frames.
|
|
||||||
* If LP analysis is of order K, and there are N
|
|
||||||
* sub-frames then this is a buffer of size
|
|
||||||
* (k + 1) * N, each vector starts with the LPC gain
|
|
||||||
* of the corresponding sub-frame. The LPC gains
|
|
||||||
* are encoded and inserted after this function is
|
|
||||||
* called. The first A-coefficient which is 1 is not
|
|
||||||
* included.
|
|
||||||
*
|
|
||||||
* Return value : 0 if encoding is successful,
|
|
||||||
* <0 if failed to encode.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_EncodeLpcUB(
|
|
||||||
double* lpcCoeff,
|
|
||||||
Bitstr* streamdata,
|
|
||||||
double* interpolLPCCoeff,
|
|
||||||
WebRtc_Word16 bandwidth,
|
|
||||||
ISACUBSaveEncDataStruct* encData);
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecodeInterpolLpcUb()
|
|
||||||
* Decode LPC coefficients and interpolate to get the coefficients fo all
|
|
||||||
* sub-frmaes.
|
|
||||||
*
|
|
||||||
* Inputs:
|
|
||||||
* - bandwidth : spepecifies if the codec is in 0-12 kHz or
|
|
||||||
* 0-16 kHz mode.
|
|
||||||
*
|
|
||||||
* Input/output:
|
|
||||||
* - streamdata : pointer to a stucture containg the encoded
|
|
||||||
* data and theparameters needed for entropy
|
|
||||||
* coding.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - percepFilterParam : Decoded and interpolated LPC (A-polynomial) of
|
|
||||||
* all sub-frames.
|
|
||||||
* If LP analysis is of order K, and there are N
|
|
||||||
* sub-frames then this is a buffer of size
|
|
||||||
* (k + 1) * N, each vector starts with the LPC gain
|
|
||||||
* of the corresponding sub-frame. The LPC gains
|
|
||||||
* are encoded and inserted after this function is
|
|
||||||
* called. The first A-coefficient which is 1 is not
|
|
||||||
* included.
|
|
||||||
*
|
|
||||||
* Return value : 0 if encoding is successful,
|
|
||||||
* <0 if failed to encode.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_DecodeInterpolLpcUb(
|
|
||||||
Bitstr* streamdata,
|
|
||||||
double* percepFilterParam,
|
|
||||||
WebRtc_Word16 bandwidth);
|
|
||||||
|
|
||||||
/* decode & dequantize RC */
|
|
||||||
int WebRtcIsac_DecodeRc(Bitstr *streamdata, WebRtc_Word16 *RCQ15);
|
|
||||||
|
|
||||||
/* quantize & code RC */
|
|
||||||
void WebRtcIsac_EncodeRc(WebRtc_Word16 *RCQ15, Bitstr *streamdata);
|
|
||||||
|
|
||||||
/* decode & dequantize squared Gain */
|
|
||||||
int WebRtcIsac_DecodeGain2(Bitstr *streamdata, WebRtc_Word32 *Gain2);
|
|
||||||
|
|
||||||
/* quantize & code squared Gain (input is squared gain) */
|
|
||||||
int WebRtcIsac_EncodeGain2(WebRtc_Word32 *gain2, Bitstr *streamdata);
|
|
||||||
|
|
||||||
void WebRtcIsac_EncodePitchGain(WebRtc_Word16* PitchGains_Q12, Bitstr* streamdata, ISAC_SaveEncData_t* encData);
|
|
||||||
|
|
||||||
void WebRtcIsac_EncodePitchLag(double* PitchLags, WebRtc_Word16* PitchGain_Q12, Bitstr* streamdata, ISAC_SaveEncData_t* encData);
|
|
||||||
|
|
||||||
int WebRtcIsac_DecodePitchGain(Bitstr *streamdata, WebRtc_Word16 *PitchGain_Q12);
|
|
||||||
int WebRtcIsac_DecodePitchLag(Bitstr *streamdata, WebRtc_Word16 *PitchGain_Q12, double *PitchLag);
|
|
||||||
|
|
||||||
int WebRtcIsac_DecodeFrameLen(Bitstr *streamdata, WebRtc_Word16 *framelength);
|
|
||||||
int WebRtcIsac_EncodeFrameLen(WebRtc_Word16 framelength, Bitstr *streamdata);
|
|
||||||
int WebRtcIsac_DecodeSendBW(Bitstr *streamdata, WebRtc_Word16 *BWno);
|
|
||||||
void WebRtcIsac_EncodeReceiveBw(int *BWno, Bitstr *streamdata);
|
|
||||||
|
|
||||||
/* step-down */
|
|
||||||
void WebRtcIsac_Poly2Rc(double *a, int N, double *RC);
|
|
||||||
|
|
||||||
/* step-up */
|
|
||||||
void WebRtcIsac_Rc2Poly(double *RC, int N, double *a);
|
|
||||||
|
|
||||||
void WebRtcIsac_TranscodeLPCCoef(double *LPCCoef_lo, double *LPCCoef_hi, int model,
|
|
||||||
int *index_g);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_EncodeLpcGainUb()
|
|
||||||
* Encode LPC gains of sub-Frames.
|
|
||||||
*
|
|
||||||
* Input/outputs:
|
|
||||||
* - lpGains : a buffer which contains 'SUBFRAME' number of
|
|
||||||
* LP gains to be encoded. The input values are
|
|
||||||
* overwritten by the quantized values.
|
|
||||||
* - streamdata : pointer to a stucture containg the encoded
|
|
||||||
* data and theparameters needed for entropy
|
|
||||||
* coding.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - lpcGainIndex : quantization indices for lpc gains, these will
|
|
||||||
* be stored to be used for FEC.
|
|
||||||
*/
|
|
||||||
void WebRtcIsac_EncodeLpcGainUb(
|
|
||||||
double* lpGains,
|
|
||||||
Bitstr* streamdata,
|
|
||||||
int* lpcGainIndex);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_EncodeLpcGainUb()
|
|
||||||
* Store LPC gains of sub-Frames in 'streamdata'.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - lpGains : a buffer which contains 'SUBFRAME' number of
|
|
||||||
* LP gains to be encoded.
|
|
||||||
* Input/outputs:
|
|
||||||
* - streamdata : pointer to a stucture containg the encoded
|
|
||||||
* data and theparameters needed for entropy
|
|
||||||
* coding.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
void WebRtcIsac_StoreLpcGainUb(
|
|
||||||
double* lpGains,
|
|
||||||
Bitstr* streamdata);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecodeLpcGainUb()
|
|
||||||
* Decode the LPC gain of sub-frames.
|
|
||||||
*
|
|
||||||
* Input/output:
|
|
||||||
* - streamdata : pointer to a stucture containg the encoded
|
|
||||||
* data and theparameters needed for entropy
|
|
||||||
* coding.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - lpGains : a buffer where decoded LPC gians will be stored.
|
|
||||||
*
|
|
||||||
* Return value : 0 if succeeded.
|
|
||||||
* <0 if failed.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_DecodeLpcGainUb(
|
|
||||||
double* lpGains,
|
|
||||||
Bitstr* streamdata);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_EncodeBandwidth()
|
|
||||||
* Encode if the bandwidth of encoded audio is 0-12 kHz or 0-16 kHz.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - bandwidth : an enumerator specifying if the codec in is
|
|
||||||
* 0-12 kHz or 0-16 kHz mode.
|
|
||||||
*
|
|
||||||
* Input/output:
|
|
||||||
* - streamdata : pointer to a stucture containg the encoded
|
|
||||||
* data and theparameters needed for entropy
|
|
||||||
* coding.
|
|
||||||
*
|
|
||||||
* Return value : 0 if succeeded.
|
|
||||||
* <0 if failed.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_EncodeBandwidth(
|
|
||||||
enum ISACBandwidth bandwidth,
|
|
||||||
Bitstr* streamData);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecodeBandwidth()
|
|
||||||
* Decode the bandwidth of the encoded audio, i.e. if the bandwidth is 0-12 kHz
|
|
||||||
* or 0-16 kHz.
|
|
||||||
*
|
|
||||||
* Input/output:
|
|
||||||
* - streamdata : pointer to a stucture containg the encoded
|
|
||||||
* data and theparameters needed for entropy
|
|
||||||
* coding.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - bandwidth : an enumerator specifying if the codec is in
|
|
||||||
* 0-12 kHz or 0-16 kHz mode.
|
|
||||||
*
|
|
||||||
* Return value : 0 if succeeded.
|
|
||||||
* <0 if failed.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_DecodeBandwidth(
|
|
||||||
Bitstr* streamData,
|
|
||||||
enum ISACBandwidth* bandwidth);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_EncodeJitterInfo()
|
|
||||||
* Decode the jitter information.
|
|
||||||
*
|
|
||||||
* Input/output:
|
|
||||||
* - streamdata : pointer to a stucture containg the encoded
|
|
||||||
* data and theparameters needed for entropy
|
|
||||||
* coding.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - jitterInfo : one bit of info specifying if the channel is
|
|
||||||
* in high/low jitter. Zero indicates low jitter
|
|
||||||
* and one indicates high jitter.
|
|
||||||
*
|
|
||||||
* Return value : 0 if succeeded.
|
|
||||||
* <0 if failed.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_EncodeJitterInfo(
|
|
||||||
WebRtc_Word32 jitterIndex,
|
|
||||||
Bitstr* streamData);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecodeJitterInfo()
|
|
||||||
* Decode the jitter information.
|
|
||||||
*
|
|
||||||
* Input/output:
|
|
||||||
* - streamdata : pointer to a stucture containg the encoded
|
|
||||||
* data and theparameters needed for entropy
|
|
||||||
* coding.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - jitterInfo : one bit of info specifying if the channel is
|
|
||||||
* in high/low jitter. Zero indicates low jitter
|
|
||||||
* and one indicates high jitter.
|
|
||||||
*
|
|
||||||
* Return value : 0 if succeeded.
|
|
||||||
* <0 if failed.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_DecodeJitterInfo(
|
|
||||||
Bitstr* streamData,
|
|
||||||
WebRtc_Word32* jitterInfo);
|
|
||||||
|
|
||||||
#endif /* WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_ENTROPY_CODING_H_ */
|
|
||||||
|
|
@ -1,947 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright(c)1995,97 Mark Olesen <olesen@me.QueensU.CA>
|
|
||||||
* Queen's Univ at Kingston (Canada)
|
|
||||||
*
|
|
||||||
* Permission to use, copy, modify, and distribute this software for
|
|
||||||
* any purpose without fee is hereby granted, provided that this
|
|
||||||
* entire notice is included in all copies of any software which is
|
|
||||||
* or includes a copy or modification of this software and in all
|
|
||||||
* copies of the supporting documentation for such software.
|
|
||||||
*
|
|
||||||
* THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR
|
|
||||||
* IMPLIED WARRANTY. IN PARTICULAR, NEITHER THE AUTHOR NOR QUEEN'S
|
|
||||||
* UNIVERSITY AT KINGSTON MAKES ANY REPRESENTATION OR WARRANTY OF ANY
|
|
||||||
* KIND CONCERNING THE MERCHANTABILITY OF THIS SOFTWARE OR ITS
|
|
||||||
* FITNESS FOR ANY PARTICULAR PURPOSE.
|
|
||||||
*
|
|
||||||
* All of which is to say that you can do what you like with this
|
|
||||||
* source code provided you don't try to sell it as your own and you
|
|
||||||
* include an unaltered copy of this message (including the
|
|
||||||
* copyright).
|
|
||||||
*
|
|
||||||
* It is also implicitly understood that bug fixes and improvements
|
|
||||||
* should make their way back to the general Internet community so
|
|
||||||
* that everyone benefits.
|
|
||||||
*
|
|
||||||
* Changes:
|
|
||||||
* Trivial type modifications by the WebRTC authors.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* File:
|
|
||||||
* WebRtcIsac_Fftn.c
|
|
||||||
*
|
|
||||||
* Public:
|
|
||||||
* WebRtcIsac_Fftn / fftnf ();
|
|
||||||
*
|
|
||||||
* Private:
|
|
||||||
* WebRtcIsac_Fftradix / fftradixf ();
|
|
||||||
*
|
|
||||||
* Descript:
|
|
||||||
* multivariate complex Fourier transform, computed in place
|
|
||||||
* using mixed-radix Fast Fourier Transform algorithm.
|
|
||||||
*
|
|
||||||
* Fortran code by:
|
|
||||||
* RC Singleton, Stanford Research Institute, Sept. 1968
|
|
||||||
*
|
|
||||||
* translated by f2c (version 19950721).
|
|
||||||
*
|
|
||||||
* int WebRtcIsac_Fftn (int ndim, const int dims[], REAL Re[], REAL Im[],
|
|
||||||
* int iSign, double scaling);
|
|
||||||
*
|
|
||||||
* NDIM = the total number dimensions
|
|
||||||
* DIMS = a vector of array sizes
|
|
||||||
* if NDIM is zero then DIMS must be zero-terminated
|
|
||||||
*
|
|
||||||
* RE and IM hold the real and imaginary components of the data, and return
|
|
||||||
* the resulting real and imaginary Fourier coefficients. Multidimensional
|
|
||||||
* data *must* be allocated contiguously. There is no limit on the number
|
|
||||||
* of dimensions.
|
|
||||||
*
|
|
||||||
* ISIGN = the sign of the complex exponential (ie, forward or inverse FFT)
|
|
||||||
* the magnitude of ISIGN (normally 1) is used to determine the
|
|
||||||
* correct indexing increment (see below).
|
|
||||||
*
|
|
||||||
* SCALING = normalizing constant by which the final result is *divided*
|
|
||||||
* if SCALING == -1, normalize by total dimension of the transform
|
|
||||||
* if SCALING < -1, normalize by the square-root of the total dimension
|
|
||||||
*
|
|
||||||
* example:
|
|
||||||
* tri-variate transform with Re[n1][n2][n3], Im[n1][n2][n3]
|
|
||||||
*
|
|
||||||
* int dims[3] = {n1,n2,n3}
|
|
||||||
* WebRtcIsac_Fftn (3, dims, Re, Im, 1, scaling);
|
|
||||||
*
|
|
||||||
*-----------------------------------------------------------------------*
|
|
||||||
* int WebRtcIsac_Fftradix (REAL Re[], REAL Im[], size_t nTotal, size_t nPass,
|
|
||||||
* size_t nSpan, int iSign, size_t max_factors,
|
|
||||||
* size_t max_perm);
|
|
||||||
*
|
|
||||||
* RE, IM - see above documentation
|
|
||||||
*
|
|
||||||
* Although there is no limit on the number of dimensions, WebRtcIsac_Fftradix() must
|
|
||||||
* be called once for each dimension, but the calls may be in any order.
|
|
||||||
*
|
|
||||||
* NTOTAL = the total number of complex data values
|
|
||||||
* NPASS = the dimension of the current variable
|
|
||||||
* NSPAN/NPASS = the spacing of consecutive data values while indexing the
|
|
||||||
* current variable
|
|
||||||
* ISIGN - see above documentation
|
|
||||||
*
|
|
||||||
* example:
|
|
||||||
* tri-variate transform with Re[n1][n2][n3], Im[n1][n2][n3]
|
|
||||||
*
|
|
||||||
* WebRtcIsac_Fftradix (Re, Im, n1*n2*n3, n1, n1, 1, maxf, maxp);
|
|
||||||
* WebRtcIsac_Fftradix (Re, Im, n1*n2*n3, n2, n1*n2, 1, maxf, maxp);
|
|
||||||
* WebRtcIsac_Fftradix (Re, Im, n1*n2*n3, n3, n1*n2*n3, 1, maxf, maxp);
|
|
||||||
*
|
|
||||||
* single-variate transform,
|
|
||||||
* NTOTAL = N = NSPAN = (number of complex data values),
|
|
||||||
*
|
|
||||||
* WebRtcIsac_Fftradix (Re, Im, n, n, n, 1, maxf, maxp);
|
|
||||||
*
|
|
||||||
* The data can also be stored in a single array with alternating real and
|
|
||||||
* imaginary parts, the magnitude of ISIGN is changed to 2 to give correct
|
|
||||||
* indexing increment, and data [0] and data [1] used to pass the initial
|
|
||||||
* addresses for the sequences of real and imaginary values,
|
|
||||||
*
|
|
||||||
* example:
|
|
||||||
* REAL data [2*NTOTAL];
|
|
||||||
* WebRtcIsac_Fftradix ( &data[0], &data[1], NTOTAL, nPass, nSpan, 2, maxf, maxp);
|
|
||||||
*
|
|
||||||
* for temporary allocation:
|
|
||||||
*
|
|
||||||
* MAX_FACTORS >= the maximum prime factor of NPASS
|
|
||||||
* MAX_PERM >= the number of prime factors of NPASS. In addition,
|
|
||||||
* if the square-free portion K of NPASS has two or more prime
|
|
||||||
* factors, then MAX_PERM >= (K-1)
|
|
||||||
*
|
|
||||||
* storage in FACTOR for a maximum of 15 prime factors of NPASS. if NPASS
|
|
||||||
* has more than one square-free factor, the product of the square-free
|
|
||||||
* factors must be <= 210 array storage for maximum prime factor of 23 the
|
|
||||||
* following two constants should agree with the array dimensions.
|
|
||||||
*
|
|
||||||
*----------------------------------------------------------------------*/
|
|
||||||
#include "fft.h"
|
|
||||||
|
|
||||||
#include <stdlib.h>
|
|
||||||
#include <math.h>
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* double precision routine */
|
|
||||||
static int
|
|
||||||
WebRtcIsac_Fftradix (double Re[], double Im[],
|
|
||||||
size_t nTotal, size_t nPass, size_t nSpan, int isign,
|
|
||||||
int max_factors, unsigned int max_perm,
|
|
||||||
FFTstr *fftstate);
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
#ifndef M_PI
|
|
||||||
# define M_PI 3.14159265358979323846264338327950288
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifndef SIN60
|
|
||||||
# define SIN60 0.86602540378443865 /* sin(60 deg) */
|
|
||||||
# define COS72 0.30901699437494742 /* cos(72 deg) */
|
|
||||||
# define SIN72 0.95105651629515357 /* sin(72 deg) */
|
|
||||||
#endif
|
|
||||||
|
|
||||||
# define REAL double
|
|
||||||
# define FFTN WebRtcIsac_Fftn
|
|
||||||
# define FFTNS "fftn"
|
|
||||||
# define FFTRADIX WebRtcIsac_Fftradix
|
|
||||||
# define FFTRADIXS "fftradix"
|
|
||||||
|
|
||||||
|
|
||||||
int WebRtcIsac_Fftns(unsigned int ndim, const int dims[],
|
|
||||||
double Re[],
|
|
||||||
double Im[],
|
|
||||||
int iSign,
|
|
||||||
double scaling,
|
|
||||||
FFTstr *fftstate)
|
|
||||||
{
|
|
||||||
|
|
||||||
size_t nSpan, nPass, nTotal;
|
|
||||||
unsigned int i;
|
|
||||||
int ret, max_factors, max_perm;
|
|
||||||
|
|
||||||
/*
|
|
||||||
* tally the number of elements in the data array
|
|
||||||
* and determine the number of dimensions
|
|
||||||
*/
|
|
||||||
nTotal = 1;
|
|
||||||
if (ndim && dims [0])
|
|
||||||
{
|
|
||||||
for (i = 0; i < ndim; i++)
|
|
||||||
{
|
|
||||||
if (dims [i] <= 0)
|
|
||||||
{
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
nTotal *= dims [i];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
ndim = 0;
|
|
||||||
for (i = 0; dims [i]; i++)
|
|
||||||
{
|
|
||||||
if (dims [i] <= 0)
|
|
||||||
{
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
nTotal *= dims [i];
|
|
||||||
ndim++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* determine maximum number of factors and permuations */
|
|
||||||
#if 1
|
|
||||||
/*
|
|
||||||
* follow John Beale's example, just use the largest dimension and don't
|
|
||||||
* worry about excess allocation. May be someone else will do it?
|
|
||||||
*/
|
|
||||||
max_factors = max_perm = 1;
|
|
||||||
for (i = 0; i < ndim; i++)
|
|
||||||
{
|
|
||||||
nSpan = dims [i];
|
|
||||||
if ((int)nSpan > max_factors)
|
|
||||||
{
|
|
||||||
max_factors = (int)nSpan;
|
|
||||||
}
|
|
||||||
if ((int)nSpan > max_perm)
|
|
||||||
{
|
|
||||||
max_perm = (int)nSpan;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
/* use the constants used in the original Fortran code */
|
|
||||||
max_factors = 23;
|
|
||||||
max_perm = 209;
|
|
||||||
#endif
|
|
||||||
/* loop over the dimensions: */
|
|
||||||
nPass = 1;
|
|
||||||
for (i = 0; i < ndim; i++)
|
|
||||||
{
|
|
||||||
nSpan = dims [i];
|
|
||||||
nPass *= nSpan;
|
|
||||||
ret = FFTRADIX (Re, Im, nTotal, nSpan, nPass, iSign,
|
|
||||||
max_factors, max_perm, fftstate);
|
|
||||||
/* exit, clean-up already done */
|
|
||||||
if (ret)
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Divide through by the normalizing constant: */
|
|
||||||
if (scaling && scaling != 1.0)
|
|
||||||
{
|
|
||||||
if (iSign < 0) iSign = -iSign;
|
|
||||||
if (scaling < 0.0)
|
|
||||||
{
|
|
||||||
scaling = (double)nTotal;
|
|
||||||
if (scaling < -1.0)
|
|
||||||
scaling = sqrt (scaling);
|
|
||||||
}
|
|
||||||
scaling = 1.0 / scaling; /* multiply is often faster */
|
|
||||||
for (i = 0; i < nTotal; i += iSign)
|
|
||||||
{
|
|
||||||
Re [i] *= scaling;
|
|
||||||
Im [i] *= scaling;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
* singleton's mixed radix routine
|
|
||||||
*
|
|
||||||
* could move allocation out to WebRtcIsac_Fftn(), but leave it here so that it's
|
|
||||||
* possible to make this a standalone function
|
|
||||||
*/
|
|
||||||
|
|
||||||
static int FFTRADIX (REAL Re[],
|
|
||||||
REAL Im[],
|
|
||||||
size_t nTotal,
|
|
||||||
size_t nPass,
|
|
||||||
size_t nSpan,
|
|
||||||
int iSign,
|
|
||||||
int max_factors,
|
|
||||||
unsigned int max_perm,
|
|
||||||
FFTstr *fftstate)
|
|
||||||
{
|
|
||||||
int ii, mfactor, kspan, ispan, inc;
|
|
||||||
int j, jc, jf, jj, k, k1, k2, k3, k4, kk, kt, nn, ns, nt;
|
|
||||||
|
|
||||||
|
|
||||||
REAL radf;
|
|
||||||
REAL c1, c2, c3, cd, aa, aj, ak, ajm, ajp, akm, akp;
|
|
||||||
REAL s1, s2, s3, sd, bb, bj, bk, bjm, bjp, bkm, bkp;
|
|
||||||
|
|
||||||
REAL *Rtmp = NULL; /* temp space for real part*/
|
|
||||||
REAL *Itmp = NULL; /* temp space for imaginary part */
|
|
||||||
REAL *Cos = NULL; /* Cosine values */
|
|
||||||
REAL *Sin = NULL; /* Sine values */
|
|
||||||
|
|
||||||
REAL s60 = SIN60; /* sin(60 deg) */
|
|
||||||
REAL c72 = COS72; /* cos(72 deg) */
|
|
||||||
REAL s72 = SIN72; /* sin(72 deg) */
|
|
||||||
REAL pi2 = M_PI; /* use PI first, 2 PI later */
|
|
||||||
|
|
||||||
|
|
||||||
fftstate->SpaceAlloced = 0;
|
|
||||||
fftstate->MaxPermAlloced = 0;
|
|
||||||
|
|
||||||
|
|
||||||
// initialize to avoid warnings
|
|
||||||
k3 = c2 = c3 = s2 = s3 = 0.0;
|
|
||||||
|
|
||||||
if (nPass < 2)
|
|
||||||
return 0;
|
|
||||||
|
|
||||||
/* allocate storage */
|
|
||||||
if (fftstate->SpaceAlloced < max_factors * sizeof (REAL))
|
|
||||||
{
|
|
||||||
#ifdef SUN_BROKEN_REALLOC
|
|
||||||
if (!fftstate->SpaceAlloced) /* first time */
|
|
||||||
{
|
|
||||||
fftstate->SpaceAlloced = max_factors * sizeof (REAL);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
#endif
|
|
||||||
fftstate->SpaceAlloced = max_factors * sizeof (REAL);
|
|
||||||
#ifdef SUN_BROKEN_REALLOC
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
/* allow full use of alloc'd space */
|
|
||||||
max_factors = fftstate->SpaceAlloced / sizeof (REAL);
|
|
||||||
}
|
|
||||||
if (fftstate->MaxPermAlloced < max_perm)
|
|
||||||
{
|
|
||||||
#ifdef SUN_BROKEN_REALLOC
|
|
||||||
if (!fftstate->MaxPermAlloced) /* first time */
|
|
||||||
else
|
|
||||||
#endif
|
|
||||||
fftstate->MaxPermAlloced = max_perm;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
/* allow full use of alloc'd space */
|
|
||||||
max_perm = fftstate->MaxPermAlloced;
|
|
||||||
}
|
|
||||||
if (fftstate->Tmp0 == NULL || fftstate->Tmp1 == NULL || fftstate->Tmp2 == NULL || fftstate->Tmp3 == NULL
|
|
||||||
|| fftstate->Perm == NULL) {
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* assign pointers */
|
|
||||||
Rtmp = (REAL *) fftstate->Tmp0;
|
|
||||||
Itmp = (REAL *) fftstate->Tmp1;
|
|
||||||
Cos = (REAL *) fftstate->Tmp2;
|
|
||||||
Sin = (REAL *) fftstate->Tmp3;
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Function Body
|
|
||||||
*/
|
|
||||||
inc = iSign;
|
|
||||||
if (iSign < 0) {
|
|
||||||
s72 = -s72;
|
|
||||||
s60 = -s60;
|
|
||||||
pi2 = -pi2;
|
|
||||||
inc = -inc; /* absolute value */
|
|
||||||
}
|
|
||||||
|
|
||||||
/* adjust for strange increments */
|
|
||||||
nt = inc * (int)nTotal;
|
|
||||||
ns = inc * (int)nSpan;
|
|
||||||
kspan = ns;
|
|
||||||
|
|
||||||
nn = nt - inc;
|
|
||||||
jc = ns / (int)nPass;
|
|
||||||
radf = pi2 * (double) jc;
|
|
||||||
pi2 *= 2.0; /* use 2 PI from here on */
|
|
||||||
|
|
||||||
ii = 0;
|
|
||||||
jf = 0;
|
|
||||||
/* determine the factors of n */
|
|
||||||
mfactor = 0;
|
|
||||||
k = (int)nPass;
|
|
||||||
while (k % 16 == 0) {
|
|
||||||
mfactor++;
|
|
||||||
fftstate->factor [mfactor - 1] = 4;
|
|
||||||
k /= 16;
|
|
||||||
}
|
|
||||||
j = 3;
|
|
||||||
jj = 9;
|
|
||||||
do {
|
|
||||||
while (k % jj == 0) {
|
|
||||||
mfactor++;
|
|
||||||
fftstate->factor [mfactor - 1] = j;
|
|
||||||
k /= jj;
|
|
||||||
}
|
|
||||||
j += 2;
|
|
||||||
jj = j * j;
|
|
||||||
} while (jj <= k);
|
|
||||||
if (k <= 4) {
|
|
||||||
kt = mfactor;
|
|
||||||
fftstate->factor [mfactor] = k;
|
|
||||||
if (k != 1)
|
|
||||||
mfactor++;
|
|
||||||
} else {
|
|
||||||
if (k - (k / 4 << 2) == 0) {
|
|
||||||
mfactor++;
|
|
||||||
fftstate->factor [mfactor - 1] = 2;
|
|
||||||
k /= 4;
|
|
||||||
}
|
|
||||||
kt = mfactor;
|
|
||||||
j = 2;
|
|
||||||
do {
|
|
||||||
if (k % j == 0) {
|
|
||||||
mfactor++;
|
|
||||||
fftstate->factor [mfactor - 1] = j;
|
|
||||||
k /= j;
|
|
||||||
}
|
|
||||||
j = ((j + 1) / 2 << 1) + 1;
|
|
||||||
} while (j <= k);
|
|
||||||
}
|
|
||||||
if (kt) {
|
|
||||||
j = kt;
|
|
||||||
do {
|
|
||||||
mfactor++;
|
|
||||||
fftstate->factor [mfactor - 1] = fftstate->factor [j - 1];
|
|
||||||
j--;
|
|
||||||
} while (j);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* test that mfactors is in range */
|
|
||||||
if (mfactor > NFACTOR)
|
|
||||||
{
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* compute fourier transform */
|
|
||||||
for (;;) {
|
|
||||||
sd = radf / (double) kspan;
|
|
||||||
cd = sin(sd);
|
|
||||||
cd = 2.0 * cd * cd;
|
|
||||||
sd = sin(sd + sd);
|
|
||||||
kk = 0;
|
|
||||||
ii++;
|
|
||||||
|
|
||||||
switch (fftstate->factor [ii - 1]) {
|
|
||||||
case 2:
|
|
||||||
/* transform for factor of 2 (including rotation factor) */
|
|
||||||
kspan /= 2;
|
|
||||||
k1 = kspan + 2;
|
|
||||||
do {
|
|
||||||
do {
|
|
||||||
k2 = kk + kspan;
|
|
||||||
ak = Re [k2];
|
|
||||||
bk = Im [k2];
|
|
||||||
Re [k2] = Re [kk] - ak;
|
|
||||||
Im [k2] = Im [kk] - bk;
|
|
||||||
Re [kk] += ak;
|
|
||||||
Im [kk] += bk;
|
|
||||||
kk = k2 + kspan;
|
|
||||||
} while (kk < nn);
|
|
||||||
kk -= nn;
|
|
||||||
} while (kk < jc);
|
|
||||||
if (kk >= kspan)
|
|
||||||
goto Permute_Results_Label; /* exit infinite loop */
|
|
||||||
do {
|
|
||||||
c1 = 1.0 - cd;
|
|
||||||
s1 = sd;
|
|
||||||
do {
|
|
||||||
do {
|
|
||||||
do {
|
|
||||||
k2 = kk + kspan;
|
|
||||||
ak = Re [kk] - Re [k2];
|
|
||||||
bk = Im [kk] - Im [k2];
|
|
||||||
Re [kk] += Re [k2];
|
|
||||||
Im [kk] += Im [k2];
|
|
||||||
Re [k2] = c1 * ak - s1 * bk;
|
|
||||||
Im [k2] = s1 * ak + c1 * bk;
|
|
||||||
kk = k2 + kspan;
|
|
||||||
} while (kk < (nt-1));
|
|
||||||
k2 = kk - nt;
|
|
||||||
c1 = -c1;
|
|
||||||
kk = k1 - k2;
|
|
||||||
} while (kk > k2);
|
|
||||||
ak = c1 - (cd * c1 + sd * s1);
|
|
||||||
s1 = sd * c1 - cd * s1 + s1;
|
|
||||||
c1 = 2.0 - (ak * ak + s1 * s1);
|
|
||||||
s1 *= c1;
|
|
||||||
c1 *= ak;
|
|
||||||
kk += jc;
|
|
||||||
} while (kk < k2);
|
|
||||||
k1 += inc + inc;
|
|
||||||
kk = (k1 - kspan + 1) / 2 + jc - 1;
|
|
||||||
} while (kk < (jc + jc));
|
|
||||||
break;
|
|
||||||
|
|
||||||
case 4: /* transform for factor of 4 */
|
|
||||||
ispan = kspan;
|
|
||||||
kspan /= 4;
|
|
||||||
|
|
||||||
do {
|
|
||||||
c1 = 1.0;
|
|
||||||
s1 = 0.0;
|
|
||||||
do {
|
|
||||||
do {
|
|
||||||
k1 = kk + kspan;
|
|
||||||
k2 = k1 + kspan;
|
|
||||||
k3 = k2 + kspan;
|
|
||||||
akp = Re [kk] + Re [k2];
|
|
||||||
akm = Re [kk] - Re [k2];
|
|
||||||
ajp = Re [k1] + Re [k3];
|
|
||||||
ajm = Re [k1] - Re [k3];
|
|
||||||
bkp = Im [kk] + Im [k2];
|
|
||||||
bkm = Im [kk] - Im [k2];
|
|
||||||
bjp = Im [k1] + Im [k3];
|
|
||||||
bjm = Im [k1] - Im [k3];
|
|
||||||
Re [kk] = akp + ajp;
|
|
||||||
Im [kk] = bkp + bjp;
|
|
||||||
ajp = akp - ajp;
|
|
||||||
bjp = bkp - bjp;
|
|
||||||
if (iSign < 0) {
|
|
||||||
akp = akm + bjm;
|
|
||||||
bkp = bkm - ajm;
|
|
||||||
akm -= bjm;
|
|
||||||
bkm += ajm;
|
|
||||||
} else {
|
|
||||||
akp = akm - bjm;
|
|
||||||
bkp = bkm + ajm;
|
|
||||||
akm += bjm;
|
|
||||||
bkm -= ajm;
|
|
||||||
}
|
|
||||||
/* avoid useless multiplies */
|
|
||||||
if (s1 == 0.0) {
|
|
||||||
Re [k1] = akp;
|
|
||||||
Re [k2] = ajp;
|
|
||||||
Re [k3] = akm;
|
|
||||||
Im [k1] = bkp;
|
|
||||||
Im [k2] = bjp;
|
|
||||||
Im [k3] = bkm;
|
|
||||||
} else {
|
|
||||||
Re [k1] = akp * c1 - bkp * s1;
|
|
||||||
Re [k2] = ajp * c2 - bjp * s2;
|
|
||||||
Re [k3] = akm * c3 - bkm * s3;
|
|
||||||
Im [k1] = akp * s1 + bkp * c1;
|
|
||||||
Im [k2] = ajp * s2 + bjp * c2;
|
|
||||||
Im [k3] = akm * s3 + bkm * c3;
|
|
||||||
}
|
|
||||||
kk = k3 + kspan;
|
|
||||||
} while (kk < nt);
|
|
||||||
|
|
||||||
c2 = c1 - (cd * c1 + sd * s1);
|
|
||||||
s1 = sd * c1 - cd * s1 + s1;
|
|
||||||
c1 = 2.0 - (c2 * c2 + s1 * s1);
|
|
||||||
s1 *= c1;
|
|
||||||
c1 *= c2;
|
|
||||||
/* values of c2, c3, s2, s3 that will get used next time */
|
|
||||||
c2 = c1 * c1 - s1 * s1;
|
|
||||||
s2 = 2.0 * c1 * s1;
|
|
||||||
c3 = c2 * c1 - s2 * s1;
|
|
||||||
s3 = c2 * s1 + s2 * c1;
|
|
||||||
kk = kk - nt + jc;
|
|
||||||
} while (kk < kspan);
|
|
||||||
kk = kk - kspan + inc;
|
|
||||||
} while (kk < jc);
|
|
||||||
if (kspan == jc)
|
|
||||||
goto Permute_Results_Label; /* exit infinite loop */
|
|
||||||
break;
|
|
||||||
|
|
||||||
default:
|
|
||||||
/* transform for odd factors */
|
|
||||||
#ifdef FFT_RADIX4
|
|
||||||
return -1;
|
|
||||||
break;
|
|
||||||
#else /* FFT_RADIX4 */
|
|
||||||
k = fftstate->factor [ii - 1];
|
|
||||||
ispan = kspan;
|
|
||||||
kspan /= k;
|
|
||||||
|
|
||||||
switch (k) {
|
|
||||||
case 3: /* transform for factor of 3 (optional code) */
|
|
||||||
do {
|
|
||||||
do {
|
|
||||||
k1 = kk + kspan;
|
|
||||||
k2 = k1 + kspan;
|
|
||||||
ak = Re [kk];
|
|
||||||
bk = Im [kk];
|
|
||||||
aj = Re [k1] + Re [k2];
|
|
||||||
bj = Im [k1] + Im [k2];
|
|
||||||
Re [kk] = ak + aj;
|
|
||||||
Im [kk] = bk + bj;
|
|
||||||
ak -= 0.5 * aj;
|
|
||||||
bk -= 0.5 * bj;
|
|
||||||
aj = (Re [k1] - Re [k2]) * s60;
|
|
||||||
bj = (Im [k1] - Im [k2]) * s60;
|
|
||||||
Re [k1] = ak - bj;
|
|
||||||
Re [k2] = ak + bj;
|
|
||||||
Im [k1] = bk + aj;
|
|
||||||
Im [k2] = bk - aj;
|
|
||||||
kk = k2 + kspan;
|
|
||||||
} while (kk < (nn - 1));
|
|
||||||
kk -= nn;
|
|
||||||
} while (kk < kspan);
|
|
||||||
break;
|
|
||||||
|
|
||||||
case 5: /* transform for factor of 5 (optional code) */
|
|
||||||
c2 = c72 * c72 - s72 * s72;
|
|
||||||
s2 = 2.0 * c72 * s72;
|
|
||||||
do {
|
|
||||||
do {
|
|
||||||
k1 = kk + kspan;
|
|
||||||
k2 = k1 + kspan;
|
|
||||||
k3 = k2 + kspan;
|
|
||||||
k4 = k3 + kspan;
|
|
||||||
akp = Re [k1] + Re [k4];
|
|
||||||
akm = Re [k1] - Re [k4];
|
|
||||||
bkp = Im [k1] + Im [k4];
|
|
||||||
bkm = Im [k1] - Im [k4];
|
|
||||||
ajp = Re [k2] + Re [k3];
|
|
||||||
ajm = Re [k2] - Re [k3];
|
|
||||||
bjp = Im [k2] + Im [k3];
|
|
||||||
bjm = Im [k2] - Im [k3];
|
|
||||||
aa = Re [kk];
|
|
||||||
bb = Im [kk];
|
|
||||||
Re [kk] = aa + akp + ajp;
|
|
||||||
Im [kk] = bb + bkp + bjp;
|
|
||||||
ak = akp * c72 + ajp * c2 + aa;
|
|
||||||
bk = bkp * c72 + bjp * c2 + bb;
|
|
||||||
aj = akm * s72 + ajm * s2;
|
|
||||||
bj = bkm * s72 + bjm * s2;
|
|
||||||
Re [k1] = ak - bj;
|
|
||||||
Re [k4] = ak + bj;
|
|
||||||
Im [k1] = bk + aj;
|
|
||||||
Im [k4] = bk - aj;
|
|
||||||
ak = akp * c2 + ajp * c72 + aa;
|
|
||||||
bk = bkp * c2 + bjp * c72 + bb;
|
|
||||||
aj = akm * s2 - ajm * s72;
|
|
||||||
bj = bkm * s2 - bjm * s72;
|
|
||||||
Re [k2] = ak - bj;
|
|
||||||
Re [k3] = ak + bj;
|
|
||||||
Im [k2] = bk + aj;
|
|
||||||
Im [k3] = bk - aj;
|
|
||||||
kk = k4 + kspan;
|
|
||||||
} while (kk < (nn-1));
|
|
||||||
kk -= nn;
|
|
||||||
} while (kk < kspan);
|
|
||||||
break;
|
|
||||||
|
|
||||||
default:
|
|
||||||
if (k != jf) {
|
|
||||||
jf = k;
|
|
||||||
s1 = pi2 / (double) k;
|
|
||||||
c1 = cos(s1);
|
|
||||||
s1 = sin(s1);
|
|
||||||
if (jf > max_factors){
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
Cos [jf - 1] = 1.0;
|
|
||||||
Sin [jf - 1] = 0.0;
|
|
||||||
j = 1;
|
|
||||||
do {
|
|
||||||
Cos [j - 1] = Cos [k - 1] * c1 + Sin [k - 1] * s1;
|
|
||||||
Sin [j - 1] = Cos [k - 1] * s1 - Sin [k - 1] * c1;
|
|
||||||
k--;
|
|
||||||
Cos [k - 1] = Cos [j - 1];
|
|
||||||
Sin [k - 1] = -Sin [j - 1];
|
|
||||||
j++;
|
|
||||||
} while (j < k);
|
|
||||||
}
|
|
||||||
do {
|
|
||||||
do {
|
|
||||||
k1 = kk;
|
|
||||||
k2 = kk + ispan;
|
|
||||||
ak = aa = Re [kk];
|
|
||||||
bk = bb = Im [kk];
|
|
||||||
j = 1;
|
|
||||||
k1 += kspan;
|
|
||||||
do {
|
|
||||||
k2 -= kspan;
|
|
||||||
j++;
|
|
||||||
Rtmp [j - 1] = Re [k1] + Re [k2];
|
|
||||||
ak += Rtmp [j - 1];
|
|
||||||
Itmp [j - 1] = Im [k1] + Im [k2];
|
|
||||||
bk += Itmp [j - 1];
|
|
||||||
j++;
|
|
||||||
Rtmp [j - 1] = Re [k1] - Re [k2];
|
|
||||||
Itmp [j - 1] = Im [k1] - Im [k2];
|
|
||||||
k1 += kspan;
|
|
||||||
} while (k1 < k2);
|
|
||||||
Re [kk] = ak;
|
|
||||||
Im [kk] = bk;
|
|
||||||
k1 = kk;
|
|
||||||
k2 = kk + ispan;
|
|
||||||
j = 1;
|
|
||||||
do {
|
|
||||||
k1 += kspan;
|
|
||||||
k2 -= kspan;
|
|
||||||
jj = j;
|
|
||||||
ak = aa;
|
|
||||||
bk = bb;
|
|
||||||
aj = 0.0;
|
|
||||||
bj = 0.0;
|
|
||||||
k = 1;
|
|
||||||
do {
|
|
||||||
k++;
|
|
||||||
ak += Rtmp [k - 1] * Cos [jj - 1];
|
|
||||||
bk += Itmp [k - 1] * Cos [jj - 1];
|
|
||||||
k++;
|
|
||||||
aj += Rtmp [k - 1] * Sin [jj - 1];
|
|
||||||
bj += Itmp [k - 1] * Sin [jj - 1];
|
|
||||||
jj += j;
|
|
||||||
if (jj > jf) {
|
|
||||||
jj -= jf;
|
|
||||||
}
|
|
||||||
} while (k < jf);
|
|
||||||
k = jf - j;
|
|
||||||
Re [k1] = ak - bj;
|
|
||||||
Im [k1] = bk + aj;
|
|
||||||
Re [k2] = ak + bj;
|
|
||||||
Im [k2] = bk - aj;
|
|
||||||
j++;
|
|
||||||
} while (j < k);
|
|
||||||
kk += ispan;
|
|
||||||
} while (kk < nn);
|
|
||||||
kk -= nn;
|
|
||||||
} while (kk < kspan);
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* multiply by rotation factor (except for factors of 2 and 4) */
|
|
||||||
if (ii == mfactor)
|
|
||||||
goto Permute_Results_Label; /* exit infinite loop */
|
|
||||||
kk = jc;
|
|
||||||
do {
|
|
||||||
c2 = 1.0 - cd;
|
|
||||||
s1 = sd;
|
|
||||||
do {
|
|
||||||
c1 = c2;
|
|
||||||
s2 = s1;
|
|
||||||
kk += kspan;
|
|
||||||
do {
|
|
||||||
do {
|
|
||||||
ak = Re [kk];
|
|
||||||
Re [kk] = c2 * ak - s2 * Im [kk];
|
|
||||||
Im [kk] = s2 * ak + c2 * Im [kk];
|
|
||||||
kk += ispan;
|
|
||||||
} while (kk < nt);
|
|
||||||
ak = s1 * s2;
|
|
||||||
s2 = s1 * c2 + c1 * s2;
|
|
||||||
c2 = c1 * c2 - ak;
|
|
||||||
kk = kk - nt + kspan;
|
|
||||||
} while (kk < ispan);
|
|
||||||
c2 = c1 - (cd * c1 + sd * s1);
|
|
||||||
s1 += sd * c1 - cd * s1;
|
|
||||||
c1 = 2.0 - (c2 * c2 + s1 * s1);
|
|
||||||
s1 *= c1;
|
|
||||||
c2 *= c1;
|
|
||||||
kk = kk - ispan + jc;
|
|
||||||
} while (kk < kspan);
|
|
||||||
kk = kk - kspan + jc + inc;
|
|
||||||
} while (kk < (jc + jc));
|
|
||||||
break;
|
|
||||||
#endif /* FFT_RADIX4 */
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* permute the results to normal order---done in two stages */
|
|
||||||
/* permutation for square factors of n */
|
|
||||||
Permute_Results_Label:
|
|
||||||
fftstate->Perm [0] = ns;
|
|
||||||
if (kt) {
|
|
||||||
k = kt + kt + 1;
|
|
||||||
if (mfactor < k)
|
|
||||||
k--;
|
|
||||||
j = 1;
|
|
||||||
fftstate->Perm [k] = jc;
|
|
||||||
do {
|
|
||||||
fftstate->Perm [j] = fftstate->Perm [j - 1] / fftstate->factor [j - 1];
|
|
||||||
fftstate->Perm [k - 1] = fftstate->Perm [k] * fftstate->factor [j - 1];
|
|
||||||
j++;
|
|
||||||
k--;
|
|
||||||
} while (j < k);
|
|
||||||
k3 = fftstate->Perm [k];
|
|
||||||
kspan = fftstate->Perm [1];
|
|
||||||
kk = jc;
|
|
||||||
k2 = kspan;
|
|
||||||
j = 1;
|
|
||||||
if (nPass != nTotal) {
|
|
||||||
/* permutation for multivariate transform */
|
|
||||||
Permute_Multi_Label:
|
|
||||||
do {
|
|
||||||
do {
|
|
||||||
k = kk + jc;
|
|
||||||
do {
|
|
||||||
/* swap Re [kk] <> Re [k2], Im [kk] <> Im [k2] */
|
|
||||||
ak = Re [kk]; Re [kk] = Re [k2]; Re [k2] = ak;
|
|
||||||
bk = Im [kk]; Im [kk] = Im [k2]; Im [k2] = bk;
|
|
||||||
kk += inc;
|
|
||||||
k2 += inc;
|
|
||||||
} while (kk < (k-1));
|
|
||||||
kk += ns - jc;
|
|
||||||
k2 += ns - jc;
|
|
||||||
} while (kk < (nt-1));
|
|
||||||
k2 = k2 - nt + kspan;
|
|
||||||
kk = kk - nt + jc;
|
|
||||||
} while (k2 < (ns-1));
|
|
||||||
do {
|
|
||||||
do {
|
|
||||||
k2 -= fftstate->Perm [j - 1];
|
|
||||||
j++;
|
|
||||||
k2 = fftstate->Perm [j] + k2;
|
|
||||||
} while (k2 > fftstate->Perm [j - 1]);
|
|
||||||
j = 1;
|
|
||||||
do {
|
|
||||||
if (kk < (k2-1))
|
|
||||||
goto Permute_Multi_Label;
|
|
||||||
kk += jc;
|
|
||||||
k2 += kspan;
|
|
||||||
} while (k2 < (ns-1));
|
|
||||||
} while (kk < (ns-1));
|
|
||||||
} else {
|
|
||||||
/* permutation for single-variate transform (optional code) */
|
|
||||||
Permute_Single_Label:
|
|
||||||
do {
|
|
||||||
/* swap Re [kk] <> Re [k2], Im [kk] <> Im [k2] */
|
|
||||||
ak = Re [kk]; Re [kk] = Re [k2]; Re [k2] = ak;
|
|
||||||
bk = Im [kk]; Im [kk] = Im [k2]; Im [k2] = bk;
|
|
||||||
kk += inc;
|
|
||||||
k2 += kspan;
|
|
||||||
} while (k2 < (ns-1));
|
|
||||||
do {
|
|
||||||
do {
|
|
||||||
k2 -= fftstate->Perm [j - 1];
|
|
||||||
j++;
|
|
||||||
k2 = fftstate->Perm [j] + k2;
|
|
||||||
} while (k2 >= fftstate->Perm [j - 1]);
|
|
||||||
j = 1;
|
|
||||||
do {
|
|
||||||
if (kk < k2)
|
|
||||||
goto Permute_Single_Label;
|
|
||||||
kk += inc;
|
|
||||||
k2 += kspan;
|
|
||||||
} while (k2 < (ns-1));
|
|
||||||
} while (kk < (ns-1));
|
|
||||||
}
|
|
||||||
jc = k3;
|
|
||||||
}
|
|
||||||
|
|
||||||
if ((kt << 1) + 1 >= mfactor)
|
|
||||||
return 0;
|
|
||||||
ispan = fftstate->Perm [kt];
|
|
||||||
/* permutation for square-free factors of n */
|
|
||||||
j = mfactor - kt;
|
|
||||||
fftstate->factor [j] = 1;
|
|
||||||
do {
|
|
||||||
fftstate->factor [j - 1] *= fftstate->factor [j];
|
|
||||||
j--;
|
|
||||||
} while (j != kt);
|
|
||||||
kt++;
|
|
||||||
nn = fftstate->factor [kt - 1] - 1;
|
|
||||||
if (nn > (int) max_perm) {
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
j = jj = 0;
|
|
||||||
for (;;) {
|
|
||||||
k = kt + 1;
|
|
||||||
k2 = fftstate->factor [kt - 1];
|
|
||||||
kk = fftstate->factor [k - 1];
|
|
||||||
j++;
|
|
||||||
if (j > nn)
|
|
||||||
break; /* exit infinite loop */
|
|
||||||
jj += kk;
|
|
||||||
while (jj >= k2) {
|
|
||||||
jj -= k2;
|
|
||||||
k2 = kk;
|
|
||||||
k++;
|
|
||||||
kk = fftstate->factor [k - 1];
|
|
||||||
jj += kk;
|
|
||||||
}
|
|
||||||
fftstate->Perm [j - 1] = jj;
|
|
||||||
}
|
|
||||||
/* determine the permutation cycles of length greater than 1 */
|
|
||||||
j = 0;
|
|
||||||
for (;;) {
|
|
||||||
do {
|
|
||||||
j++;
|
|
||||||
kk = fftstate->Perm [j - 1];
|
|
||||||
} while (kk < 0);
|
|
||||||
if (kk != j) {
|
|
||||||
do {
|
|
||||||
k = kk;
|
|
||||||
kk = fftstate->Perm [k - 1];
|
|
||||||
fftstate->Perm [k - 1] = -kk;
|
|
||||||
} while (kk != j);
|
|
||||||
k3 = kk;
|
|
||||||
} else {
|
|
||||||
fftstate->Perm [j - 1] = -j;
|
|
||||||
if (j == nn)
|
|
||||||
break; /* exit infinite loop */
|
|
||||||
}
|
|
||||||
}
|
|
||||||
max_factors *= inc;
|
|
||||||
/* reorder a and b, following the permutation cycles */
|
|
||||||
for (;;) {
|
|
||||||
j = k3 + 1;
|
|
||||||
nt -= ispan;
|
|
||||||
ii = nt - inc + 1;
|
|
||||||
if (nt < 0)
|
|
||||||
break; /* exit infinite loop */
|
|
||||||
do {
|
|
||||||
do {
|
|
||||||
j--;
|
|
||||||
} while (fftstate->Perm [j - 1] < 0);
|
|
||||||
jj = jc;
|
|
||||||
do {
|
|
||||||
kspan = jj;
|
|
||||||
if (jj > max_factors) {
|
|
||||||
kspan = max_factors;
|
|
||||||
}
|
|
||||||
jj -= kspan;
|
|
||||||
k = fftstate->Perm [j - 1];
|
|
||||||
kk = jc * k + ii + jj;
|
|
||||||
k1 = kk + kspan - 1;
|
|
||||||
k2 = 0;
|
|
||||||
do {
|
|
||||||
k2++;
|
|
||||||
Rtmp [k2 - 1] = Re [k1];
|
|
||||||
Itmp [k2 - 1] = Im [k1];
|
|
||||||
k1 -= inc;
|
|
||||||
} while (k1 != (kk-1));
|
|
||||||
do {
|
|
||||||
k1 = kk + kspan - 1;
|
|
||||||
k2 = k1 - jc * (k + fftstate->Perm [k - 1]);
|
|
||||||
k = -fftstate->Perm [k - 1];
|
|
||||||
do {
|
|
||||||
Re [k1] = Re [k2];
|
|
||||||
Im [k1] = Im [k2];
|
|
||||||
k1 -= inc;
|
|
||||||
k2 -= inc;
|
|
||||||
} while (k1 != (kk-1));
|
|
||||||
kk = k2 + 1;
|
|
||||||
} while (k != j);
|
|
||||||
k1 = kk + kspan - 1;
|
|
||||||
k2 = 0;
|
|
||||||
do {
|
|
||||||
k2++;
|
|
||||||
Re [k1] = Rtmp [k2 - 1];
|
|
||||||
Im [k1] = Itmp [k2 - 1];
|
|
||||||
k1 -= inc;
|
|
||||||
} while (k1 != (kk-1));
|
|
||||||
} while (jj);
|
|
||||||
} while (j != 1);
|
|
||||||
}
|
|
||||||
return 0; /* exit point here */
|
|
||||||
}
|
|
||||||
/* ---------------------- end-of-file (c source) ---------------------- */
|
|
||||||
|
|
||||||
|
|
@ -1,45 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*--------------------------------*-C-*---------------------------------*
|
|
||||||
* File:
|
|
||||||
* fftn.h
|
|
||||||
* ---------------------------------------------------------------------*
|
|
||||||
* Re[]: real value array
|
|
||||||
* Im[]: imaginary value array
|
|
||||||
* nTotal: total number of complex values
|
|
||||||
* nPass: number of elements involved in this pass of transform
|
|
||||||
* nSpan: nspan/nPass = number of bytes to increment pointer
|
|
||||||
* in Re[] and Im[]
|
|
||||||
* isign: exponent: +1 = forward -1 = reverse
|
|
||||||
* scaling: normalizing constant by which the final result is *divided*
|
|
||||||
* scaling == -1, normalize by total dimension of the transform
|
|
||||||
* scaling < -1, normalize by the square-root of the total dimension
|
|
||||||
*
|
|
||||||
* ----------------------------------------------------------------------
|
|
||||||
* See the comments in the code for correct usage!
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_FFT_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_FFT_H_
|
|
||||||
|
|
||||||
|
|
||||||
#include "structs.h"
|
|
||||||
|
|
||||||
|
|
||||||
/* double precision routine */
|
|
||||||
|
|
||||||
|
|
||||||
int WebRtcIsac_Fftns (unsigned int ndim, const int dims[], double Re[], double Im[],
|
|
||||||
int isign, double scaling, FFTstr *fftstate);
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
#endif /* WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_FFT_H_ */
|
|
||||||
|
|
@ -1,89 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_FilterAR().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
int WebRtcSpl_FilterAR(G_CONST WebRtc_Word16* a,
|
|
||||||
int a_length,
|
|
||||||
G_CONST WebRtc_Word16* x,
|
|
||||||
int x_length,
|
|
||||||
WebRtc_Word16* state,
|
|
||||||
int state_length,
|
|
||||||
WebRtc_Word16* state_low,
|
|
||||||
int state_low_length,
|
|
||||||
WebRtc_Word16* filtered,
|
|
||||||
WebRtc_Word16* filtered_low,
|
|
||||||
int filtered_low_length)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 o;
|
|
||||||
WebRtc_Word32 oLOW;
|
|
||||||
int i, j, stop;
|
|
||||||
G_CONST WebRtc_Word16* x_ptr = &x[0];
|
|
||||||
WebRtc_Word16* filteredFINAL_ptr = filtered;
|
|
||||||
WebRtc_Word16* filteredFINAL_LOW_ptr = filtered_low;
|
|
||||||
|
|
||||||
for (i = 0; i < x_length; i++)
|
|
||||||
{
|
|
||||||
// Calculate filtered[i] and filtered_low[i]
|
|
||||||
G_CONST WebRtc_Word16* a_ptr = &a[1];
|
|
||||||
WebRtc_Word16* filtered_ptr = &filtered[i - 1];
|
|
||||||
WebRtc_Word16* filtered_low_ptr = &filtered_low[i - 1];
|
|
||||||
WebRtc_Word16* state_ptr = &state[state_length - 1];
|
|
||||||
WebRtc_Word16* state_low_ptr = &state_low[state_length - 1];
|
|
||||||
|
|
||||||
o = (WebRtc_Word32)(*x_ptr++) << 12;
|
|
||||||
oLOW = (WebRtc_Word32)0;
|
|
||||||
|
|
||||||
stop = (i < a_length) ? i + 1 : a_length;
|
|
||||||
for (j = 1; j < stop; j++)
|
|
||||||
{
|
|
||||||
o -= WEBRTC_SPL_MUL_16_16(*a_ptr, *filtered_ptr--);
|
|
||||||
oLOW -= WEBRTC_SPL_MUL_16_16(*a_ptr++, *filtered_low_ptr--);
|
|
||||||
}
|
|
||||||
for (j = i + 1; j < a_length; j++)
|
|
||||||
{
|
|
||||||
o -= WEBRTC_SPL_MUL_16_16(*a_ptr, *state_ptr--);
|
|
||||||
oLOW -= WEBRTC_SPL_MUL_16_16(*a_ptr++, *state_low_ptr--);
|
|
||||||
}
|
|
||||||
|
|
||||||
o += (oLOW >> 12);
|
|
||||||
*filteredFINAL_ptr = (WebRtc_Word16)((o + (WebRtc_Word32)2048) >> 12);
|
|
||||||
*filteredFINAL_LOW_ptr++ = (WebRtc_Word16)(o - ((WebRtc_Word32)(*filteredFINAL_ptr++)
|
|
||||||
<< 12));
|
|
||||||
}
|
|
||||||
|
|
||||||
// Save the filter state
|
|
||||||
if (x_length >= state_length)
|
|
||||||
{
|
|
||||||
WebRtcSpl_CopyFromEndW16(filtered, x_length, a_length - 1, state);
|
|
||||||
WebRtcSpl_CopyFromEndW16(filtered_low, x_length, a_length - 1, state_low);
|
|
||||||
} else
|
|
||||||
{
|
|
||||||
for (i = 0; i < state_length - x_length; i++)
|
|
||||||
{
|
|
||||||
state[i] = state[i + x_length];
|
|
||||||
state_low[i] = state_low[i + x_length];
|
|
||||||
}
|
|
||||||
for (i = 0; i < x_length; i++)
|
|
||||||
{
|
|
||||||
state[state_length - x_length + i] = filtered[i];
|
|
||||||
state[state_length - x_length + i] = filtered_low[i];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return x_length;
|
|
||||||
}
|
|
||||||
|
|
@ -1,49 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_FilterARFastQ12().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
void WebRtcSpl_FilterARFastQ12(WebRtc_Word16 *in, WebRtc_Word16 *out, WebRtc_Word16 *A,
|
|
||||||
WebRtc_Word16 A_length, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 o;
|
|
||||||
int i, j;
|
|
||||||
|
|
||||||
WebRtc_Word16 *x_ptr = &in[0];
|
|
||||||
WebRtc_Word16 *filtered_ptr = &out[0];
|
|
||||||
|
|
||||||
for (i = 0; i < length; i++)
|
|
||||||
{
|
|
||||||
// Calculate filtered[i]
|
|
||||||
G_CONST WebRtc_Word16 *a_ptr = &A[0];
|
|
||||||
WebRtc_Word16 *state_ptr = &out[i - 1];
|
|
||||||
|
|
||||||
o = WEBRTC_SPL_MUL_16_16(*x_ptr++, *a_ptr++);
|
|
||||||
|
|
||||||
for (j = 1; j < A_length; j++)
|
|
||||||
{
|
|
||||||
o -= WEBRTC_SPL_MUL_16_16(*a_ptr++,*state_ptr--);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Saturate the output
|
|
||||||
o = WEBRTC_SPL_SAT((WebRtc_Word32)134215679, o, (WebRtc_Word32)-134217728);
|
|
||||||
|
|
||||||
*filtered_ptr++ = (WebRtc_Word16)((o + (WebRtc_Word32)2048) >> 12);
|
|
||||||
}
|
|
||||||
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
@ -1,271 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <memory.h>
|
|
||||||
#ifdef WEBRTC_ANDROID
|
|
||||||
#include <stdlib.h>
|
|
||||||
#endif
|
|
||||||
#include "pitch_estimator.h"
|
|
||||||
#include "lpc_analysis.h"
|
|
||||||
#include "codec.h"
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_AllPoleFilter(double *InOut, double *Coef, int lengthInOut, int orderCoef){
|
|
||||||
|
|
||||||
/* the state of filter is assumed to be in InOut[-1] to InOut[-orderCoef] */
|
|
||||||
double scal;
|
|
||||||
double sum;
|
|
||||||
int n,k;
|
|
||||||
|
|
||||||
//if (fabs(Coef[0]-1.0)<0.001) {
|
|
||||||
if ( (Coef[0] > 0.9999) && (Coef[0] < 1.0001) )
|
|
||||||
{
|
|
||||||
for(n = 0; n < lengthInOut; n++)
|
|
||||||
{
|
|
||||||
sum = Coef[1] * InOut[-1];
|
|
||||||
for(k = 2; k <= orderCoef; k++){
|
|
||||||
sum += Coef[k] * InOut[-k];
|
|
||||||
}
|
|
||||||
*InOut++ -= sum;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
scal = 1.0 / Coef[0];
|
|
||||||
for(n=0;n<lengthInOut;n++)
|
|
||||||
{
|
|
||||||
*InOut *= scal;
|
|
||||||
for(k=1;k<=orderCoef;k++){
|
|
||||||
*InOut -= scal*Coef[k]*InOut[-k];
|
|
||||||
}
|
|
||||||
InOut++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_AllZeroFilter(double *In, double *Coef, int lengthInOut, int orderCoef, double *Out){
|
|
||||||
|
|
||||||
/* the state of filter is assumed to be in In[-1] to In[-orderCoef] */
|
|
||||||
|
|
||||||
int n, k;
|
|
||||||
double tmp;
|
|
||||||
|
|
||||||
for(n = 0; n < lengthInOut; n++)
|
|
||||||
{
|
|
||||||
tmp = In[0] * Coef[0];
|
|
||||||
|
|
||||||
for(k = 1; k <= orderCoef; k++){
|
|
||||||
tmp += Coef[k] * In[-k];
|
|
||||||
}
|
|
||||||
|
|
||||||
*Out++ = tmp;
|
|
||||||
In++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_ZeroPoleFilter(double *In, double *ZeroCoef, double *PoleCoef, int lengthInOut, int orderCoef, double *Out){
|
|
||||||
|
|
||||||
/* the state of the zero section is assumed to be in In[-1] to In[-orderCoef] */
|
|
||||||
/* the state of the pole section is assumed to be in Out[-1] to Out[-orderCoef] */
|
|
||||||
|
|
||||||
WebRtcIsac_AllZeroFilter(In,ZeroCoef,lengthInOut,orderCoef,Out);
|
|
||||||
WebRtcIsac_AllPoleFilter(Out,PoleCoef,lengthInOut,orderCoef);
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_AutoCorr(
|
|
||||||
double *r,
|
|
||||||
const double *x,
|
|
||||||
int N,
|
|
||||||
int order
|
|
||||||
)
|
|
||||||
{
|
|
||||||
int lag, n;
|
|
||||||
double sum, prod;
|
|
||||||
const double *x_lag;
|
|
||||||
|
|
||||||
for (lag = 0; lag <= order; lag++)
|
|
||||||
{
|
|
||||||
sum = 0.0f;
|
|
||||||
x_lag = &x[lag];
|
|
||||||
prod = x[0] * x_lag[0];
|
|
||||||
for (n = 1; n < N - lag; n++) {
|
|
||||||
sum += prod;
|
|
||||||
prod = x[n] * x_lag[n];
|
|
||||||
}
|
|
||||||
sum += prod;
|
|
||||||
r[lag] = sum;
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_BwExpand(double *out, double *in, double coef, short length) {
|
|
||||||
int i;
|
|
||||||
double chirp;
|
|
||||||
|
|
||||||
chirp = coef;
|
|
||||||
|
|
||||||
out[0] = in[0];
|
|
||||||
for (i = 1; i < length; i++) {
|
|
||||||
out[i] = chirp * in[i];
|
|
||||||
chirp *= coef;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcIsac_WeightingFilter(const double *in, double *weiout, double *whiout, WeightFiltstr *wfdata) {
|
|
||||||
|
|
||||||
double tmpbuffer[PITCH_FRAME_LEN + PITCH_WLPCBUFLEN];
|
|
||||||
double corr[PITCH_WLPCORDER+1], rc[PITCH_WLPCORDER+1];
|
|
||||||
double apol[PITCH_WLPCORDER+1], apolr[PITCH_WLPCORDER+1];
|
|
||||||
double rho=0.9, *inp, *dp, *dp2;
|
|
||||||
double whoutbuf[PITCH_WLPCBUFLEN + PITCH_WLPCORDER];
|
|
||||||
double weoutbuf[PITCH_WLPCBUFLEN + PITCH_WLPCORDER];
|
|
||||||
double *weo, *who, opol[PITCH_WLPCORDER+1], ext[PITCH_WLPCWINLEN];
|
|
||||||
int k, n, endpos, start;
|
|
||||||
|
|
||||||
/* Set up buffer and states */
|
|
||||||
memcpy(tmpbuffer, wfdata->buffer, sizeof(double) * PITCH_WLPCBUFLEN);
|
|
||||||
memcpy(tmpbuffer+PITCH_WLPCBUFLEN, in, sizeof(double) * PITCH_FRAME_LEN);
|
|
||||||
memcpy(wfdata->buffer, tmpbuffer+PITCH_FRAME_LEN, sizeof(double) * PITCH_WLPCBUFLEN);
|
|
||||||
|
|
||||||
dp=weoutbuf;
|
|
||||||
dp2=whoutbuf;
|
|
||||||
for (k=0;k<PITCH_WLPCORDER;k++) {
|
|
||||||
*dp++ = wfdata->weostate[k];
|
|
||||||
*dp2++ = wfdata->whostate[k];
|
|
||||||
opol[k]=0.0;
|
|
||||||
}
|
|
||||||
opol[0]=1.0;
|
|
||||||
opol[PITCH_WLPCORDER]=0.0;
|
|
||||||
weo=dp;
|
|
||||||
who=dp2;
|
|
||||||
|
|
||||||
endpos=PITCH_WLPCBUFLEN + PITCH_SUBFRAME_LEN;
|
|
||||||
inp=tmpbuffer + PITCH_WLPCBUFLEN;
|
|
||||||
|
|
||||||
for (n=0; n<PITCH_SUBFRAMES; n++) {
|
|
||||||
/* Windowing */
|
|
||||||
start=endpos-PITCH_WLPCWINLEN;
|
|
||||||
for (k=0; k<PITCH_WLPCWINLEN; k++) {
|
|
||||||
ext[k]=wfdata->window[k]*tmpbuffer[start+k];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Get LPC polynomial */
|
|
||||||
WebRtcIsac_AutoCorr(corr, ext, PITCH_WLPCWINLEN, PITCH_WLPCORDER);
|
|
||||||
corr[0]=1.01*corr[0]+1.0; /* White noise correction */
|
|
||||||
WebRtcIsac_LevDurb(apol, rc, corr, PITCH_WLPCORDER);
|
|
||||||
WebRtcIsac_BwExpand(apolr, apol, rho, PITCH_WLPCORDER+1);
|
|
||||||
|
|
||||||
/* Filtering */
|
|
||||||
WebRtcIsac_ZeroPoleFilter(inp, apol, apolr, PITCH_SUBFRAME_LEN, PITCH_WLPCORDER, weo);
|
|
||||||
WebRtcIsac_ZeroPoleFilter(inp, apolr, opol, PITCH_SUBFRAME_LEN, PITCH_WLPCORDER, who);
|
|
||||||
|
|
||||||
inp+=PITCH_SUBFRAME_LEN;
|
|
||||||
endpos+=PITCH_SUBFRAME_LEN;
|
|
||||||
weo+=PITCH_SUBFRAME_LEN;
|
|
||||||
who+=PITCH_SUBFRAME_LEN;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Export filter states */
|
|
||||||
for (k=0;k<PITCH_WLPCORDER;k++) {
|
|
||||||
wfdata->weostate[k]=weoutbuf[PITCH_FRAME_LEN+k];
|
|
||||||
wfdata->whostate[k]=whoutbuf[PITCH_FRAME_LEN+k];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Export output data */
|
|
||||||
memcpy(weiout, weoutbuf+PITCH_WLPCORDER, sizeof(double) * PITCH_FRAME_LEN);
|
|
||||||
memcpy(whiout, whoutbuf+PITCH_WLPCORDER, sizeof(double) * PITCH_FRAME_LEN);
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
static const double APupper[ALLPASSSECTIONS] = {0.0347, 0.3826};
|
|
||||||
static const double APlower[ALLPASSSECTIONS] = {0.1544, 0.744};
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_AllpassFilterForDec(double *InOut,
|
|
||||||
const double *APSectionFactors,
|
|
||||||
int lengthInOut,
|
|
||||||
double *FilterState)
|
|
||||||
{
|
|
||||||
//This performs all-pass filtering--a series of first order all-pass sections are used
|
|
||||||
//to filter the input in a cascade manner.
|
|
||||||
int n,j;
|
|
||||||
double temp;
|
|
||||||
for (j=0; j<ALLPASSSECTIONS; j++){
|
|
||||||
for (n=0;n<lengthInOut;n+=2){
|
|
||||||
temp = InOut[n]; //store input
|
|
||||||
InOut[n] = FilterState[j] + APSectionFactors[j]*temp;
|
|
||||||
FilterState[j] = -APSectionFactors[j]*InOut[n] + temp;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcIsac_DecimateAllpass(const double *in,
|
|
||||||
double *state_in, /* array of size: 2*ALLPASSSECTIONS+1 */
|
|
||||||
int N, /* number of input samples */
|
|
||||||
double *out) /* array of size N/2 */
|
|
||||||
{
|
|
||||||
int n;
|
|
||||||
double data_vec[PITCH_FRAME_LEN];
|
|
||||||
|
|
||||||
/* copy input */
|
|
||||||
memcpy(data_vec+1, in, sizeof(double) * (N-1));
|
|
||||||
|
|
||||||
data_vec[0] = state_in[2*ALLPASSSECTIONS]; //the z^(-1) state
|
|
||||||
state_in[2*ALLPASSSECTIONS] = in[N-1];
|
|
||||||
|
|
||||||
WebRtcIsac_AllpassFilterForDec(data_vec+1, APupper, N, state_in);
|
|
||||||
WebRtcIsac_AllpassFilterForDec(data_vec, APlower, N, state_in+ALLPASSSECTIONS);
|
|
||||||
|
|
||||||
for (n=0;n<N/2;n++)
|
|
||||||
out[n] = data_vec[2*n] + data_vec[2*n+1];
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* create high-pass filter ocefficients
|
|
||||||
* z = 0.998 * exp(j*2*pi*35/8000);
|
|
||||||
* p = 0.94 * exp(j*2*pi*140/8000);
|
|
||||||
* HP_b = [1, -2*real(z), abs(z)^2];
|
|
||||||
* HP_a = [1, -2*real(p), abs(p)^2]; */
|
|
||||||
static const double a_coef[2] = { 1.86864659625574, -0.88360000000000};
|
|
||||||
static const double b_coef[2] = {-1.99524591718270, 0.99600400000000};
|
|
||||||
static const float a_coef_float[2] = { 1.86864659625574f, -0.88360000000000f};
|
|
||||||
static const float b_coef_float[2] = {-1.99524591718270f, 0.99600400000000f};
|
|
||||||
|
|
||||||
/* second order high-pass filter */
|
|
||||||
void WebRtcIsac_Highpass(const double *in, double *out, double *state, int N)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
|
|
||||||
for (k=0; k<N; k++) {
|
|
||||||
*out = *in + state[1];
|
|
||||||
state[1] = state[0] + b_coef[0] * *in + a_coef[0] * *out;
|
|
||||||
state[0] = b_coef[1] * *in++ + a_coef[1] * *out++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcIsac_Highpass_float(const float *in, double *out, double *state, int N)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
|
|
||||||
for (k=0; k<N; k++) {
|
|
||||||
*out = (double)*in + state[1];
|
|
||||||
state[1] = state[0] + b_coef_float[0] * *in + a_coef_float[0] * *out;
|
|
||||||
state[0] = b_coef_float[1] * (double)*in++ + a_coef_float[1] * *out++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
@ -1,49 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_FilterMAFastQ12().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
void WebRtcSpl_FilterMAFastQ12(WebRtc_Word16* in_ptr,
|
|
||||||
WebRtc_Word16* out_ptr,
|
|
||||||
WebRtc_Word16* B,
|
|
||||||
WebRtc_Word16 B_length,
|
|
||||||
WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 o;
|
|
||||||
int i, j;
|
|
||||||
for (i = 0; i < length; i++)
|
|
||||||
{
|
|
||||||
G_CONST WebRtc_Word16* b_ptr = &B[0];
|
|
||||||
G_CONST WebRtc_Word16* x_ptr = &in_ptr[i];
|
|
||||||
|
|
||||||
o = (WebRtc_Word32)0;
|
|
||||||
|
|
||||||
for (j = 0; j < B_length; j++)
|
|
||||||
{
|
|
||||||
o += WEBRTC_SPL_MUL_16_16(*b_ptr++, *x_ptr--);
|
|
||||||
}
|
|
||||||
|
|
||||||
// If output is higher than 32768, saturate it. Same with negative side
|
|
||||||
// 2^27 = 134217728, which corresponds to 32768 in Q12
|
|
||||||
|
|
||||||
// Saturate the output
|
|
||||||
o = WEBRTC_SPL_SAT((WebRtc_Word32)134215679, o, (WebRtc_Word32)-134217728);
|
|
||||||
|
|
||||||
*out_ptr++ = (WebRtc_Word16)((o + (WebRtc_Word32)2048) >> 12);
|
|
||||||
}
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
@ -1,37 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/* filterbank_tables.c*/
|
|
||||||
/* This file contains variables that are used in filterbanks.c*/
|
|
||||||
|
|
||||||
#include "filterbank_tables.h"
|
|
||||||
#include "settings.h"
|
|
||||||
|
|
||||||
/* The composite all-pass filter factors */
|
|
||||||
const float WebRtcIsac_kCompositeApFactorsFloat[4] = {
|
|
||||||
0.03470000000000f, 0.15440000000000f, 0.38260000000000f, 0.74400000000000f};
|
|
||||||
|
|
||||||
/* The upper channel all-pass filter factors */
|
|
||||||
const float WebRtcIsac_kUpperApFactorsFloat[2] = {
|
|
||||||
0.03470000000000f, 0.38260000000000f};
|
|
||||||
|
|
||||||
/* The lower channel all-pass filter factors */
|
|
||||||
const float WebRtcIsac_kLowerApFactorsFloat[2] = {
|
|
||||||
0.15440000000000f, 0.74400000000000f};
|
|
||||||
|
|
||||||
/* The matrix for transforming the backward composite state to upper channel state */
|
|
||||||
const float WebRtcIsac_kTransform1Float[8] = {
|
|
||||||
-0.00158678506084f, 0.00127157815343f, -0.00104805672709f, 0.00084837248079f,
|
|
||||||
0.00134467983258f, -0.00107756549387f, 0.00088814793277f, -0.00071893072525f};
|
|
||||||
|
|
||||||
/* The matrix for transforming the backward composite state to lower channel state */
|
|
||||||
const float WebRtcIsac_kTransform2Float[8] = {
|
|
||||||
-0.00170686041697f, 0.00136780109829f, -0.00112736532350f, 0.00091257055385f,
|
|
||||||
0.00103094281812f, -0.00082615076557f, 0.00068092756088f, -0.00055119165484f};
|
|
||||||
|
|
@ -1,46 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* filterbank_tables.h
|
|
||||||
*
|
|
||||||
* Header file for variables that are defined in
|
|
||||||
* filterbank_tables.c.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_FILTERBANK_TABLES_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_FILTERBANK_TABLES_H_
|
|
||||||
|
|
||||||
#include "structs.h"
|
|
||||||
|
|
||||||
/********************* Coefficient Tables ************************/
|
|
||||||
/* The number of composite all-pass filter factors */
|
|
||||||
#define NUMBEROFCOMPOSITEAPSECTIONS 4
|
|
||||||
|
|
||||||
/* The number of all-pass filter factors in an upper or lower channel*/
|
|
||||||
#define NUMBEROFCHANNELAPSECTIONS 2
|
|
||||||
|
|
||||||
/* The composite all-pass filter factors */
|
|
||||||
extern const float WebRtcIsac_kCompositeApFactorsFloat[4];
|
|
||||||
|
|
||||||
/* The upper channel all-pass filter factors */
|
|
||||||
extern const float WebRtcIsac_kUpperApFactorsFloat[2];
|
|
||||||
|
|
||||||
/* The lower channel all-pass filter factors */
|
|
||||||
extern const float WebRtcIsac_kLowerApFactorsFloat[2];
|
|
||||||
|
|
||||||
/* The matrix for transforming the backward composite state to upper channel state */
|
|
||||||
extern const float WebRtcIsac_kTransform1Float[8];
|
|
||||||
|
|
||||||
/* The matrix for transforming the backward composite state to lower channel state */
|
|
||||||
extern const float WebRtcIsac_kTransform2Float[8];
|
|
||||||
|
|
||||||
#endif /* WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_FILTERBANK_TABLES_H_ */
|
|
||||||
|
|
@ -1,346 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* filterbanks.c
|
|
||||||
*
|
|
||||||
* This file contains function WebRtcIsac_AllPassFilter2Float,
|
|
||||||
* WebRtcIsac_SplitAndFilter, and WebRtcIsac_FilterAndCombine
|
|
||||||
* which implement filterbanks that produce decimated lowpass and
|
|
||||||
* highpass versions of a signal, and performs reconstruction.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "settings.h"
|
|
||||||
#include "filterbank_tables.h"
|
|
||||||
#include "codec.h"
|
|
||||||
|
|
||||||
/* This function performs all-pass filtering--a series of first order all-pass
|
|
||||||
* sections are used to filter the input in a cascade manner.
|
|
||||||
* The input is overwritten!!
|
|
||||||
*/
|
|
||||||
static void WebRtcIsac_AllPassFilter2Float(float *InOut, const float *APSectionFactors,
|
|
||||||
int lengthInOut, int NumberOfSections,
|
|
||||||
float *FilterState)
|
|
||||||
{
|
|
||||||
int n, j;
|
|
||||||
float temp;
|
|
||||||
for (j=0; j<NumberOfSections; j++){
|
|
||||||
for (n=0;n<lengthInOut;n++){
|
|
||||||
temp = FilterState[j] + APSectionFactors[j] * InOut[n];
|
|
||||||
FilterState[j] = -APSectionFactors[j] * temp + InOut[n];
|
|
||||||
InOut[n] = temp;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* HPstcoeff_in = {a1, a2, b1 - b0 * a1, b2 - b0 * a2}; */
|
|
||||||
static const float kHpStCoefInFloat[4] =
|
|
||||||
{-1.94895953203325f, 0.94984516000000f, -0.05101826139794f, 0.05015484000000f};
|
|
||||||
|
|
||||||
/* Function WebRtcIsac_SplitAndFilter
|
|
||||||
* This function creates low-pass and high-pass decimated versions of part of
|
|
||||||
the input signal, and part of the signal in the input 'lookahead buffer'.
|
|
||||||
|
|
||||||
INPUTS:
|
|
||||||
in: a length FRAMESAMPLES array of input samples
|
|
||||||
prefiltdata: input data structure containing the filterbank states
|
|
||||||
and lookahead samples from the previous encoding
|
|
||||||
iteration.
|
|
||||||
OUTPUTS:
|
|
||||||
LP: a FRAMESAMPLES_HALF array of low-pass filtered samples that
|
|
||||||
have been phase equalized. The first QLOOKAHEAD samples are
|
|
||||||
based on the samples in the two prefiltdata->INLABUFx arrays
|
|
||||||
each of length QLOOKAHEAD.
|
|
||||||
The remaining FRAMESAMPLES_HALF-QLOOKAHEAD samples are based
|
|
||||||
on the first FRAMESAMPLES_HALF-QLOOKAHEAD samples of the input
|
|
||||||
array in[].
|
|
||||||
HP: a FRAMESAMPLES_HALF array of high-pass filtered samples that
|
|
||||||
have been phase equalized. The first QLOOKAHEAD samples are
|
|
||||||
based on the samples in the two prefiltdata->INLABUFx arrays
|
|
||||||
each of length QLOOKAHEAD.
|
|
||||||
The remaining FRAMESAMPLES_HALF-QLOOKAHEAD samples are based
|
|
||||||
on the first FRAMESAMPLES_HALF-QLOOKAHEAD samples of the input
|
|
||||||
array in[].
|
|
||||||
|
|
||||||
LP_la: a FRAMESAMPLES_HALF array of low-pass filtered samples.
|
|
||||||
These samples are not phase equalized. They are computed
|
|
||||||
from the samples in the in[] array.
|
|
||||||
HP_la: a FRAMESAMPLES_HALF array of high-pass filtered samples
|
|
||||||
that are not phase equalized. They are computed from
|
|
||||||
the in[] vector.
|
|
||||||
prefiltdata: this input data structure's filterbank state and
|
|
||||||
lookahead sample buffers are updated for the next
|
|
||||||
encoding iteration.
|
|
||||||
*/
|
|
||||||
void WebRtcIsac_SplitAndFilterFloat(float *pin, float *LP, float *HP,
|
|
||||||
double *LP_la, double *HP_la,
|
|
||||||
PreFiltBankstr *prefiltdata)
|
|
||||||
{
|
|
||||||
int k,n;
|
|
||||||
float CompositeAPFilterState[NUMBEROFCOMPOSITEAPSECTIONS];
|
|
||||||
float ForTransform_CompositeAPFilterState[NUMBEROFCOMPOSITEAPSECTIONS];
|
|
||||||
float ForTransform_CompositeAPFilterState2[NUMBEROFCOMPOSITEAPSECTIONS];
|
|
||||||
float tempinoutvec[FRAMESAMPLES+MAX_AR_MODEL_ORDER];
|
|
||||||
float tempin_ch1[FRAMESAMPLES+MAX_AR_MODEL_ORDER];
|
|
||||||
float tempin_ch2[FRAMESAMPLES+MAX_AR_MODEL_ORDER];
|
|
||||||
float in[FRAMESAMPLES];
|
|
||||||
float ftmp;
|
|
||||||
|
|
||||||
|
|
||||||
/* High pass filter */
|
|
||||||
|
|
||||||
for (k=0;k<FRAMESAMPLES;k++) {
|
|
||||||
in[k] = pin[k] + kHpStCoefInFloat[2] * prefiltdata->HPstates_float[0] +
|
|
||||||
kHpStCoefInFloat[3] * prefiltdata->HPstates_float[1];
|
|
||||||
ftmp = pin[k] - kHpStCoefInFloat[0] * prefiltdata->HPstates_float[0] -
|
|
||||||
kHpStCoefInFloat[1] * prefiltdata->HPstates_float[1];
|
|
||||||
prefiltdata->HPstates_float[1] = prefiltdata->HPstates_float[0];
|
|
||||||
prefiltdata->HPstates_float[0] = ftmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
% backwards all-pass filtering to obtain zero-phase
|
|
||||||
[tmp1(N2+LA:-1:LA+1, 1), state1] = filter(Q.coef, Q.coef(end:-1:1), in(N:-2:2));
|
|
||||||
tmp1(LA:-1:1) = filter(Q.coef, Q.coef(end:-1:1), Q.LookAheadBuf1, state1);
|
|
||||||
Q.LookAheadBuf1 = in(N:-2:N-2*LA+2);
|
|
||||||
*/
|
|
||||||
/*Backwards all-pass filter the odd samples of the input (upper channel)
|
|
||||||
to eventually obtain zero phase. The composite all-pass filter (comprised of both
|
|
||||||
the upper and lower channel all-pass filsters in series) is used for the
|
|
||||||
filtering. */
|
|
||||||
|
|
||||||
/* First Channel */
|
|
||||||
|
|
||||||
/*initial state of composite filter is zero */
|
|
||||||
for (k=0;k<NUMBEROFCOMPOSITEAPSECTIONS;k++){
|
|
||||||
CompositeAPFilterState[k] = 0.0;
|
|
||||||
}
|
|
||||||
/* put every other sample of input into a temporary vector in reverse (backward) order*/
|
|
||||||
for (k=0;k<FRAMESAMPLES_HALF;k++) {
|
|
||||||
tempinoutvec[k] = in[FRAMESAMPLES-1-2*k];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* now all-pass filter the backwards vector. Output values overwrite the input vector. */
|
|
||||||
WebRtcIsac_AllPassFilter2Float(tempinoutvec, WebRtcIsac_kCompositeApFactorsFloat,
|
|
||||||
FRAMESAMPLES_HALF, NUMBEROFCOMPOSITEAPSECTIONS, CompositeAPFilterState);
|
|
||||||
|
|
||||||
/* save the backwards filtered output for later forward filtering,
|
|
||||||
but write it in forward order*/
|
|
||||||
for (k=0;k<FRAMESAMPLES_HALF;k++) {
|
|
||||||
tempin_ch1[FRAMESAMPLES_HALF+QLOOKAHEAD-1-k] = tempinoutvec[k];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* save the backwards filter state becaue it will be transformed
|
|
||||||
later into a forward state */
|
|
||||||
for (k=0; k<NUMBEROFCOMPOSITEAPSECTIONS; k++) {
|
|
||||||
ForTransform_CompositeAPFilterState[k] = CompositeAPFilterState[k];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* now backwards filter the samples in the lookahead buffer. The samples were
|
|
||||||
placed there in the encoding of the previous frame. The output samples
|
|
||||||
overwrite the input samples */
|
|
||||||
WebRtcIsac_AllPassFilter2Float(prefiltdata->INLABUF1_float,
|
|
||||||
WebRtcIsac_kCompositeApFactorsFloat, QLOOKAHEAD,
|
|
||||||
NUMBEROFCOMPOSITEAPSECTIONS, CompositeAPFilterState);
|
|
||||||
|
|
||||||
/* save the output, but write it in forward order */
|
|
||||||
/* write the lookahead samples for the next encoding iteration. Every other
|
|
||||||
sample at the end of the input frame is written in reverse order for the
|
|
||||||
lookahead length. Exported in the prefiltdata structure. */
|
|
||||||
for (k=0;k<QLOOKAHEAD;k++) {
|
|
||||||
tempin_ch1[QLOOKAHEAD-1-k]=prefiltdata->INLABUF1_float[k];
|
|
||||||
prefiltdata->INLABUF1_float[k]=in[FRAMESAMPLES-1-2*k];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Second Channel. This is exactly like the first channel, except that the
|
|
||||||
even samples are now filtered instead (lower channel). */
|
|
||||||
for (k=0;k<NUMBEROFCOMPOSITEAPSECTIONS;k++){
|
|
||||||
CompositeAPFilterState[k] = 0.0;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (k=0;k<FRAMESAMPLES_HALF;k++) {
|
|
||||||
tempinoutvec[k] = in[FRAMESAMPLES-2-2*k];
|
|
||||||
}
|
|
||||||
|
|
||||||
WebRtcIsac_AllPassFilter2Float(tempinoutvec, WebRtcIsac_kCompositeApFactorsFloat,
|
|
||||||
FRAMESAMPLES_HALF, NUMBEROFCOMPOSITEAPSECTIONS, CompositeAPFilterState);
|
|
||||||
|
|
||||||
for (k=0;k<FRAMESAMPLES_HALF;k++) {
|
|
||||||
tempin_ch2[FRAMESAMPLES_HALF+QLOOKAHEAD-1-k] = tempinoutvec[k];
|
|
||||||
}
|
|
||||||
|
|
||||||
for (k=0; k<NUMBEROFCOMPOSITEAPSECTIONS; k++) {
|
|
||||||
ForTransform_CompositeAPFilterState2[k] = CompositeAPFilterState[k];
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
WebRtcIsac_AllPassFilter2Float(prefiltdata->INLABUF2_float,
|
|
||||||
WebRtcIsac_kCompositeApFactorsFloat, QLOOKAHEAD,NUMBEROFCOMPOSITEAPSECTIONS,
|
|
||||||
CompositeAPFilterState);
|
|
||||||
|
|
||||||
for (k=0;k<QLOOKAHEAD;k++) {
|
|
||||||
tempin_ch2[QLOOKAHEAD-1-k]=prefiltdata->INLABUF2_float[k];
|
|
||||||
prefiltdata->INLABUF2_float[k]=in[FRAMESAMPLES-2-2*k];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Transform filter states from backward to forward */
|
|
||||||
/*At this point, each of the states of the backwards composite filters for the
|
|
||||||
two channels are transformed into forward filtering states for the corresponding
|
|
||||||
forward channel filters. Each channel's forward filtering state from the previous
|
|
||||||
encoding iteration is added to the transformed state to get a proper forward state */
|
|
||||||
|
|
||||||
/* So the existing NUMBEROFCOMPOSITEAPSECTIONS x 1 (4x1) state vector is multiplied by a
|
|
||||||
NUMBEROFCHANNELAPSECTIONSxNUMBEROFCOMPOSITEAPSECTIONS (2x4) transform matrix to get the
|
|
||||||
new state that is added to the previous 2x1 input state */
|
|
||||||
|
|
||||||
for (k=0;k<NUMBEROFCHANNELAPSECTIONS;k++){ /* k is row variable */
|
|
||||||
for (n=0; n<NUMBEROFCOMPOSITEAPSECTIONS;n++){/* n is column variable */
|
|
||||||
prefiltdata->INSTAT1_float[k] += ForTransform_CompositeAPFilterState[n]*
|
|
||||||
WebRtcIsac_kTransform1Float[k*NUMBEROFCHANNELAPSECTIONS+n];
|
|
||||||
prefiltdata->INSTAT2_float[k] += ForTransform_CompositeAPFilterState2[n]*
|
|
||||||
WebRtcIsac_kTransform2Float[k*NUMBEROFCHANNELAPSECTIONS+n];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/*obtain polyphase components by forward all-pass filtering through each channel */
|
|
||||||
/* the backward filtered samples are now forward filtered with the corresponding channel filters */
|
|
||||||
/* The all pass filtering automatically updates the filter states which are exported in the
|
|
||||||
prefiltdata structure */
|
|
||||||
WebRtcIsac_AllPassFilter2Float(tempin_ch1,WebRtcIsac_kUpperApFactorsFloat,
|
|
||||||
FRAMESAMPLES_HALF, NUMBEROFCHANNELAPSECTIONS, prefiltdata->INSTAT1_float);
|
|
||||||
WebRtcIsac_AllPassFilter2Float(tempin_ch2,WebRtcIsac_kLowerApFactorsFloat,
|
|
||||||
FRAMESAMPLES_HALF, NUMBEROFCHANNELAPSECTIONS, prefiltdata->INSTAT2_float);
|
|
||||||
|
|
||||||
/* Now Construct low-pass and high-pass signals as combinations of polyphase components */
|
|
||||||
for (k=0; k<FRAMESAMPLES_HALF; k++) {
|
|
||||||
LP[k] = 0.5f*(tempin_ch1[k] + tempin_ch2[k]);/* low pass signal*/
|
|
||||||
HP[k] = 0.5f*(tempin_ch1[k] - tempin_ch2[k]);/* high pass signal*/
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Lookahead LP and HP signals */
|
|
||||||
/* now create low pass and high pass signals of the input vector. However, no
|
|
||||||
backwards filtering is performed, and hence no phase equalization is involved.
|
|
||||||
Also, the input contains some samples that are lookahead samples. The high pass
|
|
||||||
and low pass signals that are created are used outside this function for analysis
|
|
||||||
(not encoding) purposes */
|
|
||||||
|
|
||||||
/* set up input */
|
|
||||||
for (k=0; k<FRAMESAMPLES_HALF; k++) {
|
|
||||||
tempin_ch1[k]=in[2*k+1];
|
|
||||||
tempin_ch2[k]=in[2*k];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* the input filter states are passed in and updated by the all-pass filtering routine and
|
|
||||||
exported in the prefiltdata structure*/
|
|
||||||
WebRtcIsac_AllPassFilter2Float(tempin_ch1,WebRtcIsac_kUpperApFactorsFloat,
|
|
||||||
FRAMESAMPLES_HALF, NUMBEROFCHANNELAPSECTIONS, prefiltdata->INSTATLA1_float);
|
|
||||||
WebRtcIsac_AllPassFilter2Float(tempin_ch2,WebRtcIsac_kLowerApFactorsFloat,
|
|
||||||
FRAMESAMPLES_HALF, NUMBEROFCHANNELAPSECTIONS, prefiltdata->INSTATLA2_float);
|
|
||||||
|
|
||||||
for (k=0; k<FRAMESAMPLES_HALF; k++) {
|
|
||||||
LP_la[k] = (float)(0.5f*(tempin_ch1[k] + tempin_ch2[k])); /*low pass */
|
|
||||||
HP_la[k] = (double)(0.5f*(tempin_ch1[k] - tempin_ch2[k])); /* high pass */
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
}/*end of WebRtcIsac_SplitAndFilter */
|
|
||||||
|
|
||||||
|
|
||||||
/* Combining */
|
|
||||||
|
|
||||||
/* HPstcoeff_out_1 = {a1, a2, b1 - b0 * a1, b2 - b0 * a2}; */
|
|
||||||
static const float kHpStCoefOut1Float[4] =
|
|
||||||
{-1.99701049409000f, 0.99714204490000f, 0.01701049409000f, -0.01704204490000f};
|
|
||||||
|
|
||||||
/* HPstcoeff_out_2 = {a1, a2, b1 - b0 * a1, b2 - b0 * a2}; */
|
|
||||||
static const float kHpStCoefOut2Float[4] =
|
|
||||||
{-1.98645294509837f, 0.98672435560000f, 0.00645294509837f, -0.00662435560000f};
|
|
||||||
|
|
||||||
|
|
||||||
/* Function WebRtcIsac_FilterAndCombine */
|
|
||||||
/* This is a decoder function that takes the decimated
|
|
||||||
length FRAMESAMPLES_HALF input low-pass and
|
|
||||||
high-pass signals and creates a reconstructed fullband
|
|
||||||
output signal of length FRAMESAMPLES. WebRtcIsac_FilterAndCombine
|
|
||||||
is the sibling function of WebRtcIsac_SplitAndFilter */
|
|
||||||
/* INPUTS:
|
|
||||||
inLP: a length FRAMESAMPLES_HALF array of input low-pass
|
|
||||||
samples.
|
|
||||||
inHP: a length FRAMESAMPLES_HALF array of input high-pass
|
|
||||||
samples.
|
|
||||||
postfiltdata: input data structure containing the filterbank
|
|
||||||
states from the previous decoding iteration.
|
|
||||||
OUTPUTS:
|
|
||||||
Out: a length FRAMESAMPLES array of output reconstructed
|
|
||||||
samples (fullband) based on the input low-pass and
|
|
||||||
high-pass signals.
|
|
||||||
postfiltdata: the input data structure containing the filterbank
|
|
||||||
states is updated for the next decoding iteration */
|
|
||||||
void WebRtcIsac_FilterAndCombineFloat(float *InLP,
|
|
||||||
float *InHP,
|
|
||||||
float *Out,
|
|
||||||
PostFiltBankstr *postfiltdata)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
float tempin_ch1[FRAMESAMPLES+MAX_AR_MODEL_ORDER];
|
|
||||||
float tempin_ch2[FRAMESAMPLES+MAX_AR_MODEL_ORDER];
|
|
||||||
float ftmp, ftmp2;
|
|
||||||
|
|
||||||
/* Form the polyphase signals*/
|
|
||||||
for (k=0;k<FRAMESAMPLES_HALF;k++) {
|
|
||||||
tempin_ch1[k]=InLP[k]+InHP[k]; /* Construct a new upper channel signal*/
|
|
||||||
tempin_ch2[k]=InLP[k]-InHP[k]; /* Construct a new lower channel signal*/
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* all-pass filter the new upper channel signal. HOWEVER, use the all-pass filter factors
|
|
||||||
that were used as a lower channel at the encoding side. So at the decoder, the
|
|
||||||
corresponding all-pass filter factors for each channel are swapped.*/
|
|
||||||
WebRtcIsac_AllPassFilter2Float(tempin_ch1, WebRtcIsac_kLowerApFactorsFloat,
|
|
||||||
FRAMESAMPLES_HALF, NUMBEROFCHANNELAPSECTIONS,postfiltdata->STATE_0_UPPER_float);
|
|
||||||
|
|
||||||
/* Now, all-pass filter the new lower channel signal. But since all-pass filter factors
|
|
||||||
at the decoder are swapped from the ones at the encoder, the 'upper' channel
|
|
||||||
all-pass filter factors (WebRtcIsac_kUpperApFactorsFloat) are used to filter this new
|
|
||||||
lower channel signal */
|
|
||||||
WebRtcIsac_AllPassFilter2Float(tempin_ch2, WebRtcIsac_kUpperApFactorsFloat,
|
|
||||||
FRAMESAMPLES_HALF, NUMBEROFCHANNELAPSECTIONS,postfiltdata->STATE_0_LOWER_float);
|
|
||||||
|
|
||||||
|
|
||||||
/* Merge outputs to form the full length output signal.*/
|
|
||||||
for (k=0;k<FRAMESAMPLES_HALF;k++) {
|
|
||||||
Out[2*k]=tempin_ch2[k];
|
|
||||||
Out[2*k+1]=tempin_ch1[k];
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* High pass filter */
|
|
||||||
|
|
||||||
for (k=0;k<FRAMESAMPLES;k++) {
|
|
||||||
ftmp2 = Out[k] + kHpStCoefOut1Float[2] * postfiltdata->HPstates1_float[0] +
|
|
||||||
kHpStCoefOut1Float[3] * postfiltdata->HPstates1_float[1];
|
|
||||||
ftmp = Out[k] - kHpStCoefOut1Float[0] * postfiltdata->HPstates1_float[0] -
|
|
||||||
kHpStCoefOut1Float[1] * postfiltdata->HPstates1_float[1];
|
|
||||||
postfiltdata->HPstates1_float[1] = postfiltdata->HPstates1_float[0];
|
|
||||||
postfiltdata->HPstates1_float[0] = ftmp;
|
|
||||||
Out[k] = ftmp2;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (k=0;k<FRAMESAMPLES;k++) {
|
|
||||||
ftmp2 = Out[k] + kHpStCoefOut2Float[2] * postfiltdata->HPstates2_float[0] +
|
|
||||||
kHpStCoefOut2Float[3] * postfiltdata->HPstates2_float[1];
|
|
||||||
ftmp = Out[k] - kHpStCoefOut2Float[0] * postfiltdata->HPstates2_float[0] -
|
|
||||||
kHpStCoefOut2Float[1] * postfiltdata->HPstates2_float[1];
|
|
||||||
postfiltdata->HPstates2_float[1] = postfiltdata->HPstates2_float[0];
|
|
||||||
postfiltdata->HPstates2_float[0] = ftmp;
|
|
||||||
Out[k] = ftmp2;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
@ -1,77 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_GetHanningWindow().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
// Hanning table with 256 entries
|
|
||||||
static const WebRtc_Word16 kHanningTable[] = {
|
|
||||||
1, 2, 6, 10, 15, 22, 30, 39,
|
|
||||||
50, 62, 75, 89, 104, 121, 138, 157,
|
|
||||||
178, 199, 222, 246, 271, 297, 324, 353,
|
|
||||||
383, 413, 446, 479, 513, 549, 586, 624,
|
|
||||||
663, 703, 744, 787, 830, 875, 920, 967,
|
|
||||||
1015, 1064, 1114, 1165, 1218, 1271, 1325, 1381,
|
|
||||||
1437, 1494, 1553, 1612, 1673, 1734, 1796, 1859,
|
|
||||||
1924, 1989, 2055, 2122, 2190, 2259, 2329, 2399,
|
|
||||||
2471, 2543, 2617, 2691, 2765, 2841, 2918, 2995,
|
|
||||||
3073, 3152, 3232, 3312, 3393, 3475, 3558, 3641,
|
|
||||||
3725, 3809, 3895, 3980, 4067, 4154, 4242, 4330,
|
|
||||||
4419, 4509, 4599, 4689, 4781, 4872, 4964, 5057,
|
|
||||||
5150, 5244, 5338, 5432, 5527, 5622, 5718, 5814,
|
|
||||||
5910, 6007, 6104, 6202, 6299, 6397, 6495, 6594,
|
|
||||||
6693, 6791, 6891, 6990, 7090, 7189, 7289, 7389,
|
|
||||||
7489, 7589, 7690, 7790, 7890, 7991, 8091, 8192,
|
|
||||||
8293, 8393, 8494, 8594, 8694, 8795, 8895, 8995,
|
|
||||||
9095, 9195, 9294, 9394, 9493, 9593, 9691, 9790,
|
|
||||||
9889, 9987, 10085, 10182, 10280, 10377, 10474, 10570,
|
|
||||||
10666, 10762, 10857, 10952, 11046, 11140, 11234, 11327,
|
|
||||||
11420, 11512, 11603, 11695, 11785, 11875, 11965, 12054,
|
|
||||||
12142, 12230, 12317, 12404, 12489, 12575, 12659, 12743,
|
|
||||||
12826, 12909, 12991, 13072, 13152, 13232, 13311, 13389,
|
|
||||||
13466, 13543, 13619, 13693, 13767, 13841, 13913, 13985,
|
|
||||||
14055, 14125, 14194, 14262, 14329, 14395, 14460, 14525,
|
|
||||||
14588, 14650, 14711, 14772, 14831, 14890, 14947, 15003,
|
|
||||||
15059, 15113, 15166, 15219, 15270, 15320, 15369, 15417,
|
|
||||||
15464, 15509, 15554, 15597, 15640, 15681, 15721, 15760,
|
|
||||||
15798, 15835, 15871, 15905, 15938, 15971, 16001, 16031,
|
|
||||||
16060, 16087, 16113, 16138, 16162, 16185, 16206, 16227,
|
|
||||||
16246, 16263, 16280, 16295, 16309, 16322, 16334, 16345,
|
|
||||||
16354, 16362, 16369, 16374, 16378, 16382, 16383, 16384
|
|
||||||
};
|
|
||||||
|
|
||||||
void WebRtcSpl_GetHanningWindow(WebRtc_Word16 *v, WebRtc_Word16 size)
|
|
||||||
{
|
|
||||||
int jj;
|
|
||||||
WebRtc_Word16 *vptr1;
|
|
||||||
|
|
||||||
WebRtc_Word32 index;
|
|
||||||
WebRtc_Word32 factor = ((WebRtc_Word32)0x40000000);
|
|
||||||
|
|
||||||
factor = WebRtcSpl_DivW32W16(factor, size);
|
|
||||||
if (size < 513)
|
|
||||||
index = (WebRtc_Word32)-0x200000;
|
|
||||||
else
|
|
||||||
index = (WebRtc_Word32)-0x100000;
|
|
||||||
vptr1 = v;
|
|
||||||
|
|
||||||
for (jj = 0; jj < size; jj++)
|
|
||||||
{
|
|
||||||
index += factor;
|
|
||||||
(*vptr1++) = kHanningTable[index >> 22];
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
@ -1,44 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_GetScalingSquare().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
int WebRtcSpl_GetScalingSquare(WebRtc_Word16 *in_vector, int in_vector_length, int times)
|
|
||||||
{
|
|
||||||
int nbits = WebRtcSpl_GetSizeInBits(times);
|
|
||||||
int i;
|
|
||||||
WebRtc_Word16 smax = -1;
|
|
||||||
WebRtc_Word16 sabs;
|
|
||||||
WebRtc_Word16 *sptr = in_vector;
|
|
||||||
int t;
|
|
||||||
int looptimes = in_vector_length;
|
|
||||||
|
|
||||||
for (i = looptimes; i > 0; i--)
|
|
||||||
{
|
|
||||||
sabs = (*sptr > 0 ? *sptr++ : -*sptr++);
|
|
||||||
smax = (sabs > smax ? sabs : smax);
|
|
||||||
}
|
|
||||||
t = WebRtcSpl_NormW32(WEBRTC_SPL_MUL(smax, smax));
|
|
||||||
|
|
||||||
if (smax == 0)
|
|
||||||
{
|
|
||||||
return 0; // Since norm(0) returns 0
|
|
||||||
} else
|
|
||||||
{
|
|
||||||
return (t > nbits) ? 0 : nbits - t;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
@ -1,120 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains implementations of the iLBC specific functions
|
|
||||||
* WebRtcSpl_ScaleAndAddVectorsWithRound()
|
|
||||||
* WebRtcSpl_ReverseOrderMultArrayElements()
|
|
||||||
* WebRtcSpl_ElementwiseVectorMult()
|
|
||||||
* WebRtcSpl_AddVectorsAndShift()
|
|
||||||
* WebRtcSpl_AddAffineVectorToVector()
|
|
||||||
* WebRtcSpl_AffineTransformVector()
|
|
||||||
*
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
void WebRtcSpl_ScaleAndAddVectorsWithRound(WebRtc_Word16 *vector1, WebRtc_Word16 scale1,
|
|
||||||
WebRtc_Word16 *vector2, WebRtc_Word16 scale2,
|
|
||||||
WebRtc_Word16 right_shifts, WebRtc_Word16 *out,
|
|
||||||
WebRtc_Word16 vector_length)
|
|
||||||
{
|
|
||||||
int i;
|
|
||||||
WebRtc_Word16 roundVal;
|
|
||||||
roundVal = 1 << right_shifts;
|
|
||||||
roundVal = roundVal >> 1;
|
|
||||||
for (i = 0; i < vector_length; i++)
|
|
||||||
{
|
|
||||||
out[i] = (WebRtc_Word16)((WEBRTC_SPL_MUL_16_16(vector1[i], scale1)
|
|
||||||
+ WEBRTC_SPL_MUL_16_16(vector2[i], scale2) + roundVal) >> right_shifts);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcSpl_ReverseOrderMultArrayElements(WebRtc_Word16 *out, G_CONST WebRtc_Word16 *in,
|
|
||||||
G_CONST WebRtc_Word16 *win,
|
|
||||||
WebRtc_Word16 vector_length,
|
|
||||||
WebRtc_Word16 right_shifts)
|
|
||||||
{
|
|
||||||
int i;
|
|
||||||
WebRtc_Word16 *outptr = out;
|
|
||||||
G_CONST WebRtc_Word16 *inptr = in;
|
|
||||||
G_CONST WebRtc_Word16 *winptr = win;
|
|
||||||
for (i = 0; i < vector_length; i++)
|
|
||||||
{
|
|
||||||
(*outptr++) = (WebRtc_Word16)WEBRTC_SPL_MUL_16_16_RSFT(*inptr++,
|
|
||||||
*winptr--, right_shifts);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcSpl_ElementwiseVectorMult(WebRtc_Word16 *out, G_CONST WebRtc_Word16 *in,
|
|
||||||
G_CONST WebRtc_Word16 *win, WebRtc_Word16 vector_length,
|
|
||||||
WebRtc_Word16 right_shifts)
|
|
||||||
{
|
|
||||||
int i;
|
|
||||||
WebRtc_Word16 *outptr = out;
|
|
||||||
G_CONST WebRtc_Word16 *inptr = in;
|
|
||||||
G_CONST WebRtc_Word16 *winptr = win;
|
|
||||||
for (i = 0; i < vector_length; i++)
|
|
||||||
{
|
|
||||||
(*outptr++) = (WebRtc_Word16)WEBRTC_SPL_MUL_16_16_RSFT(*inptr++,
|
|
||||||
*winptr++, right_shifts);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcSpl_AddVectorsAndShift(WebRtc_Word16 *out, G_CONST WebRtc_Word16 *in1,
|
|
||||||
G_CONST WebRtc_Word16 *in2, WebRtc_Word16 vector_length,
|
|
||||||
WebRtc_Word16 right_shifts)
|
|
||||||
{
|
|
||||||
int i;
|
|
||||||
WebRtc_Word16 *outptr = out;
|
|
||||||
G_CONST WebRtc_Word16 *in1ptr = in1;
|
|
||||||
G_CONST WebRtc_Word16 *in2ptr = in2;
|
|
||||||
for (i = vector_length; i > 0; i--)
|
|
||||||
{
|
|
||||||
(*outptr++) = (WebRtc_Word16)(((*in1ptr++) + (*in2ptr++)) >> right_shifts);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcSpl_AddAffineVectorToVector(WebRtc_Word16 *out, WebRtc_Word16 *in,
|
|
||||||
WebRtc_Word16 gain, WebRtc_Word32 add_constant,
|
|
||||||
WebRtc_Word16 right_shifts, int vector_length)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 *inPtr;
|
|
||||||
WebRtc_Word16 *outPtr;
|
|
||||||
int i;
|
|
||||||
|
|
||||||
inPtr = in;
|
|
||||||
outPtr = out;
|
|
||||||
for (i = 0; i < vector_length; i++)
|
|
||||||
{
|
|
||||||
(*outPtr++) += (WebRtc_Word16)((WEBRTC_SPL_MUL_16_16((*inPtr++), gain)
|
|
||||||
+ (WebRtc_Word32)add_constant) >> right_shifts);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcSpl_AffineTransformVector(WebRtc_Word16 *out, WebRtc_Word16 *in,
|
|
||||||
WebRtc_Word16 gain, WebRtc_Word32 add_constant,
|
|
||||||
WebRtc_Word16 right_shifts, int vector_length)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 *inPtr;
|
|
||||||
WebRtc_Word16 *outPtr;
|
|
||||||
int i;
|
|
||||||
|
|
||||||
inPtr = in;
|
|
||||||
outPtr = out;
|
|
||||||
for (i = 0; i < vector_length; i++)
|
|
||||||
{
|
|
||||||
(*outPtr++) = (WebRtc_Word16)((WEBRTC_SPL_MUL_16_16((*inPtr++), gain)
|
|
||||||
+ (WebRtc_Word32)add_constant) >> right_shifts);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
@ -1,175 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/* encode.c - Encoding function for the iSAC coder */
|
|
||||||
|
|
||||||
#include "structs.h"
|
|
||||||
#include "codec.h"
|
|
||||||
#include "pitch_estimator.h"
|
|
||||||
|
|
||||||
#include <math.h>
|
|
||||||
|
|
||||||
void WebRtcIsac_InitMasking(MaskFiltstr *maskdata) {
|
|
||||||
|
|
||||||
int k;
|
|
||||||
|
|
||||||
for (k = 0; k < WINLEN; k++) {
|
|
||||||
maskdata->DataBufferLo[k] = 0.0;
|
|
||||||
maskdata->DataBufferHi[k] = 0.0;
|
|
||||||
}
|
|
||||||
for (k = 0; k < ORDERLO+1; k++) {
|
|
||||||
maskdata->CorrBufLo[k] = 0.0;
|
|
||||||
maskdata->PreStateLoF[k] = 0.0;
|
|
||||||
maskdata->PreStateLoG[k] = 0.0;
|
|
||||||
maskdata->PostStateLoF[k] = 0.0;
|
|
||||||
maskdata->PostStateLoG[k] = 0.0;
|
|
||||||
}
|
|
||||||
for (k = 0; k < ORDERHI+1; k++) {
|
|
||||||
maskdata->CorrBufHi[k] = 0.0;
|
|
||||||
maskdata->PreStateHiF[k] = 0.0;
|
|
||||||
maskdata->PreStateHiG[k] = 0.0;
|
|
||||||
maskdata->PostStateHiF[k] = 0.0;
|
|
||||||
maskdata->PostStateHiG[k] = 0.0;
|
|
||||||
}
|
|
||||||
|
|
||||||
maskdata->OldEnergy = 10.0;
|
|
||||||
|
|
||||||
/* fill tables for transforms */
|
|
||||||
WebRtcIsac_InitTransform();
|
|
||||||
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcIsac_InitPreFilterbank(PreFiltBankstr *prefiltdata)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
|
|
||||||
for (k = 0; k < QLOOKAHEAD; k++) {
|
|
||||||
prefiltdata->INLABUF1[k] = 0;
|
|
||||||
prefiltdata->INLABUF2[k] = 0;
|
|
||||||
|
|
||||||
prefiltdata->INLABUF1_float[k] = 0;
|
|
||||||
prefiltdata->INLABUF2_float[k] = 0;
|
|
||||||
}
|
|
||||||
for (k = 0; k < 2*(QORDER-1); k++) {
|
|
||||||
prefiltdata->INSTAT1[k] = 0;
|
|
||||||
prefiltdata->INSTAT2[k] = 0;
|
|
||||||
prefiltdata->INSTATLA1[k] = 0;
|
|
||||||
prefiltdata->INSTATLA2[k] = 0;
|
|
||||||
|
|
||||||
prefiltdata->INSTAT1_float[k] = 0;
|
|
||||||
prefiltdata->INSTAT2_float[k] = 0;
|
|
||||||
prefiltdata->INSTATLA1_float[k] = 0;
|
|
||||||
prefiltdata->INSTATLA2_float[k] = 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* High pass filter states */
|
|
||||||
prefiltdata->HPstates[0] = 0.0;
|
|
||||||
prefiltdata->HPstates[1] = 0.0;
|
|
||||||
|
|
||||||
prefiltdata->HPstates_float[0] = 0.0f;
|
|
||||||
prefiltdata->HPstates_float[1] = 0.0f;
|
|
||||||
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcIsac_InitPostFilterbank(PostFiltBankstr *postfiltdata)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
|
|
||||||
for (k = 0; k < 2*POSTQORDER; k++) {
|
|
||||||
postfiltdata->STATE_0_LOWER[k] = 0;
|
|
||||||
postfiltdata->STATE_0_UPPER[k] = 0;
|
|
||||||
|
|
||||||
postfiltdata->STATE_0_LOWER_float[k] = 0;
|
|
||||||
postfiltdata->STATE_0_UPPER_float[k] = 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* High pass filter states */
|
|
||||||
postfiltdata->HPstates1[0] = 0.0;
|
|
||||||
postfiltdata->HPstates1[1] = 0.0;
|
|
||||||
|
|
||||||
postfiltdata->HPstates2[0] = 0.0;
|
|
||||||
postfiltdata->HPstates2[1] = 0.0;
|
|
||||||
|
|
||||||
postfiltdata->HPstates1_float[0] = 0.0f;
|
|
||||||
postfiltdata->HPstates1_float[1] = 0.0f;
|
|
||||||
|
|
||||||
postfiltdata->HPstates2_float[0] = 0.0f;
|
|
||||||
postfiltdata->HPstates2_float[1] = 0.0f;
|
|
||||||
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_InitPitchFilter(PitchFiltstr *pitchfiltdata)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
|
|
||||||
for (k = 0; k < PITCH_BUFFSIZE; k++) {
|
|
||||||
pitchfiltdata->ubuf[k] = 0.0;
|
|
||||||
}
|
|
||||||
pitchfiltdata->ystate[0] = 0.0;
|
|
||||||
for (k = 1; k < (PITCH_DAMPORDER); k++) {
|
|
||||||
pitchfiltdata->ystate[k] = 0.0;
|
|
||||||
}
|
|
||||||
pitchfiltdata->oldlagp[0] = 50.0;
|
|
||||||
pitchfiltdata->oldgainp[0] = 0.0;
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcIsac_InitWeightingFilter(WeightFiltstr *wfdata)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
double t, dtmp, dtmp2, denum, denum2;
|
|
||||||
|
|
||||||
for (k=0;k<PITCH_WLPCBUFLEN;k++)
|
|
||||||
wfdata->buffer[k]=0.0;
|
|
||||||
|
|
||||||
for (k=0;k<PITCH_WLPCORDER;k++) {
|
|
||||||
wfdata->istate[k]=0.0;
|
|
||||||
wfdata->weostate[k]=0.0;
|
|
||||||
wfdata->whostate[k]=0.0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* next part should be in Matlab, writing to a global table */
|
|
||||||
t = 0.5;
|
|
||||||
denum = 1.0 / ((double) PITCH_WLPCWINLEN);
|
|
||||||
denum2 = denum * denum;
|
|
||||||
for (k=0;k<PITCH_WLPCWINLEN;k++) {
|
|
||||||
dtmp = PITCH_WLPCASYM * t * denum + (1-PITCH_WLPCASYM) * t * t * denum2;
|
|
||||||
dtmp *= 3.14159265;
|
|
||||||
dtmp2 = sin(dtmp);
|
|
||||||
wfdata->window[k] = dtmp2 * dtmp2;
|
|
||||||
t++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* clear all buffers */
|
|
||||||
void WebRtcIsac_InitPitchAnalysis(PitchAnalysisStruct *State)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
|
|
||||||
for (k = 0; k < PITCH_CORR_LEN2+PITCH_CORR_STEP2+PITCH_MAX_LAG/2-PITCH_FRAME_LEN/2+2; k++)
|
|
||||||
State->dec_buffer[k] = 0.0;
|
|
||||||
for (k = 0; k < 2*ALLPASSSECTIONS+1; k++)
|
|
||||||
State->decimator_state[k] = 0.0;
|
|
||||||
for (k = 0; k < 2; k++)
|
|
||||||
State->hp_state[k] = 0.0;
|
|
||||||
for (k = 0; k < QLOOKAHEAD; k++)
|
|
||||||
State->whitened_buf[k] = 0.0;
|
|
||||||
for (k = 0; k < QLOOKAHEAD; k++)
|
|
||||||
State->inbuf[k] = 0.0;
|
|
||||||
|
|
||||||
WebRtcIsac_InitPitchFilter(&(State->PFstr_wght));
|
|
||||||
|
|
||||||
WebRtcIsac_InitPitchFilter(&(State->PFstr));
|
|
||||||
|
|
||||||
WebRtcIsac_InitWeightingFilter(&(State->Wghtstr));
|
|
||||||
}
|
|
||||||
File diff suppressed because it is too large
Load Diff
|
|
@ -1,91 +0,0 @@
|
||||||
# Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
#
|
|
||||||
# Use of this source code is governed by a BSD-style license
|
|
||||||
# that can be found in the LICENSE file in the root of the source
|
|
||||||
# tree. An additional intellectual property rights grant can be found
|
|
||||||
# in the file PATENTS. All contributing project authors may
|
|
||||||
# be found in the AUTHORS file in the root of the source tree.
|
|
||||||
|
|
||||||
{
|
|
||||||
'targets': [
|
|
||||||
{
|
|
||||||
'target_name': 'iSAC',
|
|
||||||
'type': '<(library)',
|
|
||||||
'dependencies': [
|
|
||||||
'<(webrtc_root)/common_audio/common_audio.gyp:signal_processing',
|
|
||||||
],
|
|
||||||
'include_dirs': [
|
|
||||||
'../interface',
|
|
||||||
],
|
|
||||||
'direct_dependent_settings': {
|
|
||||||
'include_dirs': [
|
|
||||||
'../interface',
|
|
||||||
],
|
|
||||||
},
|
|
||||||
'sources': [
|
|
||||||
'../interface/isac.h',
|
|
||||||
'arith_routines.c',
|
|
||||||
'arith_routines_hist.c',
|
|
||||||
'arith_routines_logist.c',
|
|
||||||
'bandwidth_estimator.c',
|
|
||||||
'crc.c',
|
|
||||||
'decode.c',
|
|
||||||
'decode_bwe.c',
|
|
||||||
'encode.c',
|
|
||||||
'encode_lpc_swb.c',
|
|
||||||
'entropy_coding.c',
|
|
||||||
'fft.c',
|
|
||||||
'filter_functions.c',
|
|
||||||
'filterbank_tables.c',
|
|
||||||
'intialize.c',
|
|
||||||
'isac.c',
|
|
||||||
'filterbanks.c',
|
|
||||||
'pitch_lag_tables.c',
|
|
||||||
'lattice.c',
|
|
||||||
'lpc_gain_swb_tables.c',
|
|
||||||
'lpc_analysis.c',
|
|
||||||
'lpc_shape_swb12_tables.c',
|
|
||||||
'lpc_shape_swb16_tables.c',
|
|
||||||
'lpc_tables.c',
|
|
||||||
'pitch_estimator.c',
|
|
||||||
'pitch_filter.c',
|
|
||||||
'pitch_gain_tables.c',
|
|
||||||
'spectrum_ar_model_tables.c',
|
|
||||||
'transform.c',
|
|
||||||
'arith_routines.h',
|
|
||||||
'bandwidth_estimator.h',
|
|
||||||
'codec.h',
|
|
||||||
'crc.h',
|
|
||||||
'encode_lpc_swb.h',
|
|
||||||
'entropy_coding.h',
|
|
||||||
'fft.h',
|
|
||||||
'filterbank_tables.h',
|
|
||||||
'lpc_gain_swb_tables.h',
|
|
||||||
'lpc_analysis.h',
|
|
||||||
'lpc_shape_swb12_tables.h',
|
|
||||||
'lpc_shape_swb16_tables.h',
|
|
||||||
'lpc_tables.h',
|
|
||||||
'pitch_estimator.h',
|
|
||||||
'pitch_gain_tables.h',
|
|
||||||
'pitch_lag_tables.h',
|
|
||||||
'settings.h',
|
|
||||||
'spectrum_ar_model_tables.h',
|
|
||||||
'structs.h',
|
|
||||||
'os_specific_inline.h',
|
|
||||||
],
|
|
||||||
'conditions': [
|
|
||||||
['OS!="win"', {
|
|
||||||
'defines': [
|
|
||||||
'WEBRTC_LINUX',
|
|
||||||
],
|
|
||||||
}],
|
|
||||||
],
|
|
||||||
},
|
|
||||||
],
|
|
||||||
}
|
|
||||||
|
|
||||||
# Local Variables:
|
|
||||||
# tab-width:2
|
|
||||||
# indent-tabs-mode:nil
|
|
||||||
# End:
|
|
||||||
# vim: set expandtab tabstop=2 shiftwidth=2:
|
|
||||||
|
|
@ -1,729 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_INTERFACE_ISAC_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_INTERFACE_ISAC_H_
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Define the fixed-point numeric formats
|
|
||||||
*/
|
|
||||||
#include "typedefs.h"
|
|
||||||
|
|
||||||
typedef struct WebRtcISACStruct ISACStruct;
|
|
||||||
|
|
||||||
enum IsacSamplingRate {kIsacWideband = 16, kIsacSuperWideband = 32};
|
|
||||||
|
|
||||||
|
|
||||||
#if defined(__cplusplus)
|
|
||||||
extern "C" {
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_AssignSize(...)
|
|
||||||
*
|
|
||||||
* This function returns the size of the ISAC instance, so that the instance
|
|
||||||
* can be created outside iSAC.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - samplingRate : sampling rate of the input/output audio.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - sizeinbytes : number of bytes needed to allocate for the
|
|
||||||
* instance.
|
|
||||||
*
|
|
||||||
* Return value : 0 - Ok
|
|
||||||
* -1 - Error
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_AssignSize(
|
|
||||||
int* sizeinbytes);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_Assign(...)
|
|
||||||
*
|
|
||||||
* This function assignes the memory already created to the ISAC instance.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - *ISAC_main_inst : a pointer to the coder instance.
|
|
||||||
* - samplingRate : sampling rate of the input/output audio.
|
|
||||||
* - ISAC_inst_Addr : the already allocated memory, where we put the
|
|
||||||
* iSAC structure.
|
|
||||||
*
|
|
||||||
* Return value : 0 - Ok
|
|
||||||
* -1 - Error
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_Assign(
|
|
||||||
ISACStruct** ISAC_main_inst,
|
|
||||||
void* ISAC_inst_Addr);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_Create(...)
|
|
||||||
*
|
|
||||||
* This function creates an ISAC instance, which will contain the state
|
|
||||||
* information for one coding/decoding channel.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - *ISAC_main_inst : a pointer to the coder instance.
|
|
||||||
*
|
|
||||||
* Return value : 0 - Ok
|
|
||||||
* -1 - Error
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_Create(
|
|
||||||
ISACStruct** ISAC_main_inst);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_Free(...)
|
|
||||||
*
|
|
||||||
* This function frees the ISAC instance created at the beginning.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : an ISAC instance.
|
|
||||||
*
|
|
||||||
* Return value : 0 - Ok
|
|
||||||
* -1 - Error
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_Free(
|
|
||||||
ISACStruct* ISAC_main_inst);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_EncoderInit(...)
|
|
||||||
*
|
|
||||||
* This function initializes an ISAC instance prior to the encoder calls.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : ISAC instance.
|
|
||||||
* - CodingMode : 0 -> Bit rate and frame length are
|
|
||||||
* automatically adjusted to available bandwidth
|
|
||||||
* on transmission channel, just valid if codec
|
|
||||||
* is created to work in wideband mode.
|
|
||||||
* 1 -> User sets a frame length and a target bit
|
|
||||||
* rate which is taken as the maximum
|
|
||||||
* short-term average bit rate.
|
|
||||||
*
|
|
||||||
* Return value : 0 - Ok
|
|
||||||
* -1 - Error
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_EncoderInit(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
WebRtc_Word16 CodingMode);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_Encode(...)
|
|
||||||
*
|
|
||||||
* This function encodes 10ms audio blocks and inserts it into a package.
|
|
||||||
* Input speech length has 160 samples if operating at 16 kHz sampling
|
|
||||||
* rate, or 320 if operating at 32 kHz sampling rate. The encoder buffers the
|
|
||||||
* input audio until the whole frame is buffered then proceeds with encoding.
|
|
||||||
*
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : ISAC instance.
|
|
||||||
* - speechIn : input speech vector.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - encoded : the encoded data vector
|
|
||||||
*
|
|
||||||
* Return value:
|
|
||||||
* : >0 - Length (in bytes) of coded data
|
|
||||||
* : 0 - The buffer didn't reach the chosen
|
|
||||||
* frame-size so it keeps buffering speech
|
|
||||||
* samples.
|
|
||||||
* : -1 - Error
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_Encode(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
const WebRtc_Word16* speechIn,
|
|
||||||
WebRtc_Word16* encoded);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecoderInit(...)
|
|
||||||
*
|
|
||||||
* This function initializes an ISAC instance prior to the decoder calls.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : ISAC instance.
|
|
||||||
*
|
|
||||||
* Return value
|
|
||||||
* : 0 - Ok
|
|
||||||
* -1 - Error
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_DecoderInit(
|
|
||||||
ISACStruct* ISAC_main_inst);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_UpdateBwEstimate(...)
|
|
||||||
*
|
|
||||||
* This function updates the estimate of the bandwidth.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : ISAC instance.
|
|
||||||
* - encoded : encoded ISAC frame(s).
|
|
||||||
* - packet_size : size of the packet.
|
|
||||||
* - rtp_seq_number : the RTP number of the packet.
|
|
||||||
* - send_ts : the RTP send timestamp, given in samples
|
|
||||||
* - arr_ts : the arrival time of the packet (from NetEq)
|
|
||||||
* in samples.
|
|
||||||
*
|
|
||||||
* Return value : 0 - Ok
|
|
||||||
* -1 - Error
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_UpdateBwEstimate(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
const WebRtc_UWord16* encoded,
|
|
||||||
WebRtc_Word32 packet_size,
|
|
||||||
WebRtc_UWord16 rtp_seq_number,
|
|
||||||
WebRtc_UWord32 send_ts,
|
|
||||||
WebRtc_UWord32 arr_ts);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_Decode(...)
|
|
||||||
*
|
|
||||||
* This function decodes an ISAC frame. At 16 kHz sampling rate, the length
|
|
||||||
* of the output audio could be either 480 or 960 samples, equivalent to
|
|
||||||
* 30 or 60 ms respectively. At 32 kHz sampling rate, the length of the
|
|
||||||
* output audio is 960 samples, which is 30 ms.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : ISAC instance.
|
|
||||||
* - encoded : encoded ISAC frame(s).
|
|
||||||
* - len : bytes in encoded vector.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - decoded : The decoded vector.
|
|
||||||
*
|
|
||||||
* Return value : >0 - number of samples in decoded vector.
|
|
||||||
* -1 - Error.
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_Decode(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
const WebRtc_UWord16* encoded,
|
|
||||||
WebRtc_Word16 len,
|
|
||||||
WebRtc_Word16* decoded,
|
|
||||||
WebRtc_Word16* speechType);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecodePlc(...)
|
|
||||||
*
|
|
||||||
* This function conducts PLC for ISAC frame(s). Output speech length
|
|
||||||
* will be a multiple of frames, i.e. multiples of 30 ms audio. Therefore,
|
|
||||||
* the output is multiple of 480 samples if operating at 16 kHz and multiple
|
|
||||||
* of 960 if operating at 32 kHz.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : ISAC instance.
|
|
||||||
* - noOfLostFrames : Number of PLC frames to produce.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - decoded : The decoded vector.
|
|
||||||
*
|
|
||||||
* Return value : >0 - number of samples in decoded PLC vector
|
|
||||||
* -1 - Error
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_DecodePlc(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
WebRtc_Word16* decoded,
|
|
||||||
WebRtc_Word16 noOfLostFrames);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_Control(...)
|
|
||||||
*
|
|
||||||
* This function sets the limit on the short-term average bit-rate and the
|
|
||||||
* frame length. Should be used only in Instantaneous mode. At 16 kHz sampling
|
|
||||||
* rate, an average bit-rate between 10000 to 32000 bps is valid and a
|
|
||||||
* frame-size of 30 or 60 ms is acceptable. At 32 kHz, an average bit-rate
|
|
||||||
* between 10000 to 56000 is acceptable, and the valid frame-size is 30 ms.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : ISAC instance.
|
|
||||||
* - rate : limit on the short-term average bit rate,
|
|
||||||
* in bits/second.
|
|
||||||
* - framesize : frame-size in millisecond.
|
|
||||||
*
|
|
||||||
* Return value : 0 - ok
|
|
||||||
* -1 - Error
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_Control(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
WebRtc_Word32 rate,
|
|
||||||
WebRtc_Word16 framesize);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_ControlBwe(...)
|
|
||||||
*
|
|
||||||
* This function sets the initial values of bottleneck and frame-size if
|
|
||||||
* iSAC is used in channel-adaptive mode. Therefore, this API is not
|
|
||||||
* applicable if the codec is created to operate in super-wideband mode.
|
|
||||||
*
|
|
||||||
* Through this API, users can enforce a frame-size for all values of
|
|
||||||
* bottleneck. Then iSAC will not automatically change the frame-size.
|
|
||||||
*
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : ISAC instance.
|
|
||||||
* - rateBPS : initial value of bottleneck in bits/second
|
|
||||||
* 10000 <= rateBPS <= 56000 is accepted
|
|
||||||
* For default bottleneck set rateBPS = 0
|
|
||||||
* - frameSizeMs : number of milliseconds per frame (30 or 60)
|
|
||||||
* - enforceFrameSize : 1 to enforce the given frame-size through
|
|
||||||
* out the adaptation process, 0 to let iSAC
|
|
||||||
* change the frame-size if required.
|
|
||||||
*
|
|
||||||
* Return value : 0 - ok
|
|
||||||
* -1 - Error
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_ControlBwe(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
WebRtc_Word32 rateBPS,
|
|
||||||
WebRtc_Word16 frameSizeMs,
|
|
||||||
WebRtc_Word16 enforceFrameSize);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_ReadFrameLen(...)
|
|
||||||
*
|
|
||||||
* This function returns the length of the frame represented in the packet.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - encoded : Encoded bit-stream
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - frameLength : Length of frame in packet (in samples)
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_ReadFrameLen(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
const WebRtc_Word16* encoded,
|
|
||||||
WebRtc_Word16* frameLength);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_version(...)
|
|
||||||
*
|
|
||||||
* This function returns the version number.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - version : Pointer to character string
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
void WebRtcIsac_version(
|
|
||||||
char *version);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_GetErrorCode(...)
|
|
||||||
*
|
|
||||||
* This function can be used to check the error code of an iSAC instance. When
|
|
||||||
* a function returns -1 a error code will be set for that instance. The
|
|
||||||
* function below extract the code of the last error that occurred in the
|
|
||||||
* specified instance.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : ISAC instance
|
|
||||||
*
|
|
||||||
* Return value : Error code
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_GetErrorCode(
|
|
||||||
ISACStruct* ISAC_main_inst);
|
|
||||||
|
|
||||||
|
|
||||||
/****************************************************************************
|
|
||||||
* WebRtcIsac_GetUplinkBw(...)
|
|
||||||
*
|
|
||||||
* This function outputs the target bottleneck of the codec. In
|
|
||||||
* channel-adaptive mode, the target bottleneck is specified through in-band
|
|
||||||
* signalling retreived by bandwidth estimator.
|
|
||||||
* In channel-independent, also called instantaneous mode, the target
|
|
||||||
* bottleneck is provided to the encoder by calling xxx_control(...). If
|
|
||||||
* xxx_control is never called the default values is returned. The default
|
|
||||||
* value for bottleneck at 16 kHz encoder sampling rate is 32000 bits/sec,
|
|
||||||
* and it is 56000 bits/sec for 32 kHz sampling rate.
|
|
||||||
* Note that the output is the iSAC internal operating bottleneck which might
|
|
||||||
* differ slightly from the one provided through xxx_control().
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : iSAC instance
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - *bottleneck : bottleneck in bits/sec
|
|
||||||
*
|
|
||||||
* Return value : -1 if error happens
|
|
||||||
* 0 bit-rates computed correctly.
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_GetUplinkBw(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
WebRtc_Word32* bottleneck);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_SetMaxPayloadSize(...)
|
|
||||||
*
|
|
||||||
* This function sets a limit for the maximum payload size of iSAC. The same
|
|
||||||
* value is used both for 30 and 60 ms packets. If the encoder sampling rate
|
|
||||||
* is 16 kHz the maximum payload size is between 120 and 400 bytes. If the
|
|
||||||
* encoder sampling rate is 32 kHz the maximum payload size is between 120
|
|
||||||
* and 600 bytes.
|
|
||||||
*
|
|
||||||
* If an out of range limit is used, the function returns -1, but the closest
|
|
||||||
* valid value will be applied.
|
|
||||||
*
|
|
||||||
* ---------------
|
|
||||||
* IMPORTANT NOTES
|
|
||||||
* ---------------
|
|
||||||
* The size of a packet is limited to the minimum of 'max-payload-size' and
|
|
||||||
* 'max-rate.' For instance, let's assume the max-payload-size is set to
|
|
||||||
* 170 bytes, and max-rate is set to 40 kbps. Note that a limit of 40 kbps
|
|
||||||
* translates to 150 bytes for 30ms frame-size & 300 bytes for 60ms
|
|
||||||
* frame-size. Then a packet with a frame-size of 30 ms is limited to 150,
|
|
||||||
* i.e. min(170, 150), and a packet with 60 ms frame-size is limited to
|
|
||||||
* 170 bytes, i.e. min(170, 300).
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : iSAC instance
|
|
||||||
* - maxPayloadBytes : maximum size of the payload in bytes
|
|
||||||
* valid values are between 120 and 400 bytes
|
|
||||||
* if encoder sampling rate is 16 kHz. For
|
|
||||||
* 32 kHz encoder sampling rate valid values
|
|
||||||
* are between 120 and 600 bytes.
|
|
||||||
*
|
|
||||||
* Return value : 0 if successful
|
|
||||||
* -1 if error happens
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_SetMaxPayloadSize(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
WebRtc_Word16 maxPayloadBytes);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_SetMaxRate(...)
|
|
||||||
*
|
|
||||||
* This function sets the maximum rate which the codec may not exceed for
|
|
||||||
* any signal packet. The maximum rate is defined and payload-size per
|
|
||||||
* frame-size in bits per second.
|
|
||||||
*
|
|
||||||
* The codec has a maximum rate of 53400 bits per second (200 bytes per 30
|
|
||||||
* ms) if the encoder sampling rate is 16kHz, and 160 kbps (600 bytes/30 ms)
|
|
||||||
* if the encoder sampling rate is 32 kHz.
|
|
||||||
*
|
|
||||||
* It is possible to set a maximum rate between 32000 and 53400 bits/sec
|
|
||||||
* in wideband mode, and 32000 to 160000 bits/sec in super-wideband mode.
|
|
||||||
*
|
|
||||||
* If an out of range limit is used, the function returns -1, but the closest
|
|
||||||
* valid value will be applied.
|
|
||||||
*
|
|
||||||
* ---------------
|
|
||||||
* IMPORTANT NOTES
|
|
||||||
* ---------------
|
|
||||||
* The size of a packet is limited to the minimum of 'max-payload-size' and
|
|
||||||
* 'max-rate.' For instance, let's assume the max-payload-size is set to
|
|
||||||
* 170 bytes, and max-rate is set to 40 kbps. Note that a limit of 40 kbps
|
|
||||||
* translates to 150 bytes for 30ms frame-size & 300 bytes for 60ms
|
|
||||||
* frame-size. Then a packet with a frame-size of 30 ms is limited to 150,
|
|
||||||
* i.e. min(170, 150), and a packet with 60 ms frame-size is limited to
|
|
||||||
* 170 bytes, min(170, 300).
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : iSAC instance
|
|
||||||
* - maxRate : maximum rate in bits per second,
|
|
||||||
* valid values are 32000 to 53400 bits/sec in
|
|
||||||
* wideband mode, and 32000 to 160000 bits/sec in
|
|
||||||
* super-wideband mode.
|
|
||||||
*
|
|
||||||
* Return value : 0 if successful
|
|
||||||
* -1 if error happens
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_SetMaxRate(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
WebRtc_Word32 maxRate);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_DecSampRate()
|
|
||||||
* Return the sampling rate of the decoded audio.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : iSAC instance
|
|
||||||
*
|
|
||||||
* Return value : enumerator representing sampling frequency
|
|
||||||
* associated with the decoder, i.e. the
|
|
||||||
* sampling rate of the decoded audio.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
enum IsacSamplingRate WebRtcIsac_DecSampRate(
|
|
||||||
ISACStruct* ISAC_main_inst);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_EncSampRate()
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : iSAC instance
|
|
||||||
*
|
|
||||||
* Return value : enumerator representing sampling frequency
|
|
||||||
* associated with the encoder, the input audio
|
|
||||||
* is expected to be sampled at this rate.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
enum IsacSamplingRate WebRtcIsac_EncSampRate(
|
|
||||||
ISACStruct* ISAC_main_inst);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_SetDecSampRate()
|
|
||||||
* Set the sampling rate of the decoder. Initialization of the decoder WILL
|
|
||||||
* NOT overwrite the sampling rate of the encoder. The default value is 16 kHz
|
|
||||||
* which is set when the instance is created.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : iSAC instance
|
|
||||||
* - sampRate : enumerator specifying the sampling rate.
|
|
||||||
*
|
|
||||||
* Return value : 0 if successful
|
|
||||||
* -1 if failed.
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_SetDecSampRate(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
enum IsacSamplingRate sampRate);
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_SetEncSampRate()
|
|
||||||
* Set the sampling rate of the encoder. Initialization of the encoder WILL
|
|
||||||
* NOT overwrite the sampling rate of the encoder. The default value is 16 kHz
|
|
||||||
* which is set when the instance is created. The encoding-mode and the
|
|
||||||
* bottleneck remain unchanged by this call, however, the maximum rate and
|
|
||||||
* maximum payload-size will reset to their default value.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : iSAC instance
|
|
||||||
* - sampRate : enumerator specifying the sampling rate.
|
|
||||||
*
|
|
||||||
* Return value : 0 if successful
|
|
||||||
* -1 if failed.
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_SetEncSampRate(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
enum IsacSamplingRate sampRate);
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_GetNewBitStream(...)
|
|
||||||
*
|
|
||||||
* This function returns encoded data, with the recieved bwe-index in the
|
|
||||||
* stream. If the rate is set to a value less than bottleneck of codec
|
|
||||||
* the new bistream will be re-encoded with the given target rate.
|
|
||||||
* It should always return a complete packet, i.e. only called once
|
|
||||||
* even for 60 msec frames.
|
|
||||||
*
|
|
||||||
* NOTE 1! This function does not write in the ISACStruct, it is not allowed.
|
|
||||||
* NOTE 2! Currently not implemented for SWB mode.
|
|
||||||
* NOTE 3! Rates larger than the bottleneck of the codec will be limited
|
|
||||||
* to the current bottleneck.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : ISAC instance.
|
|
||||||
* - bweIndex : Index of bandwidth estimate to put in new
|
|
||||||
* bitstream
|
|
||||||
* - rate : target rate of the transcoder is bits/sec.
|
|
||||||
* Valid values are the accepted rate in iSAC,
|
|
||||||
* i.e. 10000 to 56000.
|
|
||||||
* - isRCU : if the new bit-stream is an RCU stream.
|
|
||||||
* Note that the rate parameter always indicates
|
|
||||||
* the target rate of the main paylaod, regardless
|
|
||||||
* of 'isRCU' value.
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - encoded : The encoded data vector
|
|
||||||
*
|
|
||||||
* Return value : >0 - Length (in bytes) of coded data
|
|
||||||
* -1 - Error or called in SWB mode
|
|
||||||
* NOTE! No error code is written to
|
|
||||||
* the struct since it is only allowed to read
|
|
||||||
* the struct.
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_GetNewBitStream(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
WebRtc_Word16 bweIndex,
|
|
||||||
WebRtc_Word16 jitterInfo,
|
|
||||||
WebRtc_Word32 rate,
|
|
||||||
WebRtc_Word16* encoded,
|
|
||||||
WebRtc_Word16 isRCU);
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/****************************************************************************
|
|
||||||
* WebRtcIsac_GetDownLinkBwIndex(...)
|
|
||||||
*
|
|
||||||
* This function returns index representing the Bandwidth estimate from
|
|
||||||
* other side to this side.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : iSAC struct
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - bweIndex : Bandwidth estimate to transmit to other side.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_GetDownLinkBwIndex(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
WebRtc_Word16* bweIndex,
|
|
||||||
WebRtc_Word16* jitterInfo);
|
|
||||||
|
|
||||||
|
|
||||||
/****************************************************************************
|
|
||||||
* WebRtcIsac_UpdateUplinkBw(...)
|
|
||||||
*
|
|
||||||
* This function takes an index representing the Bandwidth estimate from
|
|
||||||
* this side to other side and updates BWE.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : iSAC struct
|
|
||||||
* - bweIndex : Bandwidth estimate from other side.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_UpdateUplinkBw(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
WebRtc_Word16 bweIndex);
|
|
||||||
|
|
||||||
|
|
||||||
/****************************************************************************
|
|
||||||
* WebRtcIsac_ReadBwIndex(...)
|
|
||||||
*
|
|
||||||
* This function returns the index of the Bandwidth estimate from the bitstream.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - encoded : Encoded bitstream
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - frameLength : Length of frame in packet (in samples)
|
|
||||||
* - bweIndex : Bandwidth estimate in bitstream
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_ReadBwIndex(
|
|
||||||
const WebRtc_Word16* encoded,
|
|
||||||
WebRtc_Word16* bweIndex);
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/*******************************************************************************
|
|
||||||
* WebRtcIsac_GetNewFrameLen(...)
|
|
||||||
*
|
|
||||||
* returns the frame lenght (in samples) of the next packet. In the case of channel-adaptive
|
|
||||||
* mode, iSAC decides on its frame lenght based on the estimated bottleneck
|
|
||||||
* this allows a user to prepare for the next packet (at the encoder)
|
|
||||||
*
|
|
||||||
* The primary usage is in CE to make the iSAC works in channel-adaptive mode
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : iSAC struct
|
|
||||||
*
|
|
||||||
* Return Value : frame lenght in samples
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcIsac_GetNewFrameLen(
|
|
||||||
ISACStruct* ISAC_main_inst);
|
|
||||||
|
|
||||||
|
|
||||||
/****************************************************************************
|
|
||||||
* WebRtcIsac_GetRedPayload(...)
|
|
||||||
*
|
|
||||||
* Populates "encoded" with the redundant payload of the recently encoded
|
|
||||||
* frame. This function has to be called once that WebRtcIsac_Encode(...)
|
|
||||||
* returns a positive value. Regardless of the frame-size this function will
|
|
||||||
* be called only once after encoding is completed.
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : iSAC struct
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - encoded : the encoded data vector
|
|
||||||
*
|
|
||||||
*
|
|
||||||
* Return value:
|
|
||||||
* : >0 - Length (in bytes) of coded data
|
|
||||||
* : -1 - Error
|
|
||||||
*
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_GetRedPayload(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
WebRtc_Word16* encoded);
|
|
||||||
|
|
||||||
|
|
||||||
/****************************************************************************
|
|
||||||
* WebRtcIsac_DecodeRcu(...)
|
|
||||||
*
|
|
||||||
* This function decodes a redundant (RCU) iSAC frame. Function is called in
|
|
||||||
* NetEq with a stored RCU payload i case of packet loss. Output speech length
|
|
||||||
* will be a multiple of 480 samples: 480 or 960 samples,
|
|
||||||
* depending on the framesize (30 or 60 ms).
|
|
||||||
*
|
|
||||||
* Input:
|
|
||||||
* - ISAC_main_inst : ISAC instance.
|
|
||||||
* - encoded : encoded ISAC RCU frame(s)
|
|
||||||
* - len : bytes in encoded vector
|
|
||||||
*
|
|
||||||
* Output:
|
|
||||||
* - decoded : The decoded vector
|
|
||||||
*
|
|
||||||
* Return value : >0 - number of samples in decoded vector
|
|
||||||
* -1 - Error
|
|
||||||
*/
|
|
||||||
WebRtc_Word16 WebRtcIsac_DecodeRcu(
|
|
||||||
ISACStruct* ISAC_main_inst,
|
|
||||||
const WebRtc_UWord16* encoded,
|
|
||||||
WebRtc_Word16 len,
|
|
||||||
WebRtc_Word16* decoded,
|
|
||||||
WebRtc_Word16* speechType);
|
|
||||||
|
|
||||||
|
|
||||||
#if defined(__cplusplus)
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
#endif /* WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_INTERFACE_ISAC_H_ */
|
|
||||||
|
|
@ -1,217 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* lattice.c
|
|
||||||
*
|
|
||||||
* contains the normalized lattice filter routines (MA and AR) for iSAC codec
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
#include "settings.h"
|
|
||||||
#include "codec.h"
|
|
||||||
|
|
||||||
#include <math.h>
|
|
||||||
#include <memory.h>
|
|
||||||
#ifdef WEBRTC_ANDROID
|
|
||||||
#include <stdlib.h>
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* filter the signal using normalized lattice filter */
|
|
||||||
/* MA filter */
|
|
||||||
void WebRtcIsac_NormLatticeFilterMa(int orderCoef,
|
|
||||||
float *stateF,
|
|
||||||
float *stateG,
|
|
||||||
float *lat_in,
|
|
||||||
double *filtcoeflo,
|
|
||||||
double *lat_out)
|
|
||||||
{
|
|
||||||
int n,k,i,u,temp1;
|
|
||||||
int ord_1 = orderCoef+1;
|
|
||||||
float sth[MAX_AR_MODEL_ORDER];
|
|
||||||
float cth[MAX_AR_MODEL_ORDER];
|
|
||||||
float inv_cth[MAX_AR_MODEL_ORDER];
|
|
||||||
double a[MAX_AR_MODEL_ORDER+1];
|
|
||||||
float f[MAX_AR_MODEL_ORDER+1][HALF_SUBFRAMELEN], g[MAX_AR_MODEL_ORDER+1][HALF_SUBFRAMELEN];
|
|
||||||
float gain1;
|
|
||||||
|
|
||||||
for (u=0;u<SUBFRAMES;u++)
|
|
||||||
{
|
|
||||||
/* set the Direct Form coefficients */
|
|
||||||
temp1 = u*ord_1;
|
|
||||||
a[0] = 1;
|
|
||||||
memcpy(a+1, filtcoeflo+temp1+1, sizeof(double) * (ord_1-1));
|
|
||||||
|
|
||||||
/* compute lattice filter coefficients */
|
|
||||||
WebRtcIsac_Dir2Lat(a,orderCoef,sth,cth);
|
|
||||||
|
|
||||||
/* compute the gain */
|
|
||||||
gain1 = (float)filtcoeflo[temp1];
|
|
||||||
for (k=0;k<orderCoef;k++)
|
|
||||||
{
|
|
||||||
gain1 *= cth[k];
|
|
||||||
inv_cth[k] = 1/cth[k];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* normalized lattice filter */
|
|
||||||
/*****************************/
|
|
||||||
|
|
||||||
/* initial conditions */
|
|
||||||
for (i=0;i<HALF_SUBFRAMELEN;i++)
|
|
||||||
{
|
|
||||||
f[0][i] = lat_in[i + u * HALF_SUBFRAMELEN];
|
|
||||||
g[0][i] = lat_in[i + u * HALF_SUBFRAMELEN];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* get the state of f&g for the first input, for all orders */
|
|
||||||
for (i=1;i<ord_1;i++)
|
|
||||||
{
|
|
||||||
f[i][0] = inv_cth[i-1]*(f[i-1][0] + sth[i-1]*stateG[i-1]);
|
|
||||||
g[i][0] = cth[i-1]*stateG[i-1] + sth[i-1]* f[i][0];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* filtering */
|
|
||||||
for(k=0;k<orderCoef;k++)
|
|
||||||
{
|
|
||||||
for(n=0;n<(HALF_SUBFRAMELEN-1);n++)
|
|
||||||
{
|
|
||||||
f[k+1][n+1] = inv_cth[k]*(f[k][n+1] + sth[k]*g[k][n]);
|
|
||||||
g[k+1][n+1] = cth[k]*g[k][n] + sth[k]* f[k+1][n+1];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
for(n=0;n<HALF_SUBFRAMELEN;n++)
|
|
||||||
{
|
|
||||||
lat_out[n + u * HALF_SUBFRAMELEN] = gain1 * f[orderCoef][n];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* save the states */
|
|
||||||
for (i=0;i<ord_1;i++)
|
|
||||||
{
|
|
||||||
stateF[i] = f[i][HALF_SUBFRAMELEN-1];
|
|
||||||
stateG[i] = g[i][HALF_SUBFRAMELEN-1];
|
|
||||||
}
|
|
||||||
/* process next frame */
|
|
||||||
}
|
|
||||||
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/*///////////////////AR filter ///////////////////////////////*/
|
|
||||||
/* filter the signal using normalized lattice filter */
|
|
||||||
void WebRtcIsac_NormLatticeFilterAr(int orderCoef,
|
|
||||||
float *stateF,
|
|
||||||
float *stateG,
|
|
||||||
double *lat_in,
|
|
||||||
double *lo_filt_coef,
|
|
||||||
float *lat_out)
|
|
||||||
{
|
|
||||||
int n,k,i,u,temp1;
|
|
||||||
int ord_1 = orderCoef+1;
|
|
||||||
float sth[MAX_AR_MODEL_ORDER];
|
|
||||||
float cth[MAX_AR_MODEL_ORDER];
|
|
||||||
double a[MAX_AR_MODEL_ORDER+1];
|
|
||||||
float ARf[MAX_AR_MODEL_ORDER+1][HALF_SUBFRAMELEN], ARg[MAX_AR_MODEL_ORDER+1][HALF_SUBFRAMELEN];
|
|
||||||
float gain1,inv_gain1;
|
|
||||||
|
|
||||||
for (u=0;u<SUBFRAMES;u++)
|
|
||||||
{
|
|
||||||
/* set the denominator and numerator of the Direct Form */
|
|
||||||
temp1 = u*ord_1;
|
|
||||||
a[0] = 1;
|
|
||||||
|
|
||||||
memcpy(a+1, lo_filt_coef+temp1+1, sizeof(double) * (ord_1-1));
|
|
||||||
|
|
||||||
WebRtcIsac_Dir2Lat(a,orderCoef,sth,cth);
|
|
||||||
|
|
||||||
gain1 = (float)lo_filt_coef[temp1];
|
|
||||||
for (k=0;k<orderCoef;k++)
|
|
||||||
{
|
|
||||||
gain1 = cth[k]*gain1;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* initial conditions */
|
|
||||||
inv_gain1 = 1/gain1;
|
|
||||||
for (i=0;i<HALF_SUBFRAMELEN;i++)
|
|
||||||
{
|
|
||||||
ARf[orderCoef][i] = (float)lat_in[i + u * HALF_SUBFRAMELEN]*inv_gain1;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
for (i=orderCoef-1;i>=0;i--) //get the state of f&g for the first input, for all orders
|
|
||||||
{
|
|
||||||
ARf[i][0] = cth[i]*ARf[i+1][0] - sth[i]*stateG[i];
|
|
||||||
ARg[i+1][0] = sth[i]*ARf[i+1][0] + cth[i]* stateG[i];
|
|
||||||
}
|
|
||||||
ARg[0][0] = ARf[0][0];
|
|
||||||
|
|
||||||
for(n=0;n<(HALF_SUBFRAMELEN-1);n++)
|
|
||||||
{
|
|
||||||
for(k=orderCoef-1;k>=0;k--)
|
|
||||||
{
|
|
||||||
ARf[k][n+1] = cth[k]*ARf[k+1][n+1] - sth[k]*ARg[k][n];
|
|
||||||
ARg[k+1][n+1] = sth[k]*ARf[k+1][n+1] + cth[k]* ARg[k][n];
|
|
||||||
}
|
|
||||||
ARg[0][n+1] = ARf[0][n+1];
|
|
||||||
}
|
|
||||||
|
|
||||||
memcpy(lat_out+u * HALF_SUBFRAMELEN, &(ARf[0][0]), sizeof(float) * HALF_SUBFRAMELEN);
|
|
||||||
|
|
||||||
/* cannot use memcpy in the following */
|
|
||||||
for (i=0;i<ord_1;i++)
|
|
||||||
{
|
|
||||||
stateF[i] = ARf[i][HALF_SUBFRAMELEN-1];
|
|
||||||
stateG[i] = ARg[i][HALF_SUBFRAMELEN-1];
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* compute the reflection coefficients using the step-down procedure*/
|
|
||||||
/* converts the direct form parameters to lattice form.*/
|
|
||||||
/* a and b are vectors which contain the direct form coefficients,
|
|
||||||
according to
|
|
||||||
A(z) = a(1) + a(2)*z + a(3)*z^2 + ... + a(M+1)*z^M
|
|
||||||
B(z) = b(1) + b(2)*z + b(3)*z^2 + ... + b(M+1)*z^M
|
|
||||||
*/
|
|
||||||
|
|
||||||
void WebRtcIsac_Dir2Lat(double *a,
|
|
||||||
int orderCoef,
|
|
||||||
float *sth,
|
|
||||||
float *cth)
|
|
||||||
{
|
|
||||||
int m, k;
|
|
||||||
float tmp[MAX_AR_MODEL_ORDER];
|
|
||||||
float tmp_inv, cth2;
|
|
||||||
|
|
||||||
sth[orderCoef-1] = (float)a[orderCoef];
|
|
||||||
cth2 = 1.0f - sth[orderCoef-1] * sth[orderCoef-1];
|
|
||||||
cth[orderCoef-1] = (float)sqrt(cth2);
|
|
||||||
for (m=orderCoef-1; m>0; m--)
|
|
||||||
{
|
|
||||||
tmp_inv = 1.0f / cth2;
|
|
||||||
for (k=1; k<=m; k++)
|
|
||||||
{
|
|
||||||
tmp[k] = ((float)a[k] - sth[m] * (float)a[m-k+1]) * tmp_inv;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (k=1; k<m; k++)
|
|
||||||
{
|
|
||||||
a[k] = tmp[k];
|
|
||||||
}
|
|
||||||
|
|
||||||
sth[m-1] = tmp[m];
|
|
||||||
cth2 = 1 - sth[m-1] * sth[m-1];
|
|
||||||
cth[m-1] = (float)sqrt(cth2);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
@ -1,259 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_LevinsonDurbin().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
#define SPL_LEVINSON_MAXORDER 20
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcSpl_LevinsonDurbin(WebRtc_Word32 *R, WebRtc_Word16 *A, WebRtc_Word16 *K,
|
|
||||||
WebRtc_Word16 order)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 i, j;
|
|
||||||
// Auto-correlation coefficients in high precision
|
|
||||||
WebRtc_Word16 R_hi[SPL_LEVINSON_MAXORDER + 1], R_low[SPL_LEVINSON_MAXORDER + 1];
|
|
||||||
// LPC coefficients in high precision
|
|
||||||
WebRtc_Word16 A_hi[SPL_LEVINSON_MAXORDER + 1], A_low[SPL_LEVINSON_MAXORDER + 1];
|
|
||||||
// LPC coefficients for next iteration
|
|
||||||
WebRtc_Word16 A_upd_hi[SPL_LEVINSON_MAXORDER + 1], A_upd_low[SPL_LEVINSON_MAXORDER + 1];
|
|
||||||
// Reflection coefficient in high precision
|
|
||||||
WebRtc_Word16 K_hi, K_low;
|
|
||||||
// Prediction gain Alpha in high precision and with scale factor
|
|
||||||
WebRtc_Word16 Alpha_hi, Alpha_low, Alpha_exp;
|
|
||||||
WebRtc_Word16 tmp_hi, tmp_low;
|
|
||||||
WebRtc_Word32 temp1W32, temp2W32, temp3W32;
|
|
||||||
WebRtc_Word16 norm;
|
|
||||||
|
|
||||||
// Normalize the autocorrelation R[0]...R[order+1]
|
|
||||||
|
|
||||||
norm = WebRtcSpl_NormW32(R[0]);
|
|
||||||
|
|
||||||
for (i = order; i >= 0; i--)
|
|
||||||
{
|
|
||||||
temp1W32 = WEBRTC_SPL_LSHIFT_W32(R[i], norm);
|
|
||||||
// Put R in hi and low format
|
|
||||||
R_hi[i] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(temp1W32, 16);
|
|
||||||
R_low[i] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((temp1W32
|
|
||||||
- WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)R_hi[i], 16)), 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
// K = A[1] = -R[1] / R[0]
|
|
||||||
|
|
||||||
temp2W32 = WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)R_hi[1],16)
|
|
||||||
+ WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)R_low[1],1); // R[1] in Q31
|
|
||||||
temp3W32 = WEBRTC_SPL_ABS_W32(temp2W32); // abs R[1]
|
|
||||||
temp1W32 = WebRtcSpl_DivW32HiLow(temp3W32, R_hi[0], R_low[0]); // abs(R[1])/R[0] in Q31
|
|
||||||
// Put back the sign on R[1]
|
|
||||||
if (temp2W32 > 0)
|
|
||||||
{
|
|
||||||
temp1W32 = -temp1W32;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Put K in hi and low format
|
|
||||||
K_hi = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(temp1W32, 16);
|
|
||||||
K_low = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((temp1W32
|
|
||||||
- WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)K_hi, 16)), 1);
|
|
||||||
|
|
||||||
// Store first reflection coefficient
|
|
||||||
K[0] = K_hi;
|
|
||||||
|
|
||||||
temp1W32 = WEBRTC_SPL_RSHIFT_W32(temp1W32, 4); // A[1] in Q27
|
|
||||||
|
|
||||||
// Put A[1] in hi and low format
|
|
||||||
A_hi[1] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(temp1W32, 16);
|
|
||||||
A_low[1] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((temp1W32
|
|
||||||
- WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)A_hi[1], 16)), 1);
|
|
||||||
|
|
||||||
// Alpha = R[0] * (1-K^2)
|
|
||||||
|
|
||||||
temp1W32 = (((WEBRTC_SPL_MUL_16_16(K_hi, K_low) >> 14) + WEBRTC_SPL_MUL_16_16(K_hi, K_hi))
|
|
||||||
<< 1); // temp1W32 = k^2 in Q31
|
|
||||||
|
|
||||||
temp1W32 = WEBRTC_SPL_ABS_W32(temp1W32); // Guard against <0
|
|
||||||
temp1W32 = (WebRtc_Word32)0x7fffffffL - temp1W32; // temp1W32 = (1 - K[0]*K[0]) in Q31
|
|
||||||
|
|
||||||
// Store temp1W32 = 1 - K[0]*K[0] on hi and low format
|
|
||||||
tmp_hi = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(temp1W32, 16);
|
|
||||||
tmp_low = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((temp1W32
|
|
||||||
- WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)tmp_hi, 16)), 1);
|
|
||||||
|
|
||||||
// Calculate Alpha in Q31
|
|
||||||
temp1W32 = ((WEBRTC_SPL_MUL_16_16(R_hi[0], tmp_hi)
|
|
||||||
+ (WEBRTC_SPL_MUL_16_16(R_hi[0], tmp_low) >> 15)
|
|
||||||
+ (WEBRTC_SPL_MUL_16_16(R_low[0], tmp_hi) >> 15)) << 1);
|
|
||||||
|
|
||||||
// Normalize Alpha and put it in hi and low format
|
|
||||||
|
|
||||||
Alpha_exp = WebRtcSpl_NormW32(temp1W32);
|
|
||||||
temp1W32 = WEBRTC_SPL_LSHIFT_W32(temp1W32, Alpha_exp);
|
|
||||||
Alpha_hi = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(temp1W32, 16);
|
|
||||||
Alpha_low = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((temp1W32
|
|
||||||
- WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)Alpha_hi, 16)), 1);
|
|
||||||
|
|
||||||
// Perform the iterative calculations in the Levinson-Durbin algorithm
|
|
||||||
|
|
||||||
for (i = 2; i <= order; i++)
|
|
||||||
{
|
|
||||||
/* ----
|
|
||||||
temp1W32 = R[i] + > R[j]*A[i-j]
|
|
||||||
/
|
|
||||||
----
|
|
||||||
j=1..i-1
|
|
||||||
*/
|
|
||||||
|
|
||||||
temp1W32 = 0;
|
|
||||||
|
|
||||||
for (j = 1; j < i; j++)
|
|
||||||
{
|
|
||||||
// temp1W32 is in Q31
|
|
||||||
temp1W32 += ((WEBRTC_SPL_MUL_16_16(R_hi[j], A_hi[i-j]) << 1)
|
|
||||||
+ (((WEBRTC_SPL_MUL_16_16(R_hi[j], A_low[i-j]) >> 15)
|
|
||||||
+ (WEBRTC_SPL_MUL_16_16(R_low[j], A_hi[i-j]) >> 15)) << 1));
|
|
||||||
}
|
|
||||||
|
|
||||||
temp1W32 = WEBRTC_SPL_LSHIFT_W32(temp1W32, 4);
|
|
||||||
temp1W32 += (WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)R_hi[i], 16)
|
|
||||||
+ WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)R_low[i], 1));
|
|
||||||
|
|
||||||
// K = -temp1W32 / Alpha
|
|
||||||
temp2W32 = WEBRTC_SPL_ABS_W32(temp1W32); // abs(temp1W32)
|
|
||||||
temp3W32 = WebRtcSpl_DivW32HiLow(temp2W32, Alpha_hi, Alpha_low); // abs(temp1W32)/Alpha
|
|
||||||
|
|
||||||
// Put the sign of temp1W32 back again
|
|
||||||
if (temp1W32 > 0)
|
|
||||||
{
|
|
||||||
temp3W32 = -temp3W32;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Use the Alpha shifts from earlier to de-normalize
|
|
||||||
norm = WebRtcSpl_NormW32(temp3W32);
|
|
||||||
if ((Alpha_exp <= norm) || (temp3W32 == 0))
|
|
||||||
{
|
|
||||||
temp3W32 = WEBRTC_SPL_LSHIFT_W32(temp3W32, Alpha_exp);
|
|
||||||
} else
|
|
||||||
{
|
|
||||||
if (temp3W32 > 0)
|
|
||||||
{
|
|
||||||
temp3W32 = (WebRtc_Word32)0x7fffffffL;
|
|
||||||
} else
|
|
||||||
{
|
|
||||||
temp3W32 = (WebRtc_Word32)0x80000000L;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Put K on hi and low format
|
|
||||||
K_hi = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(temp3W32, 16);
|
|
||||||
K_low = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((temp3W32
|
|
||||||
- WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)K_hi, 16)), 1);
|
|
||||||
|
|
||||||
// Store Reflection coefficient in Q15
|
|
||||||
K[i - 1] = K_hi;
|
|
||||||
|
|
||||||
// Test for unstable filter.
|
|
||||||
// If unstable return 0 and let the user decide what to do in that case
|
|
||||||
|
|
||||||
if ((WebRtc_Word32)WEBRTC_SPL_ABS_W16(K_hi) > (WebRtc_Word32)32750)
|
|
||||||
{
|
|
||||||
return 0; // Unstable filter
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
Compute updated LPC coefficient: Anew[i]
|
|
||||||
Anew[j]= A[j] + K*A[i-j] for j=1..i-1
|
|
||||||
Anew[i]= K
|
|
||||||
*/
|
|
||||||
|
|
||||||
for (j = 1; j < i; j++)
|
|
||||||
{
|
|
||||||
// temp1W32 = A[j] in Q27
|
|
||||||
temp1W32 = WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)A_hi[j],16)
|
|
||||||
+ WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)A_low[j],1);
|
|
||||||
|
|
||||||
// temp1W32 += K*A[i-j] in Q27
|
|
||||||
temp1W32 += ((WEBRTC_SPL_MUL_16_16(K_hi, A_hi[i-j])
|
|
||||||
+ (WEBRTC_SPL_MUL_16_16(K_hi, A_low[i-j]) >> 15)
|
|
||||||
+ (WEBRTC_SPL_MUL_16_16(K_low, A_hi[i-j]) >> 15)) << 1);
|
|
||||||
|
|
||||||
// Put Anew in hi and low format
|
|
||||||
A_upd_hi[j] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(temp1W32, 16);
|
|
||||||
A_upd_low[j] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((temp1W32
|
|
||||||
- WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)A_upd_hi[j], 16)), 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
// temp3W32 = K in Q27 (Convert from Q31 to Q27)
|
|
||||||
temp3W32 = WEBRTC_SPL_RSHIFT_W32(temp3W32, 4);
|
|
||||||
|
|
||||||
// Store Anew in hi and low format
|
|
||||||
A_upd_hi[i] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(temp3W32, 16);
|
|
||||||
A_upd_low[i] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((temp3W32
|
|
||||||
- WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)A_upd_hi[i], 16)), 1);
|
|
||||||
|
|
||||||
// Alpha = Alpha * (1-K^2)
|
|
||||||
|
|
||||||
temp1W32 = (((WEBRTC_SPL_MUL_16_16(K_hi, K_low) >> 14)
|
|
||||||
+ WEBRTC_SPL_MUL_16_16(K_hi, K_hi)) << 1); // K*K in Q31
|
|
||||||
|
|
||||||
temp1W32 = WEBRTC_SPL_ABS_W32(temp1W32); // Guard against <0
|
|
||||||
temp1W32 = (WebRtc_Word32)0x7fffffffL - temp1W32; // 1 - K*K in Q31
|
|
||||||
|
|
||||||
// Convert 1- K^2 in hi and low format
|
|
||||||
tmp_hi = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(temp1W32, 16);
|
|
||||||
tmp_low = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((temp1W32
|
|
||||||
- WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)tmp_hi, 16)), 1);
|
|
||||||
|
|
||||||
// Calculate Alpha = Alpha * (1-K^2) in Q31
|
|
||||||
temp1W32 = ((WEBRTC_SPL_MUL_16_16(Alpha_hi, tmp_hi)
|
|
||||||
+ (WEBRTC_SPL_MUL_16_16(Alpha_hi, tmp_low) >> 15)
|
|
||||||
+ (WEBRTC_SPL_MUL_16_16(Alpha_low, tmp_hi) >> 15)) << 1);
|
|
||||||
|
|
||||||
// Normalize Alpha and store it on hi and low format
|
|
||||||
|
|
||||||
norm = WebRtcSpl_NormW32(temp1W32);
|
|
||||||
temp1W32 = WEBRTC_SPL_LSHIFT_W32(temp1W32, norm);
|
|
||||||
|
|
||||||
Alpha_hi = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(temp1W32, 16);
|
|
||||||
Alpha_low = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((temp1W32
|
|
||||||
- WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)Alpha_hi, 16)), 1);
|
|
||||||
|
|
||||||
// Update the total normalization of Alpha
|
|
||||||
Alpha_exp = Alpha_exp + norm;
|
|
||||||
|
|
||||||
// Update A[]
|
|
||||||
|
|
||||||
for (j = 1; j <= i; j++)
|
|
||||||
{
|
|
||||||
A_hi[j] = A_upd_hi[j];
|
|
||||||
A_low[j] = A_upd_low[j];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
Set A[0] to 1.0 and store the A[i] i=1...order in Q12
|
|
||||||
(Convert from Q27 and use rounding)
|
|
||||||
*/
|
|
||||||
|
|
||||||
A[0] = 4096;
|
|
||||||
|
|
||||||
for (i = 1; i <= order; i++)
|
|
||||||
{
|
|
||||||
// temp1W32 in Q27
|
|
||||||
temp1W32 = WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)A_hi[i], 16)
|
|
||||||
+ WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)A_low[i], 1);
|
|
||||||
// Round and store upper word
|
|
||||||
A[i] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32((temp1W32<<1)+(WebRtc_Word32)32768, 16);
|
|
||||||
}
|
|
||||||
return 1; // Stable filters
|
|
||||||
}
|
|
||||||
|
|
@ -1,535 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "lpc_analysis.h"
|
|
||||||
#include "settings.h"
|
|
||||||
#include "codec.h"
|
|
||||||
#include "entropy_coding.h"
|
|
||||||
|
|
||||||
#include <math.h>
|
|
||||||
#include <string.h>
|
|
||||||
|
|
||||||
#define LEVINSON_EPS 1.0e-10
|
|
||||||
|
|
||||||
|
|
||||||
/* window */
|
|
||||||
/* Matlab generation code:
|
|
||||||
* t = (1:256)/257; r = 1-(1-t).^.45; w = sin(r*pi).^3; w = w/sum(w); plot((1:256)/8, w); grid;
|
|
||||||
* for k=1:16, fprintf(1, '%.8f, ', w(k*16 + (-15:0))); fprintf(1, '\n'); end
|
|
||||||
*/
|
|
||||||
static const double kLpcCorrWindow[WINLEN] = {
|
|
||||||
0.00000000, 0.00000001, 0.00000004, 0.00000010, 0.00000020,
|
|
||||||
0.00000035, 0.00000055, 0.00000083, 0.00000118, 0.00000163,
|
|
||||||
0.00000218, 0.00000283, 0.00000361, 0.00000453, 0.00000558, 0.00000679,
|
|
||||||
0.00000817, 0.00000973, 0.00001147, 0.00001342, 0.00001558,
|
|
||||||
0.00001796, 0.00002058, 0.00002344, 0.00002657, 0.00002997,
|
|
||||||
0.00003365, 0.00003762, 0.00004190, 0.00004651, 0.00005144, 0.00005673,
|
|
||||||
0.00006236, 0.00006837, 0.00007476, 0.00008155, 0.00008875,
|
|
||||||
0.00009636, 0.00010441, 0.00011290, 0.00012186, 0.00013128,
|
|
||||||
0.00014119, 0.00015160, 0.00016252, 0.00017396, 0.00018594, 0.00019846,
|
|
||||||
0.00021155, 0.00022521, 0.00023946, 0.00025432, 0.00026978,
|
|
||||||
0.00028587, 0.00030260, 0.00031998, 0.00033802, 0.00035674,
|
|
||||||
0.00037615, 0.00039626, 0.00041708, 0.00043863, 0.00046092, 0.00048396,
|
|
||||||
0.00050775, 0.00053233, 0.00055768, 0.00058384, 0.00061080,
|
|
||||||
0.00063858, 0.00066720, 0.00069665, 0.00072696, 0.00075813,
|
|
||||||
0.00079017, 0.00082310, 0.00085692, 0.00089164, 0.00092728, 0.00096384,
|
|
||||||
0.00100133, 0.00103976, 0.00107914, 0.00111947, 0.00116077,
|
|
||||||
0.00120304, 0.00124630, 0.00129053, 0.00133577, 0.00138200,
|
|
||||||
0.00142924, 0.00147749, 0.00152676, 0.00157705, 0.00162836, 0.00168070,
|
|
||||||
0.00173408, 0.00178850, 0.00184395, 0.00190045, 0.00195799,
|
|
||||||
0.00201658, 0.00207621, 0.00213688, 0.00219860, 0.00226137,
|
|
||||||
0.00232518, 0.00239003, 0.00245591, 0.00252284, 0.00259079, 0.00265977,
|
|
||||||
0.00272977, 0.00280078, 0.00287280, 0.00294582, 0.00301984,
|
|
||||||
0.00309484, 0.00317081, 0.00324774, 0.00332563, 0.00340446,
|
|
||||||
0.00348421, 0.00356488, 0.00364644, 0.00372889, 0.00381220, 0.00389636,
|
|
||||||
0.00398135, 0.00406715, 0.00415374, 0.00424109, 0.00432920,
|
|
||||||
0.00441802, 0.00450754, 0.00459773, 0.00468857, 0.00478001,
|
|
||||||
0.00487205, 0.00496464, 0.00505775, 0.00515136, 0.00524542, 0.00533990,
|
|
||||||
0.00543476, 0.00552997, 0.00562548, 0.00572125, 0.00581725,
|
|
||||||
0.00591342, 0.00600973, 0.00610612, 0.00620254, 0.00629895,
|
|
||||||
0.00639530, 0.00649153, 0.00658758, 0.00668341, 0.00677894, 0.00687413,
|
|
||||||
0.00696891, 0.00706322, 0.00715699, 0.00725016, 0.00734266,
|
|
||||||
0.00743441, 0.00752535, 0.00761540, 0.00770449, 0.00779254,
|
|
||||||
0.00787947, 0.00796519, 0.00804963, 0.00813270, 0.00821431, 0.00829437,
|
|
||||||
0.00837280, 0.00844949, 0.00852436, 0.00859730, 0.00866822,
|
|
||||||
0.00873701, 0.00880358, 0.00886781, 0.00892960, 0.00898884,
|
|
||||||
0.00904542, 0.00909923, 0.00915014, 0.00919805, 0.00924283, 0.00928436,
|
|
||||||
0.00932252, 0.00935718, 0.00938821, 0.00941550, 0.00943890,
|
|
||||||
0.00945828, 0.00947351, 0.00948446, 0.00949098, 0.00949294,
|
|
||||||
0.00949020, 0.00948262, 0.00947005, 0.00945235, 0.00942938, 0.00940099,
|
|
||||||
0.00936704, 0.00932738, 0.00928186, 0.00923034, 0.00917268,
|
|
||||||
0.00910872, 0.00903832, 0.00896134, 0.00887763, 0.00878706,
|
|
||||||
0.00868949, 0.00858478, 0.00847280, 0.00835343, 0.00822653, 0.00809199,
|
|
||||||
0.00794970, 0.00779956, 0.00764145, 0.00747530, 0.00730103,
|
|
||||||
0.00711857, 0.00692787, 0.00672888, 0.00652158, 0.00630597,
|
|
||||||
0.00608208, 0.00584994, 0.00560962, 0.00536124, 0.00510493, 0.00484089,
|
|
||||||
0.00456935, 0.00429062, 0.00400505, 0.00371310, 0.00341532,
|
|
||||||
0.00311238, 0.00280511, 0.00249452, 0.00218184, 0.00186864,
|
|
||||||
0.00155690, 0.00124918, 0.00094895, 0.00066112, 0.00039320, 0.00015881
|
|
||||||
};
|
|
||||||
|
|
||||||
double WebRtcIsac_LevDurb(double *a, double *k, double *r, int order)
|
|
||||||
{
|
|
||||||
|
|
||||||
double sum, alpha;
|
|
||||||
int m, m_h, i;
|
|
||||||
alpha = 0; //warning -DH
|
|
||||||
a[0] = 1.0;
|
|
||||||
if (r[0] < LEVINSON_EPS) { /* if r[0] <= 0, set LPC coeff. to zero */
|
|
||||||
for (i = 0; i < order; i++) {
|
|
||||||
k[i] = 0;
|
|
||||||
a[i+1] = 0;
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
a[1] = k[0] = -r[1]/r[0];
|
|
||||||
alpha = r[0] + r[1] * k[0];
|
|
||||||
for (m = 1; m < order; m++){
|
|
||||||
sum = r[m + 1];
|
|
||||||
for (i = 0; i < m; i++){
|
|
||||||
sum += a[i+1] * r[m - i];
|
|
||||||
}
|
|
||||||
k[m] = -sum / alpha;
|
|
||||||
alpha += k[m] * sum;
|
|
||||||
m_h = (m + 1) >> 1;
|
|
||||||
for (i = 0; i < m_h; i++){
|
|
||||||
sum = a[i+1] + k[m] * a[m - i];
|
|
||||||
a[m - i] += k[m] * a[i+1];
|
|
||||||
a[i+1] = sum;
|
|
||||||
}
|
|
||||||
a[m+1] = k[m];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return alpha;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
//was static before, but didn't work with MEX file
|
|
||||||
void WebRtcIsac_GetVars(const double *input, const WebRtc_Word16 *pitchGains_Q12,
|
|
||||||
double *oldEnergy, double *varscale)
|
|
||||||
{
|
|
||||||
double nrg[4], chng, pg;
|
|
||||||
int k;
|
|
||||||
|
|
||||||
double pitchGains[4]={0,0,0,0};;
|
|
||||||
|
|
||||||
/* Calculate energies of first and second frame halfs */
|
|
||||||
nrg[0] = 0.0001;
|
|
||||||
for (k = QLOOKAHEAD/2; k < (FRAMESAMPLES_QUARTER + QLOOKAHEAD) / 2; k++) {
|
|
||||||
nrg[0] += input[k]*input[k];
|
|
||||||
}
|
|
||||||
nrg[1] = 0.0001;
|
|
||||||
for ( ; k < (FRAMESAMPLES_HALF + QLOOKAHEAD) / 2; k++) {
|
|
||||||
nrg[1] += input[k]*input[k];
|
|
||||||
}
|
|
||||||
nrg[2] = 0.0001;
|
|
||||||
for ( ; k < (FRAMESAMPLES*3/4 + QLOOKAHEAD) / 2; k++) {
|
|
||||||
nrg[2] += input[k]*input[k];
|
|
||||||
}
|
|
||||||
nrg[3] = 0.0001;
|
|
||||||
for ( ; k < (FRAMESAMPLES + QLOOKAHEAD) / 2; k++) {
|
|
||||||
nrg[3] += input[k]*input[k];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Calculate average level change */
|
|
||||||
chng = 0.25 * (fabs(10.0 * log10(nrg[3] / nrg[2])) +
|
|
||||||
fabs(10.0 * log10(nrg[2] / nrg[1])) +
|
|
||||||
fabs(10.0 * log10(nrg[1] / nrg[0])) +
|
|
||||||
fabs(10.0 * log10(nrg[0] / *oldEnergy)));
|
|
||||||
|
|
||||||
|
|
||||||
/* Find average pitch gain */
|
|
||||||
pg = 0.0;
|
|
||||||
for (k=0; k<4; k++)
|
|
||||||
{
|
|
||||||
pitchGains[k] = ((float)pitchGains_Q12[k])/4096;
|
|
||||||
pg += pitchGains[k];
|
|
||||||
}
|
|
||||||
pg *= 0.25;
|
|
||||||
|
|
||||||
/* If pitch gain is low and energy constant - increase noise level*/
|
|
||||||
/* Matlab code:
|
|
||||||
pg = 0:.01:.45; plot(pg, 0.0 + 1.0 * exp( -1.0 * exp(-200.0 * pg.*pg.*pg) / (1.0 + 0.4 * 0) ))
|
|
||||||
*/
|
|
||||||
*varscale = 0.0 + 1.0 * exp( -1.4 * exp(-200.0 * pg*pg*pg) / (1.0 + 0.4 * chng) );
|
|
||||||
|
|
||||||
*oldEnergy = nrg[3];
|
|
||||||
}
|
|
||||||
|
|
||||||
void
|
|
||||||
WebRtcIsac_GetVarsUB(
|
|
||||||
const double* input,
|
|
||||||
double* oldEnergy,
|
|
||||||
double* varscale)
|
|
||||||
{
|
|
||||||
double nrg[4], chng;
|
|
||||||
int k;
|
|
||||||
|
|
||||||
/* Calculate energies of first and second frame halfs */
|
|
||||||
nrg[0] = 0.0001;
|
|
||||||
for (k = 0; k < (FRAMESAMPLES_QUARTER) / 2; k++) {
|
|
||||||
nrg[0] += input[k]*input[k];
|
|
||||||
}
|
|
||||||
nrg[1] = 0.0001;
|
|
||||||
for ( ; k < (FRAMESAMPLES_HALF) / 2; k++) {
|
|
||||||
nrg[1] += input[k]*input[k];
|
|
||||||
}
|
|
||||||
nrg[2] = 0.0001;
|
|
||||||
for ( ; k < (FRAMESAMPLES*3/4) / 2; k++) {
|
|
||||||
nrg[2] += input[k]*input[k];
|
|
||||||
}
|
|
||||||
nrg[3] = 0.0001;
|
|
||||||
for ( ; k < (FRAMESAMPLES) / 2; k++) {
|
|
||||||
nrg[3] += input[k]*input[k];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Calculate average level change */
|
|
||||||
chng = 0.25 * (fabs(10.0 * log10(nrg[3] / nrg[2])) +
|
|
||||||
fabs(10.0 * log10(nrg[2] / nrg[1])) +
|
|
||||||
fabs(10.0 * log10(nrg[1] / nrg[0])) +
|
|
||||||
fabs(10.0 * log10(nrg[0] / *oldEnergy)));
|
|
||||||
|
|
||||||
|
|
||||||
/* If pitch gain is low and energy constant - increase noise level*/
|
|
||||||
/* Matlab code:
|
|
||||||
pg = 0:.01:.45; plot(pg, 0.0 + 1.0 * exp( -1.0 * exp(-200.0 * pg.*pg.*pg) / (1.0 + 0.4 * 0) ))
|
|
||||||
*/
|
|
||||||
*varscale = exp( -1.4 / (1.0 + 0.4 * chng) );
|
|
||||||
|
|
||||||
*oldEnergy = nrg[3];
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcIsac_GetLpcCoefLb(double *inLo, double *inHi, MaskFiltstr *maskdata,
|
|
||||||
double signal_noise_ratio, const WebRtc_Word16 *pitchGains_Q12,
|
|
||||||
double *lo_coeff, double *hi_coeff)
|
|
||||||
{
|
|
||||||
int k, n, j, pos1, pos2;
|
|
||||||
double varscale;
|
|
||||||
|
|
||||||
double DataLo[WINLEN], DataHi[WINLEN];
|
|
||||||
double corrlo[ORDERLO+2], corrlo2[ORDERLO+1];
|
|
||||||
double corrhi[ORDERHI+1];
|
|
||||||
double k_veclo[ORDERLO], k_vechi[ORDERHI];
|
|
||||||
|
|
||||||
double a_LO[ORDERLO+1], a_HI[ORDERHI+1];
|
|
||||||
double tmp, res_nrg;
|
|
||||||
|
|
||||||
double FwdA, FwdB;
|
|
||||||
|
|
||||||
/* hearing threshold level in dB; higher value gives more noise */
|
|
||||||
const double HearThresOffset = -28.0;
|
|
||||||
|
|
||||||
/* bandwdith expansion factors for low- and high band */
|
|
||||||
const double gammaLo = 0.9;
|
|
||||||
const double gammaHi = 0.8;
|
|
||||||
|
|
||||||
/* less-noise-at-low-frequencies factor */
|
|
||||||
double aa;
|
|
||||||
|
|
||||||
|
|
||||||
/* convert from dB to signal level */
|
|
||||||
const double H_T_H = pow(10.0, 0.05 * HearThresOffset);
|
|
||||||
double S_N_R = pow(10.0, 0.05 * signal_noise_ratio) / 3.46; /* divide by sqrt(12) */
|
|
||||||
|
|
||||||
/* change quallevel depending on pitch gains and level fluctuations */
|
|
||||||
WebRtcIsac_GetVars(inLo, pitchGains_Q12, &(maskdata->OldEnergy), &varscale);
|
|
||||||
|
|
||||||
/* less-noise-at-low-frequencies factor */
|
|
||||||
aa = 0.35 * (0.5 + 0.5 * varscale);
|
|
||||||
|
|
||||||
/* replace data in buffer by new look-ahead data */
|
|
||||||
for (pos1 = 0; pos1 < QLOOKAHEAD; pos1++)
|
|
||||||
maskdata->DataBufferLo[pos1 + WINLEN - QLOOKAHEAD] = inLo[pos1];
|
|
||||||
|
|
||||||
for (k = 0; k < SUBFRAMES; k++) {
|
|
||||||
|
|
||||||
/* Update input buffer and multiply signal with window */
|
|
||||||
for (pos1 = 0; pos1 < WINLEN - UPDATE/2; pos1++) {
|
|
||||||
maskdata->DataBufferLo[pos1] = maskdata->DataBufferLo[pos1 + UPDATE/2];
|
|
||||||
maskdata->DataBufferHi[pos1] = maskdata->DataBufferHi[pos1 + UPDATE/2];
|
|
||||||
DataLo[pos1] = maskdata->DataBufferLo[pos1] * kLpcCorrWindow[pos1];
|
|
||||||
DataHi[pos1] = maskdata->DataBufferHi[pos1] * kLpcCorrWindow[pos1];
|
|
||||||
}
|
|
||||||
pos2 = k * UPDATE/2;
|
|
||||||
for (n = 0; n < UPDATE/2; n++, pos1++) {
|
|
||||||
maskdata->DataBufferLo[pos1] = inLo[QLOOKAHEAD + pos2];
|
|
||||||
maskdata->DataBufferHi[pos1] = inHi[pos2++];
|
|
||||||
DataLo[pos1] = maskdata->DataBufferLo[pos1] * kLpcCorrWindow[pos1];
|
|
||||||
DataHi[pos1] = maskdata->DataBufferHi[pos1] * kLpcCorrWindow[pos1];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Get correlation coefficients */
|
|
||||||
WebRtcIsac_AutoCorr(corrlo, DataLo, WINLEN, ORDERLO+1); /* computing autocorrelation */
|
|
||||||
WebRtcIsac_AutoCorr(corrhi, DataHi, WINLEN, ORDERHI);
|
|
||||||
|
|
||||||
|
|
||||||
/* less noise for lower frequencies, by filtering/scaling autocorrelation sequences */
|
|
||||||
corrlo2[0] = (1.0+aa*aa) * corrlo[0] - 2.0*aa * corrlo[1];
|
|
||||||
tmp = (1.0 + aa*aa);
|
|
||||||
for (n = 1; n <= ORDERLO; n++) {
|
|
||||||
corrlo2[n] = tmp * corrlo[n] - aa * (corrlo[n-1] + corrlo[n+1]);
|
|
||||||
}
|
|
||||||
tmp = (1.0+aa) * (1.0+aa);
|
|
||||||
for (n = 0; n <= ORDERHI; n++) {
|
|
||||||
corrhi[n] = tmp * corrhi[n];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* add white noise floor */
|
|
||||||
corrlo2[0] += 1e-6;
|
|
||||||
corrhi[0] += 1e-6;
|
|
||||||
|
|
||||||
|
|
||||||
FwdA = 0.01;
|
|
||||||
FwdB = 0.01;
|
|
||||||
|
|
||||||
/* recursive filtering of correlation over subframes */
|
|
||||||
for (n = 0; n <= ORDERLO; n++) {
|
|
||||||
maskdata->CorrBufLo[n] = FwdA * maskdata->CorrBufLo[n] + corrlo2[n];
|
|
||||||
corrlo2[n] = ((1.0-FwdA)*FwdB) * maskdata->CorrBufLo[n] + (1.0-FwdB) * corrlo2[n];
|
|
||||||
}
|
|
||||||
for (n = 0; n <= ORDERHI; n++) {
|
|
||||||
maskdata->CorrBufHi[n] = FwdA * maskdata->CorrBufHi[n] + corrhi[n];
|
|
||||||
corrhi[n] = ((1.0-FwdA)*FwdB) * maskdata->CorrBufHi[n] + (1.0-FwdB) * corrhi[n];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* compute prediction coefficients */
|
|
||||||
WebRtcIsac_LevDurb(a_LO, k_veclo, corrlo2, ORDERLO);
|
|
||||||
WebRtcIsac_LevDurb(a_HI, k_vechi, corrhi, ORDERHI);
|
|
||||||
|
|
||||||
/* bandwidth expansion */
|
|
||||||
tmp = gammaLo;
|
|
||||||
for (n = 1; n <= ORDERLO; n++) {
|
|
||||||
a_LO[n] *= tmp;
|
|
||||||
tmp *= gammaLo;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* residual energy */
|
|
||||||
res_nrg = 0.0;
|
|
||||||
for (j = 0; j <= ORDERLO; j++) {
|
|
||||||
for (n = 0; n <= j; n++) {
|
|
||||||
res_nrg += a_LO[j] * corrlo2[j-n] * a_LO[n];
|
|
||||||
}
|
|
||||||
for (n = j+1; n <= ORDERLO; n++) {
|
|
||||||
res_nrg += a_LO[j] * corrlo2[n-j] * a_LO[n];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* add hearing threshold and compute the gain */
|
|
||||||
*lo_coeff++ = S_N_R / (sqrt(res_nrg) / varscale + H_T_H);
|
|
||||||
|
|
||||||
/* copy coefficients to output array */
|
|
||||||
for (n = 1; n <= ORDERLO; n++) {
|
|
||||||
*lo_coeff++ = a_LO[n];
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* bandwidth expansion */
|
|
||||||
tmp = gammaHi;
|
|
||||||
for (n = 1; n <= ORDERHI; n++) {
|
|
||||||
a_HI[n] *= tmp;
|
|
||||||
tmp *= gammaHi;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* residual energy */
|
|
||||||
res_nrg = 0.0;
|
|
||||||
for (j = 0; j <= ORDERHI; j++) {
|
|
||||||
for (n = 0; n <= j; n++) {
|
|
||||||
res_nrg += a_HI[j] * corrhi[j-n] * a_HI[n];
|
|
||||||
}
|
|
||||||
for (n = j+1; n <= ORDERHI; n++) {
|
|
||||||
res_nrg += a_HI[j] * corrhi[n-j] * a_HI[n];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* add hearing threshold and compute of the gain */
|
|
||||||
*hi_coeff++ = S_N_R / (sqrt(res_nrg) / varscale + H_T_H);
|
|
||||||
|
|
||||||
/* copy coefficients to output array */
|
|
||||||
for (n = 1; n <= ORDERHI; n++) {
|
|
||||||
*hi_coeff++ = a_HI[n];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_GetLpcCoefUb()
|
|
||||||
*
|
|
||||||
* Compute LP coefficients and correlation coefficients. At 12 kHz LP
|
|
||||||
* coefficients of the first and the last sub-frame is computed. At 16 kHz
|
|
||||||
* LP coefficients of 4th, 8th and 12th sub-frames are computed. We always
|
|
||||||
* compute correlation coefficients of all sub-frames.
|
|
||||||
*
|
|
||||||
* Inputs:
|
|
||||||
* -inSignal : Input signal
|
|
||||||
* -maskdata : a structure keeping signal from previous frame.
|
|
||||||
* -bandwidth : specifies if the codec is in 0-16 kHz mode or
|
|
||||||
* 0-12 kHz mode.
|
|
||||||
*
|
|
||||||
* Outputs:
|
|
||||||
* -lpCoeff : pointer to a buffer where A-polynomials are
|
|
||||||
* written to (first coeff is 1 and it is not
|
|
||||||
* written)
|
|
||||||
* -corrMat : a matrix where correlation coefficients of each
|
|
||||||
* sub-frame are written to one row.
|
|
||||||
* -varscale : a scale used to compute LPC gains.
|
|
||||||
*/
|
|
||||||
void
|
|
||||||
WebRtcIsac_GetLpcCoefUb(
|
|
||||||
double* inSignal,
|
|
||||||
MaskFiltstr* maskdata,
|
|
||||||
double* lpCoeff,
|
|
||||||
double corrMat[][UB_LPC_ORDER + 1],
|
|
||||||
double* varscale,
|
|
||||||
WebRtc_Word16 bandwidth)
|
|
||||||
{
|
|
||||||
int frameCntr, activeFrameCntr, n, pos1, pos2;
|
|
||||||
WebRtc_Word16 criterion1;
|
|
||||||
WebRtc_Word16 criterion2;
|
|
||||||
WebRtc_Word16 numSubFrames = SUBFRAMES * (1 + (bandwidth == isac16kHz));
|
|
||||||
double data[WINLEN];
|
|
||||||
double corrSubFrame[UB_LPC_ORDER+2];
|
|
||||||
double reflecCoeff[UB_LPC_ORDER];
|
|
||||||
|
|
||||||
double aPolynom[UB_LPC_ORDER+1];
|
|
||||||
double tmp;
|
|
||||||
|
|
||||||
/* bandwdith expansion factors */
|
|
||||||
const double gamma = 0.9;
|
|
||||||
|
|
||||||
/* change quallevel depending on pitch gains and level fluctuations */
|
|
||||||
WebRtcIsac_GetVarsUB(inSignal, &(maskdata->OldEnergy), varscale);
|
|
||||||
|
|
||||||
/* replace data in buffer by new look-ahead data */
|
|
||||||
for(frameCntr = 0, activeFrameCntr = 0; frameCntr < numSubFrames;
|
|
||||||
frameCntr++)
|
|
||||||
{
|
|
||||||
if(frameCntr == SUBFRAMES)
|
|
||||||
{
|
|
||||||
// we are in 16 kHz
|
|
||||||
varscale++;
|
|
||||||
WebRtcIsac_GetVarsUB(&inSignal[FRAMESAMPLES_HALF],
|
|
||||||
&(maskdata->OldEnergy), varscale);
|
|
||||||
}
|
|
||||||
/* Update input buffer and multiply signal with window */
|
|
||||||
for(pos1 = 0; pos1 < WINLEN - UPDATE/2; pos1++)
|
|
||||||
{
|
|
||||||
maskdata->DataBufferLo[pos1] = maskdata->DataBufferLo[pos1 +
|
|
||||||
UPDATE/2];
|
|
||||||
data[pos1] = maskdata->DataBufferLo[pos1] * kLpcCorrWindow[pos1];
|
|
||||||
}
|
|
||||||
pos2 = frameCntr * UPDATE/2;
|
|
||||||
for(n = 0; n < UPDATE/2; n++, pos1++, pos2++)
|
|
||||||
{
|
|
||||||
maskdata->DataBufferLo[pos1] = inSignal[pos2];
|
|
||||||
data[pos1] = maskdata->DataBufferLo[pos1] * kLpcCorrWindow[pos1];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Get correlation coefficients */
|
|
||||||
/* computing autocorrelation */
|
|
||||||
WebRtcIsac_AutoCorr(corrSubFrame, data, WINLEN, UB_LPC_ORDER+1);
|
|
||||||
memcpy(corrMat[frameCntr], corrSubFrame,
|
|
||||||
(UB_LPC_ORDER+1)*sizeof(double));
|
|
||||||
|
|
||||||
criterion1 = ((frameCntr == 0) || (frameCntr == (SUBFRAMES - 1))) &&
|
|
||||||
(bandwidth == isac12kHz);
|
|
||||||
criterion2 = (((frameCntr+1) % 4) == 0) &&
|
|
||||||
(bandwidth == isac16kHz);
|
|
||||||
if(criterion1 || criterion2)
|
|
||||||
{
|
|
||||||
/* add noise */
|
|
||||||
corrSubFrame[0] += 1e-6;
|
|
||||||
/* compute prediction coefficients */
|
|
||||||
WebRtcIsac_LevDurb(aPolynom, reflecCoeff, corrSubFrame,
|
|
||||||
UB_LPC_ORDER);
|
|
||||||
|
|
||||||
/* bandwidth expansion */
|
|
||||||
tmp = gamma;
|
|
||||||
for (n = 1; n <= UB_LPC_ORDER; n++)
|
|
||||||
{
|
|
||||||
*lpCoeff++ = aPolynom[n] * tmp;
|
|
||||||
tmp *= gamma;
|
|
||||||
}
|
|
||||||
activeFrameCntr++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/******************************************************************************
|
|
||||||
* WebRtcIsac_GetLpcGain()
|
|
||||||
*
|
|
||||||
* Compute the LPC gains for each sub-frame, given the LPC of each sub-frame
|
|
||||||
* and the corresponding correlation coefficients.
|
|
||||||
*
|
|
||||||
* Inputs:
|
|
||||||
* -signal_noise_ratio : the desired SNR in dB.
|
|
||||||
* -numVecs : number of sub-frames
|
|
||||||
* -corrMat : a matrix of correlation coefficients where
|
|
||||||
* each row is a set of correlation coefficients of
|
|
||||||
* one sub-frame.
|
|
||||||
* -varscale : a scale computed when WebRtcIsac_GetLpcCoefUb()
|
|
||||||
* is called.
|
|
||||||
*
|
|
||||||
* Outputs:
|
|
||||||
* -gain : pointer to a buffer where LP gains are written.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
void
|
|
||||||
WebRtcIsac_GetLpcGain(
|
|
||||||
double signal_noise_ratio,
|
|
||||||
const double* filtCoeffVecs,
|
|
||||||
int numVecs,
|
|
||||||
double* gain,
|
|
||||||
double corrMat[][UB_LPC_ORDER + 1],
|
|
||||||
const double* varscale)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 j, n;
|
|
||||||
WebRtc_Word16 subFrameCntr;
|
|
||||||
double aPolynom[ORDERLO + 1];
|
|
||||||
double res_nrg;
|
|
||||||
|
|
||||||
const double HearThresOffset = -28.0;
|
|
||||||
const double H_T_H = pow(10.0, 0.05 * HearThresOffset);
|
|
||||||
/* divide by sqrt(12) = 3.46 */
|
|
||||||
const double S_N_R = pow(10.0, 0.05 * signal_noise_ratio) / 3.46;
|
|
||||||
|
|
||||||
aPolynom[0] = 1;
|
|
||||||
for(subFrameCntr = 0; subFrameCntr < numVecs; subFrameCntr++)
|
|
||||||
{
|
|
||||||
if(subFrameCntr == SUBFRAMES)
|
|
||||||
{
|
|
||||||
// we are in second half of a SWB frame. use new varscale
|
|
||||||
varscale++;
|
|
||||||
}
|
|
||||||
memcpy(&aPolynom[1], &filtCoeffVecs[(subFrameCntr * (UB_LPC_ORDER + 1)) +
|
|
||||||
1], sizeof(double) * UB_LPC_ORDER);
|
|
||||||
|
|
||||||
/* residual energy */
|
|
||||||
res_nrg = 0.0;
|
|
||||||
for(j = 0; j <= UB_LPC_ORDER; j++)
|
|
||||||
{
|
|
||||||
for(n = 0; n <= j; n++)
|
|
||||||
{
|
|
||||||
res_nrg += aPolynom[j] * corrMat[subFrameCntr][j-n] *
|
|
||||||
aPolynom[n];
|
|
||||||
}
|
|
||||||
for(n = j+1; n <= UB_LPC_ORDER; n++)
|
|
||||||
{
|
|
||||||
res_nrg += aPolynom[j] * corrMat[subFrameCntr][n-j] *
|
|
||||||
aPolynom[n];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* add hearing threshold and compute the gain */
|
|
||||||
gain[subFrameCntr] = S_N_R / (sqrt(res_nrg) / *varscale + H_T_H);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
@ -1,50 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* lpc_analysis.h
|
|
||||||
*
|
|
||||||
* LPC functions
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_LPC_ANALYSIS_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_LPC_ANALYSIS_H_
|
|
||||||
|
|
||||||
#include "settings.h"
|
|
||||||
#include "structs.h"
|
|
||||||
|
|
||||||
double WebRtcIsac_LevDurb(double *a, double *k, double *r, int order);
|
|
||||||
|
|
||||||
void WebRtcIsac_GetVars(const double *input, const WebRtc_Word16 *pitchGains_Q12,
|
|
||||||
double *oldEnergy, double *varscale);
|
|
||||||
|
|
||||||
void WebRtcIsac_GetLpcCoefLb(double *inLo, double *inHi, MaskFiltstr *maskdata,
|
|
||||||
double signal_noise_ratio, const WebRtc_Word16 *pitchGains_Q12,
|
|
||||||
double *lo_coeff, double *hi_coeff);
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_GetLpcGain(
|
|
||||||
double signal_noise_ratio,
|
|
||||||
const double* filtCoeffVecs,
|
|
||||||
int numVecs,
|
|
||||||
double* gain,
|
|
||||||
double corrLo[][UB_LPC_ORDER + 1],
|
|
||||||
const double* varscale);
|
|
||||||
|
|
||||||
void WebRtcIsac_GetLpcCoefUb(
|
|
||||||
double* inSignal,
|
|
||||||
MaskFiltstr* maskdata,
|
|
||||||
double* lpCoeff,
|
|
||||||
double corr[][UB_LPC_ORDER + 1],
|
|
||||||
double* varscale,
|
|
||||||
WebRtc_Word16 bandwidth);
|
|
||||||
|
|
||||||
#endif /* WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_LPC_ANALYIS_H_ */
|
|
||||||
|
|
@ -1,137 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* SWB_KLT_Tables_LPCGain.c
|
|
||||||
*
|
|
||||||
* This file defines tables used for entropy coding of LPC Gain
|
|
||||||
* of upper-band.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "lpc_gain_swb_tables.h"
|
|
||||||
#include "settings.h"
|
|
||||||
#include "typedefs.h"
|
|
||||||
|
|
||||||
const double WebRtcIsac_kQSizeLpcGain = 0.100000;
|
|
||||||
|
|
||||||
const double WebRtcIsac_kMeanLpcGain = -3.3822;
|
|
||||||
|
|
||||||
/*
|
|
||||||
* The smallest reconstruction points for quantiztion of
|
|
||||||
* LPC gains.
|
|
||||||
*/
|
|
||||||
const double WebRtcIsac_kLeftRecPointLpcGain[SUBFRAMES] =
|
|
||||||
{
|
|
||||||
-0.800000, -1.000000, -1.200000, -2.200000, -3.000000, -12.700000
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Number of reconstruction points of quantizers for LPC Gains.
|
|
||||||
*/
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kNumQCellLpcGain[SUBFRAMES] =
|
|
||||||
{
|
|
||||||
17, 20, 25, 45, 77, 170
|
|
||||||
};
|
|
||||||
/*
|
|
||||||
* Starting index for entropy decoder to search for the right interval,
|
|
||||||
* one entry per LAR coefficient
|
|
||||||
*/
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcGainEntropySearch[SUBFRAMES] =
|
|
||||||
{
|
|
||||||
8, 10, 12, 22, 38, 85
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* The following 6 vectors define CDF of 6 decorrelated LPC
|
|
||||||
* gains.
|
|
||||||
*/
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcGainCdfVec0[18] =
|
|
||||||
{
|
|
||||||
0, 10, 27, 83, 234, 568, 1601, 4683, 16830, 57534, 63437,
|
|
||||||
64767, 65229, 65408, 65483, 65514, 65527, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcGainCdfVec1[21] =
|
|
||||||
{
|
|
||||||
0, 15, 33, 84, 185, 385, 807, 1619, 3529, 7850, 19488,
|
|
||||||
51365, 62437, 64548, 65088, 65304, 65409, 65484, 65507, 65522, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcGainCdfVec2[26] =
|
|
||||||
{
|
|
||||||
0, 15, 29, 54, 89, 145, 228, 380, 652, 1493, 4260,
|
|
||||||
12359, 34133, 50749, 57224, 60814, 62927, 64078, 64742, 65103, 65311, 65418,
|
|
||||||
65473, 65509, 65521, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcGainCdfVec3[46] =
|
|
||||||
{
|
|
||||||
0, 8, 12, 16, 26, 42, 56, 76, 111, 164, 247,
|
|
||||||
366, 508, 693, 1000, 1442, 2155, 3188, 4854, 7387, 11249, 17617,
|
|
||||||
30079, 46711, 56291, 60127, 62140, 63258, 63954, 64384, 64690, 64891, 65031,
|
|
||||||
65139, 65227, 65293, 65351, 65399, 65438, 65467, 65492, 65504, 65510, 65518,
|
|
||||||
65523, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcGainCdfVec4[78] =
|
|
||||||
{
|
|
||||||
0, 17, 29, 39, 51, 70, 104, 154, 234, 324, 443,
|
|
||||||
590, 760, 971, 1202, 1494, 1845, 2274, 2797, 3366, 4088, 4905,
|
|
||||||
5899, 7142, 8683, 10625, 12983, 16095, 20637, 28216, 38859, 47237, 51537,
|
|
||||||
54150, 56066, 57583, 58756, 59685, 60458, 61103, 61659, 62144, 62550, 62886,
|
|
||||||
63186, 63480, 63743, 63954, 64148, 64320, 64467, 64600, 64719, 64837, 64939,
|
|
||||||
65014, 65098, 65160, 65211, 65250, 65290, 65325, 65344, 65366, 65391, 65410,
|
|
||||||
65430, 65447, 65460, 65474, 65487, 65494, 65501, 65509, 65513, 65518, 65520,
|
|
||||||
65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcGainCdfVec5[171] =
|
|
||||||
{
|
|
||||||
0, 10, 12, 14, 16, 18, 23, 29, 35, 42, 51,
|
|
||||||
58, 65, 72, 78, 87, 96, 103, 111, 122, 134, 150,
|
|
||||||
167, 184, 202, 223, 244, 265, 289, 315, 346, 379, 414,
|
|
||||||
450, 491, 532, 572, 613, 656, 700, 751, 802, 853, 905,
|
|
||||||
957, 1021, 1098, 1174, 1250, 1331, 1413, 1490, 1565, 1647, 1730,
|
|
||||||
1821, 1913, 2004, 2100, 2207, 2314, 2420, 2532, 2652, 2783, 2921,
|
|
||||||
3056, 3189, 3327, 3468, 3640, 3817, 3993, 4171, 4362, 4554, 4751,
|
|
||||||
4948, 5142, 5346, 5566, 5799, 6044, 6301, 6565, 6852, 7150, 7470,
|
|
||||||
7797, 8143, 8492, 8835, 9181, 9547, 9919, 10315, 10718, 11136, 11566,
|
|
||||||
12015, 12482, 12967, 13458, 13953, 14432, 14903, 15416, 15936, 16452, 16967,
|
|
||||||
17492, 18024, 18600, 19173, 19736, 20311, 20911, 21490, 22041, 22597, 23157,
|
|
||||||
23768, 24405, 25034, 25660, 26280, 26899, 27614, 28331, 29015, 29702, 30403,
|
|
||||||
31107, 31817, 32566, 33381, 34224, 35099, 36112, 37222, 38375, 39549, 40801,
|
|
||||||
42074, 43350, 44626, 45982, 47354, 48860, 50361, 51845, 53312, 54739, 56026,
|
|
||||||
57116, 58104, 58996, 59842, 60658, 61488, 62324, 63057, 63769, 64285, 64779,
|
|
||||||
65076, 65344, 65430, 65500, 65517, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* An array of pointers to CDFs of decorrelated LPC Gains
|
|
||||||
*/
|
|
||||||
const WebRtc_UWord16* WebRtcIsac_kLpcGainCdfMat[SUBFRAMES] =
|
|
||||||
{
|
|
||||||
WebRtcIsac_kLpcGainCdfVec0, WebRtcIsac_kLpcGainCdfVec1,
|
|
||||||
WebRtcIsac_kLpcGainCdfVec2, WebRtcIsac_kLpcGainCdfVec3,
|
|
||||||
WebRtcIsac_kLpcGainCdfVec4, WebRtcIsac_kLpcGainCdfVec5
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* A matrix to decorrellate LPC gains of subframes.
|
|
||||||
*/
|
|
||||||
const double WebRtcIsac_kLpcGainDecorrMat[SUBFRAMES][SUBFRAMES] =
|
|
||||||
{
|
|
||||||
{-0.150860, 0.327872, 0.367220, 0.504613, 0.559270, 0.409234},
|
|
||||||
{ 0.457128, -0.613591, -0.289283, -0.029734, 0.393760, 0.418240},
|
|
||||||
{-0.626043, 0.136489, -0.439118, -0.448323, 0.135987, 0.420869},
|
|
||||||
{ 0.526617, 0.480187, 0.242552, -0.488754, -0.158713, 0.411331},
|
|
||||||
{-0.302587, -0.494953, 0.588112, -0.063035, -0.404290, 0.387510},
|
|
||||||
{ 0.086378, 0.147714, -0.428875, 0.548300, -0.570121, 0.401391}
|
|
||||||
};
|
|
||||||
|
|
@ -1,49 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* SWB_KLT_Tables_LPCGain.h
|
|
||||||
*
|
|
||||||
* This file declares tables used for entropy coding of LPC Gain
|
|
||||||
* of upper-band.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_LPC_GAIN_SWB_TABLES_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_LPC_GAIN_SWB_TABLES_H_
|
|
||||||
|
|
||||||
#include "settings.h"
|
|
||||||
#include "typedefs.h"
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kQSizeLpcGain;
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kLeftRecPointLpcGain[SUBFRAMES];
|
|
||||||
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kNumQCellLpcGain[SUBFRAMES];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcGainEntropySearch[SUBFRAMES];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcGainCdfVec0[18];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcGainCdfVec1[21];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcGainCdfVec2[26];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcGainCdfVec3[46];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcGainCdfVec4[78];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcGainCdfVec5[171];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16* WebRtcIsac_kLpcGainCdfMat[SUBFRAMES];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kLpcGainDecorrMat[SUBFRAMES][SUBFRAMES];
|
|
||||||
|
|
||||||
#endif // WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_LPC_GAIN_SWB_TABLES_H_
|
|
||||||
|
|
@ -1,159 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* SWB_KLT_Tables.c
|
|
||||||
*
|
|
||||||
* This file defines tables used for entropy coding of LPC shape of
|
|
||||||
* upper-band signal if the bandwidth is 12 kHz.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "lpc_shape_swb12_tables.h"
|
|
||||||
#include "settings.h"
|
|
||||||
#include "typedefs.h"
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Mean value of LAR
|
|
||||||
*/
|
|
||||||
const double WebRtcIsac_kMeanLarUb12[UB_LPC_ORDER] =
|
|
||||||
{
|
|
||||||
0.03748928306641, 0.09453441192543, -0.01112522344398, 0.03800237516842
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* A rotation matrix to decorrelate intra-vector correlation,
|
|
||||||
* i.e. correlation among components of LAR vector.
|
|
||||||
*/
|
|
||||||
const double WebRtcIsac_kIntraVecDecorrMatUb12[UB_LPC_ORDER][UB_LPC_ORDER] =
|
|
||||||
{
|
|
||||||
{-0.00075365493856, -0.05809964887743, -0.23397966154116, 0.97050367376411},
|
|
||||||
{ 0.00625021257734, -0.17299965610679, 0.95977735920651, 0.22104179375008},
|
|
||||||
{ 0.20543384258374, -0.96202143495696, -0.15301870801552, -0.09432375099565},
|
|
||||||
{-0.97865075648479, -0.20300322280841, -0.02581111653779, -0.01913568980258}
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* A rotation matrix to remove correlation among LAR coefficients
|
|
||||||
* of different LAR vectors. One might guess that decorrelation matrix
|
|
||||||
* for the first component should differ from the second component
|
|
||||||
* but we haven't observed a significant benefit of having different
|
|
||||||
* decorrelation matrices for different components.
|
|
||||||
*/
|
|
||||||
const double WebRtcIsac_kInterVecDecorrMatUb12
|
|
||||||
[UB_LPC_VEC_PER_FRAME][UB_LPC_VEC_PER_FRAME] =
|
|
||||||
{
|
|
||||||
{ 0.70650597970460, -0.70770707262373},
|
|
||||||
{-0.70770707262373, -0.70650597970460}
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* LAR quantization step-size.
|
|
||||||
*/
|
|
||||||
const double WebRtcIsac_kLpcShapeQStepSizeUb12 = 0.150000;
|
|
||||||
|
|
||||||
/*
|
|
||||||
* The smallest reconstruction points for quantiztion of LAR coefficients.
|
|
||||||
*/
|
|
||||||
const double WebRtcIsac_kLpcShapeLeftRecPointUb12
|
|
||||||
[UB_LPC_ORDER*UB_LPC_VEC_PER_FRAME] =
|
|
||||||
{
|
|
||||||
-0.900000, -1.050000, -1.350000, -1.800000, -1.350000, -1.650000,
|
|
||||||
-2.250000, -3.450000
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Number of reconstruction points of quantizers for LAR coefficients.
|
|
||||||
*/
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kLpcShapeNumRecPointUb12
|
|
||||||
[UB_LPC_ORDER * UB_LPC_VEC_PER_FRAME] =
|
|
||||||
{
|
|
||||||
13, 15, 19, 27, 19, 24, 32, 48
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Starting index for entropy decoder to search for the right interval,
|
|
||||||
* one entry per LAR coefficient
|
|
||||||
*/
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeEntropySearchUb12
|
|
||||||
[UB_LPC_ORDER * UB_LPC_VEC_PER_FRAME] =
|
|
||||||
{
|
|
||||||
6, 7, 9, 13, 9, 12, 16, 24
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* The following 8 vectors define CDF of 8 decorrelated LAR
|
|
||||||
* coefficients.
|
|
||||||
*/
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec0Ub12[14] =
|
|
||||||
{
|
|
||||||
0, 13, 95, 418, 1687, 6498, 21317, 44200, 59029, 63849, 65147,
|
|
||||||
65449, 65525, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec1Ub12[16] =
|
|
||||||
{
|
|
||||||
0, 10, 59, 255, 858, 2667, 8200, 22609, 42988, 57202, 62947,
|
|
||||||
64743, 65308, 65476, 65522, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec2Ub12[20] =
|
|
||||||
{
|
|
||||||
0, 18, 40, 118, 332, 857, 2017, 4822, 11321, 24330, 41279,
|
|
||||||
54342, 60637, 63394, 64659, 65184, 65398, 65482, 65518, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec3Ub12[28] =
|
|
||||||
{
|
|
||||||
0, 21, 38, 90, 196, 398, 770, 1400, 2589, 4650, 8211,
|
|
||||||
14933, 26044, 39592, 50814, 57452, 60971, 62884, 63995, 64621, 65019, 65273,
|
|
||||||
65410, 65480, 65514, 65522, 65531, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec4Ub12[20] =
|
|
||||||
{
|
|
||||||
0, 7, 46, 141, 403, 969, 2132, 4649, 10633, 24902, 43254,
|
|
||||||
54665, 59928, 62674, 64173, 64938, 65293, 65464, 65523, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec5Ub12[25] =
|
|
||||||
{
|
|
||||||
0, 7, 22, 72, 174, 411, 854, 1737, 3545, 6774, 13165,
|
|
||||||
25221, 40980, 52821, 58714, 61706, 63472, 64437, 64989, 65287, 65430, 65503,
|
|
||||||
65525, 65529, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec6Ub12[33] =
|
|
||||||
{
|
|
||||||
0, 11, 21, 36, 65, 128, 228, 401, 707, 1241, 2126,
|
|
||||||
3589, 6060, 10517, 18853, 31114, 42477, 49770, 54271, 57467, 59838, 61569,
|
|
||||||
62831, 63772, 64433, 64833, 65123, 65306, 65419, 65466, 65499, 65519, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec7Ub12[49] =
|
|
||||||
{
|
|
||||||
0, 14, 34, 67, 107, 167, 245, 326, 449, 645, 861,
|
|
||||||
1155, 1508, 2003, 2669, 3544, 4592, 5961, 7583, 9887, 13256, 18765,
|
|
||||||
26519, 34077, 40034, 44349, 47795, 50663, 53262, 55473, 57458, 59122, 60592,
|
|
||||||
61742, 62690, 63391, 63997, 64463, 64794, 65045, 65207, 65309, 65394, 65443,
|
|
||||||
65478, 65504, 65514, 65523, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* An array of pointers to CDFs of decorrelated LARs
|
|
||||||
*/
|
|
||||||
const WebRtc_UWord16* WebRtcIsac_kLpcShapeCdfMatUb12
|
|
||||||
[UB_LPC_ORDER * UB_LPC_VEC_PER_FRAME] =
|
|
||||||
{
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec0Ub12, WebRtcIsac_kLpcShapeCdfVec1Ub12,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec2Ub12, WebRtcIsac_kLpcShapeCdfVec3Ub12,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec4Ub12, WebRtcIsac_kLpcShapeCdfVec5Ub12,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec6Ub12, WebRtcIsac_kLpcShapeCdfVec7Ub12
|
|
||||||
};
|
|
||||||
|
|
@ -1,65 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* lpc_shape_swb12_tables.h
|
|
||||||
*
|
|
||||||
* This file declares tables used for entropy coding of LPC shape of
|
|
||||||
* upper-band signal if the bandwidth is 12 kHz.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_LPC_SHAPE_SWB12_TABLES_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_LPC_SHAPE_SWB12_TABLES_H_
|
|
||||||
|
|
||||||
#include "settings.h"
|
|
||||||
#include "typedefs.h"
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kMeanLarUb12[UB_LPC_ORDER];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kMeanLpcGain;
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kIntraVecDecorrMatUb12[UB_LPC_ORDER][UB_LPC_ORDER];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kInterVecDecorrMatUb12
|
|
||||||
[UB_LPC_VEC_PER_FRAME][UB_LPC_VEC_PER_FRAME];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kLpcShapeQStepSizeUb12;
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kLpcShapeLeftRecPointUb12
|
|
||||||
[UB_LPC_ORDER*UB_LPC_VEC_PER_FRAME];
|
|
||||||
|
|
||||||
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kLpcShapeNumRecPointUb12
|
|
||||||
[UB_LPC_ORDER * UB_LPC_VEC_PER_FRAME];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeEntropySearchUb12
|
|
||||||
[UB_LPC_ORDER * UB_LPC_VEC_PER_FRAME];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec0Ub12[14];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec1Ub12[16];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec2Ub12[20];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec3Ub12[28];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec4Ub12[20];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec5Ub12[25];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec6Ub12[33];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec7Ub12[49];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16* WebRtcIsac_kLpcShapeCdfMatUb12
|
|
||||||
[UB_LPC_ORDER * UB_LPC_VEC_PER_FRAME];
|
|
||||||
|
|
||||||
#endif // WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_LPC_SHAPE_SWB12_TABLES_H_
|
|
||||||
|
|
@ -1,248 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* SWB16_KLT_Tables.c
|
|
||||||
*
|
|
||||||
* This file defines tables used for entropy coding of LPC shape of
|
|
||||||
* upper-band signal if the bandwidth is 16 kHz.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "lpc_shape_swb16_tables.h"
|
|
||||||
#include "settings.h"
|
|
||||||
#include "typedefs.h"
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Mean value of LAR
|
|
||||||
*/
|
|
||||||
const double WebRtcIsac_kMeanLarUb16[UB_LPC_ORDER] =
|
|
||||||
{
|
|
||||||
0.454978, 0.364747, 0.102999, 0.104523
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* A rotation matrix to decorrelate intra-vector correlation,
|
|
||||||
* i.e. correlation among components of LAR vector.
|
|
||||||
*/
|
|
||||||
const double WebRtcIsac_kIintraVecDecorrMatUb16[UB_LPC_ORDER][UB_LPC_ORDER] =
|
|
||||||
{
|
|
||||||
{-0.020528, -0.085858, -0.002431, 0.996093},
|
|
||||||
{-0.033155, 0.036102, 0.998786, 0.004866},
|
|
||||||
{ 0.202627, 0.974853, -0.028940, 0.088132},
|
|
||||||
{-0.978479, 0.202454, -0.039785, -0.002811}
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* A rotation matrix to remove correlation among LAR coefficients
|
|
||||||
* of different LAR vectors. One might guess that decorrelation matrix
|
|
||||||
* for the first component should differ from the second component
|
|
||||||
* but we haven't observed a significant benefit of having different
|
|
||||||
* decorrelation matrices for different components.
|
|
||||||
*/
|
|
||||||
const double WebRtcIsac_kInterVecDecorrMatUb16
|
|
||||||
[UB16_LPC_VEC_PER_FRAME][UB16_LPC_VEC_PER_FRAME] =
|
|
||||||
{
|
|
||||||
{ 0.291675, -0.515786, 0.644927, 0.482658},
|
|
||||||
{-0.647220, 0.479712, 0.289556, 0.516856},
|
|
||||||
{ 0.643084, 0.485489, -0.289307, 0.516763},
|
|
||||||
{-0.287185, -0.517823, -0.645389, 0.482553}
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* The following 16 vectors define CDF of 16 decorrelated LAR
|
|
||||||
* coefficients.
|
|
||||||
*/
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub16[14] =
|
|
||||||
{
|
|
||||||
0, 2, 20, 159, 1034, 5688, 20892, 44653,
|
|
||||||
59849, 64485, 65383, 65518, 65534, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec1Ub16[16] =
|
|
||||||
{
|
|
||||||
0, 1, 7, 43, 276, 1496, 6681, 21653,
|
|
||||||
43891, 58859, 64022, 65248, 65489, 65529, 65534, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec2Ub16[18] =
|
|
||||||
{
|
|
||||||
0, 1, 9, 54, 238, 933, 3192, 9461,
|
|
||||||
23226, 42146, 56138, 62413, 64623, 65300, 65473, 65521,
|
|
||||||
65533, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec3Ub16[30] =
|
|
||||||
{
|
|
||||||
0, 2, 4, 8, 17, 36, 75, 155,
|
|
||||||
329, 683, 1376, 2662, 5047, 9508, 17526, 29027,
|
|
||||||
40363, 48997, 55096, 59180, 61789, 63407, 64400, 64967,
|
|
||||||
65273, 65429, 65497, 65526, 65534, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec4Ub16[16] =
|
|
||||||
{
|
|
||||||
0, 1, 10, 63, 361, 1785, 7407, 22242,
|
|
||||||
43337, 58125, 63729, 65181, 65472, 65527, 65534, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec5Ub16[17] =
|
|
||||||
{
|
|
||||||
0, 1, 7, 29, 134, 599, 2443, 8590,
|
|
||||||
22962, 42635, 56911, 63060, 64940, 65408, 65513, 65531,
|
|
||||||
65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec6Ub16[21] =
|
|
||||||
{
|
|
||||||
0, 1, 5, 16, 57, 191, 611, 1808,
|
|
||||||
4847, 11755, 24612, 40910, 53789, 60698, 63729, 64924,
|
|
||||||
65346, 65486, 65523, 65532, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec7Ub16[36] =
|
|
||||||
{
|
|
||||||
0, 1, 4, 12, 25, 55, 104, 184,
|
|
||||||
314, 539, 926, 1550, 2479, 3861, 5892, 8845,
|
|
||||||
13281, 20018, 29019, 38029, 45581, 51557, 56057, 59284,
|
|
||||||
61517, 63047, 64030, 64648, 65031, 65261, 65402, 65480,
|
|
||||||
65518, 65530, 65534, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec8Ub16[21] =
|
|
||||||
{
|
|
||||||
0, 1, 2, 7, 26, 103, 351, 1149,
|
|
||||||
3583, 10204, 23846, 41711, 55361, 61917, 64382, 65186,
|
|
||||||
65433, 65506, 65528, 65534, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub160[21] =
|
|
||||||
{
|
|
||||||
0, 6, 19, 63, 205, 638, 1799, 4784,
|
|
||||||
11721, 24494, 40803, 53805, 60886, 63822, 64931, 65333,
|
|
||||||
65472, 65517, 65530, 65533, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub161[28] =
|
|
||||||
{
|
|
||||||
0, 1, 3, 11, 31, 86, 221, 506,
|
|
||||||
1101, 2296, 4486, 8477, 15356, 26079, 38941, 49952,
|
|
||||||
57165, 61257, 63426, 64549, 65097, 65351, 65463, 65510,
|
|
||||||
65526, 65532, 65534, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub162[55] =
|
|
||||||
{
|
|
||||||
0, 3, 12, 23, 42, 65, 89, 115,
|
|
||||||
150, 195, 248, 327, 430, 580, 784, 1099,
|
|
||||||
1586, 2358, 3651, 5899, 9568, 14312, 19158, 23776,
|
|
||||||
28267, 32663, 36991, 41153, 45098, 48680, 51870, 54729,
|
|
||||||
57141, 59158, 60772, 62029, 63000, 63761, 64322, 64728,
|
|
||||||
65000, 65192, 65321, 65411, 65463, 65496, 65514, 65523,
|
|
||||||
65527, 65529, 65531, 65532, 65533, 65534, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub163[26] =
|
|
||||||
{
|
|
||||||
0, 2, 4, 10, 21, 48, 114, 280,
|
|
||||||
701, 1765, 4555, 11270, 24267, 41213, 54285, 61003,
|
|
||||||
63767, 64840, 65254, 65421, 65489, 65514, 65526, 65532,
|
|
||||||
65534, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub164[28] =
|
|
||||||
{
|
|
||||||
0, 1, 3, 6, 15, 36, 82, 196,
|
|
||||||
453, 1087, 2557, 5923, 13016, 25366, 40449, 52582,
|
|
||||||
59539, 62896, 64389, 65033, 65316, 65442, 65494, 65519,
|
|
||||||
65529, 65533, 65534, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub165[34] =
|
|
||||||
{
|
|
||||||
0, 2, 4, 8, 18, 35, 73, 146,
|
|
||||||
279, 524, 980, 1789, 3235, 5784, 10040, 16998,
|
|
||||||
27070, 38543, 48499, 55421, 59712, 62257, 63748, 64591,
|
|
||||||
65041, 65278, 65410, 65474, 65508, 65522, 65530, 65533,
|
|
||||||
65534, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub166[71] =
|
|
||||||
{
|
|
||||||
0, 1, 2, 6, 13, 26, 55, 92,
|
|
||||||
141, 191, 242, 296, 355, 429, 522, 636,
|
|
||||||
777, 947, 1162, 1428, 1753, 2137, 2605, 3140,
|
|
||||||
3743, 4409, 5164, 6016, 6982, 8118, 9451, 10993,
|
|
||||||
12754, 14810, 17130, 19780, 22864, 26424, 30547, 35222,
|
|
||||||
40140, 44716, 48698, 52056, 54850, 57162, 59068, 60643,
|
|
||||||
61877, 62827, 63561, 64113, 64519, 64807, 65019, 65167,
|
|
||||||
65272, 65343, 65399, 65440, 65471, 65487, 65500, 65509,
|
|
||||||
65518, 65524, 65527, 65531, 65533, 65534, 65535
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* An array of pointers to CDFs of decorrelated LARs
|
|
||||||
*/
|
|
||||||
const WebRtc_UWord16* WebRtcIsac_kLpcShapeCdfMatUb16
|
|
||||||
[UB_LPC_ORDER * UB16_LPC_VEC_PER_FRAME] = {
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec01Ub16,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec1Ub16,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec2Ub16,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec3Ub16,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec4Ub16,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec5Ub16,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec6Ub16,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec7Ub16,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec8Ub16,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec01Ub160,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec01Ub161,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec01Ub162,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec01Ub163,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec01Ub164,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec01Ub165,
|
|
||||||
WebRtcIsac_kLpcShapeCdfVec01Ub166
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* The smallest reconstruction points for quantiztion of LAR coefficients.
|
|
||||||
*/
|
|
||||||
const double WebRtcIsac_kLpcShapeLeftRecPointUb16
|
|
||||||
[UB_LPC_ORDER * UB16_LPC_VEC_PER_FRAME] =
|
|
||||||
{
|
|
||||||
-0.8250, -0.9750, -1.1250, -2.1750, -0.9750, -1.1250, -1.4250,
|
|
||||||
-2.6250, -1.4250, -1.2750, -1.8750, -3.6750, -1.7250, -1.8750,
|
|
||||||
-2.3250, -5.4750
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Number of reconstruction points of quantizers for LAR coefficients.
|
|
||||||
*/
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kLpcShapeNumRecPointUb16
|
|
||||||
[UB_LPC_ORDER * UB16_LPC_VEC_PER_FRAME] =
|
|
||||||
{
|
|
||||||
13, 15, 17, 29, 15, 16, 20, 35, 20,
|
|
||||||
20, 27, 54, 25, 27, 33, 70
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Starting index for entropy decoder to search for the right interval,
|
|
||||||
* one entry per LAR coefficient
|
|
||||||
*/
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kLpcShapeEntropySearchUb16
|
|
||||||
[UB_LPC_ORDER * UB16_LPC_VEC_PER_FRAME] =
|
|
||||||
{
|
|
||||||
6, 7, 8, 14, 7, 8, 10, 17, 10,
|
|
||||||
10, 13, 27, 12, 13, 16, 35
|
|
||||||
};
|
|
||||||
|
|
||||||
/*
|
|
||||||
* LAR quantization step-size.
|
|
||||||
*/
|
|
||||||
const double WebRtcIsac_kLpcShapeQStepSizeUb16 = 0.150000;
|
|
||||||
|
|
@ -1,79 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* lpc_shape_swb16_tables.h
|
|
||||||
*
|
|
||||||
* This file declares tables used for entropy coding of LPC shape of
|
|
||||||
* upper-band signal if the bandwidth is 16 kHz.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_LPC_SHAPE_SWB16_TABLES_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_LPC_SHAPE_SWB16_TABLES_H_
|
|
||||||
|
|
||||||
#include "settings.h"
|
|
||||||
#include "typedefs.h"
|
|
||||||
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kMeanLarUb16[UB_LPC_ORDER];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kIintraVecDecorrMatUb16[UB_LPC_ORDER][UB_LPC_ORDER];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kInterVecDecorrMatUb16
|
|
||||||
[UB16_LPC_VEC_PER_FRAME][UB16_LPC_VEC_PER_FRAME];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub16[14];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec1Ub16[16];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec2Ub16[18];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec3Ub16[30];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec4Ub16[16];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec5Ub16[17];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec6Ub16[21];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec7Ub16[36];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec8Ub16[21];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub160[21];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub161[28];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub162[55];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub163[26];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub164[28];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub165[34];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeCdfVec01Ub166[71];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16* WebRtcIsac_kLpcShapeCdfMatUb16
|
|
||||||
[UB_LPC_ORDER * UB16_LPC_VEC_PER_FRAME];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kLpcShapeLeftRecPointUb16
|
|
||||||
[UB_LPC_ORDER * UB16_LPC_VEC_PER_FRAME];
|
|
||||||
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kLpcShapeNumRecPointUb16
|
|
||||||
[UB_LPC_ORDER * UB16_LPC_VEC_PER_FRAME];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kLpcShapeEntropySearchUb16
|
|
||||||
[UB_LPC_ORDER * UB16_LPC_VEC_PER_FRAME];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kLpcShapeQStepSizeUb16;
|
|
||||||
|
|
||||||
#endif // WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_LPC_SHAPE_SWB16_TABLES_H_
|
|
||||||
File diff suppressed because it is too large
Load Diff
|
|
@ -1,114 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* lpc_tables.h
|
|
||||||
*
|
|
||||||
* header file for coding tables for the LPC coefficients
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_LPC_TABLES_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_LPC_TABLES_H_
|
|
||||||
|
|
||||||
#include "structs.h"
|
|
||||||
|
|
||||||
#include "settings.h"
|
|
||||||
|
|
||||||
#define KLT_STEPSIZE 1.00000000
|
|
||||||
#define KLT_NUM_AVG_GAIN 0
|
|
||||||
#define KLT_NUM_AVG_SHAPE 0
|
|
||||||
#define KLT_NUM_MODELS 3
|
|
||||||
#define LPC_GAIN_SCALE 4.000f
|
|
||||||
#define LPC_LOBAND_SCALE 2.100f
|
|
||||||
#define LPC_LOBAND_ORDER ORDERLO
|
|
||||||
#define LPC_HIBAND_SCALE 0.450f
|
|
||||||
#define LPC_HIBAND_ORDER ORDERHI
|
|
||||||
#define LPC_GAIN_ORDER 2
|
|
||||||
|
|
||||||
#define LPC_SHAPE_ORDER (LPC_LOBAND_ORDER + LPC_HIBAND_ORDER)
|
|
||||||
|
|
||||||
#define KLT_ORDER_GAIN (LPC_GAIN_ORDER * SUBFRAMES)
|
|
||||||
#define KLT_ORDER_SHAPE (LPC_SHAPE_ORDER * SUBFRAMES)
|
|
||||||
/* indices of KLT coefficients used */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQKltSelIndGain[12];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQKltSelIndShape[108];
|
|
||||||
|
|
||||||
/* cdf array for model indicator */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQKltModelCdf[KLT_NUM_MODELS+1];
|
|
||||||
|
|
||||||
/* pointer to cdf array for model indicator */
|
|
||||||
extern const WebRtc_UWord16 *WebRtcIsac_kQKltModelCdfPtr[1];
|
|
||||||
|
|
||||||
/* initial cdf index for decoder of model indicator */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQKltModelInitIndex[1];
|
|
||||||
|
|
||||||
/* offset to go from rounded value to quantization index */
|
|
||||||
extern const short WebRtcIsac_kQKltQuantMinGain[12];
|
|
||||||
|
|
||||||
extern const short WebRtcIsac_kQKltQuantMinShape[108];
|
|
||||||
|
|
||||||
/* maximum quantization index */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQKltMaxIndGain[12];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQKltMaxIndShape[108];
|
|
||||||
|
|
||||||
/* index offset */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQKltOffsetGain[KLT_NUM_MODELS][12];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQKltOffsetShape[KLT_NUM_MODELS][108];
|
|
||||||
|
|
||||||
/* initial cdf index for KLT coefficients */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQKltInitIndexGain[KLT_NUM_MODELS][12];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQKltInitIndexShape[KLT_NUM_MODELS][108];
|
|
||||||
|
|
||||||
/* offsets for quantizer representation levels */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQKltOfLevelsGain[3];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQKltOfLevelsShape[3];
|
|
||||||
|
|
||||||
/* quantizer representation levels */
|
|
||||||
extern const double WebRtcIsac_kQKltLevelsGain[1176];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kQKltLevelsShape[1735];
|
|
||||||
|
|
||||||
/* cdf tables for quantizer indices */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQKltCdfGain[1212];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQKltCdfShape[2059];
|
|
||||||
|
|
||||||
/* pointers to cdf tables for quantizer indices */
|
|
||||||
extern const WebRtc_UWord16 *WebRtcIsac_kQKltCdfPtrGain[KLT_NUM_MODELS][12];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 *WebRtcIsac_kQKltCdfPtrShape[KLT_NUM_MODELS][108];
|
|
||||||
|
|
||||||
/* code length for all coefficients using different models */
|
|
||||||
extern const double WebRtcIsac_kQKltCodeLenGain[392];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kQKltCodeLenShape[578];
|
|
||||||
|
|
||||||
/* left KLT transforms */
|
|
||||||
extern const double WebRtcIsac_kKltT1Gain[KLT_NUM_MODELS][4];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kKltT1Shape[KLT_NUM_MODELS][324];
|
|
||||||
|
|
||||||
/* right KLT transforms */
|
|
||||||
extern const double WebRtcIsac_kKltT2Gain[KLT_NUM_MODELS][36];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kKltT2Shape[KLT_NUM_MODELS][36];
|
|
||||||
|
|
||||||
/* means of log gains and LAR coefficients */
|
|
||||||
extern const double WebRtcIsac_kLpcMeansGain[KLT_NUM_MODELS][12];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kLpcMeansShape[KLT_NUM_MODELS][108];
|
|
||||||
|
|
||||||
#endif /* WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_LPC_TABLES_H_ */
|
|
||||||
|
|
@ -1,57 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_LpcToReflCoef().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
#define SPL_LPC_TO_REFL_COEF_MAX_AR_MODEL_ORDER 50
|
|
||||||
|
|
||||||
void WebRtcSpl_LpcToReflCoef(WebRtc_Word16* a16, int use_order, WebRtc_Word16* k16)
|
|
||||||
{
|
|
||||||
int m, k;
|
|
||||||
WebRtc_Word32 tmp32[SPL_LPC_TO_REFL_COEF_MAX_AR_MODEL_ORDER];
|
|
||||||
WebRtc_Word32 tmp_inv_denom32;
|
|
||||||
WebRtc_Word16 tmp_inv_denom16;
|
|
||||||
|
|
||||||
k16[use_order - 1] = WEBRTC_SPL_LSHIFT_W16(a16[use_order], 3); //Q12<<3 => Q15
|
|
||||||
for (m = use_order - 1; m > 0; m--)
|
|
||||||
{
|
|
||||||
// (1 - k^2) in Q30
|
|
||||||
tmp_inv_denom32 = ((WebRtc_Word32)1073741823) - WEBRTC_SPL_MUL_16_16(k16[m], k16[m]);
|
|
||||||
// (1 - k^2) in Q15
|
|
||||||
tmp_inv_denom16 = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(tmp_inv_denom32, 15);
|
|
||||||
|
|
||||||
for (k = 1; k <= m; k++)
|
|
||||||
{
|
|
||||||
// tmp[k] = (a[k] - RC[m] * a[m-k+1]) / (1.0 - RC[m]*RC[m]);
|
|
||||||
|
|
||||||
// [Q12<<16 - (Q15*Q12)<<1] = [Q28 - Q28] = Q28
|
|
||||||
tmp32[k] = WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)a16[k], 16)
|
|
||||||
- WEBRTC_SPL_LSHIFT_W32(WEBRTC_SPL_MUL_16_16(k16[m], a16[m-k+1]), 1);
|
|
||||||
|
|
||||||
tmp32[k] = WebRtcSpl_DivW32W16(tmp32[k], tmp_inv_denom16); //Q28/Q15 = Q13
|
|
||||||
}
|
|
||||||
|
|
||||||
for (k = 1; k < m; k++)
|
|
||||||
{
|
|
||||||
a16[k] = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(tmp32[k], 1); //Q13>>1 => Q12
|
|
||||||
}
|
|
||||||
|
|
||||||
tmp32[m] = WEBRTC_SPL_SAT(8191, tmp32[m], -8191);
|
|
||||||
k16[m - 1] = (WebRtc_Word16)WEBRTC_SPL_LSHIFT_W32(tmp32[m], 2); //Q13<<2 => Q15
|
|
||||||
}
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
@ -1,265 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the implementation of functions
|
|
||||||
* WebRtcSpl_MaxAbsValueW16()
|
|
||||||
* WebRtcSpl_MaxAbsIndexW16()
|
|
||||||
* WebRtcSpl_MaxAbsValueW32()
|
|
||||||
* WebRtcSpl_MaxValueW16()
|
|
||||||
* WebRtcSpl_MaxIndexW16()
|
|
||||||
* WebRtcSpl_MaxValueW32()
|
|
||||||
* WebRtcSpl_MaxIndexW32()
|
|
||||||
* WebRtcSpl_MinValueW16()
|
|
||||||
* WebRtcSpl_MinIndexW16()
|
|
||||||
* WebRtcSpl_MinValueW32()
|
|
||||||
* WebRtcSpl_MinIndexW32()
|
|
||||||
*
|
|
||||||
* The description header can be found in signal_processing_library.h.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
#if !(defined(WEBRTC_ANDROID) && defined(WEBRTC_ARCH_ARM_NEON))
|
|
||||||
|
|
||||||
// Maximum absolute value of word16 vector.
|
|
||||||
WebRtc_Word16 WebRtcSpl_MaxAbsValueW16(const WebRtc_Word16 *vector, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tempMax = 0;
|
|
||||||
WebRtc_Word32 absVal;
|
|
||||||
WebRtc_Word16 totMax;
|
|
||||||
int i;
|
|
||||||
G_CONST WebRtc_Word16 *tmpvector = vector;
|
|
||||||
|
|
||||||
for (i = 0; i < length; i++)
|
|
||||||
{
|
|
||||||
absVal = WEBRTC_SPL_ABS_W32((*tmpvector));
|
|
||||||
if (absVal > tempMax)
|
|
||||||
{
|
|
||||||
tempMax = absVal;
|
|
||||||
}
|
|
||||||
tmpvector++;
|
|
||||||
}
|
|
||||||
totMax = (WebRtc_Word16)WEBRTC_SPL_MIN(tempMax, WEBRTC_SPL_WORD16_MAX);
|
|
||||||
return totMax;
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Index of maximum absolute value in a word16 vector.
|
|
||||||
WebRtc_Word16 WebRtcSpl_MaxAbsIndexW16(G_CONST WebRtc_Word16* vector, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 tempMax;
|
|
||||||
WebRtc_Word16 absTemp;
|
|
||||||
WebRtc_Word16 tempMaxIndex = 0;
|
|
||||||
WebRtc_Word16 i = 0;
|
|
||||||
G_CONST WebRtc_Word16 *tmpvector = vector;
|
|
||||||
|
|
||||||
tempMax = WEBRTC_SPL_ABS_W16(*tmpvector);
|
|
||||||
tmpvector++;
|
|
||||||
for (i = 1; i < length; i++)
|
|
||||||
{
|
|
||||||
absTemp = WEBRTC_SPL_ABS_W16(*tmpvector);
|
|
||||||
tmpvector++;
|
|
||||||
if (absTemp > tempMax)
|
|
||||||
{
|
|
||||||
tempMax = absTemp;
|
|
||||||
tempMaxIndex = i;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return tempMaxIndex;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Maximum absolute value of word32 vector.
|
|
||||||
WebRtc_Word32 WebRtcSpl_MaxAbsValueW32(G_CONST WebRtc_Word32 *vector, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtc_UWord32 tempMax = 0;
|
|
||||||
WebRtc_UWord32 absVal;
|
|
||||||
WebRtc_Word32 retval;
|
|
||||||
int i;
|
|
||||||
G_CONST WebRtc_Word32 *tmpvector = vector;
|
|
||||||
|
|
||||||
for (i = 0; i < length; i++)
|
|
||||||
{
|
|
||||||
absVal = WEBRTC_SPL_ABS_W32((*tmpvector));
|
|
||||||
if (absVal > tempMax)
|
|
||||||
{
|
|
||||||
tempMax = absVal;
|
|
||||||
}
|
|
||||||
tmpvector++;
|
|
||||||
}
|
|
||||||
retval = (WebRtc_Word32)(WEBRTC_SPL_MIN(tempMax, WEBRTC_SPL_WORD32_MAX));
|
|
||||||
return retval;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Maximum value of word16 vector.
|
|
||||||
#ifndef XSCALE_OPT
|
|
||||||
WebRtc_Word16 WebRtcSpl_MaxValueW16(G_CONST WebRtc_Word16* vector, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 tempMax;
|
|
||||||
WebRtc_Word16 i;
|
|
||||||
G_CONST WebRtc_Word16 *tmpvector = vector;
|
|
||||||
|
|
||||||
tempMax = *tmpvector++;
|
|
||||||
for (i = 1; i < length; i++)
|
|
||||||
{
|
|
||||||
if (*tmpvector++ > tempMax)
|
|
||||||
tempMax = vector[i];
|
|
||||||
}
|
|
||||||
return tempMax;
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
#pragma message(">> WebRtcSpl_MaxValueW16 is excluded from this build")
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Index of maximum value in a word16 vector.
|
|
||||||
WebRtc_Word16 WebRtcSpl_MaxIndexW16(G_CONST WebRtc_Word16 *vector, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 tempMax;
|
|
||||||
WebRtc_Word16 tempMaxIndex = 0;
|
|
||||||
WebRtc_Word16 i = 0;
|
|
||||||
G_CONST WebRtc_Word16 *tmpvector = vector;
|
|
||||||
|
|
||||||
tempMax = *tmpvector++;
|
|
||||||
for (i = 1; i < length; i++)
|
|
||||||
{
|
|
||||||
if (*tmpvector++ > tempMax)
|
|
||||||
{
|
|
||||||
tempMax = vector[i];
|
|
||||||
tempMaxIndex = i;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return tempMaxIndex;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Maximum value of word32 vector.
|
|
||||||
#ifndef XSCALE_OPT
|
|
||||||
WebRtc_Word32 WebRtcSpl_MaxValueW32(G_CONST WebRtc_Word32* vector, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tempMax;
|
|
||||||
WebRtc_Word16 i;
|
|
||||||
G_CONST WebRtc_Word32 *tmpvector = vector;
|
|
||||||
|
|
||||||
tempMax = *tmpvector++;
|
|
||||||
for (i = 1; i < length; i++)
|
|
||||||
{
|
|
||||||
if (*tmpvector++ > tempMax)
|
|
||||||
tempMax = vector[i];
|
|
||||||
}
|
|
||||||
return tempMax;
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
#pragma message(">> WebRtcSpl_MaxValueW32 is excluded from this build")
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Index of maximum value in a word32 vector.
|
|
||||||
WebRtc_Word16 WebRtcSpl_MaxIndexW32(G_CONST WebRtc_Word32* vector, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tempMax;
|
|
||||||
WebRtc_Word16 tempMaxIndex = 0;
|
|
||||||
WebRtc_Word16 i = 0;
|
|
||||||
G_CONST WebRtc_Word32 *tmpvector = vector;
|
|
||||||
|
|
||||||
tempMax = *tmpvector++;
|
|
||||||
for (i = 1; i < length; i++)
|
|
||||||
{
|
|
||||||
if (*tmpvector++ > tempMax)
|
|
||||||
{
|
|
||||||
tempMax = vector[i];
|
|
||||||
tempMaxIndex = i;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return tempMaxIndex;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Minimum value of word16 vector.
|
|
||||||
WebRtc_Word16 WebRtcSpl_MinValueW16(G_CONST WebRtc_Word16 *vector, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 tempMin;
|
|
||||||
WebRtc_Word16 i;
|
|
||||||
G_CONST WebRtc_Word16 *tmpvector = vector;
|
|
||||||
|
|
||||||
// Find the minimum value
|
|
||||||
tempMin = *tmpvector++;
|
|
||||||
for (i = 1; i < length; i++)
|
|
||||||
{
|
|
||||||
if (*tmpvector++ < tempMin)
|
|
||||||
tempMin = (vector[i]);
|
|
||||||
}
|
|
||||||
return tempMin;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Index of minimum value in a word16 vector.
|
|
||||||
#ifndef XSCALE_OPT
|
|
||||||
WebRtc_Word16 WebRtcSpl_MinIndexW16(G_CONST WebRtc_Word16* vector, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 tempMin;
|
|
||||||
WebRtc_Word16 tempMinIndex = 0;
|
|
||||||
WebRtc_Word16 i = 0;
|
|
||||||
G_CONST WebRtc_Word16* tmpvector = vector;
|
|
||||||
|
|
||||||
// Find index of smallest value
|
|
||||||
tempMin = *tmpvector++;
|
|
||||||
for (i = 1; i < length; i++)
|
|
||||||
{
|
|
||||||
if (*tmpvector++ < tempMin)
|
|
||||||
{
|
|
||||||
tempMin = vector[i];
|
|
||||||
tempMinIndex = i;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return tempMinIndex;
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
#pragma message(">> WebRtcSpl_MinIndexW16 is excluded from this build")
|
|
||||||
#endif
|
|
||||||
|
|
||||||
// Minimum value of word32 vector.
|
|
||||||
WebRtc_Word32 WebRtcSpl_MinValueW32(G_CONST WebRtc_Word32 *vector, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tempMin;
|
|
||||||
WebRtc_Word16 i;
|
|
||||||
G_CONST WebRtc_Word32 *tmpvector = vector;
|
|
||||||
|
|
||||||
// Find the minimum value
|
|
||||||
tempMin = *tmpvector++;
|
|
||||||
for (i = 1; i < length; i++)
|
|
||||||
{
|
|
||||||
if (*tmpvector++ < tempMin)
|
|
||||||
tempMin = (vector[i]);
|
|
||||||
}
|
|
||||||
return tempMin;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Index of minimum value in a word32 vector.
|
|
||||||
#ifndef XSCALE_OPT
|
|
||||||
WebRtc_Word16 WebRtcSpl_MinIndexW32(G_CONST WebRtc_Word32* vector, WebRtc_Word16 length)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tempMin;
|
|
||||||
WebRtc_Word16 tempMinIndex = 0;
|
|
||||||
WebRtc_Word16 i = 0;
|
|
||||||
G_CONST WebRtc_Word32 *tmpvector = vector;
|
|
||||||
|
|
||||||
// Find index of smallest value
|
|
||||||
tempMin = *tmpvector++;
|
|
||||||
for (i = 1; i < length; i++)
|
|
||||||
{
|
|
||||||
if (*tmpvector++ < tempMin)
|
|
||||||
{
|
|
||||||
tempMin = vector[i];
|
|
||||||
tempMinIndex = i;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return tempMinIndex;
|
|
||||||
}
|
|
||||||
#else
|
|
||||||
#pragma message(">> WebRtcSpl_MinIndexW32 is excluded from this build")
|
|
||||||
#endif
|
|
||||||
|
|
@ -1,47 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#if (defined(WEBRTC_ANDROID) && defined(WEBRTC_ARCH_ARM_NEON))
|
|
||||||
|
|
||||||
#include <arm_neon.h>
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
// Maximum absolute value of word16 vector.
|
|
||||||
WebRtc_Word16 WebRtcSpl_MaxAbsValueW16(const WebRtc_Word16* vector,
|
|
||||||
WebRtc_Word16 length) {
|
|
||||||
WebRtc_Word32 temp_max = 0;
|
|
||||||
WebRtc_Word32 abs_val;
|
|
||||||
WebRtc_Word16 tot_max;
|
|
||||||
int i;
|
|
||||||
|
|
||||||
__asm__("vmov.i16 d25, #0" : : : "d25");
|
|
||||||
|
|
||||||
for (i = 0; i < length - 7; i += 8) {
|
|
||||||
__asm__("vld1.16 {d26, d27}, [%0]" : : "r"(&vector[i]) : "q13");
|
|
||||||
__asm__("vabs.s16 q13, q13" : : : "q13");
|
|
||||||
__asm__("vpmax.s16 d26, d27" : : : "q13");
|
|
||||||
__asm__("vpmax.s16 d25, d26" : : : "d25", "d26");
|
|
||||||
}
|
|
||||||
__asm__("vpmax.s16 d25, d25" : : : "d25");
|
|
||||||
__asm__("vpmax.s16 d25, d25" : : : "d25");
|
|
||||||
__asm__("vmov.s16 %0, d25[0]" : "=r"(temp_max): : "d25");
|
|
||||||
|
|
||||||
for (; i < length; i++) {
|
|
||||||
abs_val = WEBRTC_SPL_ABS_W32((vector[i]));
|
|
||||||
if (abs_val > temp_max) {
|
|
||||||
temp_max = abs_val;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
tot_max = (WebRtc_Word16)WEBRTC_SPL_MIN(temp_max, WEBRTC_SPL_WORD16_MAX);
|
|
||||||
return tot_max;
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif
|
|
||||||
|
|
@ -1,254 +0,0 @@
|
||||||
<?xml version="1.0" encoding="utf-8"?>
|
|
||||||
<Project DefaultTargets="Build" ToolsVersion="15.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
|
||||||
<ItemGroup Label="ProjectConfigurations">
|
|
||||||
<ProjectConfiguration Include="Debug|Win32">
|
|
||||||
<Configuration>Debug</Configuration>
|
|
||||||
<Platform>Win32</Platform>
|
|
||||||
</ProjectConfiguration>
|
|
||||||
<ProjectConfiguration Include="Debug|x64">
|
|
||||||
<Configuration>Debug</Configuration>
|
|
||||||
<Platform>x64</Platform>
|
|
||||||
</ProjectConfiguration>
|
|
||||||
<ProjectConfiguration Include="Release|Win32">
|
|
||||||
<Configuration>Release</Configuration>
|
|
||||||
<Platform>Win32</Platform>
|
|
||||||
</ProjectConfiguration>
|
|
||||||
<ProjectConfiguration Include="Release|x64">
|
|
||||||
<Configuration>Release</Configuration>
|
|
||||||
<Platform>x64</Platform>
|
|
||||||
</ProjectConfiguration>
|
|
||||||
</ItemGroup>
|
|
||||||
<PropertyGroup Label="Globals">
|
|
||||||
<ProjectName>mod_iSAC</ProjectName>
|
|
||||||
<ProjectGuid>{7F1610F1-DD5A-4CF7-8610-30AB12C60ADD}</ProjectGuid>
|
|
||||||
<RootNamespace>mod_iSAC</RootNamespace>
|
|
||||||
<Keyword>Win32Proj</Keyword>
|
|
||||||
</PropertyGroup>
|
|
||||||
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
|
|
||||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
|
|
||||||
<ConfigurationType>DynamicLibrary</ConfigurationType>
|
|
||||||
<CharacterSet>MultiByte</CharacterSet>
|
|
||||||
<PlatformToolset>$(DefaultPlatformToolset)</PlatformToolset>
|
|
||||||
</PropertyGroup>
|
|
||||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
|
|
||||||
<ConfigurationType>DynamicLibrary</ConfigurationType>
|
|
||||||
<CharacterSet>MultiByte</CharacterSet>
|
|
||||||
<PlatformToolset>$(DefaultPlatformToolset)</PlatformToolset>
|
|
||||||
</PropertyGroup>
|
|
||||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
|
|
||||||
<ConfigurationType>DynamicLibrary</ConfigurationType>
|
|
||||||
<CharacterSet>MultiByte</CharacterSet>
|
|
||||||
<PlatformToolset>$(DefaultPlatformToolset)</PlatformToolset>
|
|
||||||
</PropertyGroup>
|
|
||||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
|
|
||||||
<ConfigurationType>DynamicLibrary</ConfigurationType>
|
|
||||||
<CharacterSet>MultiByte</CharacterSet>
|
|
||||||
<PlatformToolset>$(DefaultPlatformToolset)</PlatformToolset>
|
|
||||||
</PropertyGroup>
|
|
||||||
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
|
|
||||||
<ImportGroup Label="ExtensionSettings">
|
|
||||||
</ImportGroup>
|
|
||||||
<ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="PropertySheets">
|
|
||||||
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
|
||||||
<Import Project="..\..\..\..\w32\module_release.props" />
|
|
||||||
</ImportGroup>
|
|
||||||
<ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="PropertySheets">
|
|
||||||
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
|
||||||
<Import Project="..\..\..\..\w32\module_debug.props" />
|
|
||||||
</ImportGroup>
|
|
||||||
<ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="PropertySheets">
|
|
||||||
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
|
||||||
<Import Project="..\..\..\..\w32\module_release.props" />
|
|
||||||
</ImportGroup>
|
|
||||||
<ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="PropertySheets">
|
|
||||||
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
|
||||||
<Import Project="..\..\..\..\w32\module_debug.props" />
|
|
||||||
</ImportGroup>
|
|
||||||
<PropertyGroup Label="UserMacros" />
|
|
||||||
<PropertyGroup>
|
|
||||||
<_ProjectFileVersion>10.0.30319.1</_ProjectFileVersion>
|
|
||||||
</PropertyGroup>
|
|
||||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
|
||||||
<CodeAnalysisRuleSet>NativeMinimumRules.ruleset</CodeAnalysisRuleSet>
|
|
||||||
<RunCodeAnalysis>false</RunCodeAnalysis>
|
|
||||||
</PropertyGroup>
|
|
||||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
|
||||||
<CodeAnalysisRuleSet>NativeMinimumRules.ruleset</CodeAnalysisRuleSet>
|
|
||||||
<RunCodeAnalysis>false</RunCodeAnalysis>
|
|
||||||
</PropertyGroup>
|
|
||||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
|
||||||
<CodeAnalysisRuleSet>NativeMinimumRules.ruleset</CodeAnalysisRuleSet>
|
|
||||||
<RunCodeAnalysis>false</RunCodeAnalysis>
|
|
||||||
</PropertyGroup>
|
|
||||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
|
||||||
<CodeAnalysisRuleSet>NativeMinimumRules.ruleset</CodeAnalysisRuleSet>
|
|
||||||
<RunCodeAnalysis>false</RunCodeAnalysis>
|
|
||||||
</PropertyGroup>
|
|
||||||
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
|
||||||
<ClCompile>
|
|
||||||
<PrecompiledHeader>
|
|
||||||
</PrecompiledHeader>
|
|
||||||
<PreprocessorDefinitions>_CRT_SECURE_NO_WARNINGS;_DEBUG;DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
|
||||||
<DisableSpecificWarnings>4206;4100;4244;6340;6246;6011;6387;%(DisableSpecificWarnings)</DisableSpecificWarnings>
|
|
||||||
<EnablePREfast>false</EnablePREfast>
|
|
||||||
</ClCompile>
|
|
||||||
<Link>
|
|
||||||
<RandomizedBaseAddress>false</RandomizedBaseAddress>
|
|
||||||
<DataExecutionPrevention>
|
|
||||||
</DataExecutionPrevention>
|
|
||||||
</Link>
|
|
||||||
</ItemDefinitionGroup>
|
|
||||||
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
|
||||||
<Midl>
|
|
||||||
<TargetEnvironment>X64</TargetEnvironment>
|
|
||||||
</Midl>
|
|
||||||
<ClCompile>
|
|
||||||
<PrecompiledHeader>
|
|
||||||
</PrecompiledHeader>
|
|
||||||
<PreprocessorDefinitions>_CRT_SECURE_NO_WARNINGS;_DEBUG;DEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
|
||||||
<DisableSpecificWarnings>4206;4100;4244;6340;6246;6011;6387;%(DisableSpecificWarnings)</DisableSpecificWarnings>
|
|
||||||
<EnablePREfast>false</EnablePREfast>
|
|
||||||
</ClCompile>
|
|
||||||
<Link>
|
|
||||||
<RandomizedBaseAddress>false</RandomizedBaseAddress>
|
|
||||||
<DataExecutionPrevention>
|
|
||||||
</DataExecutionPrevention>
|
|
||||||
<TargetMachine>MachineX64</TargetMachine>
|
|
||||||
</Link>
|
|
||||||
</ItemDefinitionGroup>
|
|
||||||
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
|
||||||
<ClCompile>
|
|
||||||
<PrecompiledHeader>
|
|
||||||
</PrecompiledHeader>
|
|
||||||
<PreprocessorDefinitions>_CRT_SECURE_NO_WARNINGS;NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
|
||||||
<DisableSpecificWarnings>4206;4100;4244;6340;6246;6011;6387;%(DisableSpecificWarnings)</DisableSpecificWarnings>
|
|
||||||
<EnablePREfast>false</EnablePREfast>
|
|
||||||
</ClCompile>
|
|
||||||
<Link>
|
|
||||||
<RandomizedBaseAddress>false</RandomizedBaseAddress>
|
|
||||||
<DataExecutionPrevention>
|
|
||||||
</DataExecutionPrevention>
|
|
||||||
</Link>
|
|
||||||
</ItemDefinitionGroup>
|
|
||||||
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
|
||||||
<Midl>
|
|
||||||
<TargetEnvironment>X64</TargetEnvironment>
|
|
||||||
</Midl>
|
|
||||||
<ClCompile>
|
|
||||||
<PrecompiledHeader>
|
|
||||||
</PrecompiledHeader>
|
|
||||||
<PreprocessorDefinitions>_CRT_SECURE_NO_WARNINGS;NDEBUG;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
|
||||||
<DisableSpecificWarnings>4206;4100;4244;6340;6246;6011;6387;%(DisableSpecificWarnings)</DisableSpecificWarnings>
|
|
||||||
<EnablePREfast>false</EnablePREfast>
|
|
||||||
</ClCompile>
|
|
||||||
<Link>
|
|
||||||
<RandomizedBaseAddress>false</RandomizedBaseAddress>
|
|
||||||
<DataExecutionPrevention>
|
|
||||||
</DataExecutionPrevention>
|
|
||||||
<TargetMachine>MachineX64</TargetMachine>
|
|
||||||
</Link>
|
|
||||||
</ItemDefinitionGroup>
|
|
||||||
<ItemGroup>
|
|
||||||
<ClCompile Include="arith_routines.c" />
|
|
||||||
<ClCompile Include="arith_routines_hist.c" />
|
|
||||||
<ClCompile Include="arith_routines_logist.c" />
|
|
||||||
<ClCompile Include="auto_correlation.c" />
|
|
||||||
<ClCompile Include="auto_corr_to_refl_coef.c" />
|
|
||||||
<ClCompile Include="bandwidth_estimator.c" />
|
|
||||||
<ClCompile Include="complex_bit_reverse.c" />
|
|
||||||
<ClCompile Include="complex_fft.c" />
|
|
||||||
<ClCompile Include="copy_set_operations.c" />
|
|
||||||
<ClCompile Include="crc.c" />
|
|
||||||
<ClCompile Include="cross_correlation.c" />
|
|
||||||
<ClCompile Include="decode.c" />
|
|
||||||
<ClCompile Include="decode_bwe.c" />
|
|
||||||
<ClCompile Include="division_operations.c" />
|
|
||||||
<ClCompile Include="dot_product_with_scale.c" />
|
|
||||||
<ClCompile Include="downsample_fast.c" />
|
|
||||||
<ClCompile Include="encode.c" />
|
|
||||||
<ClCompile Include="encode_lpc_swb.c" />
|
|
||||||
<ClCompile Include="energy.c" />
|
|
||||||
<ClCompile Include="entropy_coding.c" />
|
|
||||||
<ClCompile Include="fft.c" />
|
|
||||||
<ClCompile Include="filterbanks.c" />
|
|
||||||
<ClCompile Include="filterbank_tables.c" />
|
|
||||||
<ClCompile Include="filter_ar.c" />
|
|
||||||
<ClCompile Include="filter_ar_fast_q12.c" />
|
|
||||||
<ClCompile Include="filter_functions.c" />
|
|
||||||
<ClCompile Include="filter_ma_fast_q12.c" />
|
|
||||||
<ClCompile Include="get_hanning_window.c" />
|
|
||||||
<ClCompile Include="get_scaling_square.c" />
|
|
||||||
<ClCompile Include="ilbc_specific_functions.c" />
|
|
||||||
<ClCompile Include="intialize.c" />
|
|
||||||
<ClCompile Include="isac.c" />
|
|
||||||
<ClCompile Include="lattice.c" />
|
|
||||||
<ClCompile Include="levinson_durbin.c" />
|
|
||||||
<ClCompile Include="lpc_analysis.c" />
|
|
||||||
<ClCompile Include="lpc_gain_swb_tables.c" />
|
|
||||||
<ClCompile Include="lpc_shape_swb12_tables.c" />
|
|
||||||
<ClCompile Include="lpc_shape_swb16_tables.c" />
|
|
||||||
<ClCompile Include="lpc_tables.c" />
|
|
||||||
<ClCompile Include="lpc_to_refl_coef.c" />
|
|
||||||
<ClCompile Include="min_max_operations.c" />
|
|
||||||
<ClCompile Include="min_max_operations_neon.c" />
|
|
||||||
<ClCompile Include="mod_iSAC.c" />
|
|
||||||
<ClCompile Include="pitch_estimator.c" />
|
|
||||||
<ClCompile Include="pitch_filter.c" />
|
|
||||||
<ClCompile Include="pitch_gain_tables.c" />
|
|
||||||
<ClCompile Include="pitch_lag_tables.c" />
|
|
||||||
<ClCompile Include="randomization_functions.c" />
|
|
||||||
<ClCompile Include="refl_coef_to_lpc.c" />
|
|
||||||
<ClCompile Include="resample.c" />
|
|
||||||
<ClCompile Include="resample_48khz.c" />
|
|
||||||
<ClCompile Include="resample_by_2.c" />
|
|
||||||
<ClCompile Include="resample_by_2_internal.c" />
|
|
||||||
<ClCompile Include="resample_fractional.c" />
|
|
||||||
<ClCompile Include="spectrum_ar_model_tables.c" />
|
|
||||||
<ClCompile Include="splitting_filter.c" />
|
|
||||||
<ClCompile Include="spl_sqrt.c" />
|
|
||||||
<ClCompile Include="spl_sqrt_floor.c" />
|
|
||||||
<ClCompile Include="spl_version.c" />
|
|
||||||
<ClCompile Include="sqrt_of_one_minus_x_squared.c" />
|
|
||||||
<ClCompile Include="transform.c" />
|
|
||||||
<ClCompile Include="vector_scaling_operations.c" />
|
|
||||||
<ClCompile Include="webrtc_fft_t_1024_8.c" />
|
|
||||||
<ClCompile Include="webrtc_fft_t_rad.c" />
|
|
||||||
</ItemGroup>
|
|
||||||
<ItemGroup>
|
|
||||||
<ProjectReference Include="..\..\..\..\w32\Library\FreeSwitchCore.2017.vcxproj">
|
|
||||||
<Project>{202d7a4e-760d-4d0e-afa1-d7459ced30ff}</Project>
|
|
||||||
<ReferenceOutputAssembly>false</ReferenceOutputAssembly>
|
|
||||||
</ProjectReference>
|
|
||||||
</ItemGroup>
|
|
||||||
<ItemGroup>
|
|
||||||
<ClInclude Include="arith_routines.h" />
|
|
||||||
<ClInclude Include="bandwidth_estimator.h" />
|
|
||||||
<ClInclude Include="codec.h" />
|
|
||||||
<ClInclude Include="crc.h" />
|
|
||||||
<ClInclude Include="encode_lpc_swb.h" />
|
|
||||||
<ClInclude Include="entropy_coding.h" />
|
|
||||||
<ClInclude Include="fft.h" />
|
|
||||||
<ClInclude Include="filterbank_tables.h" />
|
|
||||||
<ClInclude Include="isac.h" />
|
|
||||||
<ClInclude Include="lpc_analysis.h" />
|
|
||||||
<ClInclude Include="lpc_gain_swb_tables.h" />
|
|
||||||
<ClInclude Include="lpc_shape_swb12_tables.h" />
|
|
||||||
<ClInclude Include="lpc_shape_swb16_tables.h" />
|
|
||||||
<ClInclude Include="lpc_tables.h" />
|
|
||||||
<ClInclude Include="os_specific_inline.h" />
|
|
||||||
<ClInclude Include="pitch_estimator.h" />
|
|
||||||
<ClInclude Include="pitch_gain_tables.h" />
|
|
||||||
<ClInclude Include="pitch_lag_tables.h" />
|
|
||||||
<ClInclude Include="resample_by_2_internal.h" />
|
|
||||||
<ClInclude Include="settings.h" />
|
|
||||||
<ClInclude Include="signal_processing_library.h" />
|
|
||||||
<ClInclude Include="spectrum_ar_model_tables.h" />
|
|
||||||
<ClInclude Include="spl_inl.h" />
|
|
||||||
<ClInclude Include="spl_inl_armv7.h" />
|
|
||||||
<ClInclude Include="structs.h" />
|
|
||||||
<ClInclude Include="typedefs.h" />
|
|
||||||
</ItemGroup>
|
|
||||||
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
|
|
||||||
<ImportGroup Label="ExtensionTargets">
|
|
||||||
</ImportGroup>
|
|
||||||
</Project>
|
|
||||||
|
|
@ -1,283 +0,0 @@
|
||||||
/*
|
|
||||||
* FreeSWITCH Modular Media Switching Software Library / Soft-Switch Application
|
|
||||||
* Copyright (C) 2005-2014, Anthony Minessale II <anthm@freeswitch.org>
|
|
||||||
*
|
|
||||||
* Version: MPL 1.1
|
|
||||||
*
|
|
||||||
* The contents of this file are subject to the Mozilla Public License Version
|
|
||||||
* 1.1 (the "License"); you may not use this file except in compliance with
|
|
||||||
* the License. You may obtain a copy of the License at
|
|
||||||
* http://www.mozilla.org/MPL/
|
|
||||||
*
|
|
||||||
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
||||||
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
||||||
* for the specific language governing rights and limitations under the
|
|
||||||
* License.
|
|
||||||
*
|
|
||||||
* The Original Code is FreeSWITCH Modular Media Switching Software Library / ISAC codec module
|
|
||||||
*
|
|
||||||
* The Initial Developer of the Original Code is
|
|
||||||
* Anthony Minessale II <anthm@freeswitch.org>
|
|
||||||
* Portions created by the Initial Developer are Copyright (C)
|
|
||||||
* the Initial Developer. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Contributor(s):
|
|
||||||
* Anthony Minessale II <anthm@freeswitch.org>
|
|
||||||
*
|
|
||||||
*
|
|
||||||
* mod_isac.c -- isac Codec Module
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <switch.h>
|
|
||||||
#include "isac.h"
|
|
||||||
|
|
||||||
SWITCH_MODULE_LOAD_FUNCTION(mod_isac_codec_load);
|
|
||||||
SWITCH_MODULE_DEFINITION(mod_isac, mod_isac_codec_load, NULL, NULL);
|
|
||||||
|
|
||||||
struct isac_context {
|
|
||||||
ISACStruct *ISAC_main_inst;
|
|
||||||
};
|
|
||||||
|
|
||||||
static switch_status_t switch_isac_init(switch_codec_t *codec, switch_codec_flag_t flags, const switch_codec_settings_t *codec_settings)
|
|
||||||
{
|
|
||||||
uint32_t encoding, decoding;
|
|
||||||
WebRtc_Word16 err;
|
|
||||||
struct isac_context *context = NULL;
|
|
||||||
|
|
||||||
encoding = (flags & SWITCH_CODEC_FLAG_ENCODE);
|
|
||||||
decoding = (flags & SWITCH_CODEC_FLAG_DECODE);
|
|
||||||
|
|
||||||
if (!(encoding || decoding)) {
|
|
||||||
return SWITCH_STATUS_FALSE;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!(context = switch_core_alloc(codec->memory_pool, sizeof(*context)))) {
|
|
||||||
return SWITCH_STATUS_FALSE;
|
|
||||||
}
|
|
||||||
|
|
||||||
codec->private_info = context;
|
|
||||||
|
|
||||||
err = WebRtcIsac_Create(&context->ISAC_main_inst);
|
|
||||||
|
|
||||||
if (err < 0) return SWITCH_STATUS_FALSE;
|
|
||||||
|
|
||||||
|
|
||||||
if (encoding) {
|
|
||||||
if (WebRtcIsac_EncoderInit(context->ISAC_main_inst, 0) < 0) {
|
|
||||||
return SWITCH_STATUS_FALSE;
|
|
||||||
}
|
|
||||||
WebRtcIsac_SetEncSampRate(context->ISAC_main_inst, codec->implementation->actual_samples_per_second / 1000);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (decoding) {
|
|
||||||
if (WebRtcIsac_DecoderInit(context->ISAC_main_inst) < 0) {
|
|
||||||
return SWITCH_STATUS_FALSE;
|
|
||||||
}
|
|
||||||
WebRtcIsac_SetDecSampRate(context->ISAC_main_inst, codec->implementation->actual_samples_per_second / 1000);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (codec->implementation->actual_samples_per_second == 16000) {
|
|
||||||
if (WebRtcIsac_ControlBwe(context->ISAC_main_inst, 32000, codec->implementation->microseconds_per_packet / 1000, 1) < 0) {
|
|
||||||
return SWITCH_STATUS_FALSE;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (WebRtcIsac_SetMaxPayloadSize(context->ISAC_main_inst, 400) < 0) {
|
|
||||||
return SWITCH_STATUS_FALSE;
|
|
||||||
}
|
|
||||||
|
|
||||||
} else {
|
|
||||||
if (WebRtcIsac_Control(context->ISAC_main_inst, 32000, codec->implementation->microseconds_per_packet / 1000) < 0) {
|
|
||||||
return SWITCH_STATUS_FALSE;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (WebRtcIsac_SetMaxPayloadSize(context->ISAC_main_inst, 600) < 0) {
|
|
||||||
return SWITCH_STATUS_FALSE;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
if (WebRtcIsac_SetMaxRate(context->ISAC_main_inst, codec->implementation->bits_per_second) < 0) {
|
|
||||||
return SWITCH_STATUS_FALSE;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
return SWITCH_STATUS_SUCCESS;
|
|
||||||
}
|
|
||||||
|
|
||||||
static switch_status_t switch_isac_encode(switch_codec_t *codec, switch_codec_t *other_codec,
|
|
||||||
void *decoded_data,
|
|
||||||
uint32_t decoded_data_len,
|
|
||||||
uint32_t decoded_rate,
|
|
||||||
void *encoded_data,
|
|
||||||
uint32_t *encoded_data_len,
|
|
||||||
uint32_t *encoded_rate,
|
|
||||||
unsigned int *flag)
|
|
||||||
{
|
|
||||||
struct isac_context *context = codec->private_info;
|
|
||||||
WebRtc_Word16 len = 0, *in, *out;
|
|
||||||
int rise = (codec->implementation->actual_samples_per_second / 100);
|
|
||||||
|
|
||||||
in = decoded_data;
|
|
||||||
out = encoded_data;
|
|
||||||
|
|
||||||
while(len == 0) {
|
|
||||||
len = WebRtcIsac_Encode(context->ISAC_main_inst, in, out);
|
|
||||||
in += rise;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (len < 0) {
|
|
||||||
return SWITCH_STATUS_GENERR;
|
|
||||||
}
|
|
||||||
|
|
||||||
*encoded_data_len = (uint32_t) len;
|
|
||||||
|
|
||||||
return SWITCH_STATUS_SUCCESS;
|
|
||||||
}
|
|
||||||
|
|
||||||
static switch_status_t switch_isac_decode(switch_codec_t *codec,
|
|
||||||
switch_codec_t *other_codec,
|
|
||||||
void *encoded_data,
|
|
||||||
uint32_t encoded_data_len,
|
|
||||||
uint32_t encoded_rate,
|
|
||||||
void *decoded_data,
|
|
||||||
uint32_t *decoded_data_len,
|
|
||||||
uint32_t *decoded_rate,
|
|
||||||
unsigned int *flag)
|
|
||||||
{
|
|
||||||
struct isac_context *context = codec->private_info;
|
|
||||||
WebRtc_Word16 len, speechType[1];
|
|
||||||
|
|
||||||
if ((*flag & SFF_PLC)) {
|
|
||||||
len = WebRtcIsac_DecodePlc(context->ISAC_main_inst, decoded_data, 1);
|
|
||||||
} else {
|
|
||||||
len = WebRtcIsac_Decode(context->ISAC_main_inst, encoded_data, encoded_data_len, decoded_data, speechType);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (len < 0) {
|
|
||||||
*decoded_data_len = 0;
|
|
||||||
return SWITCH_STATUS_GENERR;
|
|
||||||
}
|
|
||||||
|
|
||||||
*decoded_data_len = (uint32_t) len * 2;
|
|
||||||
|
|
||||||
return SWITCH_STATUS_SUCCESS;
|
|
||||||
}
|
|
||||||
|
|
||||||
static switch_status_t switch_isac_destroy(switch_codec_t *codec)
|
|
||||||
{
|
|
||||||
struct isac_context *context = codec->private_info;
|
|
||||||
|
|
||||||
WebRtcIsac_Free(context->ISAC_main_inst);
|
|
||||||
|
|
||||||
return SWITCH_STATUS_SUCCESS;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
SWITCH_MODULE_LOAD_FUNCTION(mod_isac_codec_load)
|
|
||||||
{
|
|
||||||
switch_codec_interface_t *codec_interface;
|
|
||||||
|
|
||||||
*module_interface = switch_loadable_module_create_module_interface(pool, modname);
|
|
||||||
|
|
||||||
SWITCH_ADD_CODEC(codec_interface, "isac"); /* 8.0kbit */
|
|
||||||
|
|
||||||
switch_core_codec_add_implementation(pool, codec_interface,
|
|
||||||
SWITCH_CODEC_TYPE_AUDIO,
|
|
||||||
99,
|
|
||||||
"isac",
|
|
||||||
"ibitrate=32000;maxbitrate=53400",
|
|
||||||
16000,
|
|
||||||
16000,
|
|
||||||
53400,
|
|
||||||
30000,
|
|
||||||
480,
|
|
||||||
960,
|
|
||||||
0,
|
|
||||||
1,
|
|
||||||
3,
|
|
||||||
switch_isac_init,
|
|
||||||
switch_isac_encode,
|
|
||||||
switch_isac_decode,
|
|
||||||
switch_isac_destroy);
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
switch_core_codec_add_implementation(pool, codec_interface,
|
|
||||||
SWITCH_CODEC_TYPE_AUDIO,
|
|
||||||
99,
|
|
||||||
"isac",
|
|
||||||
"ibitrate=32000;maxbitrate=53400",
|
|
||||||
16000,
|
|
||||||
16000,
|
|
||||||
53400,
|
|
||||||
60000,
|
|
||||||
960,
|
|
||||||
1920,
|
|
||||||
0,
|
|
||||||
1,
|
|
||||||
6,
|
|
||||||
switch_isac_init,
|
|
||||||
switch_isac_encode,
|
|
||||||
switch_isac_decode,
|
|
||||||
switch_isac_destroy);
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
switch_core_codec_add_implementation(pool, codec_interface,
|
|
||||||
SWITCH_CODEC_TYPE_AUDIO,
|
|
||||||
99,
|
|
||||||
"isac",
|
|
||||||
"ibitrate=32000;maxbitrate=160000",
|
|
||||||
32000,
|
|
||||||
32000,
|
|
||||||
160000,
|
|
||||||
30000,
|
|
||||||
960,
|
|
||||||
1920,
|
|
||||||
0,
|
|
||||||
1,
|
|
||||||
6,
|
|
||||||
switch_isac_init,
|
|
||||||
switch_isac_encode,
|
|
||||||
switch_isac_decode,
|
|
||||||
switch_isac_destroy);
|
|
||||||
|
|
||||||
|
|
||||||
switch_core_codec_add_implementation(pool, codec_interface,
|
|
||||||
SWITCH_CODEC_TYPE_AUDIO,
|
|
||||||
99,
|
|
||||||
"isac",
|
|
||||||
"ibitrate=32000;maxbitrate=160000",
|
|
||||||
32000,
|
|
||||||
32000,
|
|
||||||
160000,
|
|
||||||
60000,
|
|
||||||
1920,
|
|
||||||
3840,
|
|
||||||
0,
|
|
||||||
1,
|
|
||||||
6,
|
|
||||||
switch_isac_init,
|
|
||||||
switch_isac_encode,
|
|
||||||
switch_isac_decode,
|
|
||||||
switch_isac_destroy);
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* indicate that the module should continue to be loaded */
|
|
||||||
return SWITCH_STATUS_SUCCESS;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* For Emacs:
|
|
||||||
* Local Variables:
|
|
||||||
* mode:c
|
|
||||||
* indent-tabs-mode:t
|
|
||||||
* tab-width:4
|
|
||||||
* c-basic-offset:4
|
|
||||||
* End:
|
|
||||||
* For VIM:
|
|
||||||
* vim:set softtabstop=4 shiftwidth=4 tabstop=4 noet:
|
|
||||||
*/
|
|
||||||
|
|
@ -1,42 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_OS_SPECIFIC_INLINE_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_OS_SPECIFIC_INLINE_H_
|
|
||||||
|
|
||||||
#include <math.h>
|
|
||||||
#include "typedefs.h"
|
|
||||||
|
|
||||||
// TODO(turaj): switch to WEBRTC_POSIX when available
|
|
||||||
#if defined(WEBRTC_LINUX) || defined(WEBRTC_MAC)
|
|
||||||
#define WebRtcIsac_lrint lrint
|
|
||||||
#elif (defined(WEBRTC_ARCH_X86) && defined(WIN32))
|
|
||||||
static __inline long int WebRtcIsac_lrint(double x_dbl) {
|
|
||||||
long int x_int;
|
|
||||||
|
|
||||||
__asm {
|
|
||||||
fld x_dbl
|
|
||||||
fistp x_int
|
|
||||||
};
|
|
||||||
|
|
||||||
return x_int;
|
|
||||||
}
|
|
||||||
#else // Do a slow but correct implementation of lrint
|
|
||||||
|
|
||||||
static __inline long int WebRtcIsac_lrint(double x_dbl) {
|
|
||||||
long int x_int;
|
|
||||||
x_int = (long int)floor(x_dbl + 0.499999999999);
|
|
||||||
return x_int;
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif // WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_OS_SPECIFIC_INLINE_H_
|
|
||||||
|
|
@ -1,622 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "pitch_estimator.h"
|
|
||||||
|
|
||||||
#include <math.h>
|
|
||||||
#include <memory.h>
|
|
||||||
#ifdef WEBRTC_ANDROID
|
|
||||||
#include <stdlib.h>
|
|
||||||
#endif
|
|
||||||
|
|
||||||
static const double kInterpolWin[8] = {-0.00067556028640, 0.02184247643159, -0.12203175715679, 0.60086484101160,
|
|
||||||
0.60086484101160, -0.12203175715679, 0.02184247643159, -0.00067556028640};
|
|
||||||
|
|
||||||
/* interpolation filter */
|
|
||||||
__inline static void IntrepolFilter(double *data_ptr, double *intrp)
|
|
||||||
{
|
|
||||||
*intrp = kInterpolWin[0] * data_ptr[-3];
|
|
||||||
*intrp += kInterpolWin[1] * data_ptr[-2];
|
|
||||||
*intrp += kInterpolWin[2] * data_ptr[-1];
|
|
||||||
*intrp += kInterpolWin[3] * data_ptr[0];
|
|
||||||
*intrp += kInterpolWin[4] * data_ptr[1];
|
|
||||||
*intrp += kInterpolWin[5] * data_ptr[2];
|
|
||||||
*intrp += kInterpolWin[6] * data_ptr[3];
|
|
||||||
*intrp += kInterpolWin[7] * data_ptr[4];
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* 2D parabolic interpolation */
|
|
||||||
/* probably some 0.5 factors can be eliminated, and the square-roots can be removed from the Cholesky fact. */
|
|
||||||
__inline static void Intrpol2D(double T[3][3], double *x, double *y, double *peak_val)
|
|
||||||
{
|
|
||||||
double c, b[2], A[2][2];
|
|
||||||
double t1, t2, d;
|
|
||||||
double delta1, delta2;
|
|
||||||
|
|
||||||
|
|
||||||
// double T[3][3] = {{-1.25, -.25,-.25}, {-.25, .75, .75}, {-.25, .75, .75}};
|
|
||||||
// should result in: delta1 = 0.5; delta2 = 0.0; peak_val = 1.0
|
|
||||||
|
|
||||||
c = T[1][1];
|
|
||||||
b[0] = 0.5 * (T[1][2] + T[2][1] - T[0][1] - T[1][0]);
|
|
||||||
b[1] = 0.5 * (T[1][0] + T[2][1] - T[0][1] - T[1][2]);
|
|
||||||
A[0][1] = -0.5 * (T[0][1] + T[2][1] - T[1][0] - T[1][2]);
|
|
||||||
t1 = 0.5 * (T[0][0] + T[2][2]) - c;
|
|
||||||
t2 = 0.5 * (T[2][0] + T[0][2]) - c;
|
|
||||||
d = (T[0][1] + T[1][2] + T[1][0] + T[2][1]) - 4.0 * c - t1 - t2;
|
|
||||||
A[0][0] = -t1 - 0.5 * d;
|
|
||||||
A[1][1] = -t2 - 0.5 * d;
|
|
||||||
|
|
||||||
/* deal with singularities or ill-conditioned cases */
|
|
||||||
if ( (A[0][0] < 1e-7) || ((A[0][0] * A[1][1] - A[0][1] * A[0][1]) < 1e-7) ) {
|
|
||||||
*peak_val = T[1][1];
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Cholesky decomposition: replace A by upper-triangular factor */
|
|
||||||
A[0][0] = sqrt(A[0][0]);
|
|
||||||
A[0][1] = A[0][1] / A[0][0];
|
|
||||||
A[1][1] = sqrt(A[1][1] - A[0][1] * A[0][1]);
|
|
||||||
|
|
||||||
/* compute [x; y] = -0.5 * inv(A) * b */
|
|
||||||
t1 = b[0] / A[0][0];
|
|
||||||
t2 = (b[1] - t1 * A[0][1]) / A[1][1];
|
|
||||||
delta2 = t2 / A[1][1];
|
|
||||||
delta1 = 0.5 * (t1 - delta2 * A[0][1]) / A[0][0];
|
|
||||||
delta2 *= 0.5;
|
|
||||||
|
|
||||||
/* limit norm */
|
|
||||||
t1 = delta1 * delta1 + delta2 * delta2;
|
|
||||||
if (t1 > 1.0) {
|
|
||||||
delta1 /= t1;
|
|
||||||
delta2 /= t1;
|
|
||||||
}
|
|
||||||
|
|
||||||
*peak_val = 0.5 * (b[0] * delta1 + b[1] * delta2) + c;
|
|
||||||
|
|
||||||
*x += delta1;
|
|
||||||
*y += delta2;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
static void PCorr(const double *in, double *outcorr)
|
|
||||||
{
|
|
||||||
double sum, ysum, prod;
|
|
||||||
const double *x, *inptr;
|
|
||||||
int k, n;
|
|
||||||
|
|
||||||
//ysum = 1e-6; /* use this with float (i.s.o. double)! */
|
|
||||||
ysum = 1e-13;
|
|
||||||
sum = 0.0;
|
|
||||||
x = in + PITCH_MAX_LAG/2 + 2;
|
|
||||||
for (n = 0; n < PITCH_CORR_LEN2; n++) {
|
|
||||||
ysum += in[n] * in[n];
|
|
||||||
sum += x[n] * in[n];
|
|
||||||
}
|
|
||||||
|
|
||||||
outcorr += PITCH_LAG_SPAN2 - 1; /* index of last element in array */
|
|
||||||
*outcorr = sum / sqrt(ysum);
|
|
||||||
|
|
||||||
for (k = 1; k < PITCH_LAG_SPAN2; k++) {
|
|
||||||
ysum -= in[k-1] * in[k-1];
|
|
||||||
ysum += in[PITCH_CORR_LEN2 + k - 1] * in[PITCH_CORR_LEN2 + k - 1];
|
|
||||||
sum = 0.0;
|
|
||||||
inptr = &in[k];
|
|
||||||
prod = x[0] * inptr[0];
|
|
||||||
for (n = 1; n < PITCH_CORR_LEN2; n++) {
|
|
||||||
sum += prod;
|
|
||||||
prod = x[n] * inptr[n];
|
|
||||||
}
|
|
||||||
sum += prod;
|
|
||||||
outcorr--;
|
|
||||||
*outcorr = sum / sqrt(ysum);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_InitializePitch(const double *in,
|
|
||||||
const double old_lag,
|
|
||||||
const double old_gain,
|
|
||||||
PitchAnalysisStruct *State,
|
|
||||||
double *lags)
|
|
||||||
{
|
|
||||||
double buf_dec[PITCH_CORR_LEN2+PITCH_CORR_STEP2+PITCH_MAX_LAG/2+2];
|
|
||||||
double ratio, log_lag, gain_bias;
|
|
||||||
double bias;
|
|
||||||
double corrvec1[PITCH_LAG_SPAN2];
|
|
||||||
double corrvec2[PITCH_LAG_SPAN2];
|
|
||||||
int m, k;
|
|
||||||
// Allocating 10 extra entries at the begining of the CorrSurf
|
|
||||||
double corrSurfBuff[10 + (2*PITCH_BW+3)*(PITCH_LAG_SPAN2+4)];
|
|
||||||
double* CorrSurf[2*PITCH_BW+3];
|
|
||||||
double *CorrSurfPtr1, *CorrSurfPtr2;
|
|
||||||
double LagWin[3] = {0.2, 0.5, 0.98};
|
|
||||||
int ind1, ind2, peaks_ind, peak, max_ind;
|
|
||||||
int peaks[PITCH_MAX_NUM_PEAKS];
|
|
||||||
double adj, gain_tmp;
|
|
||||||
double corr, corr_max;
|
|
||||||
double intrp_a, intrp_b, intrp_c, intrp_d;
|
|
||||||
double peak_vals[PITCH_MAX_NUM_PEAKS];
|
|
||||||
double lags1[PITCH_MAX_NUM_PEAKS];
|
|
||||||
double lags2[PITCH_MAX_NUM_PEAKS];
|
|
||||||
double T[3][3];
|
|
||||||
int row;
|
|
||||||
|
|
||||||
for(k = 0; k < 2*PITCH_BW+3; k++)
|
|
||||||
{
|
|
||||||
CorrSurf[k] = &corrSurfBuff[10 + k * (PITCH_LAG_SPAN2+4)];
|
|
||||||
}
|
|
||||||
/* reset CorrSurf matrix */
|
|
||||||
memset(corrSurfBuff, 0, sizeof(double) * (10 + (2*PITCH_BW+3) * (PITCH_LAG_SPAN2+4)));
|
|
||||||
|
|
||||||
//warnings -DH
|
|
||||||
max_ind = 0;
|
|
||||||
peak = 0;
|
|
||||||
|
|
||||||
/* copy old values from state buffer */
|
|
||||||
memcpy(buf_dec, State->dec_buffer, sizeof(double) * (PITCH_CORR_LEN2+PITCH_CORR_STEP2+PITCH_MAX_LAG/2-PITCH_FRAME_LEN/2+2));
|
|
||||||
|
|
||||||
/* decimation; put result after the old values */
|
|
||||||
WebRtcIsac_DecimateAllpass(in, State->decimator_state, PITCH_FRAME_LEN,
|
|
||||||
&buf_dec[PITCH_CORR_LEN2+PITCH_CORR_STEP2+PITCH_MAX_LAG/2-PITCH_FRAME_LEN/2+2]);
|
|
||||||
|
|
||||||
/* low-pass filtering */
|
|
||||||
for (k = PITCH_CORR_LEN2+PITCH_CORR_STEP2+PITCH_MAX_LAG/2-PITCH_FRAME_LEN/2+2; k < PITCH_CORR_LEN2+PITCH_CORR_STEP2+PITCH_MAX_LAG/2+2; k++)
|
|
||||||
buf_dec[k] += 0.75 * buf_dec[k-1] - 0.25 * buf_dec[k-2];
|
|
||||||
|
|
||||||
/* copy end part back into state buffer */
|
|
||||||
memcpy(State->dec_buffer, buf_dec+PITCH_FRAME_LEN/2, sizeof(double) * (PITCH_CORR_LEN2+PITCH_CORR_STEP2+PITCH_MAX_LAG/2-PITCH_FRAME_LEN/2+2));
|
|
||||||
|
|
||||||
/* compute correlation for first and second half of the frame */
|
|
||||||
PCorr(buf_dec, corrvec1);
|
|
||||||
PCorr(buf_dec + PITCH_CORR_STEP2, corrvec2);
|
|
||||||
|
|
||||||
/* bias towards pitch lag of previous frame */
|
|
||||||
log_lag = log(0.5 * old_lag);
|
|
||||||
gain_bias = 4.0 * old_gain * old_gain;
|
|
||||||
if (gain_bias > 0.8) gain_bias = 0.8;
|
|
||||||
for (k = 0; k < PITCH_LAG_SPAN2; k++)
|
|
||||||
{
|
|
||||||
ratio = log((double) (k + (PITCH_MIN_LAG/2-2))) - log_lag;
|
|
||||||
bias = 1.0 + gain_bias * exp(-5.0 * ratio * ratio);
|
|
||||||
corrvec1[k] *= bias;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* taper correlation functions */
|
|
||||||
for (k = 0; k < 3; k++) {
|
|
||||||
gain_tmp = LagWin[k];
|
|
||||||
corrvec1[k] *= gain_tmp;
|
|
||||||
corrvec2[k] *= gain_tmp;
|
|
||||||
corrvec1[PITCH_LAG_SPAN2-1-k] *= gain_tmp;
|
|
||||||
corrvec2[PITCH_LAG_SPAN2-1-k] *= gain_tmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
corr_max = 0.0;
|
|
||||||
/* fill middle row of correlation surface */
|
|
||||||
ind1 = 0;
|
|
||||||
ind2 = 0;
|
|
||||||
CorrSurfPtr1 = &CorrSurf[PITCH_BW][2];
|
|
||||||
for (k = 0; k < PITCH_LAG_SPAN2; k++) {
|
|
||||||
corr = corrvec1[ind1++] + corrvec2[ind2++];
|
|
||||||
CorrSurfPtr1[k] = corr;
|
|
||||||
if (corr > corr_max) {
|
|
||||||
corr_max = corr; /* update maximum */
|
|
||||||
max_ind = (int)(&CorrSurfPtr1[k] - &CorrSurf[0][0]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
/* fill first and last rows of correlation surface */
|
|
||||||
ind1 = 0;
|
|
||||||
ind2 = PITCH_BW;
|
|
||||||
CorrSurfPtr1 = &CorrSurf[0][2];
|
|
||||||
CorrSurfPtr2 = &CorrSurf[2*PITCH_BW][PITCH_BW+2];
|
|
||||||
for (k = 0; k < PITCH_LAG_SPAN2-PITCH_BW; k++) {
|
|
||||||
ratio = ((double) (ind1 + 12)) / ((double) (ind2 + 12));
|
|
||||||
adj = 0.2 * ratio * (2.0 - ratio); /* adjustment factor; inverse parabola as a function of ratio */
|
|
||||||
corr = adj * (corrvec1[ind1] + corrvec2[ind2]);
|
|
||||||
CorrSurfPtr1[k] = corr;
|
|
||||||
if (corr > corr_max) {
|
|
||||||
corr_max = corr; /* update maximum */
|
|
||||||
max_ind = (int)(&CorrSurfPtr1[k] - &CorrSurf[0][0]);
|
|
||||||
}
|
|
||||||
corr = adj * (corrvec1[ind2++] + corrvec2[ind1++]);
|
|
||||||
CorrSurfPtr2[k] = corr;
|
|
||||||
if (corr > corr_max) {
|
|
||||||
corr_max = corr; /* update maximum */
|
|
||||||
max_ind = (int)(&CorrSurfPtr2[k] - &CorrSurf[0][0]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
/* fill second and next to last rows of correlation surface */
|
|
||||||
ind1 = 0;
|
|
||||||
ind2 = PITCH_BW-1;
|
|
||||||
CorrSurfPtr1 = &CorrSurf[1][2];
|
|
||||||
CorrSurfPtr2 = &CorrSurf[2*PITCH_BW-1][PITCH_BW+1];
|
|
||||||
for (k = 0; k < PITCH_LAG_SPAN2-PITCH_BW+1; k++) {
|
|
||||||
ratio = ((double) (ind1 + 12)) / ((double) (ind2 + 12));
|
|
||||||
adj = 0.9 * ratio * (2.0 - ratio); /* adjustment factor; inverse parabola as a function of ratio */
|
|
||||||
corr = adj * (corrvec1[ind1] + corrvec2[ind2]);
|
|
||||||
CorrSurfPtr1[k] = corr;
|
|
||||||
if (corr > corr_max) {
|
|
||||||
corr_max = corr; /* update maximum */
|
|
||||||
max_ind = (int)(&CorrSurfPtr1[k] - &CorrSurf[0][0]);
|
|
||||||
}
|
|
||||||
corr = adj * (corrvec1[ind2++] + corrvec2[ind1++]);
|
|
||||||
CorrSurfPtr2[k] = corr;
|
|
||||||
if (corr > corr_max) {
|
|
||||||
corr_max = corr; /* update maximum */
|
|
||||||
max_ind = (int)(&CorrSurfPtr2[k] - &CorrSurf[0][0]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
/* fill remainder of correlation surface */
|
|
||||||
for (m = 2; m < PITCH_BW; m++) {
|
|
||||||
ind1 = 0;
|
|
||||||
ind2 = PITCH_BW - m; /* always larger than ind1 */
|
|
||||||
CorrSurfPtr1 = &CorrSurf[m][2];
|
|
||||||
CorrSurfPtr2 = &CorrSurf[2*PITCH_BW-m][PITCH_BW+2-m];
|
|
||||||
for (k = 0; k < PITCH_LAG_SPAN2-PITCH_BW+m; k++) {
|
|
||||||
ratio = ((double) (ind1 + 12)) / ((double) (ind2 + 12));
|
|
||||||
adj = ratio * (2.0 - ratio); /* adjustment factor; inverse parabola as a function of ratio */
|
|
||||||
corr = adj * (corrvec1[ind1] + corrvec2[ind2]);
|
|
||||||
CorrSurfPtr1[k] = corr;
|
|
||||||
if (corr > corr_max) {
|
|
||||||
corr_max = corr; /* update maximum */
|
|
||||||
max_ind = (int)(&CorrSurfPtr1[k] - &CorrSurf[0][0]);
|
|
||||||
}
|
|
||||||
corr = adj * (corrvec1[ind2++] + corrvec2[ind1++]);
|
|
||||||
CorrSurfPtr2[k] = corr;
|
|
||||||
if (corr > corr_max) {
|
|
||||||
corr_max = corr; /* update maximum */
|
|
||||||
max_ind = (int)(&CorrSurfPtr2[k] - &CorrSurf[0][0]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* threshold value to qualify as a peak */
|
|
||||||
corr_max *= 0.6;
|
|
||||||
|
|
||||||
peaks_ind = 0;
|
|
||||||
/* find peaks */
|
|
||||||
for (m = 1; m < PITCH_BW+1; m++) {
|
|
||||||
if (peaks_ind == PITCH_MAX_NUM_PEAKS) break;
|
|
||||||
CorrSurfPtr1 = &CorrSurf[m][2];
|
|
||||||
for (k = 2; k < PITCH_LAG_SPAN2-PITCH_BW-2+m; k++) {
|
|
||||||
corr = CorrSurfPtr1[k];
|
|
||||||
if (corr > corr_max) {
|
|
||||||
if ( (corr > CorrSurfPtr1[k - (PITCH_LAG_SPAN2+5)]) && (corr > CorrSurfPtr1[k - (PITCH_LAG_SPAN2+4)]) ) {
|
|
||||||
if ( (corr > CorrSurfPtr1[k + (PITCH_LAG_SPAN2+4)]) && (corr > CorrSurfPtr1[k + (PITCH_LAG_SPAN2+5)]) ) {
|
|
||||||
/* found a peak; store index into matrix */
|
|
||||||
peaks[peaks_ind++] = (int)(&CorrSurfPtr1[k] - &CorrSurf[0][0]);
|
|
||||||
if (peaks_ind == PITCH_MAX_NUM_PEAKS) break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
for (m = PITCH_BW+1; m < 2*PITCH_BW; m++) {
|
|
||||||
if (peaks_ind == PITCH_MAX_NUM_PEAKS) break;
|
|
||||||
CorrSurfPtr1 = &CorrSurf[m][2];
|
|
||||||
for (k = 2+m-PITCH_BW; k < PITCH_LAG_SPAN2-2; k++) {
|
|
||||||
corr = CorrSurfPtr1[k];
|
|
||||||
if (corr > corr_max) {
|
|
||||||
if ( (corr > CorrSurfPtr1[k - (PITCH_LAG_SPAN2+5)]) && (corr > CorrSurfPtr1[k - (PITCH_LAG_SPAN2+4)]) ) {
|
|
||||||
if ( (corr > CorrSurfPtr1[k + (PITCH_LAG_SPAN2+4)]) && (corr > CorrSurfPtr1[k + (PITCH_LAG_SPAN2+5)]) ) {
|
|
||||||
/* found a peak; store index into matrix */
|
|
||||||
peaks[peaks_ind++] = (int)(&CorrSurfPtr1[k] - &CorrSurf[0][0]);
|
|
||||||
if (peaks_ind == PITCH_MAX_NUM_PEAKS) break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (peaks_ind > 0) {
|
|
||||||
/* examine each peak */
|
|
||||||
CorrSurfPtr1 = &CorrSurf[0][0];
|
|
||||||
for (k = 0; k < peaks_ind; k++) {
|
|
||||||
peak = peaks[k];
|
|
||||||
|
|
||||||
/* compute four interpolated values around current peak */
|
|
||||||
IntrepolFilter(&CorrSurfPtr1[peak - (PITCH_LAG_SPAN2+5)], &intrp_a);
|
|
||||||
IntrepolFilter(&CorrSurfPtr1[peak - 1 ], &intrp_b);
|
|
||||||
IntrepolFilter(&CorrSurfPtr1[peak ], &intrp_c);
|
|
||||||
IntrepolFilter(&CorrSurfPtr1[peak + (PITCH_LAG_SPAN2+4)], &intrp_d);
|
|
||||||
|
|
||||||
/* determine maximum of the interpolated values */
|
|
||||||
corr = CorrSurfPtr1[peak];
|
|
||||||
corr_max = intrp_a;
|
|
||||||
if (intrp_b > corr_max) corr_max = intrp_b;
|
|
||||||
if (intrp_c > corr_max) corr_max = intrp_c;
|
|
||||||
if (intrp_d > corr_max) corr_max = intrp_d;
|
|
||||||
|
|
||||||
/* determine where the peak sits and fill a 3x3 matrix around it */
|
|
||||||
row = peak / (PITCH_LAG_SPAN2+4);
|
|
||||||
lags1[k] = (double) ((peak - row * (PITCH_LAG_SPAN2+4)) + PITCH_MIN_LAG/2 - 4);
|
|
||||||
lags2[k] = (double) (lags1[k] + PITCH_BW - row);
|
|
||||||
if ( corr > corr_max ) {
|
|
||||||
T[0][0] = CorrSurfPtr1[peak - (PITCH_LAG_SPAN2+5)];
|
|
||||||
T[2][0] = CorrSurfPtr1[peak - (PITCH_LAG_SPAN2+4)];
|
|
||||||
T[1][1] = corr;
|
|
||||||
T[0][2] = CorrSurfPtr1[peak + (PITCH_LAG_SPAN2+4)];
|
|
||||||
T[2][2] = CorrSurfPtr1[peak + (PITCH_LAG_SPAN2+5)];
|
|
||||||
T[1][0] = intrp_a;
|
|
||||||
T[0][1] = intrp_b;
|
|
||||||
T[2][1] = intrp_c;
|
|
||||||
T[1][2] = intrp_d;
|
|
||||||
} else {
|
|
||||||
if (intrp_a == corr_max) {
|
|
||||||
lags1[k] -= 0.5;
|
|
||||||
lags2[k] += 0.5;
|
|
||||||
IntrepolFilter(&CorrSurfPtr1[peak - 2*(PITCH_LAG_SPAN2+5)], &T[0][0]);
|
|
||||||
IntrepolFilter(&CorrSurfPtr1[peak - (2*PITCH_LAG_SPAN2+9)], &T[2][0]);
|
|
||||||
T[1][1] = intrp_a;
|
|
||||||
T[0][2] = intrp_b;
|
|
||||||
T[2][2] = intrp_c;
|
|
||||||
T[1][0] = CorrSurfPtr1[peak - (2*PITCH_LAG_SPAN2+9)];
|
|
||||||
T[0][1] = CorrSurfPtr1[peak - (PITCH_LAG_SPAN2+5)];
|
|
||||||
T[2][1] = CorrSurfPtr1[peak - (PITCH_LAG_SPAN2+4)];
|
|
||||||
T[1][2] = corr;
|
|
||||||
} else if (intrp_b == corr_max) {
|
|
||||||
lags1[k] -= 0.5;
|
|
||||||
lags2[k] -= 0.5;
|
|
||||||
IntrepolFilter(&CorrSurfPtr1[peak - (PITCH_LAG_SPAN2+6)], &T[0][0]);
|
|
||||||
T[2][0] = intrp_a;
|
|
||||||
T[1][1] = intrp_b;
|
|
||||||
IntrepolFilter(&CorrSurfPtr1[peak + (PITCH_LAG_SPAN2+3)], &T[0][2]);
|
|
||||||
T[2][2] = intrp_d;
|
|
||||||
T[1][0] = CorrSurfPtr1[peak - (PITCH_LAG_SPAN2+5)];
|
|
||||||
T[0][1] = CorrSurfPtr1[peak - 1];
|
|
||||||
T[2][1] = corr;
|
|
||||||
T[1][2] = CorrSurfPtr1[peak + (PITCH_LAG_SPAN2+4)];
|
|
||||||
} else if (intrp_c == corr_max) {
|
|
||||||
lags1[k] += 0.5;
|
|
||||||
lags2[k] += 0.5;
|
|
||||||
T[0][0] = intrp_a;
|
|
||||||
IntrepolFilter(&CorrSurfPtr1[peak - (PITCH_LAG_SPAN2+4)], &T[2][0]);
|
|
||||||
T[1][1] = intrp_c;
|
|
||||||
T[0][2] = intrp_d;
|
|
||||||
IntrepolFilter(&CorrSurfPtr1[peak + (PITCH_LAG_SPAN2+5)], &T[2][2]);
|
|
||||||
T[1][0] = CorrSurfPtr1[peak - (PITCH_LAG_SPAN2+4)];
|
|
||||||
T[0][1] = corr;
|
|
||||||
T[2][1] = CorrSurfPtr1[peak + 1];
|
|
||||||
T[1][2] = CorrSurfPtr1[peak + (PITCH_LAG_SPAN2+5)];
|
|
||||||
} else {
|
|
||||||
lags1[k] += 0.5;
|
|
||||||
lags2[k] -= 0.5;
|
|
||||||
T[0][0] = intrp_b;
|
|
||||||
T[2][0] = intrp_c;
|
|
||||||
T[1][1] = intrp_d;
|
|
||||||
IntrepolFilter(&CorrSurfPtr1[peak + 2*(PITCH_LAG_SPAN2+4)], &T[0][2]);
|
|
||||||
IntrepolFilter(&CorrSurfPtr1[peak + (2*PITCH_LAG_SPAN2+9)], &T[2][2]);
|
|
||||||
T[1][0] = corr;
|
|
||||||
T[0][1] = CorrSurfPtr1[peak + (PITCH_LAG_SPAN2+4)];
|
|
||||||
T[2][1] = CorrSurfPtr1[peak + (PITCH_LAG_SPAN2+5)];
|
|
||||||
T[1][2] = CorrSurfPtr1[peak + (2*PITCH_LAG_SPAN2+9)];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* 2D parabolic interpolation gives more accurate lags and peak value */
|
|
||||||
Intrpol2D(T, &lags1[k], &lags2[k], &peak_vals[k]);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* determine the highest peak, after applying a bias towards short lags */
|
|
||||||
corr_max = 0.0;
|
|
||||||
for (k = 0; k < peaks_ind; k++) {
|
|
||||||
corr = peak_vals[k] * pow(PITCH_PEAK_DECAY, log(lags1[k] + lags2[k]));
|
|
||||||
if (corr > corr_max) {
|
|
||||||
corr_max = corr;
|
|
||||||
peak = k;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
lags1[peak] *= 2.0;
|
|
||||||
lags2[peak] *= 2.0;
|
|
||||||
|
|
||||||
if (lags1[peak] < (double) PITCH_MIN_LAG) lags1[peak] = (double) PITCH_MIN_LAG;
|
|
||||||
if (lags2[peak] < (double) PITCH_MIN_LAG) lags2[peak] = (double) PITCH_MIN_LAG;
|
|
||||||
if (lags1[peak] > (double) PITCH_MAX_LAG) lags1[peak] = (double) PITCH_MAX_LAG;
|
|
||||||
if (lags2[peak] > (double) PITCH_MAX_LAG) lags2[peak] = (double) PITCH_MAX_LAG;
|
|
||||||
|
|
||||||
/* store lags of highest peak in output array */
|
|
||||||
lags[0] = lags1[peak];
|
|
||||||
lags[1] = lags1[peak];
|
|
||||||
lags[2] = lags2[peak];
|
|
||||||
lags[3] = lags2[peak];
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
row = max_ind / (PITCH_LAG_SPAN2+4);
|
|
||||||
lags1[0] = (double) ((max_ind - row * (PITCH_LAG_SPAN2+4)) + PITCH_MIN_LAG/2 - 4);
|
|
||||||
lags2[0] = (double) (lags1[0] + PITCH_BW - row);
|
|
||||||
|
|
||||||
if (lags1[0] < (double) PITCH_MIN_LAG) lags1[0] = (double) PITCH_MIN_LAG;
|
|
||||||
if (lags2[0] < (double) PITCH_MIN_LAG) lags2[0] = (double) PITCH_MIN_LAG;
|
|
||||||
if (lags1[0] > (double) PITCH_MAX_LAG) lags1[0] = (double) PITCH_MAX_LAG;
|
|
||||||
if (lags2[0] > (double) PITCH_MAX_LAG) lags2[0] = (double) PITCH_MAX_LAG;
|
|
||||||
|
|
||||||
/* store lags of highest peak in output array */
|
|
||||||
lags[0] = lags1[0];
|
|
||||||
lags[1] = lags1[0];
|
|
||||||
lags[2] = lags2[0];
|
|
||||||
lags[3] = lags2[0];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* create weighting matrix by orthogonalizing a basis of polynomials of increasing order
|
|
||||||
* t = (0:4)';
|
|
||||||
* A = [t.^0, t.^1, t.^2, t.^3, t.^4];
|
|
||||||
* [Q, dummy] = qr(A);
|
|
||||||
* P.Weight = Q * diag([0, .1, .5, 1, 1]) * Q'; */
|
|
||||||
static const double kWeight[5][5] = {
|
|
||||||
{ 0.29714285714286, -0.30857142857143, -0.05714285714286, 0.05142857142857, 0.01714285714286},
|
|
||||||
{-0.30857142857143, 0.67428571428571, -0.27142857142857, -0.14571428571429, 0.05142857142857},
|
|
||||||
{-0.05714285714286, -0.27142857142857, 0.65714285714286, -0.27142857142857, -0.05714285714286},
|
|
||||||
{ 0.05142857142857, -0.14571428571429, -0.27142857142857, 0.67428571428571, -0.30857142857143},
|
|
||||||
{ 0.01714285714286, 0.05142857142857, -0.05714285714286, -0.30857142857143, 0.29714285714286}
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_PitchAnalysis(const double *in, /* PITCH_FRAME_LEN samples */
|
|
||||||
double *out, /* PITCH_FRAME_LEN+QLOOKAHEAD samples */
|
|
||||||
PitchAnalysisStruct *State,
|
|
||||||
double *lags,
|
|
||||||
double *gains)
|
|
||||||
{
|
|
||||||
double HPin[PITCH_FRAME_LEN];
|
|
||||||
double Weighted[PITCH_FRAME_LEN];
|
|
||||||
double Whitened[PITCH_FRAME_LEN + QLOOKAHEAD];
|
|
||||||
double inbuf[PITCH_FRAME_LEN + QLOOKAHEAD];
|
|
||||||
double out_G[PITCH_FRAME_LEN + QLOOKAHEAD]; // could be removed by using out instead
|
|
||||||
double out_dG[4][PITCH_FRAME_LEN + QLOOKAHEAD];
|
|
||||||
double old_lag, old_gain;
|
|
||||||
double nrg_wht, tmp;
|
|
||||||
double Wnrg, Wfluct, Wgain;
|
|
||||||
double H[4][4];
|
|
||||||
double grad[4];
|
|
||||||
double dG[4];
|
|
||||||
int k, m, n, iter;
|
|
||||||
|
|
||||||
/* high pass filtering using second order pole-zero filter */
|
|
||||||
WebRtcIsac_Highpass(in, HPin, State->hp_state, PITCH_FRAME_LEN);
|
|
||||||
|
|
||||||
/* copy from state into buffer */
|
|
||||||
memcpy(Whitened, State->whitened_buf, sizeof(double) * QLOOKAHEAD);
|
|
||||||
|
|
||||||
/* compute weighted and whitened signals */
|
|
||||||
WebRtcIsac_WeightingFilter(HPin, &Weighted[0], &Whitened[QLOOKAHEAD], &(State->Wghtstr));
|
|
||||||
|
|
||||||
/* copy from buffer into state */
|
|
||||||
memcpy(State->whitened_buf, Whitened+PITCH_FRAME_LEN, sizeof(double) * QLOOKAHEAD);
|
|
||||||
|
|
||||||
old_lag = State->PFstr_wght.oldlagp[0];
|
|
||||||
old_gain = State->PFstr_wght.oldgainp[0];
|
|
||||||
|
|
||||||
/* inital pitch estimate */
|
|
||||||
WebRtcIsac_InitializePitch(Weighted, old_lag, old_gain, State, lags);
|
|
||||||
|
|
||||||
|
|
||||||
/* Iterative optimization of lags - to be done */
|
|
||||||
|
|
||||||
/* compute energy of whitened signal */
|
|
||||||
nrg_wht = 0.0;
|
|
||||||
for (k = 0; k < PITCH_FRAME_LEN + QLOOKAHEAD; k++)
|
|
||||||
nrg_wht += Whitened[k] * Whitened[k];
|
|
||||||
|
|
||||||
|
|
||||||
/* Iterative optimization of gains */
|
|
||||||
|
|
||||||
/* set weights for energy, gain fluctiation, and spectral gain penalty functions */
|
|
||||||
Wnrg = 1.0 / nrg_wht;
|
|
||||||
Wgain = 0.005;
|
|
||||||
Wfluct = 3.0;
|
|
||||||
|
|
||||||
/* set initial gains */
|
|
||||||
for (k = 0; k < 4; k++)
|
|
||||||
gains[k] = PITCH_MAX_GAIN_06;
|
|
||||||
|
|
||||||
/* two iterations should be enough */
|
|
||||||
for (iter = 0; iter < 2; iter++) {
|
|
||||||
/* compute Jacobian of pre-filter output towards gains */
|
|
||||||
WebRtcIsac_PitchfilterPre_gains(Whitened, out_G, out_dG, &(State->PFstr_wght), lags, gains);
|
|
||||||
|
|
||||||
/* gradient and approximate Hessian (lower triangle) for minimizing the filter's output power */
|
|
||||||
for (k = 0; k < 4; k++) {
|
|
||||||
tmp = 0.0;
|
|
||||||
for (n = 0; n < PITCH_FRAME_LEN + QLOOKAHEAD; n++)
|
|
||||||
tmp += out_G[n] * out_dG[k][n];
|
|
||||||
grad[k] = tmp * Wnrg;
|
|
||||||
}
|
|
||||||
for (k = 0; k < 4; k++) {
|
|
||||||
for (m = 0; m <= k; m++) {
|
|
||||||
tmp = 0.0;
|
|
||||||
for (n = 0; n < PITCH_FRAME_LEN + QLOOKAHEAD; n++)
|
|
||||||
tmp += out_dG[m][n] * out_dG[k][n];
|
|
||||||
H[k][m] = tmp * Wnrg;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* add gradient and Hessian (lower triangle) for dampening fast gain changes */
|
|
||||||
for (k = 0; k < 4; k++) {
|
|
||||||
tmp = kWeight[k+1][0] * old_gain;
|
|
||||||
for (m = 0; m < 4; m++)
|
|
||||||
tmp += kWeight[k+1][m+1] * gains[m];
|
|
||||||
grad[k] += tmp * Wfluct;
|
|
||||||
}
|
|
||||||
for (k = 0; k < 4; k++) {
|
|
||||||
for (m = 0; m <= k; m++) {
|
|
||||||
H[k][m] += kWeight[k+1][m+1] * Wfluct;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* add gradient and Hessian for dampening gain */
|
|
||||||
for (k = 0; k < 3; k++) {
|
|
||||||
tmp = 1.0 / (1 - gains[k]);
|
|
||||||
grad[k] += tmp * tmp * Wgain;
|
|
||||||
H[k][k] += 2.0 * tmp * (tmp * tmp * Wgain);
|
|
||||||
}
|
|
||||||
tmp = 1.0 / (1 - gains[3]);
|
|
||||||
grad[3] += 1.33 * (tmp * tmp * Wgain);
|
|
||||||
H[3][3] += 2.66 * tmp * (tmp * tmp * Wgain);
|
|
||||||
|
|
||||||
|
|
||||||
/* compute Cholesky factorization of Hessian
|
|
||||||
* by overwritting the upper triangle; scale factors on diagonal
|
|
||||||
* (for non pc-platforms store the inverse of the diagonals seperately to minimize divisions) */
|
|
||||||
H[0][1] = H[1][0] / H[0][0];
|
|
||||||
H[0][2] = H[2][0] / H[0][0];
|
|
||||||
H[0][3] = H[3][0] / H[0][0];
|
|
||||||
H[1][1] -= H[0][0] * H[0][1] * H[0][1];
|
|
||||||
H[1][2] = (H[2][1] - H[0][1] * H[2][0]) / H[1][1];
|
|
||||||
H[1][3] = (H[3][1] - H[0][1] * H[3][0]) / H[1][1];
|
|
||||||
H[2][2] -= H[0][0] * H[0][2] * H[0][2] + H[1][1] * H[1][2] * H[1][2];
|
|
||||||
H[2][3] = (H[3][2] - H[0][2] * H[3][0] - H[1][2] * H[1][1] * H[1][3]) / H[2][2];
|
|
||||||
H[3][3] -= H[0][0] * H[0][3] * H[0][3] + H[1][1] * H[1][3] * H[1][3] + H[2][2] * H[2][3] * H[2][3];
|
|
||||||
|
|
||||||
/* Compute update as delta_gains = -inv(H) * grad */
|
|
||||||
/* copy and negate */
|
|
||||||
for (k = 0; k < 4; k++)
|
|
||||||
dG[k] = -grad[k];
|
|
||||||
/* back substitution */
|
|
||||||
dG[1] -= dG[0] * H[0][1];
|
|
||||||
dG[2] -= dG[0] * H[0][2] + dG[1] * H[1][2];
|
|
||||||
dG[3] -= dG[0] * H[0][3] + dG[1] * H[1][3] + dG[2] * H[2][3];
|
|
||||||
/* scale */
|
|
||||||
for (k = 0; k < 4; k++)
|
|
||||||
dG[k] /= H[k][k];
|
|
||||||
/* back substitution */
|
|
||||||
dG[2] -= dG[3] * H[2][3];
|
|
||||||
dG[1] -= dG[3] * H[1][3] + dG[2] * H[1][2];
|
|
||||||
dG[0] -= dG[3] * H[0][3] + dG[2] * H[0][2] + dG[1] * H[0][1];
|
|
||||||
|
|
||||||
/* update gains and check range */
|
|
||||||
for (k = 0; k < 4; k++) {
|
|
||||||
gains[k] += dG[k];
|
|
||||||
if (gains[k] > PITCH_MAX_GAIN)
|
|
||||||
gains[k] = PITCH_MAX_GAIN;
|
|
||||||
else if (gains[k] < 0.0)
|
|
||||||
gains[k] = 0.0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* update state for next frame */
|
|
||||||
WebRtcIsac_PitchfilterPre(Whitened, out, &(State->PFstr_wght), lags, gains);
|
|
||||||
|
|
||||||
/* concatenate previous input's end and current input */
|
|
||||||
memcpy(inbuf, State->inbuf, sizeof(double) * QLOOKAHEAD);
|
|
||||||
memcpy(inbuf+QLOOKAHEAD, in, sizeof(double) * PITCH_FRAME_LEN);
|
|
||||||
|
|
||||||
/* lookahead pitch filtering for masking analysis */
|
|
||||||
WebRtcIsac_PitchfilterPre_la(inbuf, out, &(State->PFstr), lags, gains);
|
|
||||||
|
|
||||||
/* store last part of input */
|
|
||||||
for (k = 0; k < QLOOKAHEAD; k++)
|
|
||||||
State->inbuf[k] = inbuf[k + PITCH_FRAME_LEN];
|
|
||||||
}
|
|
||||||
|
|
@ -1,71 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* pitch_estimator.h
|
|
||||||
*
|
|
||||||
* Pitch functions
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_PITCH_ESTIMATOR_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_PITCH_ESTIMATOR_H_
|
|
||||||
|
|
||||||
#include "structs.h"
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_PitchAnalysis(const double *in, /* PITCH_FRAME_LEN samples */
|
|
||||||
double *out, /* PITCH_FRAME_LEN+QLOOKAHEAD samples */
|
|
||||||
PitchAnalysisStruct *State,
|
|
||||||
double *lags,
|
|
||||||
double *gains);
|
|
||||||
|
|
||||||
void WebRtcIsac_InitializePitch(const double *in,
|
|
||||||
const double old_lag,
|
|
||||||
const double old_gain,
|
|
||||||
PitchAnalysisStruct *State,
|
|
||||||
double *lags);
|
|
||||||
|
|
||||||
void WebRtcIsac_PitchfilterPre(double *indat,
|
|
||||||
double *outdat,
|
|
||||||
PitchFiltstr *pfp,
|
|
||||||
double *lags,
|
|
||||||
double *gains);
|
|
||||||
|
|
||||||
void WebRtcIsac_PitchfilterPost(double *indat,
|
|
||||||
double *outdat,
|
|
||||||
PitchFiltstr *pfp,
|
|
||||||
double *lags,
|
|
||||||
double *gains);
|
|
||||||
|
|
||||||
void WebRtcIsac_PitchfilterPre_la(double *indat,
|
|
||||||
double *outdat,
|
|
||||||
PitchFiltstr *pfp,
|
|
||||||
double *lags,
|
|
||||||
double *gains);
|
|
||||||
|
|
||||||
void WebRtcIsac_PitchfilterPre_gains(double *indat,
|
|
||||||
double *outdat,
|
|
||||||
double out_dG[][PITCH_FRAME_LEN + QLOOKAHEAD],
|
|
||||||
PitchFiltstr *pfp,
|
|
||||||
double *lags,
|
|
||||||
double *gains);
|
|
||||||
|
|
||||||
void WebRtcIsac_WeightingFilter(const double *in, double *weiout, double *whiout, WeightFiltstr *wfdata);
|
|
||||||
|
|
||||||
void WebRtcIsac_Highpass(const double *in, double *out, double *state, int N);
|
|
||||||
|
|
||||||
void WebRtcIsac_DecimateAllpass(const double *in,
|
|
||||||
double *state_in, /* array of size: 2*ALLPASSSECTIONS+1 */
|
|
||||||
int N, /* number of input samples */
|
|
||||||
double *out); /* array of size N/2 */
|
|
||||||
|
|
||||||
#endif /* WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_PITCH_ESTIMATOR_H_ */
|
|
||||||
|
|
@ -1,469 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "pitch_estimator.h"
|
|
||||||
#include "os_specific_inline.h"
|
|
||||||
|
|
||||||
#include <stdlib.h>
|
|
||||||
#include <memory.h>
|
|
||||||
#include <math.h>
|
|
||||||
|
|
||||||
static const double kDampFilter[PITCH_DAMPORDER] = {-0.07, 0.25, 0.64, 0.25, -0.07};
|
|
||||||
|
|
||||||
/* interpolation coefficients; generated by design_pitch_filter.m */
|
|
||||||
static const double kIntrpCoef[PITCH_FRACS][PITCH_FRACORDER] = {
|
|
||||||
{-0.02239172458614, 0.06653315052934, -0.16515880017569, 0.60701333734125, 0.64671399919202, -0.20249000396417, 0.09926548334755, -0.04765933793109, 0.01754159521746},
|
|
||||||
{-0.01985640750434, 0.05816126837866, -0.13991265473714, 0.44560418147643, 0.79117042386876, -0.20266133815188, 0.09585268418555, -0.04533310458084, 0.01654127246314},
|
|
||||||
{-0.01463300534216, 0.04229888475060, -0.09897034715253, 0.28284326017787, 0.90385267956632, -0.16976950138649, 0.07704272393639, -0.03584218578311, 0.01295781500709},
|
|
||||||
{-0.00764851320885, 0.02184035544377, -0.04985561057281, 0.13083306574393, 0.97545011664662, -0.10177807997561, 0.04400901776474, -0.02010737175166, 0.00719783432422},
|
|
||||||
{-0.00000000000000, 0.00000000000000, -0.00000000000001, 0.00000000000001, 0.99999999999999, 0.00000000000001, -0.00000000000001, 0.00000000000000, -0.00000000000000},
|
|
||||||
{ 0.00719783432422, -0.02010737175166, 0.04400901776474, -0.10177807997562, 0.97545011664663, 0.13083306574393, -0.04985561057280, 0.02184035544377, -0.00764851320885},
|
|
||||||
{ 0.01295781500710, -0.03584218578312, 0.07704272393640, -0.16976950138650, 0.90385267956634, 0.28284326017785, -0.09897034715252, 0.04229888475059, -0.01463300534216},
|
|
||||||
{ 0.01654127246315, -0.04533310458085, 0.09585268418557, -0.20266133815190, 0.79117042386878, 0.44560418147640, -0.13991265473712, 0.05816126837865, -0.01985640750433}
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_PitchfilterPre(double *indat,
|
|
||||||
double *outdat,
|
|
||||||
PitchFiltstr *pfp,
|
|
||||||
double *lags,
|
|
||||||
double *gains)
|
|
||||||
{
|
|
||||||
|
|
||||||
double ubuf[PITCH_INTBUFFSIZE];
|
|
||||||
const double *fracoeff = NULL;
|
|
||||||
double curgain, curlag, gaindelta, lagdelta;
|
|
||||||
double sum, inystate[PITCH_DAMPORDER];
|
|
||||||
double ftmp, oldlag, oldgain;
|
|
||||||
int k, n, m, pos, ind, pos2, Li, frc;
|
|
||||||
|
|
||||||
Li = 0;
|
|
||||||
/* Set up buffer and states */
|
|
||||||
memcpy(ubuf, pfp->ubuf, sizeof(double) * PITCH_BUFFSIZE);
|
|
||||||
memcpy(inystate, pfp->ystate, sizeof(double) * PITCH_DAMPORDER);
|
|
||||||
|
|
||||||
oldlag = *pfp->oldlagp;
|
|
||||||
oldgain = *pfp->oldgainp;
|
|
||||||
|
|
||||||
/* No interpolation if pitch lag step is big */
|
|
||||||
if ((lags[0] > (PITCH_UPSTEP * oldlag)) || (lags[0] < (PITCH_DOWNSTEP * oldlag))) {
|
|
||||||
oldlag = lags[0];
|
|
||||||
oldgain = gains[0];
|
|
||||||
}
|
|
||||||
|
|
||||||
ind=0;
|
|
||||||
for (k=0;k<PITCH_SUBFRAMES;k++) {
|
|
||||||
|
|
||||||
/* Calculate interpolation steps */
|
|
||||||
lagdelta=(lags[k]-oldlag) / PITCH_GRAN_PER_SUBFRAME;
|
|
||||||
curlag=oldlag ;
|
|
||||||
gaindelta=(gains[k]-oldgain) / PITCH_GRAN_PER_SUBFRAME;
|
|
||||||
curgain=oldgain ;
|
|
||||||
oldlag=lags[k];
|
|
||||||
oldgain=gains[k];
|
|
||||||
|
|
||||||
for (n=0;n<PITCH_SUBFRAME_LEN;n++) {
|
|
||||||
if ((ind % PITCH_UPDATE) == 0) { /* Update parameters */
|
|
||||||
curgain += gaindelta;
|
|
||||||
curlag += lagdelta;
|
|
||||||
Li = WebRtcIsac_lrint(curlag+PITCH_FILTDELAY + 0.5);
|
|
||||||
ftmp = Li - (curlag+PITCH_FILTDELAY);
|
|
||||||
frc = WebRtcIsac_lrint(PITCH_FRACS * ftmp - 0.5);
|
|
||||||
fracoeff = kIntrpCoef[frc];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* shift low pass filter state */
|
|
||||||
for (m=PITCH_DAMPORDER-1;m>0;m--)
|
|
||||||
inystate[m] = inystate[m-1];
|
|
||||||
|
|
||||||
/* Filter to get fractional pitch */
|
|
||||||
pos = ind + PITCH_BUFFSIZE;
|
|
||||||
pos2 = pos - Li;
|
|
||||||
sum=0;
|
|
||||||
for (m=0;m<PITCH_FRACORDER;m++)
|
|
||||||
sum += ubuf[pos2+m] * fracoeff[m];
|
|
||||||
inystate[0] = curgain * sum; /* Multiply with gain */
|
|
||||||
|
|
||||||
/* Low pass filter */
|
|
||||||
sum=0;
|
|
||||||
for (m=0;m<PITCH_DAMPORDER;m++)
|
|
||||||
sum += inystate[m] * kDampFilter[m];
|
|
||||||
|
|
||||||
/* Subtract from input and update buffer */
|
|
||||||
outdat[ind] = indat[ind] - sum;
|
|
||||||
ubuf[pos] = indat[ind] + outdat[ind];
|
|
||||||
ind++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Export buffer and states */
|
|
||||||
memcpy(pfp->ubuf, ubuf+PITCH_FRAME_LEN, sizeof(double) * PITCH_BUFFSIZE);
|
|
||||||
memcpy(pfp->ystate, inystate, sizeof(double) * PITCH_DAMPORDER);
|
|
||||||
|
|
||||||
*pfp->oldlagp = oldlag;
|
|
||||||
*pfp->oldgainp = oldgain;
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_PitchfilterPre_la(double *indat,
|
|
||||||
double *outdat,
|
|
||||||
PitchFiltstr *pfp,
|
|
||||||
double *lags,
|
|
||||||
double *gains)
|
|
||||||
{
|
|
||||||
double ubuf[PITCH_INTBUFFSIZE+QLOOKAHEAD];
|
|
||||||
const double *fracoeff = NULL;
|
|
||||||
double curgain, curlag, gaindelta, lagdelta;
|
|
||||||
double sum, inystate[PITCH_DAMPORDER];
|
|
||||||
double ftmp;
|
|
||||||
double oldlag, oldgain;
|
|
||||||
int k, n, m, pos, ind, pos2, Li, frc;
|
|
||||||
|
|
||||||
Li = 0;
|
|
||||||
/* Set up buffer and states */
|
|
||||||
memcpy(ubuf, pfp->ubuf, sizeof(double) * PITCH_BUFFSIZE);
|
|
||||||
memcpy(inystate, pfp->ystate, sizeof(double) * PITCH_DAMPORDER);
|
|
||||||
|
|
||||||
oldlag = *pfp->oldlagp;
|
|
||||||
oldgain = *pfp->oldgainp;
|
|
||||||
|
|
||||||
/* No interpolation if pitch lag step is big */
|
|
||||||
if ((lags[0] > (PITCH_UPSTEP * oldlag)) || (lags[0] < (PITCH_DOWNSTEP * oldlag))) {
|
|
||||||
oldlag = lags[0];
|
|
||||||
oldgain = gains[0];
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
ind=0;
|
|
||||||
for (k=0;k<PITCH_SUBFRAMES;k++) {
|
|
||||||
|
|
||||||
/* Calculate interpolation steps */
|
|
||||||
lagdelta=(lags[k]-oldlag) / PITCH_GRAN_PER_SUBFRAME;
|
|
||||||
curlag=oldlag ;
|
|
||||||
gaindelta=(gains[k]-oldgain) / PITCH_GRAN_PER_SUBFRAME;
|
|
||||||
curgain=oldgain ;
|
|
||||||
oldlag=lags[k];
|
|
||||||
oldgain=gains[k];
|
|
||||||
|
|
||||||
for (n=0;n<PITCH_SUBFRAME_LEN;n++) {
|
|
||||||
if ((ind % PITCH_UPDATE) == 0) { /* Update parameters */
|
|
||||||
curgain += gaindelta;
|
|
||||||
curlag += lagdelta;
|
|
||||||
Li = WebRtcIsac_lrint(curlag+PITCH_FILTDELAY + 0.5);
|
|
||||||
ftmp = Li - (curlag+PITCH_FILTDELAY);
|
|
||||||
frc = WebRtcIsac_lrint(PITCH_FRACS * ftmp - 0.5);
|
|
||||||
fracoeff = kIntrpCoef[frc];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* shift low pass filter state */
|
|
||||||
for (m=PITCH_DAMPORDER-1;m>0;m--)
|
|
||||||
inystate[m] = inystate[m-1];
|
|
||||||
|
|
||||||
/* Filter to get fractional pitch */
|
|
||||||
pos = ind + PITCH_BUFFSIZE;
|
|
||||||
pos2 = pos - Li;
|
|
||||||
sum=0.0;
|
|
||||||
for (m=0;m<PITCH_FRACORDER;m++)
|
|
||||||
sum += ubuf[pos2+m] * fracoeff[m];
|
|
||||||
inystate[0] = curgain * sum; /* Multiply with gain */
|
|
||||||
|
|
||||||
/* Low pass filter */
|
|
||||||
sum=0.0;
|
|
||||||
for (m=0;m<PITCH_DAMPORDER;m++)
|
|
||||||
sum += inystate[m] * kDampFilter[m];
|
|
||||||
|
|
||||||
/* Subtract from input and update buffer */
|
|
||||||
outdat[ind] = indat[ind] - sum;
|
|
||||||
ubuf[pos] = indat[ind] + outdat[ind];
|
|
||||||
ind++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Export buffer and states */
|
|
||||||
memcpy(pfp->ubuf, ubuf+PITCH_FRAME_LEN, sizeof(double) * PITCH_BUFFSIZE);
|
|
||||||
memcpy(pfp->ystate, inystate, sizeof(double) * PITCH_DAMPORDER);
|
|
||||||
|
|
||||||
*pfp->oldlagp = oldlag;
|
|
||||||
*pfp->oldgainp = oldgain;
|
|
||||||
|
|
||||||
|
|
||||||
/* Filter look-ahead segment */
|
|
||||||
for (n=0;n<QLOOKAHEAD;n++) {
|
|
||||||
/* shift low pass filter state */
|
|
||||||
for (m=PITCH_DAMPORDER-1;m>0;m--)
|
|
||||||
inystate[m] = inystate[m-1];
|
|
||||||
|
|
||||||
/* Filter to get fractional pitch */
|
|
||||||
pos = ind + PITCH_BUFFSIZE;
|
|
||||||
pos2 = pos - Li;
|
|
||||||
sum=0.0;
|
|
||||||
for (m=0;m<PITCH_FRACORDER;m++)
|
|
||||||
sum += ubuf[pos2+m] * fracoeff[m];
|
|
||||||
inystate[0] = curgain * sum; /* Multiply with gain */
|
|
||||||
|
|
||||||
/* Low pass filter */
|
|
||||||
sum=0.0;
|
|
||||||
for (m=0;m<PITCH_DAMPORDER;m++)
|
|
||||||
sum += inystate[m] * kDampFilter[m];
|
|
||||||
|
|
||||||
/* Subtract from input and update buffer */
|
|
||||||
outdat[ind] = indat[ind] - sum;
|
|
||||||
ubuf[pos] = indat[ind] + outdat[ind];
|
|
||||||
ind++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_PitchfilterPre_gains(double *indat,
|
|
||||||
double *outdat,
|
|
||||||
double out_dG[][PITCH_FRAME_LEN + QLOOKAHEAD],
|
|
||||||
PitchFiltstr *pfp,
|
|
||||||
double *lags,
|
|
||||||
double *gains)
|
|
||||||
{
|
|
||||||
double ubuf[PITCH_INTBUFFSIZE+QLOOKAHEAD];
|
|
||||||
double inystate_dG[4][PITCH_DAMPORDER];
|
|
||||||
double gain_mult[4];
|
|
||||||
const double *fracoeff = NULL;
|
|
||||||
double curgain, curlag, gaindelta, lagdelta;
|
|
||||||
double sum, sum2, inystate[PITCH_DAMPORDER];
|
|
||||||
double ftmp, oldlag, oldgain;
|
|
||||||
int k, n, m, m_tmp, j, pos, ind, pos2, Li, frc;
|
|
||||||
|
|
||||||
Li = 0;
|
|
||||||
|
|
||||||
/* Set up buffer and states */
|
|
||||||
memcpy(ubuf, pfp->ubuf, sizeof(double) * PITCH_BUFFSIZE);
|
|
||||||
memcpy(inystate, pfp->ystate, sizeof(double) * PITCH_DAMPORDER);
|
|
||||||
|
|
||||||
/* clear some buffers */
|
|
||||||
for (k = 0; k < 4; k++) {
|
|
||||||
gain_mult[k] = 0.0;
|
|
||||||
for (n = 0; n < PITCH_DAMPORDER; n++)
|
|
||||||
inystate_dG[k][n] = 0.0;
|
|
||||||
}
|
|
||||||
|
|
||||||
oldlag = *pfp->oldlagp;
|
|
||||||
oldgain = *pfp->oldgainp;
|
|
||||||
|
|
||||||
/* No interpolation if pitch lag step is big */
|
|
||||||
if ((lags[0] > (PITCH_UPSTEP * oldlag)) || (lags[0] < (PITCH_DOWNSTEP * oldlag))) {
|
|
||||||
oldlag = lags[0];
|
|
||||||
oldgain = gains[0];
|
|
||||||
gain_mult[0] = 1.0;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
ind=0;
|
|
||||||
for (k=0;k<PITCH_SUBFRAMES;k++) {
|
|
||||||
|
|
||||||
/* Calculate interpolation steps */
|
|
||||||
lagdelta=(lags[k]-oldlag) / PITCH_GRAN_PER_SUBFRAME;
|
|
||||||
curlag=oldlag ;
|
|
||||||
gaindelta=(gains[k]-oldgain) / PITCH_GRAN_PER_SUBFRAME;
|
|
||||||
curgain=oldgain ;
|
|
||||||
oldlag=lags[k];
|
|
||||||
oldgain=gains[k];
|
|
||||||
|
|
||||||
for (n=0;n<PITCH_SUBFRAME_LEN;n++) {
|
|
||||||
if ((ind % PITCH_UPDATE) == 0) { /* Update parameters */
|
|
||||||
curgain += gaindelta;
|
|
||||||
curlag += lagdelta;
|
|
||||||
Li = WebRtcIsac_lrint(curlag+PITCH_FILTDELAY + 0.5);
|
|
||||||
ftmp = Li - (curlag+PITCH_FILTDELAY);
|
|
||||||
frc = WebRtcIsac_lrint(PITCH_FRACS * ftmp - 0.5);
|
|
||||||
fracoeff = kIntrpCoef[frc];
|
|
||||||
gain_mult[k] += 0.2;
|
|
||||||
if (gain_mult[k] > 1.0) gain_mult[k] = 1.0;
|
|
||||||
if (k > 0) gain_mult[k-1] -= 0.2;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* shift low pass filter states */
|
|
||||||
for (m=PITCH_DAMPORDER-1;m>0;m--) {
|
|
||||||
inystate[m] = inystate[m-1];
|
|
||||||
for (j = 0; j < 4; j++)
|
|
||||||
inystate_dG[j][m] = inystate_dG[j][m-1];
|
|
||||||
}
|
|
||||||
|
|
||||||
pos = ind + PITCH_BUFFSIZE;
|
|
||||||
pos2 = pos - Li;
|
|
||||||
|
|
||||||
/* Filter to get fractional pitch */
|
|
||||||
sum=0.0;
|
|
||||||
for (m=0;m<PITCH_FRACORDER;m++)
|
|
||||||
sum += ubuf[pos2+m] * fracoeff[m];
|
|
||||||
inystate[0] = curgain * sum; /* Multiply with gain */
|
|
||||||
m_tmp = (Li-ind > 0) ? Li-ind : 0;
|
|
||||||
for (j = 0; j < k+1; j++) {
|
|
||||||
/* filter */
|
|
||||||
sum2 = 0.0;
|
|
||||||
for (m = PITCH_FRACORDER-1; m >= m_tmp; m--)
|
|
||||||
sum2 += out_dG[j][ind-Li + m] * fracoeff[m];
|
|
||||||
inystate_dG[j][0] = gain_mult[j] * sum + curgain * sum2;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Low pass filter */
|
|
||||||
sum=0.0;
|
|
||||||
for (m=0;m<PITCH_DAMPORDER;m++)
|
|
||||||
sum += inystate[m] * kDampFilter[m];
|
|
||||||
|
|
||||||
/* Subtract from input and update buffer */
|
|
||||||
outdat[ind] = indat[ind] - sum;
|
|
||||||
ubuf[pos] = indat[ind] + outdat[ind];
|
|
||||||
|
|
||||||
for (j = 0; j < k+1; j++) {
|
|
||||||
sum = 0.0;
|
|
||||||
for (m=0;m<PITCH_DAMPORDER;m++)
|
|
||||||
sum -= inystate_dG[j][m] * kDampFilter[m];
|
|
||||||
out_dG[j][ind] = sum;
|
|
||||||
}
|
|
||||||
for (j = k+1; j < 4; j++)
|
|
||||||
out_dG[j][ind] = 0.0;
|
|
||||||
|
|
||||||
|
|
||||||
ind++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Filter look-ahead segment */
|
|
||||||
for (n=0;n<QLOOKAHEAD;n++) {
|
|
||||||
/* shift low pass filter states */
|
|
||||||
for (m=PITCH_DAMPORDER-1;m>0;m--) {
|
|
||||||
inystate[m] = inystate[m-1];
|
|
||||||
for (j = 0; j < 4; j++)
|
|
||||||
inystate_dG[j][m] = inystate_dG[j][m-1];
|
|
||||||
}
|
|
||||||
|
|
||||||
pos = ind + PITCH_BUFFSIZE;
|
|
||||||
pos2 = pos - Li;
|
|
||||||
|
|
||||||
/* Filter to get fractional pitch */
|
|
||||||
sum=0.0;
|
|
||||||
for (m=0;m<PITCH_FRACORDER;m++)
|
|
||||||
sum += ubuf[pos2+m] * fracoeff[m];
|
|
||||||
inystate[0] = curgain * sum; /* Multiply with gain */
|
|
||||||
m_tmp = (Li-ind > 0) ? Li-ind : 0;
|
|
||||||
for (j = 0; (j<k+1)&&(j<4); j++) {
|
|
||||||
/* filter */
|
|
||||||
sum2 = 0.0;
|
|
||||||
for (m = PITCH_FRACORDER-1; m >= m_tmp; m--)
|
|
||||||
sum2 += out_dG[j][ind-Li + m] * fracoeff[m];
|
|
||||||
inystate_dG[j][0] = gain_mult[j] * sum + curgain * sum2;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Low pass filter */
|
|
||||||
sum=0.0;
|
|
||||||
for (m=0;m<PITCH_DAMPORDER;m++)
|
|
||||||
sum += inystate[m] * kDampFilter[m];
|
|
||||||
|
|
||||||
/* Subtract from input and update buffer */
|
|
||||||
outdat[ind] = indat[ind] - sum;
|
|
||||||
ubuf[pos] = indat[ind] + outdat[ind];
|
|
||||||
|
|
||||||
for (j = 0; (j<k+1)&&(j<4); j++) {
|
|
||||||
sum = 0.0;
|
|
||||||
for (m=0;m<PITCH_DAMPORDER;m++)
|
|
||||||
sum -= inystate_dG[j][m] * kDampFilter[m];
|
|
||||||
out_dG[j][ind] = sum;
|
|
||||||
}
|
|
||||||
|
|
||||||
ind++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcIsac_PitchfilterPost(double *indat,
|
|
||||||
double *outdat,
|
|
||||||
PitchFiltstr *pfp,
|
|
||||||
double *lags,
|
|
||||||
double *gains)
|
|
||||||
{
|
|
||||||
|
|
||||||
double ubuf[PITCH_INTBUFFSIZE];
|
|
||||||
const double *fracoeff = NULL;
|
|
||||||
double curgain, curlag, gaindelta, lagdelta;
|
|
||||||
double sum, inystate[PITCH_DAMPORDER];
|
|
||||||
double ftmp, oldlag, oldgain;
|
|
||||||
int k, n, m, pos, ind, pos2, Li, frc;
|
|
||||||
|
|
||||||
Li = 0;
|
|
||||||
|
|
||||||
/* Set up buffer and states */
|
|
||||||
memcpy(ubuf, pfp->ubuf, sizeof(double) * PITCH_BUFFSIZE);
|
|
||||||
memcpy(inystate, pfp->ystate, sizeof(double) * PITCH_DAMPORDER);
|
|
||||||
|
|
||||||
oldlag = *pfp->oldlagp;
|
|
||||||
oldgain = *pfp->oldgainp;
|
|
||||||
|
|
||||||
/* make output more periodic */
|
|
||||||
for (k=0;k<PITCH_SUBFRAMES;k++)
|
|
||||||
gains[k] *= 1.3;
|
|
||||||
|
|
||||||
/* No interpolation if pitch lag step is big */
|
|
||||||
if ((lags[0] > (PITCH_UPSTEP * oldlag)) || (lags[0] < (PITCH_DOWNSTEP * oldlag))) {
|
|
||||||
oldlag = lags[0];
|
|
||||||
oldgain = gains[0];
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
ind=0;
|
|
||||||
for (k=0;k<PITCH_SUBFRAMES;k++) {
|
|
||||||
|
|
||||||
/* Calculate interpolation steps */
|
|
||||||
lagdelta=(lags[k]-oldlag) / PITCH_GRAN_PER_SUBFRAME;
|
|
||||||
curlag=oldlag ;
|
|
||||||
gaindelta=(gains[k]-oldgain) / PITCH_GRAN_PER_SUBFRAME;
|
|
||||||
curgain=oldgain ;
|
|
||||||
oldlag=lags[k];
|
|
||||||
oldgain=gains[k];
|
|
||||||
|
|
||||||
for (n=0;n<PITCH_SUBFRAME_LEN;n++) {
|
|
||||||
if ((ind % PITCH_UPDATE) == 0) { /* Update parameters */
|
|
||||||
curgain += gaindelta;
|
|
||||||
curlag += lagdelta;
|
|
||||||
Li = WebRtcIsac_lrint(curlag+PITCH_FILTDELAY + 0.5);
|
|
||||||
ftmp = Li - (curlag+PITCH_FILTDELAY);
|
|
||||||
frc = WebRtcIsac_lrint(PITCH_FRACS * ftmp - 0.5);
|
|
||||||
fracoeff = kIntrpCoef[frc];
|
|
||||||
}
|
|
||||||
|
|
||||||
/* shift low pass filter state */
|
|
||||||
for (m=PITCH_DAMPORDER-1;m>0;m--)
|
|
||||||
inystate[m] = inystate[m-1];
|
|
||||||
|
|
||||||
/* Filter to get fractional pitch */
|
|
||||||
pos = ind + PITCH_BUFFSIZE;
|
|
||||||
pos2 = pos - Li;
|
|
||||||
sum=0.0;
|
|
||||||
for (m=0;m<PITCH_FRACORDER;m++)
|
|
||||||
sum += ubuf[pos2+m] * fracoeff[m];
|
|
||||||
inystate[0] = curgain * sum; /* Multiply with gain */
|
|
||||||
|
|
||||||
/* Low pass filter */
|
|
||||||
sum=0.0;
|
|
||||||
for (m=0;m<PITCH_DAMPORDER;m++)
|
|
||||||
sum += inystate[m] * kDampFilter[m];
|
|
||||||
|
|
||||||
/* Add to input and update buffer */
|
|
||||||
outdat[ind] = indat[ind] + sum;
|
|
||||||
ubuf[pos] = indat[ind] + outdat[ind];
|
|
||||||
ind++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Export buffer and states */
|
|
||||||
memcpy(pfp->ubuf, ubuf+PITCH_FRAME_LEN, sizeof(double) * PITCH_BUFFSIZE);
|
|
||||||
memcpy(pfp->ystate, inystate, sizeof(double) * PITCH_DAMPORDER);
|
|
||||||
|
|
||||||
*pfp->oldlagp = oldlag;
|
|
||||||
*pfp->oldgainp = oldgain;
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
@ -1,105 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "pitch_gain_tables.h"
|
|
||||||
|
|
||||||
#include "settings.h"
|
|
||||||
|
|
||||||
/* header file for coding tables for the pitch filter side-info in the entropy coder */
|
|
||||||
/********************* Pitch Filter Gain Coefficient Tables ************************/
|
|
||||||
/* cdf for quantized pitch filter gains */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchGainCdf[255] = {
|
|
||||||
0, 2, 4, 6, 64, 901, 903, 905, 16954, 16956,
|
|
||||||
16961, 17360, 17362, 17364, 17366, 17368, 17370, 17372, 17374, 17411,
|
|
||||||
17514, 17516, 17583, 18790, 18796, 18802, 20760, 20777, 20782, 21722,
|
|
||||||
21724, 21728, 21738, 21740, 21742, 21744, 21746, 21748, 22224, 22227,
|
|
||||||
22230, 23214, 23229, 23239, 25086, 25108, 25120, 26088, 26094, 26098,
|
|
||||||
26175, 26177, 26179, 26181, 26183, 26185, 26484, 26507, 26522, 27705,
|
|
||||||
27731, 27750, 29767, 29799, 29817, 30866, 30883, 30885, 31025, 31029,
|
|
||||||
31031, 31033, 31035, 31037, 31114, 31126, 31134, 32687, 32722, 32767,
|
|
||||||
35718, 35742, 35757, 36943, 36952, 36954, 37115, 37128, 37130, 37132,
|
|
||||||
37134, 37136, 37143, 37145, 37152, 38843, 38863, 38897, 47458, 47467,
|
|
||||||
47474, 49040, 49061, 49063, 49145, 49157, 49159, 49161, 49163, 49165,
|
|
||||||
49167, 49169, 49171, 49757, 49770, 49782, 61333, 61344, 61346, 62860,
|
|
||||||
62883, 62885, 62887, 62889, 62891, 62893, 62895, 62897, 62899, 62901,
|
|
||||||
62903, 62905, 62907, 62909, 65496, 65498, 65500, 65521, 65523, 65525,
|
|
||||||
65527, 65529, 65531, 65533, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535, 65535, 65535, 65535, 65535};
|
|
||||||
|
|
||||||
/* index limits and ranges */
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kIndexLowerLimitGain[3] = {
|
|
||||||
-7, -2, -1};
|
|
||||||
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kIndexUpperLimitGain[3] = {
|
|
||||||
0, 3, 1};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kIndexMultsGain[2] = {
|
|
||||||
18, 3};
|
|
||||||
|
|
||||||
/* size of cdf table */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQCdfTableSizeGain[1] = {
|
|
||||||
256};
|
|
||||||
|
|
||||||
///////////////////////////FIXED POINT
|
|
||||||
/* mean values of pitch filter gains in FIXED point */
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQMeanGain1Q12[144] = {
|
|
||||||
843, 1092, 1336, 1222, 1405, 1656, 1500, 1815, 1843, 1838, 1839, 1843, 1843, 1843, 1843, 1843,
|
|
||||||
1843, 1843, 814, 846, 1092, 1013, 1174, 1383, 1391, 1511, 1584, 1734, 1753, 1843, 1843, 1843,
|
|
||||||
1843, 1843, 1843, 1843, 524, 689, 777, 845, 947, 1069, 1090, 1263, 1380, 1447, 1559, 1676,
|
|
||||||
1645, 1749, 1843, 1843, 1843, 1843, 81, 477, 563, 611, 706, 806, 849, 1012, 1192, 1128,
|
|
||||||
1330, 1489, 1425, 1576, 1826, 1741, 1843, 1843, 0, 290, 305, 356, 488, 575, 602, 741,
|
|
||||||
890, 835, 1079, 1196, 1182, 1376, 1519, 1506, 1680, 1843, 0, 47, 97, 69, 289, 381,
|
|
||||||
385, 474, 617, 664, 803, 1079, 935, 1160, 1269, 1265, 1506, 1741, 0, 0, 0, 0,
|
|
||||||
112, 120, 190, 283, 442, 343, 526, 809, 684, 935, 1134, 1020, 1265, 1506, 0, 0,
|
|
||||||
0, 0, 0, 0, 0, 111, 256, 87, 373, 597, 430, 684, 935, 770, 1020, 1265};
|
|
||||||
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQMeanGain2Q12[144] = {
|
|
||||||
1760, 1525, 1285, 1747, 1671, 1393, 1843, 1826, 1555, 1843, 1784, 1606, 1843, 1843, 1711, 1843,
|
|
||||||
1843, 1814, 1389, 1275, 1040, 1564, 1414, 1252, 1610, 1495, 1343, 1753, 1592, 1405, 1804, 1720,
|
|
||||||
1475, 1843, 1814, 1581, 1208, 1061, 856, 1349, 1148, 994, 1390, 1253, 1111, 1495, 1343, 1178,
|
|
||||||
1770, 1465, 1234, 1814, 1581, 1342, 1040, 793, 713, 1053, 895, 737, 1128, 1003, 861, 1277,
|
|
||||||
1094, 981, 1475, 1192, 1019, 1581, 1342, 1098, 855, 570, 483, 833, 648, 540, 948, 744,
|
|
||||||
572, 1009, 844, 636, 1234, 934, 685, 1342, 1217, 984, 537, 318, 124, 603, 423, 350,
|
|
||||||
687, 479, 322, 791, 581, 430, 987, 671, 488, 1098, 849, 597, 283, 27, 0, 397,
|
|
||||||
222, 38, 513, 271, 124, 624, 325, 157, 737, 484, 233, 849, 597, 343, 27, 0,
|
|
||||||
0, 141, 0, 0, 256, 69, 0, 370, 87, 0, 484, 229, 0, 597, 343, 87};
|
|
||||||
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQMeanGain3Q12[144] = {
|
|
||||||
1843, 1843, 1711, 1843, 1818, 1606, 1843, 1827, 1511, 1814, 1639, 1393, 1760, 1525, 1285, 1656,
|
|
||||||
1419, 1176, 1835, 1718, 1475, 1841, 1650, 1387, 1648, 1498, 1287, 1600, 1411, 1176, 1522, 1299,
|
|
||||||
1040, 1419, 1176, 928, 1773, 1461, 1128, 1532, 1355, 1202, 1429, 1260, 1115, 1398, 1151, 1025,
|
|
||||||
1172, 1080, 790, 1176, 928, 677, 1475, 1147, 1019, 1276, 1096, 922, 1214, 1010, 901, 1057,
|
|
||||||
893, 800, 1040, 796, 734, 928, 677, 424, 1137, 897, 753, 1120, 830, 710, 875, 751,
|
|
||||||
601, 795, 642, 583, 790, 544, 475, 677, 474, 140, 987, 750, 482, 697, 573, 450,
|
|
||||||
691, 487, 303, 661, 394, 332, 537, 303, 220, 424, 168, 0, 737, 484, 229, 624,
|
|
||||||
348, 153, 441, 261, 136, 397, 166, 51, 283, 27, 0, 168, 0, 0, 484, 229,
|
|
||||||
0, 370, 57, 0, 256, 43, 0, 141, 0, 0, 27, 0, 0, 0, 0, 0};
|
|
||||||
|
|
||||||
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQMeanGain4Q12[144] = {
|
|
||||||
1843, 1843, 1843, 1843, 1841, 1843, 1500, 1821, 1843, 1222, 1434, 1656, 843, 1092, 1336, 504,
|
|
||||||
757, 1007, 1843, 1843, 1843, 1838, 1791, 1843, 1265, 1505, 1599, 965, 1219, 1425, 730, 821,
|
|
||||||
1092, 249, 504, 757, 1783, 1819, 1843, 1351, 1567, 1727, 1096, 1268, 1409, 805, 961, 1131,
|
|
||||||
444, 670, 843, 0, 249, 504, 1425, 1655, 1743, 1096, 1324, 1448, 822, 1019, 1199, 490,
|
|
||||||
704, 867, 81, 450, 555, 0, 0, 249, 1247, 1428, 1530, 881, 1073, 1283, 610, 759,
|
|
||||||
939, 278, 464, 645, 0, 200, 270, 0, 0, 0, 935, 1163, 1410, 528, 790, 1068,
|
|
||||||
377, 499, 717, 173, 240, 274, 0, 43, 62, 0, 0, 0, 684, 935, 1182, 343,
|
|
||||||
551, 735, 161, 262, 423, 0, 55, 27, 0, 0, 0, 0, 0, 0, 430, 684,
|
|
||||||
935, 87, 377, 597, 0, 46, 256, 0, 0, 0, 0, 0, 0, 0, 0, 0};
|
|
||||||
|
|
@ -1,45 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* pitch_gain_tables.h
|
|
||||||
*
|
|
||||||
* This file contains tables for the pitch filter side-info in the entropy coder.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_PITCH_GAIN_TABLES_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_PITCH_GAIN_TABLES_H_
|
|
||||||
|
|
||||||
#include "typedefs.h"
|
|
||||||
|
|
||||||
/* header file for coding tables for the pitch filter side-info in the entropy coder */
|
|
||||||
/********************* Pitch Filter Gain Coefficient Tables ************************/
|
|
||||||
/* cdf for quantized pitch filter gains */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchGainCdf[255];
|
|
||||||
|
|
||||||
/* index limits and ranges */
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kIndexLowerLimitGain[3];
|
|
||||||
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kIndexUpperLimitGain[3];
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kIndexMultsGain[2];
|
|
||||||
|
|
||||||
/* mean values of pitch filter gains */
|
|
||||||
//(Y)
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kQMeanGain1Q12[144];
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kQMeanGain2Q12[144];
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kQMeanGain3Q12[144];
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kQMeanGain4Q12[144];
|
|
||||||
//(Y)
|
|
||||||
|
|
||||||
/* size of cdf table */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQCdfTableSizeGain[1];
|
|
||||||
|
|
||||||
#endif /* WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_PITCH_GAIN_TABLES_H_ */
|
|
||||||
|
|
@ -1,277 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "pitch_lag_tables.h"
|
|
||||||
#include "settings.h"
|
|
||||||
|
|
||||||
/* header file for coding tables for the pitch filter side-info in the entropy coder */
|
|
||||||
/********************* Pitch Filter Gain Coefficient Tables ************************/
|
|
||||||
|
|
||||||
/* tables for use with small pitch gain */
|
|
||||||
|
|
||||||
/* cdf for quantized pitch filter lags */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf1Lo[127] = {
|
|
||||||
0, 134, 336, 549, 778, 998, 1264, 1512, 1777, 2070,
|
|
||||||
2423, 2794, 3051, 3361, 3708, 3979, 4315, 4610, 4933, 5269,
|
|
||||||
5575, 5896, 6155, 6480, 6816, 7129, 7477, 7764, 8061, 8358,
|
|
||||||
8718, 9020, 9390, 9783, 10177, 10543, 10885, 11342, 11795, 12213,
|
|
||||||
12680, 13096, 13524, 13919, 14436, 14903, 15349, 15795, 16267, 16734,
|
|
||||||
17266, 17697, 18130, 18632, 19080, 19447, 19884, 20315, 20735, 21288,
|
|
||||||
21764, 22264, 22723, 23193, 23680, 24111, 24557, 25022, 25537, 26082,
|
|
||||||
26543, 27090, 27620, 28139, 28652, 29149, 29634, 30175, 30692, 31273,
|
|
||||||
31866, 32506, 33059, 33650, 34296, 34955, 35629, 36295, 36967, 37726,
|
|
||||||
38559, 39458, 40364, 41293, 42256, 43215, 44231, 45253, 46274, 47359,
|
|
||||||
48482, 49678, 50810, 51853, 53016, 54148, 55235, 56263, 57282, 58363,
|
|
||||||
59288, 60179, 61076, 61806, 62474, 63129, 63656, 64160, 64533, 64856,
|
|
||||||
65152, 65535, 65535, 65535, 65535, 65535, 65535};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf2Lo[20] = {
|
|
||||||
0, 429, 3558, 5861, 8558, 11639, 15210, 19502, 24773, 31983,
|
|
||||||
42602, 48567, 52601, 55676, 58160, 60172, 61889, 63235, 65383, 65535};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf3Lo[2] = {
|
|
||||||
0, 65535};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf4Lo[10] = {
|
|
||||||
0, 2966, 6368, 11182, 19431, 37793, 48532, 55353, 60626, 65535};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 *WebRtcIsac_kQPitchLagCdfPtrLo[4] = {WebRtcIsac_kQPitchLagCdf1Lo, WebRtcIsac_kQPitchLagCdf2Lo, WebRtcIsac_kQPitchLagCdf3Lo, WebRtcIsac_kQPitchLagCdf4Lo};
|
|
||||||
|
|
||||||
/* size of first cdf table */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdfSizeLo[1] = {128};
|
|
||||||
|
|
||||||
/* index limits and ranges */
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQIndexLowerLimitLagLo[4] = {
|
|
||||||
-140, -9, 0, -4};
|
|
||||||
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQIndexUpperLimitLagLo[4] = {
|
|
||||||
-20, 9, 0, 4};
|
|
||||||
|
|
||||||
/* initial index for arithmetic decoder */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQInitIndexLagLo[3] = {
|
|
||||||
10, 1, 5};
|
|
||||||
|
|
||||||
/* mean values of pitch filter lags */
|
|
||||||
const double WebRtcIsac_kQMeanLag2Lo[19] = {
|
|
||||||
-17.21385070, -15.82678944, -14.07123081, -12.03003877, -10.01311864, -8.00794627, -5.91162987, -3.89231876, -1.90220980, -0.01879275,
|
|
||||||
1.89144232, 3.88123171, 5.92146992, 7.96435361, 9.98923648, 11.98266347, 13.96101002, 15.74855713, 17.10976611};
|
|
||||||
|
|
||||||
const double WebRtcIsac_kQMeanLag3Lo[1] = {
|
|
||||||
0.00000000};
|
|
||||||
|
|
||||||
const double WebRtcIsac_kQMeanLag4Lo[9] = {
|
|
||||||
-7.76246496, -5.92083980, -3.94095226, -1.89502305, 0.03724681, 1.93054221, 3.96443467, 5.91726366, 7.78434291};
|
|
||||||
|
|
||||||
const double WebRtcIsac_kQPitchLagStepsizeLo = 2.000000;
|
|
||||||
|
|
||||||
|
|
||||||
/* tables for use with medium pitch gain */
|
|
||||||
|
|
||||||
/* cdf for quantized pitch filter lags */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf1Mid[255] = {
|
|
||||||
0, 28, 61, 88, 121, 149, 233, 331, 475, 559,
|
|
||||||
624, 661, 689, 712, 745, 791, 815, 843, 866, 922,
|
|
||||||
959, 1024, 1061, 1117, 1178, 1238, 1280, 1350, 1453, 1513,
|
|
||||||
1564, 1625, 1671, 1741, 1788, 1904, 2072, 2421, 2626, 2770,
|
|
||||||
2840, 2900, 2942, 3012, 3068, 3115, 3147, 3194, 3254, 3319,
|
|
||||||
3366, 3520, 3678, 3780, 3850, 3911, 3957, 4032, 4106, 4185,
|
|
||||||
4292, 4474, 4683, 4842, 5019, 5191, 5321, 5428, 5540, 5675,
|
|
||||||
5763, 5847, 5959, 6127, 6304, 6564, 6839, 7090, 7263, 7421,
|
|
||||||
7556, 7728, 7872, 7984, 8142, 8361, 8580, 8743, 8938, 9227,
|
|
||||||
9409, 9539, 9674, 9795, 9930, 10060, 10177, 10382, 10614, 10861,
|
|
||||||
11038, 11271, 11415, 11629, 11792, 12044, 12193, 12416, 12574, 12821,
|
|
||||||
13007, 13235, 13445, 13654, 13901, 14134, 14488, 15000, 15703, 16285,
|
|
||||||
16504, 16797, 17086, 17328, 17579, 17807, 17998, 18268, 18538, 18836,
|
|
||||||
19087, 19274, 19474, 19716, 19935, 20270, 20833, 21303, 21532, 21741,
|
|
||||||
21978, 22207, 22523, 22770, 23054, 23613, 23943, 24204, 24399, 24651,
|
|
||||||
24832, 25074, 25270, 25549, 25759, 26015, 26150, 26424, 26713, 27048,
|
|
||||||
27342, 27504, 27681, 27854, 28021, 28207, 28412, 28664, 28859, 29064,
|
|
||||||
29278, 29548, 29748, 30107, 30377, 30656, 30856, 31164, 31452, 31755,
|
|
||||||
32011, 32328, 32626, 32919, 33319, 33789, 34329, 34925, 35396, 35973,
|
|
||||||
36443, 36964, 37551, 38156, 38724, 39357, 40023, 40908, 41587, 42602,
|
|
||||||
43924, 45037, 45810, 46597, 47421, 48291, 49092, 50051, 51448, 52719,
|
|
||||||
53440, 54241, 54944, 55977, 56676, 57299, 57872, 58389, 59059, 59688,
|
|
||||||
60237, 60782, 61094, 61573, 61890, 62290, 62658, 63030, 63217, 63454,
|
|
||||||
63622, 63882, 64003, 64273, 64427, 64529, 64581, 64697, 64758, 64902,
|
|
||||||
65414, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535, 65535, 65535, 65535, 65535};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf2Mid[36] = {
|
|
||||||
0, 71, 335, 581, 836, 1039, 1323, 1795, 2258, 2608,
|
|
||||||
3005, 3591, 4243, 5344, 7163, 10583, 16848, 28078, 49448, 57007,
|
|
||||||
60357, 61850, 62837, 63437, 63872, 64188, 64377, 64614, 64774, 64949,
|
|
||||||
65039, 65115, 65223, 65360, 65474, 65535};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf3Mid[2] = {
|
|
||||||
0, 65535};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf4Mid[20] = {
|
|
||||||
0, 28, 246, 459, 667, 1045, 1523, 2337, 4337, 11347,
|
|
||||||
44231, 56709, 60781, 62243, 63161, 63969, 64608, 65062, 65502, 65535};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 *WebRtcIsac_kQPitchLagCdfPtrMid[4] = {WebRtcIsac_kQPitchLagCdf1Mid, WebRtcIsac_kQPitchLagCdf2Mid, WebRtcIsac_kQPitchLagCdf3Mid, WebRtcIsac_kQPitchLagCdf4Mid};
|
|
||||||
|
|
||||||
/* size of first cdf table */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdfSizeMid[1] = {256};
|
|
||||||
|
|
||||||
/* index limits and ranges */
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQIndexLowerLimitLagMid[4] = {
|
|
||||||
-280, -17, 0, -9};
|
|
||||||
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQIndexUpperLimitLagMid[4] = {
|
|
||||||
-40, 17, 0, 9};
|
|
||||||
|
|
||||||
/* initial index for arithmetic decoder */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQInitIndexLagMid[3] = {
|
|
||||||
18, 1, 10};
|
|
||||||
|
|
||||||
/* mean values of pitch filter lags */
|
|
||||||
const double WebRtcIsac_kQMeanLag2Mid[35] = {
|
|
||||||
-16.89183900, -15.86949778, -15.05476653, -14.00664348, -13.02793036, -12.07324237, -11.00542532, -10.11250602, -8.90792971, -8.02474753,
|
|
||||||
-7.00426767, -5.94055287, -4.98251338, -3.91053158, -2.98820425, -1.93524245, -0.92978085, -0.01722509, 0.91317387, 1.92973955,
|
|
||||||
2.96908851, 3.93728974, 4.96308471, 5.92244151, 7.08673497, 8.00993708, 9.04656316, 9.98538742, 10.97851694, 11.94772884,
|
|
||||||
13.02426166, 14.00039951, 15.01347042, 15.80758023, 16.94086895};
|
|
||||||
|
|
||||||
const double WebRtcIsac_kQMeanLag3Mid[1] = {
|
|
||||||
0.00000000};
|
|
||||||
|
|
||||||
const double WebRtcIsac_kQMeanLag4Mid[19] = {
|
|
||||||
-8.60409403, -7.89198395, -7.03450280, -5.86260421, -4.93822322, -3.93078706, -2.91302322, -1.91824007, -0.87003282, 0.02822649,
|
|
||||||
0.89951758, 1.87495484, 2.91802604, 3.96874074, 5.06571703, 5.93618227, 7.00520185, 7.88497726, 8.64160364};
|
|
||||||
|
|
||||||
const double WebRtcIsac_kQPitchLagStepsizeMid = 1.000000;
|
|
||||||
|
|
||||||
|
|
||||||
/* tables for use with large pitch gain */
|
|
||||||
|
|
||||||
/* cdf for quantized pitch filter lags */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf1Hi[511] = {
|
|
||||||
0, 7, 18, 33, 69, 105, 156, 228, 315, 612,
|
|
||||||
680, 691, 709, 724, 735, 738, 742, 746, 749, 753,
|
|
||||||
756, 760, 764, 774, 782, 785, 789, 796, 800, 803,
|
|
||||||
807, 814, 818, 822, 829, 832, 847, 854, 858, 869,
|
|
||||||
876, 883, 898, 908, 934, 977, 1010, 1050, 1060, 1064,
|
|
||||||
1075, 1078, 1086, 1089, 1093, 1104, 1111, 1122, 1133, 1136,
|
|
||||||
1151, 1162, 1183, 1209, 1252, 1281, 1339, 1364, 1386, 1401,
|
|
||||||
1411, 1415, 1426, 1430, 1433, 1440, 1448, 1455, 1462, 1477,
|
|
||||||
1487, 1495, 1502, 1506, 1509, 1516, 1524, 1531, 1535, 1542,
|
|
||||||
1553, 1556, 1578, 1589, 1611, 1625, 1639, 1643, 1654, 1665,
|
|
||||||
1672, 1687, 1694, 1705, 1708, 1719, 1730, 1744, 1752, 1759,
|
|
||||||
1791, 1795, 1820, 1867, 1886, 1915, 1936, 1943, 1965, 1987,
|
|
||||||
2041, 2099, 2161, 2175, 2200, 2211, 2226, 2233, 2244, 2251,
|
|
||||||
2266, 2280, 2287, 2298, 2309, 2316, 2331, 2342, 2356, 2378,
|
|
||||||
2403, 2418, 2447, 2497, 2544, 2602, 2863, 2895, 2903, 2935,
|
|
||||||
2950, 2971, 3004, 3011, 3018, 3029, 3040, 3062, 3087, 3127,
|
|
||||||
3152, 3170, 3199, 3243, 3293, 3322, 3340, 3377, 3402, 3427,
|
|
||||||
3474, 3518, 3543, 3579, 3601, 3637, 3659, 3706, 3731, 3760,
|
|
||||||
3818, 3847, 3869, 3901, 3920, 3952, 4068, 4169, 4220, 4271,
|
|
||||||
4524, 4571, 4604, 4632, 4672, 4730, 4777, 4806, 4857, 4904,
|
|
||||||
4951, 5002, 5031, 5060, 5107, 5150, 5212, 5266, 5331, 5382,
|
|
||||||
5432, 5490, 5544, 5610, 5700, 5762, 5812, 5874, 5972, 6022,
|
|
||||||
6091, 6163, 6232, 6305, 6402, 6540, 6685, 6880, 7090, 7271,
|
|
||||||
7379, 7452, 7542, 7625, 7687, 7770, 7843, 7911, 7966, 8024,
|
|
||||||
8096, 8190, 8252, 8320, 8411, 8501, 8585, 8639, 8751, 8842,
|
|
||||||
8918, 8986, 9066, 9127, 9203, 9269, 9345, 9406, 9464, 9536,
|
|
||||||
9612, 9667, 9735, 9844, 9931, 10036, 10119, 10199, 10260, 10358,
|
|
||||||
10441, 10514, 10666, 10734, 10872, 10951, 11053, 11125, 11223, 11324,
|
|
||||||
11516, 11664, 11737, 11816, 11892, 12008, 12120, 12200, 12280, 12392,
|
|
||||||
12490, 12576, 12685, 12812, 12917, 13003, 13108, 13210, 13300, 13384,
|
|
||||||
13470, 13579, 13673, 13771, 13879, 13999, 14136, 14201, 14368, 14614,
|
|
||||||
14759, 14867, 14958, 15030, 15121, 15189, 15280, 15385, 15461, 15555,
|
|
||||||
15653, 15768, 15884, 15971, 16069, 16145, 16210, 16279, 16380, 16463,
|
|
||||||
16539, 16615, 16688, 16818, 16919, 17017, 18041, 18338, 18523, 18649,
|
|
||||||
18790, 18917, 19047, 19167, 19315, 19460, 19601, 19731, 19858, 20068,
|
|
||||||
20173, 20318, 20466, 20625, 20741, 20911, 21045, 21201, 21396, 21588,
|
|
||||||
21816, 22022, 22305, 22547, 22786, 23072, 23322, 23600, 23879, 24168,
|
|
||||||
24433, 24769, 25120, 25511, 25895, 26289, 26792, 27219, 27683, 28077,
|
|
||||||
28566, 29094, 29546, 29977, 30491, 30991, 31573, 32105, 32594, 33173,
|
|
||||||
33788, 34497, 35181, 35833, 36488, 37255, 37921, 38645, 39275, 39894,
|
|
||||||
40505, 41167, 41790, 42431, 43096, 43723, 44385, 45134, 45858, 46607,
|
|
||||||
47349, 48091, 48768, 49405, 49955, 50555, 51167, 51985, 52611, 53078,
|
|
||||||
53494, 53965, 54435, 54996, 55601, 56125, 56563, 56838, 57244, 57566,
|
|
||||||
57967, 58297, 58771, 59093, 59419, 59647, 59886, 60143, 60461, 60693,
|
|
||||||
60917, 61170, 61416, 61634, 61891, 62122, 62310, 62455, 62632, 62839,
|
|
||||||
63103, 63436, 63639, 63805, 63906, 64015, 64192, 64355, 64475, 64558,
|
|
||||||
64663, 64742, 64811, 64865, 64916, 64956, 64981, 65025, 65068, 65115,
|
|
||||||
65195, 65314, 65419, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
|
|
||||||
65535};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf2Hi[68] = {
|
|
||||||
0, 7, 11, 22, 37, 52, 56, 59, 81, 85,
|
|
||||||
89, 96, 115, 130, 137, 152, 170, 181, 193, 200,
|
|
||||||
207, 233, 237, 259, 289, 318, 363, 433, 592, 992,
|
|
||||||
1607, 3062, 6149, 12206, 25522, 48368, 58223, 61918, 63640, 64584,
|
|
||||||
64943, 65098, 65206, 65268, 65294, 65335, 65350, 65372, 65387, 65402,
|
|
||||||
65413, 65420, 65428, 65435, 65439, 65450, 65454, 65468, 65472, 65476,
|
|
||||||
65483, 65491, 65498, 65505, 65516, 65520, 65528, 65535};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf3Hi[2] = {
|
|
||||||
0, 65535};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf4Hi[35] = {
|
|
||||||
0, 7, 19, 30, 41, 48, 63, 74, 82, 96,
|
|
||||||
122, 152, 215, 330, 701, 2611, 10931, 48106, 61177, 64341,
|
|
||||||
65112, 65238, 65309, 65338, 65364, 65379, 65401, 65427, 65453, 65465,
|
|
||||||
65476, 65490, 65509, 65528, 65535};
|
|
||||||
|
|
||||||
const WebRtc_UWord16 *WebRtcIsac_kQPitchLagCdfPtrHi[4] = {WebRtcIsac_kQPitchLagCdf1Hi, WebRtcIsac_kQPitchLagCdf2Hi, WebRtcIsac_kQPitchLagCdf3Hi, WebRtcIsac_kQPitchLagCdf4Hi};
|
|
||||||
|
|
||||||
/* size of first cdf table */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdfSizeHi[1] = {512};
|
|
||||||
|
|
||||||
/* index limits and ranges */
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQindexLowerLimitLagHi[4] = {
|
|
||||||
-552, -34, 0, -16};
|
|
||||||
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQindexUpperLimitLagHi[4] = {
|
|
||||||
-80, 32, 0, 17};
|
|
||||||
|
|
||||||
/* initial index for arithmetic decoder */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQInitIndexLagHi[3] = {
|
|
||||||
34, 1, 18};
|
|
||||||
|
|
||||||
/* mean values of pitch filter lags */
|
|
||||||
const double WebRtcIsac_kQMeanLag2Hi[67] = {
|
|
||||||
-17.07263295, -16.50000000, -15.83966081, -15.55613708, -14.96948007, -14.50000000, -14.00000000, -13.48377986, -13.00000000, -12.50000000,
|
|
||||||
-11.93199636, -11.44530414, -11.04197641, -10.39910301, -10.15202337, -9.51322461, -8.93357741, -8.46456632, -8.10270672, -7.53751847,
|
|
||||||
-6.98686404, -6.50000000, -6.08463150, -5.46872991, -5.00864717, -4.50163760, -4.01382410, -3.43856708, -2.96898001, -2.46554810,
|
|
||||||
-1.96861004, -1.47106701, -0.97197237, -0.46561654, -0.00531409, 0.45767857, 0.96777907, 1.47507903, 1.97740425, 2.46695420,
|
|
||||||
3.00695774, 3.47167185, 4.02712538, 4.49280007, 5.01087640, 5.48191963, 6.04916550, 6.51511058, 6.97297819, 7.46565499,
|
|
||||||
8.01489405, 8.39912001, 8.91819757, 9.50000000, 10.11654065, 10.50000000, 11.03712583, 11.50000000, 12.00000000, 12.38964346,
|
|
||||||
12.89466127, 13.43657881, 13.96013840, 14.46279912, 15.00000000, 15.39412269, 15.96662441};
|
|
||||||
|
|
||||||
const double WebRtcIsac_kQMeanLag3Hi[1] = {
|
|
||||||
0.00000000};
|
|
||||||
|
|
||||||
const double WebRtcIsac_kQMeanLag4Hi[34] = {
|
|
||||||
-7.98331221, -7.47988769, -7.03626557, -6.52708003, -6.06982173, -5.51856292, -5.05827033, -4.45909878, -3.99125864, -3.45308135,
|
|
||||||
-3.02328139, -2.47297273, -1.94341995, -1.44699056, -0.93612243, -0.43012406, 0.01120357, 0.44054812, 0.93199883, 1.45669587,
|
|
||||||
1.97218322, 2.50187419, 2.98748690, 3.49343202, 4.01660147, 4.50984306, 5.01402683, 5.58936797, 5.91787793, 6.59998900,
|
|
||||||
6.85034315, 7.53503316, 7.87711194, 8.53631648};
|
|
||||||
|
|
||||||
const double WebRtcIsac_kQPitchLagStepsizeHi = 0.500000;
|
|
||||||
|
|
||||||
/* transform matrix */
|
|
||||||
const double WebRtcIsac_kTransform[4][4] = {
|
|
||||||
{-0.50000000, -0.50000000, -0.50000000, -0.50000000},
|
|
||||||
{ 0.67082039, 0.22360680, -0.22360680, -0.67082039},
|
|
||||||
{ 0.50000000, -0.50000000, -0.50000000, 0.50000000},
|
|
||||||
{ 0.22360680, -0.67082039, 0.67082039, -0.22360680}};
|
|
||||||
|
|
||||||
/* transpose transform matrix */
|
|
||||||
const double WebRtcIsac_kTransformTranspose[4][4] = {
|
|
||||||
{-0.50000000, 0.67082039, 0.50000000, 0.22360680},
|
|
||||||
{-0.50000000, 0.22360680, -0.50000000, -0.67082039},
|
|
||||||
{-0.50000000, -0.22360680, -0.50000000, 0.67082039},
|
|
||||||
{-0.50000000, -0.67082039, 0.50000000, -0.22360680}};
|
|
||||||
|
|
||||||
|
|
@ -1,114 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* pitch_lag_tables.h
|
|
||||||
*
|
|
||||||
* This file contains tables for the pitch filter side-info in the entropy coder.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_PITCH_LAG_TABLES_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_PITCH_LAG_TABLES_H_
|
|
||||||
|
|
||||||
#include "typedefs.h"
|
|
||||||
/* header file for coding tables for the pitch filter side-info in the entropy coder */
|
|
||||||
/********************* Pitch Filter Lag Coefficient Tables ************************/
|
|
||||||
|
|
||||||
/* tables for use with small pitch gain */
|
|
||||||
|
|
||||||
/* cdfs for quantized pitch lags */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf1Lo[127];
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf2Lo[20];
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf3Lo[2];
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf4Lo[10];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 *WebRtcIsac_kQPitchLagCdfPtrLo[4];
|
|
||||||
|
|
||||||
/* size of first cdf table */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdfSizeLo[1];
|
|
||||||
|
|
||||||
/* index limits and ranges */
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kQIndexLowerLimitLagLo[4];
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kQIndexUpperLimitLagLo[4];
|
|
||||||
|
|
||||||
/* initial index for arithmetic decoder */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQInitIndexLagLo[3];
|
|
||||||
|
|
||||||
/* mean values of pitch filter lags */
|
|
||||||
extern const double WebRtcIsac_kQMeanLag2Lo[19];
|
|
||||||
extern const double WebRtcIsac_kQMeanLag3Lo[1];
|
|
||||||
extern const double WebRtcIsac_kQMeanLag4Lo[9];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kQPitchLagStepsizeLo;
|
|
||||||
|
|
||||||
|
|
||||||
/* tables for use with medium pitch gain */
|
|
||||||
|
|
||||||
/* cdfs for quantized pitch lags */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf1Mid[255];
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf2Mid[36];
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf3Mid[2];
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf4Mid[20];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 *WebRtcIsac_kQPitchLagCdfPtrMid[4];
|
|
||||||
|
|
||||||
/* size of first cdf table */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdfSizeMid[1];
|
|
||||||
|
|
||||||
/* index limits and ranges */
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kQIndexLowerLimitLagMid[4];
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kQIndexUpperLimitLagMid[4];
|
|
||||||
|
|
||||||
/* initial index for arithmetic decoder */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQInitIndexLagMid[3];
|
|
||||||
|
|
||||||
/* mean values of pitch filter lags */
|
|
||||||
extern const double WebRtcIsac_kQMeanLag2Mid[35];
|
|
||||||
extern const double WebRtcIsac_kQMeanLag3Mid[1];
|
|
||||||
extern const double WebRtcIsac_kQMeanLag4Mid[19];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kQPitchLagStepsizeMid;
|
|
||||||
|
|
||||||
|
|
||||||
/* tables for use with large pitch gain */
|
|
||||||
|
|
||||||
/* cdfs for quantized pitch lags */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf1Hi[511];
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf2Hi[68];
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf3Hi[2];
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdf4Hi[35];
|
|
||||||
|
|
||||||
extern const WebRtc_UWord16 *WebRtcIsac_kQPitchLagCdfPtrHi[4];
|
|
||||||
|
|
||||||
/* size of first cdf table */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQPitchLagCdfSizeHi[1];
|
|
||||||
|
|
||||||
/* index limits and ranges */
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kQindexLowerLimitLagHi[4];
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kQindexUpperLimitLagHi[4];
|
|
||||||
|
|
||||||
/* initial index for arithmetic decoder */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQInitIndexLagHi[3];
|
|
||||||
|
|
||||||
/* mean values of pitch filter lags */
|
|
||||||
extern const double WebRtcIsac_kQMeanLag2Hi[67];
|
|
||||||
extern const double WebRtcIsac_kQMeanLag3Hi[1];
|
|
||||||
extern const double WebRtcIsac_kQMeanLag4Hi[34];
|
|
||||||
|
|
||||||
extern const double WebRtcIsac_kQPitchLagStepsizeHi;
|
|
||||||
|
|
||||||
/* transform matrix */
|
|
||||||
extern const double WebRtcIsac_kTransform[4][4];
|
|
||||||
|
|
||||||
/* transpose transform matrix */
|
|
||||||
extern const double WebRtcIsac_kTransformTranspose[4][4];
|
|
||||||
|
|
||||||
#endif /* WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_PITCH_LAG_TABLES_H_ */
|
|
||||||
|
|
@ -1,119 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains implementations of the randomization functions
|
|
||||||
* WebRtcSpl_IncreaseSeed()
|
|
||||||
* WebRtcSpl_RandU()
|
|
||||||
* WebRtcSpl_RandN()
|
|
||||||
* WebRtcSpl_RandUArray()
|
|
||||||
*
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
static const WebRtc_Word16 kRandNTable[] = {
|
|
||||||
9178, -7260, 40, 10189, 4894, -3531, -13779, 14764,
|
|
||||||
-4008, -8884, -8990, 1008, 7368, 5184, 3251, -5817,
|
|
||||||
-9786, 5963, 1770, 8066, -7135, 10772, -2298, 1361,
|
|
||||||
6484, 2241, -8633, 792, 199, -3344, 6553, -10079,
|
|
||||||
-15040, 95, 11608, -12469, 14161, -4176, 2476, 6403,
|
|
||||||
13685, -16005, 6646, 2239, 10916, -3004, -602, -3141,
|
|
||||||
2142, 14144, -5829, 5305, 8209, 4713, 2697, -5112,
|
|
||||||
16092, -1210, -2891, -6631, -5360, -11878, -6781, -2739,
|
|
||||||
-6392, 536, 10923, 10872, 5059, -4748, -7770, 5477,
|
|
||||||
38, -1025, -2892, 1638, 6304, 14375, -11028, 1553,
|
|
||||||
-1565, 10762, -393, 4040, 5257, 12310, 6554, -4799,
|
|
||||||
4899, -6354, 1603, -1048, -2220, 8247, -186, -8944,
|
|
||||||
-12004, 2332, 4801, -4933, 6371, 131, 8614, -5927,
|
|
||||||
-8287, -22760, 4033, -15162, 3385, 3246, 3153, -5250,
|
|
||||||
3766, 784, 6494, -62, 3531, -1582, 15572, 662,
|
|
||||||
-3952, -330, -3196, 669, 7236, -2678, -6569, 23319,
|
|
||||||
-8645, -741, 14830, -15976, 4903, 315, -11342, 10311,
|
|
||||||
1858, -7777, 2145, 5436, 5677, -113, -10033, 826,
|
|
||||||
-1353, 17210, 7768, 986, -1471, 8291, -4982, 8207,
|
|
||||||
-14911, -6255, -2449, -11881, -7059, -11703, -4338, 8025,
|
|
||||||
7538, -2823, -12490, 9470, -1613, -2529, -10092, -7807,
|
|
||||||
9480, 6970, -12844, 5123, 3532, 4816, 4803, -8455,
|
|
||||||
-5045, 14032, -4378, -1643, 5756, -11041, -2732, -16618,
|
|
||||||
-6430, -18375, -3320, 6098, 5131, -4269, -8840, 2482,
|
|
||||||
-7048, 1547, -21890, -6505, -7414, -424, -11722, 7955,
|
|
||||||
1653, -17299, 1823, 473, -9232, 3337, 1111, 873,
|
|
||||||
4018, -8982, 9889, 3531, -11763, -3799, 7373, -4539,
|
|
||||||
3231, 7054, -8537, 7616, 6244, 16635, 447, -2915,
|
|
||||||
13967, 705, -2669, -1520, -1771, -16188, 5956, 5117,
|
|
||||||
6371, -9936, -1448, 2480, 5128, 7550, -8130, 5236,
|
|
||||||
8213, -6443, 7707, -1950, -13811, 7218, 7031, -3883,
|
|
||||||
67, 5731, -2874, 13480, -3743, 9298, -3280, 3552,
|
|
||||||
-4425, -18, -3785, -9988, -5357, 5477, -11794, 2117,
|
|
||||||
1416, -9935, 3376, 802, -5079, -8243, 12652, 66,
|
|
||||||
3653, -2368, 6781, -21895, -7227, 2487, 7839, -385,
|
|
||||||
6646, -7016, -4658, 5531, -1705, 834, 129, 3694,
|
|
||||||
-1343, 2238, -22640, -6417, -11139, 11301, -2945, -3494,
|
|
||||||
-5626, 185, -3615, -2041, -7972, -3106, -60, -23497,
|
|
||||||
-1566, 17064, 3519, 2518, 304, -6805, -10269, 2105,
|
|
||||||
1936, -426, -736, -8122, -1467, 4238, -6939, -13309,
|
|
||||||
360, 7402, -7970, 12576, 3287, 12194, -6289, -16006,
|
|
||||||
9171, 4042, -9193, 9123, -2512, 6388, -4734, -8739,
|
|
||||||
1028, -5406, -1696, 5889, -666, -4736, 4971, 3565,
|
|
||||||
9362, -6292, 3876, -3652, -19666, 7523, -4061, 391,
|
|
||||||
-11773, 7502, -3763, 4929, -9478, 13278, 2805, 4496,
|
|
||||||
7814, 16419, 12455, -14773, 2127, -2746, 3763, 4847,
|
|
||||||
3698, 6978, 4751, -6957, -3581, -45, 6252, 1513,
|
|
||||||
-4797, -7925, 11270, 16188, -2359, -5269, 9376, -10777,
|
|
||||||
7262, 20031, -6515, -2208, -5353, 8085, -1341, -1303,
|
|
||||||
7333, 5576, 3625, 5763, -7931, 9833, -3371, -10305,
|
|
||||||
6534, -13539, -9971, 997, 8464, -4064, -1495, 1857,
|
|
||||||
13624, 5458, 9490, -11086, -4524, 12022, -550, -198,
|
|
||||||
408, -8455, -7068, 10289, 9712, -3366, 9028, -7621,
|
|
||||||
-5243, 2362, 6909, 4672, -4933, -1799, 4709, -4563,
|
|
||||||
-62, -566, 1624, -7010, 14730, -17791, -3697, -2344,
|
|
||||||
-1741, 7099, -9509, -6855, -1989, 3495, -2289, 2031,
|
|
||||||
12784, 891, 14189, -3963, -5683, 421, -12575, 1724,
|
|
||||||
-12682, -5970, -8169, 3143, -1824, -5488, -5130, 8536,
|
|
||||||
12799, 794, 5738, 3459, -11689, -258, -3738, -3775,
|
|
||||||
-8742, 2333, 8312, -9383, 10331, 13119, 8398, 10644,
|
|
||||||
-19433, -6446, -16277, -11793, 16284, 9345, 15222, 15834,
|
|
||||||
2009, -7349, 130, -14547, 338, -5998, 3337, 21492,
|
|
||||||
2406, 7703, -951, 11196, -564, 3406, 2217, 4806,
|
|
||||||
2374, -5797, 11839, 8940, -11874, 18213, 2855, 10492
|
|
||||||
};
|
|
||||||
|
|
||||||
WebRtc_UWord32 WebRtcSpl_IncreaseSeed(WebRtc_UWord32 *seed)
|
|
||||||
{
|
|
||||||
seed[0] = (seed[0] * ((WebRtc_Word32)69069) + 1) & (WEBRTC_SPL_MAX_SEED_USED - 1);
|
|
||||||
return seed[0];
|
|
||||||
}
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcSpl_RandU(WebRtc_UWord32 *seed)
|
|
||||||
{
|
|
||||||
return (WebRtc_Word16)(WebRtcSpl_IncreaseSeed(seed) >> 16);
|
|
||||||
}
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcSpl_RandN(WebRtc_UWord32 *seed)
|
|
||||||
{
|
|
||||||
return kRandNTable[WebRtcSpl_IncreaseSeed(seed) >> 23];
|
|
||||||
}
|
|
||||||
|
|
||||||
// Creates an array of uniformly distributed variables
|
|
||||||
WebRtc_Word16 WebRtcSpl_RandUArray(WebRtc_Word16* vector,
|
|
||||||
WebRtc_Word16 vector_length,
|
|
||||||
WebRtc_UWord32* seed)
|
|
||||||
{
|
|
||||||
int i;
|
|
||||||
for (i = 0; i < vector_length; i++)
|
|
||||||
{
|
|
||||||
vector[i] = WebRtcSpl_RandU(seed);
|
|
||||||
}
|
|
||||||
return vector_length;
|
|
||||||
}
|
|
||||||
|
|
@ -1,60 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_ReflCoefToLpc().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
void WebRtcSpl_ReflCoefToLpc(G_CONST WebRtc_Word16 *k, int use_order, WebRtc_Word16 *a)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 any[WEBRTC_SPL_MAX_LPC_ORDER + 1];
|
|
||||||
WebRtc_Word16 *aptr, *aptr2, *anyptr;
|
|
||||||
G_CONST WebRtc_Word16 *kptr;
|
|
||||||
int m, i;
|
|
||||||
|
|
||||||
kptr = k;
|
|
||||||
*a = 4096; // i.e., (Word16_MAX >> 3)+1.
|
|
||||||
*any = *a;
|
|
||||||
a[1] = WEBRTC_SPL_RSHIFT_W16((*k), 3);
|
|
||||||
|
|
||||||
for (m = 1; m < use_order; m++)
|
|
||||||
{
|
|
||||||
kptr++;
|
|
||||||
aptr = a;
|
|
||||||
aptr++;
|
|
||||||
aptr2 = &a[m];
|
|
||||||
anyptr = any;
|
|
||||||
anyptr++;
|
|
||||||
|
|
||||||
any[m + 1] = WEBRTC_SPL_RSHIFT_W16((*kptr), 3);
|
|
||||||
for (i = 0; i < m; i++)
|
|
||||||
{
|
|
||||||
*anyptr = (*aptr)
|
|
||||||
+ (WebRtc_Word16)WEBRTC_SPL_MUL_16_16_RSFT((*aptr2), (*kptr), 15);
|
|
||||||
anyptr++;
|
|
||||||
aptr++;
|
|
||||||
aptr2--;
|
|
||||||
}
|
|
||||||
|
|
||||||
aptr = a;
|
|
||||||
anyptr = any;
|
|
||||||
for (i = 0; i < (m + 2); i++)
|
|
||||||
{
|
|
||||||
*aptr = *anyptr;
|
|
||||||
aptr++;
|
|
||||||
anyptr++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
@ -1,505 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the resampling functions for 22 kHz.
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
#include "resample_by_2_internal.h"
|
|
||||||
|
|
||||||
// Declaration of internally used functions
|
|
||||||
static void WebRtcSpl_32khzTo22khzIntToShort(const WebRtc_Word32 *In, WebRtc_Word16 *Out,
|
|
||||||
const WebRtc_Word32 K);
|
|
||||||
|
|
||||||
void WebRtcSpl_32khzTo22khzIntToInt(const WebRtc_Word32 *In, WebRtc_Word32 *Out,
|
|
||||||
const WebRtc_Word32 K);
|
|
||||||
|
|
||||||
// interpolation coefficients
|
|
||||||
static const WebRtc_Word16 kCoefficients32To22[5][9] = {
|
|
||||||
{127, -712, 2359, -6333, 23456, 16775, -3695, 945, -154},
|
|
||||||
{-39, 230, -830, 2785, 32366, -2324, 760, -218, 38},
|
|
||||||
{117, -663, 2222, -6133, 26634, 13070, -3174, 831, -137},
|
|
||||||
{-77, 457, -1677, 5958, 31175, -4136, 1405, -408, 71},
|
|
||||||
{ 98, -560, 1900, -5406, 29240, 9423, -2480, 663, -110}
|
|
||||||
};
|
|
||||||
|
|
||||||
//////////////////////
|
|
||||||
// 22 kHz -> 16 kHz //
|
|
||||||
//////////////////////
|
|
||||||
|
|
||||||
// number of subblocks; options: 1, 2, 4, 5, 10
|
|
||||||
#define SUB_BLOCKS_22_16 5
|
|
||||||
|
|
||||||
// 22 -> 16 resampler
|
|
||||||
void WebRtcSpl_Resample22khzTo16khz(const WebRtc_Word16* in, WebRtc_Word16* out,
|
|
||||||
WebRtcSpl_State22khzTo16khz* state, WebRtc_Word32* tmpmem)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
|
|
||||||
// process two blocks of 10/SUB_BLOCKS_22_16 ms (to reduce temp buffer size)
|
|
||||||
for (k = 0; k < SUB_BLOCKS_22_16; k++)
|
|
||||||
{
|
|
||||||
///// 22 --> 44 /////
|
|
||||||
// WebRtc_Word16 in[220/SUB_BLOCKS_22_16]
|
|
||||||
// WebRtc_Word32 out[440/SUB_BLOCKS_22_16]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_UpBy2ShortToInt(in, 220 / SUB_BLOCKS_22_16, tmpmem + 16, state->S_22_44);
|
|
||||||
|
|
||||||
///// 44 --> 32 /////
|
|
||||||
// WebRtc_Word32 in[440/SUB_BLOCKS_22_16]
|
|
||||||
// WebRtc_Word32 out[320/SUB_BLOCKS_22_16]
|
|
||||||
/////
|
|
||||||
// copy state to and from input array
|
|
||||||
tmpmem[8] = state->S_44_32[0];
|
|
||||||
tmpmem[9] = state->S_44_32[1];
|
|
||||||
tmpmem[10] = state->S_44_32[2];
|
|
||||||
tmpmem[11] = state->S_44_32[3];
|
|
||||||
tmpmem[12] = state->S_44_32[4];
|
|
||||||
tmpmem[13] = state->S_44_32[5];
|
|
||||||
tmpmem[14] = state->S_44_32[6];
|
|
||||||
tmpmem[15] = state->S_44_32[7];
|
|
||||||
state->S_44_32[0] = tmpmem[440 / SUB_BLOCKS_22_16 + 8];
|
|
||||||
state->S_44_32[1] = tmpmem[440 / SUB_BLOCKS_22_16 + 9];
|
|
||||||
state->S_44_32[2] = tmpmem[440 / SUB_BLOCKS_22_16 + 10];
|
|
||||||
state->S_44_32[3] = tmpmem[440 / SUB_BLOCKS_22_16 + 11];
|
|
||||||
state->S_44_32[4] = tmpmem[440 / SUB_BLOCKS_22_16 + 12];
|
|
||||||
state->S_44_32[5] = tmpmem[440 / SUB_BLOCKS_22_16 + 13];
|
|
||||||
state->S_44_32[6] = tmpmem[440 / SUB_BLOCKS_22_16 + 14];
|
|
||||||
state->S_44_32[7] = tmpmem[440 / SUB_BLOCKS_22_16 + 15];
|
|
||||||
|
|
||||||
WebRtcSpl_Resample44khzTo32khz(tmpmem + 8, tmpmem, 40 / SUB_BLOCKS_22_16);
|
|
||||||
|
|
||||||
///// 32 --> 16 /////
|
|
||||||
// WebRtc_Word32 in[320/SUB_BLOCKS_22_16]
|
|
||||||
// WebRtc_Word32 out[160/SUB_BLOCKS_22_16]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_DownBy2IntToShort(tmpmem, 320 / SUB_BLOCKS_22_16, out, state->S_32_16);
|
|
||||||
|
|
||||||
// move input/output pointers 10/SUB_BLOCKS_22_16 ms seconds ahead
|
|
||||||
in += 220 / SUB_BLOCKS_22_16;
|
|
||||||
out += 160 / SUB_BLOCKS_22_16;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// initialize state of 22 -> 16 resampler
|
|
||||||
void WebRtcSpl_ResetResample22khzTo16khz(WebRtcSpl_State22khzTo16khz* state)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
for (k = 0; k < 8; k++)
|
|
||||||
{
|
|
||||||
state->S_22_44[k] = 0;
|
|
||||||
state->S_44_32[k] = 0;
|
|
||||||
state->S_32_16[k] = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
//////////////////////
|
|
||||||
// 16 kHz -> 22 kHz //
|
|
||||||
//////////////////////
|
|
||||||
|
|
||||||
// number of subblocks; options: 1, 2, 4, 5, 10
|
|
||||||
#define SUB_BLOCKS_16_22 4
|
|
||||||
|
|
||||||
// 16 -> 22 resampler
|
|
||||||
void WebRtcSpl_Resample16khzTo22khz(const WebRtc_Word16* in, WebRtc_Word16* out,
|
|
||||||
WebRtcSpl_State16khzTo22khz* state, WebRtc_Word32* tmpmem)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
|
|
||||||
// process two blocks of 10/SUB_BLOCKS_16_22 ms (to reduce temp buffer size)
|
|
||||||
for (k = 0; k < SUB_BLOCKS_16_22; k++)
|
|
||||||
{
|
|
||||||
///// 16 --> 32 /////
|
|
||||||
// WebRtc_Word16 in[160/SUB_BLOCKS_16_22]
|
|
||||||
// WebRtc_Word32 out[320/SUB_BLOCKS_16_22]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_UpBy2ShortToInt(in, 160 / SUB_BLOCKS_16_22, tmpmem + 8, state->S_16_32);
|
|
||||||
|
|
||||||
///// 32 --> 22 /////
|
|
||||||
// WebRtc_Word32 in[320/SUB_BLOCKS_16_22]
|
|
||||||
// WebRtc_Word32 out[220/SUB_BLOCKS_16_22]
|
|
||||||
/////
|
|
||||||
// copy state to and from input array
|
|
||||||
tmpmem[0] = state->S_32_22[0];
|
|
||||||
tmpmem[1] = state->S_32_22[1];
|
|
||||||
tmpmem[2] = state->S_32_22[2];
|
|
||||||
tmpmem[3] = state->S_32_22[3];
|
|
||||||
tmpmem[4] = state->S_32_22[4];
|
|
||||||
tmpmem[5] = state->S_32_22[5];
|
|
||||||
tmpmem[6] = state->S_32_22[6];
|
|
||||||
tmpmem[7] = state->S_32_22[7];
|
|
||||||
state->S_32_22[0] = tmpmem[320 / SUB_BLOCKS_16_22];
|
|
||||||
state->S_32_22[1] = tmpmem[320 / SUB_BLOCKS_16_22 + 1];
|
|
||||||
state->S_32_22[2] = tmpmem[320 / SUB_BLOCKS_16_22 + 2];
|
|
||||||
state->S_32_22[3] = tmpmem[320 / SUB_BLOCKS_16_22 + 3];
|
|
||||||
state->S_32_22[4] = tmpmem[320 / SUB_BLOCKS_16_22 + 4];
|
|
||||||
state->S_32_22[5] = tmpmem[320 / SUB_BLOCKS_16_22 + 5];
|
|
||||||
state->S_32_22[6] = tmpmem[320 / SUB_BLOCKS_16_22 + 6];
|
|
||||||
state->S_32_22[7] = tmpmem[320 / SUB_BLOCKS_16_22 + 7];
|
|
||||||
|
|
||||||
WebRtcSpl_32khzTo22khzIntToShort(tmpmem, out, 20 / SUB_BLOCKS_16_22);
|
|
||||||
|
|
||||||
// move input/output pointers 10/SUB_BLOCKS_16_22 ms seconds ahead
|
|
||||||
in += 160 / SUB_BLOCKS_16_22;
|
|
||||||
out += 220 / SUB_BLOCKS_16_22;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// initialize state of 16 -> 22 resampler
|
|
||||||
void WebRtcSpl_ResetResample16khzTo22khz(WebRtcSpl_State16khzTo22khz* state)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
for (k = 0; k < 8; k++)
|
|
||||||
{
|
|
||||||
state->S_16_32[k] = 0;
|
|
||||||
state->S_32_22[k] = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
//////////////////////
|
|
||||||
// 22 kHz -> 8 kHz //
|
|
||||||
//////////////////////
|
|
||||||
|
|
||||||
// number of subblocks; options: 1, 2, 5, 10
|
|
||||||
#define SUB_BLOCKS_22_8 2
|
|
||||||
|
|
||||||
// 22 -> 8 resampler
|
|
||||||
void WebRtcSpl_Resample22khzTo8khz(const WebRtc_Word16* in, WebRtc_Word16* out,
|
|
||||||
WebRtcSpl_State22khzTo8khz* state, WebRtc_Word32* tmpmem)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
|
|
||||||
// process two blocks of 10/SUB_BLOCKS_22_8 ms (to reduce temp buffer size)
|
|
||||||
for (k = 0; k < SUB_BLOCKS_22_8; k++)
|
|
||||||
{
|
|
||||||
///// 22 --> 22 lowpass /////
|
|
||||||
// WebRtc_Word16 in[220/SUB_BLOCKS_22_8]
|
|
||||||
// WebRtc_Word32 out[220/SUB_BLOCKS_22_8]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_LPBy2ShortToInt(in, 220 / SUB_BLOCKS_22_8, tmpmem + 16, state->S_22_22);
|
|
||||||
|
|
||||||
///// 22 --> 16 /////
|
|
||||||
// WebRtc_Word32 in[220/SUB_BLOCKS_22_8]
|
|
||||||
// WebRtc_Word32 out[160/SUB_BLOCKS_22_8]
|
|
||||||
/////
|
|
||||||
// copy state to and from input array
|
|
||||||
tmpmem[8] = state->S_22_16[0];
|
|
||||||
tmpmem[9] = state->S_22_16[1];
|
|
||||||
tmpmem[10] = state->S_22_16[2];
|
|
||||||
tmpmem[11] = state->S_22_16[3];
|
|
||||||
tmpmem[12] = state->S_22_16[4];
|
|
||||||
tmpmem[13] = state->S_22_16[5];
|
|
||||||
tmpmem[14] = state->S_22_16[6];
|
|
||||||
tmpmem[15] = state->S_22_16[7];
|
|
||||||
state->S_22_16[0] = tmpmem[220 / SUB_BLOCKS_22_8 + 8];
|
|
||||||
state->S_22_16[1] = tmpmem[220 / SUB_BLOCKS_22_8 + 9];
|
|
||||||
state->S_22_16[2] = tmpmem[220 / SUB_BLOCKS_22_8 + 10];
|
|
||||||
state->S_22_16[3] = tmpmem[220 / SUB_BLOCKS_22_8 + 11];
|
|
||||||
state->S_22_16[4] = tmpmem[220 / SUB_BLOCKS_22_8 + 12];
|
|
||||||
state->S_22_16[5] = tmpmem[220 / SUB_BLOCKS_22_8 + 13];
|
|
||||||
state->S_22_16[6] = tmpmem[220 / SUB_BLOCKS_22_8 + 14];
|
|
||||||
state->S_22_16[7] = tmpmem[220 / SUB_BLOCKS_22_8 + 15];
|
|
||||||
|
|
||||||
WebRtcSpl_Resample44khzTo32khz(tmpmem + 8, tmpmem, 20 / SUB_BLOCKS_22_8);
|
|
||||||
|
|
||||||
///// 16 --> 8 /////
|
|
||||||
// WebRtc_Word32 in[160/SUB_BLOCKS_22_8]
|
|
||||||
// WebRtc_Word32 out[80/SUB_BLOCKS_22_8]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_DownBy2IntToShort(tmpmem, 160 / SUB_BLOCKS_22_8, out, state->S_16_8);
|
|
||||||
|
|
||||||
// move input/output pointers 10/SUB_BLOCKS_22_8 ms seconds ahead
|
|
||||||
in += 220 / SUB_BLOCKS_22_8;
|
|
||||||
out += 80 / SUB_BLOCKS_22_8;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// initialize state of 22 -> 8 resampler
|
|
||||||
void WebRtcSpl_ResetResample22khzTo8khz(WebRtcSpl_State22khzTo8khz* state)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
for (k = 0; k < 8; k++)
|
|
||||||
{
|
|
||||||
state->S_22_22[k] = 0;
|
|
||||||
state->S_22_22[k + 8] = 0;
|
|
||||||
state->S_22_16[k] = 0;
|
|
||||||
state->S_16_8[k] = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
//////////////////////
|
|
||||||
// 8 kHz -> 22 kHz //
|
|
||||||
//////////////////////
|
|
||||||
|
|
||||||
// number of subblocks; options: 1, 2, 5, 10
|
|
||||||
#define SUB_BLOCKS_8_22 2
|
|
||||||
|
|
||||||
// 8 -> 22 resampler
|
|
||||||
void WebRtcSpl_Resample8khzTo22khz(const WebRtc_Word16* in, WebRtc_Word16* out,
|
|
||||||
WebRtcSpl_State8khzTo22khz* state, WebRtc_Word32* tmpmem)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
|
|
||||||
// process two blocks of 10/SUB_BLOCKS_8_22 ms (to reduce temp buffer size)
|
|
||||||
for (k = 0; k < SUB_BLOCKS_8_22; k++)
|
|
||||||
{
|
|
||||||
///// 8 --> 16 /////
|
|
||||||
// WebRtc_Word16 in[80/SUB_BLOCKS_8_22]
|
|
||||||
// WebRtc_Word32 out[160/SUB_BLOCKS_8_22]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_UpBy2ShortToInt(in, 80 / SUB_BLOCKS_8_22, tmpmem + 18, state->S_8_16);
|
|
||||||
|
|
||||||
///// 16 --> 11 /////
|
|
||||||
// WebRtc_Word32 in[160/SUB_BLOCKS_8_22]
|
|
||||||
// WebRtc_Word32 out[110/SUB_BLOCKS_8_22]
|
|
||||||
/////
|
|
||||||
// copy state to and from input array
|
|
||||||
tmpmem[10] = state->S_16_11[0];
|
|
||||||
tmpmem[11] = state->S_16_11[1];
|
|
||||||
tmpmem[12] = state->S_16_11[2];
|
|
||||||
tmpmem[13] = state->S_16_11[3];
|
|
||||||
tmpmem[14] = state->S_16_11[4];
|
|
||||||
tmpmem[15] = state->S_16_11[5];
|
|
||||||
tmpmem[16] = state->S_16_11[6];
|
|
||||||
tmpmem[17] = state->S_16_11[7];
|
|
||||||
state->S_16_11[0] = tmpmem[160 / SUB_BLOCKS_8_22 + 10];
|
|
||||||
state->S_16_11[1] = tmpmem[160 / SUB_BLOCKS_8_22 + 11];
|
|
||||||
state->S_16_11[2] = tmpmem[160 / SUB_BLOCKS_8_22 + 12];
|
|
||||||
state->S_16_11[3] = tmpmem[160 / SUB_BLOCKS_8_22 + 13];
|
|
||||||
state->S_16_11[4] = tmpmem[160 / SUB_BLOCKS_8_22 + 14];
|
|
||||||
state->S_16_11[5] = tmpmem[160 / SUB_BLOCKS_8_22 + 15];
|
|
||||||
state->S_16_11[6] = tmpmem[160 / SUB_BLOCKS_8_22 + 16];
|
|
||||||
state->S_16_11[7] = tmpmem[160 / SUB_BLOCKS_8_22 + 17];
|
|
||||||
|
|
||||||
WebRtcSpl_32khzTo22khzIntToInt(tmpmem + 10, tmpmem, 10 / SUB_BLOCKS_8_22);
|
|
||||||
|
|
||||||
///// 11 --> 22 /////
|
|
||||||
// WebRtc_Word32 in[110/SUB_BLOCKS_8_22]
|
|
||||||
// WebRtc_Word16 out[220/SUB_BLOCKS_8_22]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_UpBy2IntToShort(tmpmem, 110 / SUB_BLOCKS_8_22, out, state->S_11_22);
|
|
||||||
|
|
||||||
// move input/output pointers 10/SUB_BLOCKS_8_22 ms seconds ahead
|
|
||||||
in += 80 / SUB_BLOCKS_8_22;
|
|
||||||
out += 220 / SUB_BLOCKS_8_22;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// initialize state of 8 -> 22 resampler
|
|
||||||
void WebRtcSpl_ResetResample8khzTo22khz(WebRtcSpl_State8khzTo22khz* state)
|
|
||||||
{
|
|
||||||
int k;
|
|
||||||
for (k = 0; k < 8; k++)
|
|
||||||
{
|
|
||||||
state->S_8_16[k] = 0;
|
|
||||||
state->S_16_11[k] = 0;
|
|
||||||
state->S_11_22[k] = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// compute two inner-products and store them to output array
|
|
||||||
static void WebRtcSpl_DotProdIntToInt(const WebRtc_Word32* in1, const WebRtc_Word32* in2,
|
|
||||||
const WebRtc_Word16* coef_ptr, WebRtc_Word32* out1,
|
|
||||||
WebRtc_Word32* out2)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tmp1 = 16384;
|
|
||||||
WebRtc_Word32 tmp2 = 16384;
|
|
||||||
WebRtc_Word16 coef;
|
|
||||||
|
|
||||||
coef = coef_ptr[0];
|
|
||||||
tmp1 += coef * in1[0];
|
|
||||||
tmp2 += coef * in2[-0];
|
|
||||||
|
|
||||||
coef = coef_ptr[1];
|
|
||||||
tmp1 += coef * in1[1];
|
|
||||||
tmp2 += coef * in2[-1];
|
|
||||||
|
|
||||||
coef = coef_ptr[2];
|
|
||||||
tmp1 += coef * in1[2];
|
|
||||||
tmp2 += coef * in2[-2];
|
|
||||||
|
|
||||||
coef = coef_ptr[3];
|
|
||||||
tmp1 += coef * in1[3];
|
|
||||||
tmp2 += coef * in2[-3];
|
|
||||||
|
|
||||||
coef = coef_ptr[4];
|
|
||||||
tmp1 += coef * in1[4];
|
|
||||||
tmp2 += coef * in2[-4];
|
|
||||||
|
|
||||||
coef = coef_ptr[5];
|
|
||||||
tmp1 += coef * in1[5];
|
|
||||||
tmp2 += coef * in2[-5];
|
|
||||||
|
|
||||||
coef = coef_ptr[6];
|
|
||||||
tmp1 += coef * in1[6];
|
|
||||||
tmp2 += coef * in2[-6];
|
|
||||||
|
|
||||||
coef = coef_ptr[7];
|
|
||||||
tmp1 += coef * in1[7];
|
|
||||||
tmp2 += coef * in2[-7];
|
|
||||||
|
|
||||||
coef = coef_ptr[8];
|
|
||||||
*out1 = tmp1 + coef * in1[8];
|
|
||||||
*out2 = tmp2 + coef * in2[-8];
|
|
||||||
}
|
|
||||||
|
|
||||||
// compute two inner-products and store them to output array
|
|
||||||
static void WebRtcSpl_DotProdIntToShort(const WebRtc_Word32* in1, const WebRtc_Word32* in2,
|
|
||||||
const WebRtc_Word16* coef_ptr, WebRtc_Word16* out1,
|
|
||||||
WebRtc_Word16* out2)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tmp1 = 16384;
|
|
||||||
WebRtc_Word32 tmp2 = 16384;
|
|
||||||
WebRtc_Word16 coef;
|
|
||||||
|
|
||||||
coef = coef_ptr[0];
|
|
||||||
tmp1 += coef * in1[0];
|
|
||||||
tmp2 += coef * in2[-0];
|
|
||||||
|
|
||||||
coef = coef_ptr[1];
|
|
||||||
tmp1 += coef * in1[1];
|
|
||||||
tmp2 += coef * in2[-1];
|
|
||||||
|
|
||||||
coef = coef_ptr[2];
|
|
||||||
tmp1 += coef * in1[2];
|
|
||||||
tmp2 += coef * in2[-2];
|
|
||||||
|
|
||||||
coef = coef_ptr[3];
|
|
||||||
tmp1 += coef * in1[3];
|
|
||||||
tmp2 += coef * in2[-3];
|
|
||||||
|
|
||||||
coef = coef_ptr[4];
|
|
||||||
tmp1 += coef * in1[4];
|
|
||||||
tmp2 += coef * in2[-4];
|
|
||||||
|
|
||||||
coef = coef_ptr[5];
|
|
||||||
tmp1 += coef * in1[5];
|
|
||||||
tmp2 += coef * in2[-5];
|
|
||||||
|
|
||||||
coef = coef_ptr[6];
|
|
||||||
tmp1 += coef * in1[6];
|
|
||||||
tmp2 += coef * in2[-6];
|
|
||||||
|
|
||||||
coef = coef_ptr[7];
|
|
||||||
tmp1 += coef * in1[7];
|
|
||||||
tmp2 += coef * in2[-7];
|
|
||||||
|
|
||||||
coef = coef_ptr[8];
|
|
||||||
tmp1 += coef * in1[8];
|
|
||||||
tmp2 += coef * in2[-8];
|
|
||||||
|
|
||||||
// scale down, round and saturate
|
|
||||||
tmp1 >>= 15;
|
|
||||||
if (tmp1 > (WebRtc_Word32)0x00007FFF)
|
|
||||||
tmp1 = 0x00007FFF;
|
|
||||||
if (tmp1 < (WebRtc_Word32)0xFFFF8000)
|
|
||||||
tmp1 = 0xFFFF8000;
|
|
||||||
tmp2 >>= 15;
|
|
||||||
if (tmp2 > (WebRtc_Word32)0x00007FFF)
|
|
||||||
tmp2 = 0x00007FFF;
|
|
||||||
if (tmp2 < (WebRtc_Word32)0xFFFF8000)
|
|
||||||
tmp2 = 0xFFFF8000;
|
|
||||||
*out1 = (WebRtc_Word16)tmp1;
|
|
||||||
*out2 = (WebRtc_Word16)tmp2;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Resampling ratio: 11/16
|
|
||||||
// input: WebRtc_Word32 (normalized, not saturated) :: size 16 * K
|
|
||||||
// output: WebRtc_Word32 (shifted 15 positions to the left, + offset 16384) :: size 11 * K
|
|
||||||
// K: Number of blocks
|
|
||||||
|
|
||||||
void WebRtcSpl_32khzTo22khzIntToInt(const WebRtc_Word32* In,
|
|
||||||
WebRtc_Word32* Out,
|
|
||||||
const WebRtc_Word32 K)
|
|
||||||
{
|
|
||||||
/////////////////////////////////////////////////////////////
|
|
||||||
// Filter operation:
|
|
||||||
//
|
|
||||||
// Perform resampling (16 input samples -> 11 output samples);
|
|
||||||
// process in sub blocks of size 16 samples.
|
|
||||||
WebRtc_Word32 m;
|
|
||||||
|
|
||||||
for (m = 0; m < K; m++)
|
|
||||||
{
|
|
||||||
// first output sample
|
|
||||||
Out[0] = ((WebRtc_Word32)In[3] << 15) + (1 << 14);
|
|
||||||
|
|
||||||
// sum and accumulate filter coefficients and input samples
|
|
||||||
WebRtcSpl_DotProdIntToInt(&In[0], &In[22], kCoefficients32To22[0], &Out[1], &Out[10]);
|
|
||||||
|
|
||||||
// sum and accumulate filter coefficients and input samples
|
|
||||||
WebRtcSpl_DotProdIntToInt(&In[2], &In[20], kCoefficients32To22[1], &Out[2], &Out[9]);
|
|
||||||
|
|
||||||
// sum and accumulate filter coefficients and input samples
|
|
||||||
WebRtcSpl_DotProdIntToInt(&In[3], &In[19], kCoefficients32To22[2], &Out[3], &Out[8]);
|
|
||||||
|
|
||||||
// sum and accumulate filter coefficients and input samples
|
|
||||||
WebRtcSpl_DotProdIntToInt(&In[5], &In[17], kCoefficients32To22[3], &Out[4], &Out[7]);
|
|
||||||
|
|
||||||
// sum and accumulate filter coefficients and input samples
|
|
||||||
WebRtcSpl_DotProdIntToInt(&In[6], &In[16], kCoefficients32To22[4], &Out[5], &Out[6]);
|
|
||||||
|
|
||||||
// update pointers
|
|
||||||
In += 16;
|
|
||||||
Out += 11;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Resampling ratio: 11/16
|
|
||||||
// input: WebRtc_Word32 (normalized, not saturated) :: size 16 * K
|
|
||||||
// output: WebRtc_Word16 (saturated) :: size 11 * K
|
|
||||||
// K: Number of blocks
|
|
||||||
|
|
||||||
void WebRtcSpl_32khzTo22khzIntToShort(const WebRtc_Word32 *In,
|
|
||||||
WebRtc_Word16 *Out,
|
|
||||||
const WebRtc_Word32 K)
|
|
||||||
{
|
|
||||||
/////////////////////////////////////////////////////////////
|
|
||||||
// Filter operation:
|
|
||||||
//
|
|
||||||
// Perform resampling (16 input samples -> 11 output samples);
|
|
||||||
// process in sub blocks of size 16 samples.
|
|
||||||
WebRtc_Word32 tmp;
|
|
||||||
WebRtc_Word32 m;
|
|
||||||
|
|
||||||
for (m = 0; m < K; m++)
|
|
||||||
{
|
|
||||||
// first output sample
|
|
||||||
tmp = In[3];
|
|
||||||
if (tmp > (WebRtc_Word32)0x00007FFF)
|
|
||||||
tmp = 0x00007FFF;
|
|
||||||
if (tmp < (WebRtc_Word32)0xFFFF8000)
|
|
||||||
tmp = 0xFFFF8000;
|
|
||||||
Out[0] = (WebRtc_Word16)tmp;
|
|
||||||
|
|
||||||
// sum and accumulate filter coefficients and input samples
|
|
||||||
WebRtcSpl_DotProdIntToShort(&In[0], &In[22], kCoefficients32To22[0], &Out[1], &Out[10]);
|
|
||||||
|
|
||||||
// sum and accumulate filter coefficients and input samples
|
|
||||||
WebRtcSpl_DotProdIntToShort(&In[2], &In[20], kCoefficients32To22[1], &Out[2], &Out[9]);
|
|
||||||
|
|
||||||
// sum and accumulate filter coefficients and input samples
|
|
||||||
WebRtcSpl_DotProdIntToShort(&In[3], &In[19], kCoefficients32To22[2], &Out[3], &Out[8]);
|
|
||||||
|
|
||||||
// sum and accumulate filter coefficients and input samples
|
|
||||||
WebRtcSpl_DotProdIntToShort(&In[5], &In[17], kCoefficients32To22[3], &Out[4], &Out[7]);
|
|
||||||
|
|
||||||
// sum and accumulate filter coefficients and input samples
|
|
||||||
WebRtcSpl_DotProdIntToShort(&In[6], &In[16], kCoefficients32To22[4], &Out[5], &Out[6]);
|
|
||||||
|
|
||||||
// update pointers
|
|
||||||
In += 16;
|
|
||||||
Out += 11;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
@ -1,186 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains resampling functions between 48 kHz and nb/wb.
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <string.h>
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
#include "resample_by_2_internal.h"
|
|
||||||
|
|
||||||
////////////////////////////
|
|
||||||
///// 48 kHz -> 16 kHz /////
|
|
||||||
////////////////////////////
|
|
||||||
|
|
||||||
// 48 -> 16 resampler
|
|
||||||
void WebRtcSpl_Resample48khzTo16khz(const WebRtc_Word16* in, WebRtc_Word16* out,
|
|
||||||
WebRtcSpl_State48khzTo16khz* state, WebRtc_Word32* tmpmem)
|
|
||||||
{
|
|
||||||
///// 48 --> 48(LP) /////
|
|
||||||
// WebRtc_Word16 in[480]
|
|
||||||
// WebRtc_Word32 out[480]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_LPBy2ShortToInt(in, 480, tmpmem + 16, state->S_48_48);
|
|
||||||
|
|
||||||
///// 48 --> 32 /////
|
|
||||||
// WebRtc_Word32 in[480]
|
|
||||||
// WebRtc_Word32 out[320]
|
|
||||||
/////
|
|
||||||
// copy state to and from input array
|
|
||||||
memcpy(tmpmem + 8, state->S_48_32, 8 * sizeof(WebRtc_Word32));
|
|
||||||
memcpy(state->S_48_32, tmpmem + 488, 8 * sizeof(WebRtc_Word32));
|
|
||||||
WebRtcSpl_Resample48khzTo32khz(tmpmem + 8, tmpmem, 160);
|
|
||||||
|
|
||||||
///// 32 --> 16 /////
|
|
||||||
// WebRtc_Word32 in[320]
|
|
||||||
// WebRtc_Word16 out[160]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_DownBy2IntToShort(tmpmem, 320, out, state->S_32_16);
|
|
||||||
}
|
|
||||||
|
|
||||||
// initialize state of 48 -> 16 resampler
|
|
||||||
void WebRtcSpl_ResetResample48khzTo16khz(WebRtcSpl_State48khzTo16khz* state)
|
|
||||||
{
|
|
||||||
memset(state->S_48_48, 0, 16 * sizeof(WebRtc_Word32));
|
|
||||||
memset(state->S_48_32, 0, 8 * sizeof(WebRtc_Word32));
|
|
||||||
memset(state->S_32_16, 0, 8 * sizeof(WebRtc_Word32));
|
|
||||||
}
|
|
||||||
|
|
||||||
////////////////////////////
|
|
||||||
///// 16 kHz -> 48 kHz /////
|
|
||||||
////////////////////////////
|
|
||||||
|
|
||||||
// 16 -> 48 resampler
|
|
||||||
void WebRtcSpl_Resample16khzTo48khz(const WebRtc_Word16* in, WebRtc_Word16* out,
|
|
||||||
WebRtcSpl_State16khzTo48khz* state, WebRtc_Word32* tmpmem)
|
|
||||||
{
|
|
||||||
///// 16 --> 32 /////
|
|
||||||
// WebRtc_Word16 in[160]
|
|
||||||
// WebRtc_Word32 out[320]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_UpBy2ShortToInt(in, 160, tmpmem + 16, state->S_16_32);
|
|
||||||
|
|
||||||
///// 32 --> 24 /////
|
|
||||||
// WebRtc_Word32 in[320]
|
|
||||||
// WebRtc_Word32 out[240]
|
|
||||||
// copy state to and from input array
|
|
||||||
/////
|
|
||||||
memcpy(tmpmem + 8, state->S_32_24, 8 * sizeof(WebRtc_Word32));
|
|
||||||
memcpy(state->S_32_24, tmpmem + 328, 8 * sizeof(WebRtc_Word32));
|
|
||||||
WebRtcSpl_Resample32khzTo24khz(tmpmem + 8, tmpmem, 80);
|
|
||||||
|
|
||||||
///// 24 --> 48 /////
|
|
||||||
// WebRtc_Word32 in[240]
|
|
||||||
// WebRtc_Word16 out[480]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_UpBy2IntToShort(tmpmem, 240, out, state->S_24_48);
|
|
||||||
}
|
|
||||||
|
|
||||||
// initialize state of 16 -> 48 resampler
|
|
||||||
void WebRtcSpl_ResetResample16khzTo48khz(WebRtcSpl_State16khzTo48khz* state)
|
|
||||||
{
|
|
||||||
memset(state->S_16_32, 0, 8 * sizeof(WebRtc_Word32));
|
|
||||||
memset(state->S_32_24, 0, 8 * sizeof(WebRtc_Word32));
|
|
||||||
memset(state->S_24_48, 0, 8 * sizeof(WebRtc_Word32));
|
|
||||||
}
|
|
||||||
|
|
||||||
////////////////////////////
|
|
||||||
///// 48 kHz -> 8 kHz /////
|
|
||||||
////////////////////////////
|
|
||||||
|
|
||||||
// 48 -> 8 resampler
|
|
||||||
void WebRtcSpl_Resample48khzTo8khz(const WebRtc_Word16* in, WebRtc_Word16* out,
|
|
||||||
WebRtcSpl_State48khzTo8khz* state, WebRtc_Word32* tmpmem)
|
|
||||||
{
|
|
||||||
///// 48 --> 24 /////
|
|
||||||
// WebRtc_Word16 in[480]
|
|
||||||
// WebRtc_Word32 out[240]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_DownBy2ShortToInt(in, 480, tmpmem + 256, state->S_48_24);
|
|
||||||
|
|
||||||
///// 24 --> 24(LP) /////
|
|
||||||
// WebRtc_Word32 in[240]
|
|
||||||
// WebRtc_Word32 out[240]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_LPBy2IntToInt(tmpmem + 256, 240, tmpmem + 16, state->S_24_24);
|
|
||||||
|
|
||||||
///// 24 --> 16 /////
|
|
||||||
// WebRtc_Word32 in[240]
|
|
||||||
// WebRtc_Word32 out[160]
|
|
||||||
/////
|
|
||||||
// copy state to and from input array
|
|
||||||
memcpy(tmpmem + 8, state->S_24_16, 8 * sizeof(WebRtc_Word32));
|
|
||||||
memcpy(state->S_24_16, tmpmem + 248, 8 * sizeof(WebRtc_Word32));
|
|
||||||
WebRtcSpl_Resample48khzTo32khz(tmpmem + 8, tmpmem, 80);
|
|
||||||
|
|
||||||
///// 16 --> 8 /////
|
|
||||||
// WebRtc_Word32 in[160]
|
|
||||||
// WebRtc_Word16 out[80]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_DownBy2IntToShort(tmpmem, 160, out, state->S_16_8);
|
|
||||||
}
|
|
||||||
|
|
||||||
// initialize state of 48 -> 8 resampler
|
|
||||||
void WebRtcSpl_ResetResample48khzTo8khz(WebRtcSpl_State48khzTo8khz* state)
|
|
||||||
{
|
|
||||||
memset(state->S_48_24, 0, 8 * sizeof(WebRtc_Word32));
|
|
||||||
memset(state->S_24_24, 0, 16 * sizeof(WebRtc_Word32));
|
|
||||||
memset(state->S_24_16, 0, 8 * sizeof(WebRtc_Word32));
|
|
||||||
memset(state->S_16_8, 0, 8 * sizeof(WebRtc_Word32));
|
|
||||||
}
|
|
||||||
|
|
||||||
////////////////////////////
|
|
||||||
///// 8 kHz -> 48 kHz /////
|
|
||||||
////////////////////////////
|
|
||||||
|
|
||||||
// 8 -> 48 resampler
|
|
||||||
void WebRtcSpl_Resample8khzTo48khz(const WebRtc_Word16* in, WebRtc_Word16* out,
|
|
||||||
WebRtcSpl_State8khzTo48khz* state, WebRtc_Word32* tmpmem)
|
|
||||||
{
|
|
||||||
///// 8 --> 16 /////
|
|
||||||
// WebRtc_Word16 in[80]
|
|
||||||
// WebRtc_Word32 out[160]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_UpBy2ShortToInt(in, 80, tmpmem + 264, state->S_8_16);
|
|
||||||
|
|
||||||
///// 16 --> 12 /////
|
|
||||||
// WebRtc_Word32 in[160]
|
|
||||||
// WebRtc_Word32 out[120]
|
|
||||||
/////
|
|
||||||
// copy state to and from input array
|
|
||||||
memcpy(tmpmem + 256, state->S_16_12, 8 * sizeof(WebRtc_Word32));
|
|
||||||
memcpy(state->S_16_12, tmpmem + 416, 8 * sizeof(WebRtc_Word32));
|
|
||||||
WebRtcSpl_Resample32khzTo24khz(tmpmem + 256, tmpmem + 240, 40);
|
|
||||||
|
|
||||||
///// 12 --> 24 /////
|
|
||||||
// WebRtc_Word32 in[120]
|
|
||||||
// WebRtc_Word16 out[240]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_UpBy2IntToInt(tmpmem + 240, 120, tmpmem, state->S_12_24);
|
|
||||||
|
|
||||||
///// 24 --> 48 /////
|
|
||||||
// WebRtc_Word32 in[240]
|
|
||||||
// WebRtc_Word16 out[480]
|
|
||||||
/////
|
|
||||||
WebRtcSpl_UpBy2IntToShort(tmpmem, 240, out, state->S_24_48);
|
|
||||||
}
|
|
||||||
|
|
||||||
// initialize state of 8 -> 48 resampler
|
|
||||||
void WebRtcSpl_ResetResample8khzTo48khz(WebRtcSpl_State8khzTo48khz* state)
|
|
||||||
{
|
|
||||||
memset(state->S_8_16, 0, 8 * sizeof(WebRtc_Word32));
|
|
||||||
memset(state->S_16_12, 0, 8 * sizeof(WebRtc_Word32));
|
|
||||||
memset(state->S_12_24, 0, 8 * sizeof(WebRtc_Word32));
|
|
||||||
memset(state->S_24_48, 0, 8 * sizeof(WebRtc_Word32));
|
|
||||||
}
|
|
||||||
|
|
@ -1,181 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the resampling by two functions.
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
#ifdef WEBRTC_ARCH_ARM_V7A
|
|
||||||
|
|
||||||
// allpass filter coefficients.
|
|
||||||
static const WebRtc_UWord32 kResampleAllpass1[3] = {3284, 24441, 49528 << 15};
|
|
||||||
static const WebRtc_UWord32 kResampleAllpass2[3] =
|
|
||||||
{12199, 37471 << 15, 60255 << 15};
|
|
||||||
|
|
||||||
// Multiply two 32-bit values and accumulate to another input value.
|
|
||||||
// Return: state + ((diff * tbl_value) >> 16)
|
|
||||||
|
|
||||||
static __inline WebRtc_Word32 MUL_ACCUM_1(WebRtc_Word32 tbl_value,
|
|
||||||
WebRtc_Word32 diff,
|
|
||||||
WebRtc_Word32 state) {
|
|
||||||
WebRtc_Word32 result;
|
|
||||||
__asm__("smlawb %r0, %r1, %r2, %r3": "=r"(result): "r"(diff),
|
|
||||||
"r"(tbl_value), "r"(state));
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Multiply two 32-bit values and accumulate to another input value.
|
|
||||||
// Return: Return: state + (((diff << 1) * tbl_value) >> 32)
|
|
||||||
//
|
|
||||||
// The reason to introduce this function is that, in case we can't use smlawb
|
|
||||||
// instruction (in MUL_ACCUM_1) due to input value range, we can still use
|
|
||||||
// smmla to save some cycles.
|
|
||||||
|
|
||||||
static __inline WebRtc_Word32 MUL_ACCUM_2(WebRtc_Word32 tbl_value,
|
|
||||||
WebRtc_Word32 diff,
|
|
||||||
WebRtc_Word32 state) {
|
|
||||||
WebRtc_Word32 result;
|
|
||||||
__asm__("smmla %r0, %r1, %r2, %r3": "=r"(result): "r"(diff << 1),
|
|
||||||
"r"(tbl_value), "r"(state));
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
|
|
||||||
#else
|
|
||||||
|
|
||||||
// allpass filter coefficients.
|
|
||||||
static const WebRtc_UWord16 kResampleAllpass1[3] = {3284, 24441, 49528};
|
|
||||||
static const WebRtc_UWord16 kResampleAllpass2[3] = {12199, 37471, 60255};
|
|
||||||
|
|
||||||
// Multiply a 32-bit value with a 16-bit value and accumulate to another input:
|
|
||||||
#define MUL_ACCUM_1(a, b, c) WEBRTC_SPL_SCALEDIFF32(a, b, c)
|
|
||||||
#define MUL_ACCUM_2(a, b, c) WEBRTC_SPL_SCALEDIFF32(a, b, c)
|
|
||||||
|
|
||||||
#endif // WEBRTC_ARCH_ARM_V7A
|
|
||||||
|
|
||||||
|
|
||||||
// decimator
|
|
||||||
void WebRtcSpl_DownsampleBy2(const WebRtc_Word16* in, const WebRtc_Word16 len,
|
|
||||||
WebRtc_Word16* out, WebRtc_Word32* filtState) {
|
|
||||||
WebRtc_Word32 tmp1, tmp2, diff, in32, out32;
|
|
||||||
WebRtc_Word16 i;
|
|
||||||
|
|
||||||
register WebRtc_Word32 state0 = filtState[0];
|
|
||||||
register WebRtc_Word32 state1 = filtState[1];
|
|
||||||
register WebRtc_Word32 state2 = filtState[2];
|
|
||||||
register WebRtc_Word32 state3 = filtState[3];
|
|
||||||
register WebRtc_Word32 state4 = filtState[4];
|
|
||||||
register WebRtc_Word32 state5 = filtState[5];
|
|
||||||
register WebRtc_Word32 state6 = filtState[6];
|
|
||||||
register WebRtc_Word32 state7 = filtState[7];
|
|
||||||
|
|
||||||
for (i = (len >> 1); i > 0; i--) {
|
|
||||||
// lower allpass filter
|
|
||||||
in32 = (WebRtc_Word32)(*in++) << 10;
|
|
||||||
diff = in32 - state1;
|
|
||||||
tmp1 = MUL_ACCUM_1(kResampleAllpass2[0], diff, state0);
|
|
||||||
state0 = in32;
|
|
||||||
diff = tmp1 - state2;
|
|
||||||
tmp2 = MUL_ACCUM_2(kResampleAllpass2[1], diff, state1);
|
|
||||||
state1 = tmp1;
|
|
||||||
diff = tmp2 - state3;
|
|
||||||
state3 = MUL_ACCUM_2(kResampleAllpass2[2], diff, state2);
|
|
||||||
state2 = tmp2;
|
|
||||||
|
|
||||||
// upper allpass filter
|
|
||||||
in32 = (WebRtc_Word32)(*in++) << 10;
|
|
||||||
diff = in32 - state5;
|
|
||||||
tmp1 = MUL_ACCUM_1(kResampleAllpass1[0], diff, state4);
|
|
||||||
state4 = in32;
|
|
||||||
diff = tmp1 - state6;
|
|
||||||
tmp2 = MUL_ACCUM_1(kResampleAllpass1[1], diff, state5);
|
|
||||||
state5 = tmp1;
|
|
||||||
diff = tmp2 - state7;
|
|
||||||
state7 = MUL_ACCUM_2(kResampleAllpass1[2], diff, state6);
|
|
||||||
state6 = tmp2;
|
|
||||||
|
|
||||||
// add two allpass outputs, divide by two and round
|
|
||||||
out32 = (state3 + state7 + 1024) >> 11;
|
|
||||||
|
|
||||||
// limit amplitude to prevent wrap-around, and write to output array
|
|
||||||
*out++ = WebRtcSpl_SatW32ToW16(out32);
|
|
||||||
}
|
|
||||||
|
|
||||||
filtState[0] = state0;
|
|
||||||
filtState[1] = state1;
|
|
||||||
filtState[2] = state2;
|
|
||||||
filtState[3] = state3;
|
|
||||||
filtState[4] = state4;
|
|
||||||
filtState[5] = state5;
|
|
||||||
filtState[6] = state6;
|
|
||||||
filtState[7] = state7;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
void WebRtcSpl_UpsampleBy2(const WebRtc_Word16* in, WebRtc_Word16 len,
|
|
||||||
WebRtc_Word16* out, WebRtc_Word32* filtState) {
|
|
||||||
WebRtc_Word32 tmp1, tmp2, diff, in32, out32;
|
|
||||||
WebRtc_Word16 i;
|
|
||||||
|
|
||||||
register WebRtc_Word32 state0 = filtState[0];
|
|
||||||
register WebRtc_Word32 state1 = filtState[1];
|
|
||||||
register WebRtc_Word32 state2 = filtState[2];
|
|
||||||
register WebRtc_Word32 state3 = filtState[3];
|
|
||||||
register WebRtc_Word32 state4 = filtState[4];
|
|
||||||
register WebRtc_Word32 state5 = filtState[5];
|
|
||||||
register WebRtc_Word32 state6 = filtState[6];
|
|
||||||
register WebRtc_Word32 state7 = filtState[7];
|
|
||||||
|
|
||||||
for (i = len; i > 0; i--) {
|
|
||||||
// lower allpass filter
|
|
||||||
in32 = (WebRtc_Word32)(*in++) << 10;
|
|
||||||
diff = in32 - state1;
|
|
||||||
tmp1 = MUL_ACCUM_1(kResampleAllpass1[0], diff, state0);
|
|
||||||
state0 = in32;
|
|
||||||
diff = tmp1 - state2;
|
|
||||||
tmp2 = MUL_ACCUM_1(kResampleAllpass1[1], diff, state1);
|
|
||||||
state1 = tmp1;
|
|
||||||
diff = tmp2 - state3;
|
|
||||||
state3 = MUL_ACCUM_2(kResampleAllpass1[2], diff, state2);
|
|
||||||
state2 = tmp2;
|
|
||||||
|
|
||||||
// round; limit amplitude to prevent wrap-around; write to output array
|
|
||||||
out32 = (state3 + 512) >> 10;
|
|
||||||
*out++ = WebRtcSpl_SatW32ToW16(out32);
|
|
||||||
|
|
||||||
// upper allpass filter
|
|
||||||
diff = in32 - state5;
|
|
||||||
tmp1 = MUL_ACCUM_1(kResampleAllpass2[0], diff, state4);
|
|
||||||
state4 = in32;
|
|
||||||
diff = tmp1 - state6;
|
|
||||||
tmp2 = MUL_ACCUM_2(kResampleAllpass2[1], diff, state5);
|
|
||||||
state5 = tmp1;
|
|
||||||
diff = tmp2 - state7;
|
|
||||||
state7 = MUL_ACCUM_2(kResampleAllpass2[2], diff, state6);
|
|
||||||
state6 = tmp2;
|
|
||||||
|
|
||||||
// round; limit amplitude to prevent wrap-around; write to output array
|
|
||||||
out32 = (state7 + 512) >> 10;
|
|
||||||
*out++ = WebRtcSpl_SatW32ToW16(out32);
|
|
||||||
}
|
|
||||||
|
|
||||||
filtState[0] = state0;
|
|
||||||
filtState[1] = state1;
|
|
||||||
filtState[2] = state2;
|
|
||||||
filtState[3] = state3;
|
|
||||||
filtState[4] = state4;
|
|
||||||
filtState[5] = state5;
|
|
||||||
filtState[6] = state6;
|
|
||||||
filtState[7] = state7;
|
|
||||||
}
|
|
||||||
|
|
@ -1,679 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This header file contains some internal resampling functions.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "resample_by_2_internal.h"
|
|
||||||
|
|
||||||
// allpass filter coefficients.
|
|
||||||
static const WebRtc_Word16 kResampleAllpass[2][3] = {
|
|
||||||
{821, 6110, 12382},
|
|
||||||
{3050, 9368, 15063}
|
|
||||||
};
|
|
||||||
|
|
||||||
//
|
|
||||||
// decimator
|
|
||||||
// input: WebRtc_Word32 (shifted 15 positions to the left, + offset 16384) OVERWRITTEN!
|
|
||||||
// output: WebRtc_Word16 (saturated) (of length len/2)
|
|
||||||
// state: filter state array; length = 8
|
|
||||||
|
|
||||||
void WebRtcSpl_DownBy2IntToShort(WebRtc_Word32 *in, WebRtc_Word32 len, WebRtc_Word16 *out,
|
|
||||||
WebRtc_Word32 *state)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tmp0, tmp1, diff;
|
|
||||||
WebRtc_Word32 i;
|
|
||||||
|
|
||||||
len >>= 1;
|
|
||||||
|
|
||||||
// lower allpass filter (operates on even input samples)
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = in[i << 1];
|
|
||||||
diff = tmp0 - state[1];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[0] + diff * kResampleAllpass[1][0];
|
|
||||||
state[0] = tmp0;
|
|
||||||
diff = tmp1 - state[2];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[1] + diff * kResampleAllpass[1][1];
|
|
||||||
state[1] = tmp1;
|
|
||||||
diff = tmp0 - state[3];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[3] = state[2] + diff * kResampleAllpass[1][2];
|
|
||||||
state[2] = tmp0;
|
|
||||||
|
|
||||||
// divide by two and store temporarily
|
|
||||||
in[i << 1] = (state[3] >> 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
in++;
|
|
||||||
|
|
||||||
// upper allpass filter (operates on odd input samples)
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = in[i << 1];
|
|
||||||
diff = tmp0 - state[5];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[4] + diff * kResampleAllpass[0][0];
|
|
||||||
state[4] = tmp0;
|
|
||||||
diff = tmp1 - state[6];
|
|
||||||
// scale down and round
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[5] + diff * kResampleAllpass[0][1];
|
|
||||||
state[5] = tmp1;
|
|
||||||
diff = tmp0 - state[7];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[7] = state[6] + diff * kResampleAllpass[0][2];
|
|
||||||
state[6] = tmp0;
|
|
||||||
|
|
||||||
// divide by two and store temporarily
|
|
||||||
in[i << 1] = (state[7] >> 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
in--;
|
|
||||||
|
|
||||||
// combine allpass outputs
|
|
||||||
for (i = 0; i < len; i += 2)
|
|
||||||
{
|
|
||||||
// divide by two, add both allpass outputs and round
|
|
||||||
tmp0 = (in[i << 1] + in[(i << 1) + 1]) >> 15;
|
|
||||||
tmp1 = (in[(i << 1) + 2] + in[(i << 1) + 3]) >> 15;
|
|
||||||
if (tmp0 > (WebRtc_Word32)0x00007FFF)
|
|
||||||
tmp0 = 0x00007FFF;
|
|
||||||
if (tmp0 < (WebRtc_Word32)0xFFFF8000)
|
|
||||||
tmp0 = 0xFFFF8000;
|
|
||||||
out[i] = (WebRtc_Word16)tmp0;
|
|
||||||
if (tmp1 > (WebRtc_Word32)0x00007FFF)
|
|
||||||
tmp1 = 0x00007FFF;
|
|
||||||
if (tmp1 < (WebRtc_Word32)0xFFFF8000)
|
|
||||||
tmp1 = 0xFFFF8000;
|
|
||||||
out[i + 1] = (WebRtc_Word16)tmp1;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
//
|
|
||||||
// decimator
|
|
||||||
// input: WebRtc_Word16
|
|
||||||
// output: WebRtc_Word32 (shifted 15 positions to the left, + offset 16384) (of length len/2)
|
|
||||||
// state: filter state array; length = 8
|
|
||||||
|
|
||||||
void WebRtcSpl_DownBy2ShortToInt(const WebRtc_Word16 *in,
|
|
||||||
WebRtc_Word32 len,
|
|
||||||
WebRtc_Word32 *out,
|
|
||||||
WebRtc_Word32 *state)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tmp0, tmp1, diff;
|
|
||||||
WebRtc_Word32 i;
|
|
||||||
|
|
||||||
len >>= 1;
|
|
||||||
|
|
||||||
// lower allpass filter (operates on even input samples)
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = ((WebRtc_Word32)in[i << 1] << 15) + (1 << 14);
|
|
||||||
diff = tmp0 - state[1];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[0] + diff * kResampleAllpass[1][0];
|
|
||||||
state[0] = tmp0;
|
|
||||||
diff = tmp1 - state[2];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[1] + diff * kResampleAllpass[1][1];
|
|
||||||
state[1] = tmp1;
|
|
||||||
diff = tmp0 - state[3];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[3] = state[2] + diff * kResampleAllpass[1][2];
|
|
||||||
state[2] = tmp0;
|
|
||||||
|
|
||||||
// divide by two and store temporarily
|
|
||||||
out[i] = (state[3] >> 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
in++;
|
|
||||||
|
|
||||||
// upper allpass filter (operates on odd input samples)
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = ((WebRtc_Word32)in[i << 1] << 15) + (1 << 14);
|
|
||||||
diff = tmp0 - state[5];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[4] + diff * kResampleAllpass[0][0];
|
|
||||||
state[4] = tmp0;
|
|
||||||
diff = tmp1 - state[6];
|
|
||||||
// scale down and round
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[5] + diff * kResampleAllpass[0][1];
|
|
||||||
state[5] = tmp1;
|
|
||||||
diff = tmp0 - state[7];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[7] = state[6] + diff * kResampleAllpass[0][2];
|
|
||||||
state[6] = tmp0;
|
|
||||||
|
|
||||||
// divide by two and store temporarily
|
|
||||||
out[i] += (state[7] >> 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
in--;
|
|
||||||
}
|
|
||||||
|
|
||||||
//
|
|
||||||
// interpolator
|
|
||||||
// input: WebRtc_Word16
|
|
||||||
// output: WebRtc_Word32 (normalized, not saturated) (of length len*2)
|
|
||||||
// state: filter state array; length = 8
|
|
||||||
void WebRtcSpl_UpBy2ShortToInt(const WebRtc_Word16 *in, WebRtc_Word32 len, WebRtc_Word32 *out,
|
|
||||||
WebRtc_Word32 *state)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tmp0, tmp1, diff;
|
|
||||||
WebRtc_Word32 i;
|
|
||||||
|
|
||||||
// upper allpass filter (generates odd output samples)
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = ((WebRtc_Word32)in[i] << 15) + (1 << 14);
|
|
||||||
diff = tmp0 - state[5];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[4] + diff * kResampleAllpass[0][0];
|
|
||||||
state[4] = tmp0;
|
|
||||||
diff = tmp1 - state[6];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[5] + diff * kResampleAllpass[0][1];
|
|
||||||
state[5] = tmp1;
|
|
||||||
diff = tmp0 - state[7];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[7] = state[6] + diff * kResampleAllpass[0][2];
|
|
||||||
state[6] = tmp0;
|
|
||||||
|
|
||||||
// scale down, round and store
|
|
||||||
out[i << 1] = state[7] >> 15;
|
|
||||||
}
|
|
||||||
|
|
||||||
out++;
|
|
||||||
|
|
||||||
// lower allpass filter (generates even output samples)
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = ((WebRtc_Word32)in[i] << 15) + (1 << 14);
|
|
||||||
diff = tmp0 - state[1];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[0] + diff * kResampleAllpass[1][0];
|
|
||||||
state[0] = tmp0;
|
|
||||||
diff = tmp1 - state[2];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[1] + diff * kResampleAllpass[1][1];
|
|
||||||
state[1] = tmp1;
|
|
||||||
diff = tmp0 - state[3];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[3] = state[2] + diff * kResampleAllpass[1][2];
|
|
||||||
state[2] = tmp0;
|
|
||||||
|
|
||||||
// scale down, round and store
|
|
||||||
out[i << 1] = state[3] >> 15;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
//
|
|
||||||
// interpolator
|
|
||||||
// input: WebRtc_Word32 (shifted 15 positions to the left, + offset 16384)
|
|
||||||
// output: WebRtc_Word32 (shifted 15 positions to the left, + offset 16384) (of length len*2)
|
|
||||||
// state: filter state array; length = 8
|
|
||||||
void WebRtcSpl_UpBy2IntToInt(const WebRtc_Word32 *in, WebRtc_Word32 len, WebRtc_Word32 *out,
|
|
||||||
WebRtc_Word32 *state)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tmp0, tmp1, diff;
|
|
||||||
WebRtc_Word32 i;
|
|
||||||
|
|
||||||
// upper allpass filter (generates odd output samples)
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = in[i];
|
|
||||||
diff = tmp0 - state[5];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[4] + diff * kResampleAllpass[0][0];
|
|
||||||
state[4] = tmp0;
|
|
||||||
diff = tmp1 - state[6];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[5] + diff * kResampleAllpass[0][1];
|
|
||||||
state[5] = tmp1;
|
|
||||||
diff = tmp0 - state[7];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[7] = state[6] + diff * kResampleAllpass[0][2];
|
|
||||||
state[6] = tmp0;
|
|
||||||
|
|
||||||
// scale down, round and store
|
|
||||||
out[i << 1] = state[7];
|
|
||||||
}
|
|
||||||
|
|
||||||
out++;
|
|
||||||
|
|
||||||
// lower allpass filter (generates even output samples)
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = in[i];
|
|
||||||
diff = tmp0 - state[1];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[0] + diff * kResampleAllpass[1][0];
|
|
||||||
state[0] = tmp0;
|
|
||||||
diff = tmp1 - state[2];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[1] + diff * kResampleAllpass[1][1];
|
|
||||||
state[1] = tmp1;
|
|
||||||
diff = tmp0 - state[3];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[3] = state[2] + diff * kResampleAllpass[1][2];
|
|
||||||
state[2] = tmp0;
|
|
||||||
|
|
||||||
// scale down, round and store
|
|
||||||
out[i << 1] = state[3];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
//
|
|
||||||
// interpolator
|
|
||||||
// input: WebRtc_Word32 (shifted 15 positions to the left, + offset 16384)
|
|
||||||
// output: WebRtc_Word16 (saturated) (of length len*2)
|
|
||||||
// state: filter state array; length = 8
|
|
||||||
void WebRtcSpl_UpBy2IntToShort(const WebRtc_Word32 *in, WebRtc_Word32 len, WebRtc_Word16 *out,
|
|
||||||
WebRtc_Word32 *state)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tmp0, tmp1, diff;
|
|
||||||
WebRtc_Word32 i;
|
|
||||||
|
|
||||||
// upper allpass filter (generates odd output samples)
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = in[i];
|
|
||||||
diff = tmp0 - state[5];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[4] + diff * kResampleAllpass[0][0];
|
|
||||||
state[4] = tmp0;
|
|
||||||
diff = tmp1 - state[6];
|
|
||||||
// scale down and round
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[5] + diff * kResampleAllpass[0][1];
|
|
||||||
state[5] = tmp1;
|
|
||||||
diff = tmp0 - state[7];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[7] = state[6] + diff * kResampleAllpass[0][2];
|
|
||||||
state[6] = tmp0;
|
|
||||||
|
|
||||||
// scale down, saturate and store
|
|
||||||
tmp1 = state[7] >> 15;
|
|
||||||
if (tmp1 > (WebRtc_Word32)0x00007FFF)
|
|
||||||
tmp1 = 0x00007FFF;
|
|
||||||
if (tmp1 < (WebRtc_Word32)0xFFFF8000)
|
|
||||||
tmp1 = 0xFFFF8000;
|
|
||||||
out[i << 1] = (WebRtc_Word16)tmp1;
|
|
||||||
}
|
|
||||||
|
|
||||||
out++;
|
|
||||||
|
|
||||||
// lower allpass filter (generates even output samples)
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = in[i];
|
|
||||||
diff = tmp0 - state[1];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[0] + diff * kResampleAllpass[1][0];
|
|
||||||
state[0] = tmp0;
|
|
||||||
diff = tmp1 - state[2];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[1] + diff * kResampleAllpass[1][1];
|
|
||||||
state[1] = tmp1;
|
|
||||||
diff = tmp0 - state[3];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[3] = state[2] + diff * kResampleAllpass[1][2];
|
|
||||||
state[2] = tmp0;
|
|
||||||
|
|
||||||
// scale down, saturate and store
|
|
||||||
tmp1 = state[3] >> 15;
|
|
||||||
if (tmp1 > (WebRtc_Word32)0x00007FFF)
|
|
||||||
tmp1 = 0x00007FFF;
|
|
||||||
if (tmp1 < (WebRtc_Word32)0xFFFF8000)
|
|
||||||
tmp1 = 0xFFFF8000;
|
|
||||||
out[i << 1] = (WebRtc_Word16)tmp1;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// lowpass filter
|
|
||||||
// input: WebRtc_Word16
|
|
||||||
// output: WebRtc_Word32 (normalized, not saturated)
|
|
||||||
// state: filter state array; length = 8
|
|
||||||
void WebRtcSpl_LPBy2ShortToInt(const WebRtc_Word16* in, WebRtc_Word32 len, WebRtc_Word32* out,
|
|
||||||
WebRtc_Word32* state)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tmp0, tmp1, diff;
|
|
||||||
WebRtc_Word32 i;
|
|
||||||
|
|
||||||
len >>= 1;
|
|
||||||
|
|
||||||
// lower allpass filter: odd input -> even output samples
|
|
||||||
in++;
|
|
||||||
// initial state of polyphase delay element
|
|
||||||
tmp0 = state[12];
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
diff = tmp0 - state[1];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[0] + diff * kResampleAllpass[1][0];
|
|
||||||
state[0] = tmp0;
|
|
||||||
diff = tmp1 - state[2];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[1] + diff * kResampleAllpass[1][1];
|
|
||||||
state[1] = tmp1;
|
|
||||||
diff = tmp0 - state[3];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[3] = state[2] + diff * kResampleAllpass[1][2];
|
|
||||||
state[2] = tmp0;
|
|
||||||
|
|
||||||
// scale down, round and store
|
|
||||||
out[i << 1] = state[3] >> 1;
|
|
||||||
tmp0 = ((WebRtc_Word32)in[i << 1] << 15) + (1 << 14);
|
|
||||||
}
|
|
||||||
in--;
|
|
||||||
|
|
||||||
// upper allpass filter: even input -> even output samples
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = ((WebRtc_Word32)in[i << 1] << 15) + (1 << 14);
|
|
||||||
diff = tmp0 - state[5];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[4] + diff * kResampleAllpass[0][0];
|
|
||||||
state[4] = tmp0;
|
|
||||||
diff = tmp1 - state[6];
|
|
||||||
// scale down and round
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[5] + diff * kResampleAllpass[0][1];
|
|
||||||
state[5] = tmp1;
|
|
||||||
diff = tmp0 - state[7];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[7] = state[6] + diff * kResampleAllpass[0][2];
|
|
||||||
state[6] = tmp0;
|
|
||||||
|
|
||||||
// average the two allpass outputs, scale down and store
|
|
||||||
out[i << 1] = (out[i << 1] + (state[7] >> 1)) >> 15;
|
|
||||||
}
|
|
||||||
|
|
||||||
// switch to odd output samples
|
|
||||||
out++;
|
|
||||||
|
|
||||||
// lower allpass filter: even input -> odd output samples
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = ((WebRtc_Word32)in[i << 1] << 15) + (1 << 14);
|
|
||||||
diff = tmp0 - state[9];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[8] + diff * kResampleAllpass[1][0];
|
|
||||||
state[8] = tmp0;
|
|
||||||
diff = tmp1 - state[10];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[9] + diff * kResampleAllpass[1][1];
|
|
||||||
state[9] = tmp1;
|
|
||||||
diff = tmp0 - state[11];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[11] = state[10] + diff * kResampleAllpass[1][2];
|
|
||||||
state[10] = tmp0;
|
|
||||||
|
|
||||||
// scale down, round and store
|
|
||||||
out[i << 1] = state[11] >> 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
// upper allpass filter: odd input -> odd output samples
|
|
||||||
in++;
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = ((WebRtc_Word32)in[i << 1] << 15) + (1 << 14);
|
|
||||||
diff = tmp0 - state[13];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[12] + diff * kResampleAllpass[0][0];
|
|
||||||
state[12] = tmp0;
|
|
||||||
diff = tmp1 - state[14];
|
|
||||||
// scale down and round
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[13] + diff * kResampleAllpass[0][1];
|
|
||||||
state[13] = tmp1;
|
|
||||||
diff = tmp0 - state[15];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[15] = state[14] + diff * kResampleAllpass[0][2];
|
|
||||||
state[14] = tmp0;
|
|
||||||
|
|
||||||
// average the two allpass outputs, scale down and store
|
|
||||||
out[i << 1] = (out[i << 1] + (state[15] >> 1)) >> 15;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// lowpass filter
|
|
||||||
// input: WebRtc_Word32 (shifted 15 positions to the left, + offset 16384)
|
|
||||||
// output: WebRtc_Word32 (normalized, not saturated)
|
|
||||||
// state: filter state array; length = 8
|
|
||||||
void WebRtcSpl_LPBy2IntToInt(const WebRtc_Word32* in, WebRtc_Word32 len, WebRtc_Word32* out,
|
|
||||||
WebRtc_Word32* state)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tmp0, tmp1, diff;
|
|
||||||
WebRtc_Word32 i;
|
|
||||||
|
|
||||||
len >>= 1;
|
|
||||||
|
|
||||||
// lower allpass filter: odd input -> even output samples
|
|
||||||
in++;
|
|
||||||
// initial state of polyphase delay element
|
|
||||||
tmp0 = state[12];
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
diff = tmp0 - state[1];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[0] + diff * kResampleAllpass[1][0];
|
|
||||||
state[0] = tmp0;
|
|
||||||
diff = tmp1 - state[2];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[1] + diff * kResampleAllpass[1][1];
|
|
||||||
state[1] = tmp1;
|
|
||||||
diff = tmp0 - state[3];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[3] = state[2] + diff * kResampleAllpass[1][2];
|
|
||||||
state[2] = tmp0;
|
|
||||||
|
|
||||||
// scale down, round and store
|
|
||||||
out[i << 1] = state[3] >> 1;
|
|
||||||
tmp0 = in[i << 1];
|
|
||||||
}
|
|
||||||
in--;
|
|
||||||
|
|
||||||
// upper allpass filter: even input -> even output samples
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = in[i << 1];
|
|
||||||
diff = tmp0 - state[5];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[4] + diff * kResampleAllpass[0][0];
|
|
||||||
state[4] = tmp0;
|
|
||||||
diff = tmp1 - state[6];
|
|
||||||
// scale down and round
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[5] + diff * kResampleAllpass[0][1];
|
|
||||||
state[5] = tmp1;
|
|
||||||
diff = tmp0 - state[7];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[7] = state[6] + diff * kResampleAllpass[0][2];
|
|
||||||
state[6] = tmp0;
|
|
||||||
|
|
||||||
// average the two allpass outputs, scale down and store
|
|
||||||
out[i << 1] = (out[i << 1] + (state[7] >> 1)) >> 15;
|
|
||||||
}
|
|
||||||
|
|
||||||
// switch to odd output samples
|
|
||||||
out++;
|
|
||||||
|
|
||||||
// lower allpass filter: even input -> odd output samples
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = in[i << 1];
|
|
||||||
diff = tmp0 - state[9];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[8] + diff * kResampleAllpass[1][0];
|
|
||||||
state[8] = tmp0;
|
|
||||||
diff = tmp1 - state[10];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[9] + diff * kResampleAllpass[1][1];
|
|
||||||
state[9] = tmp1;
|
|
||||||
diff = tmp0 - state[11];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[11] = state[10] + diff * kResampleAllpass[1][2];
|
|
||||||
state[10] = tmp0;
|
|
||||||
|
|
||||||
// scale down, round and store
|
|
||||||
out[i << 1] = state[11] >> 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
// upper allpass filter: odd input -> odd output samples
|
|
||||||
in++;
|
|
||||||
for (i = 0; i < len; i++)
|
|
||||||
{
|
|
||||||
tmp0 = in[i << 1];
|
|
||||||
diff = tmp0 - state[13];
|
|
||||||
// scale down and round
|
|
||||||
diff = (diff + (1 << 13)) >> 14;
|
|
||||||
tmp1 = state[12] + diff * kResampleAllpass[0][0];
|
|
||||||
state[12] = tmp0;
|
|
||||||
diff = tmp1 - state[14];
|
|
||||||
// scale down and round
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
tmp0 = state[13] + diff * kResampleAllpass[0][1];
|
|
||||||
state[13] = tmp1;
|
|
||||||
diff = tmp0 - state[15];
|
|
||||||
// scale down and truncate
|
|
||||||
diff = diff >> 14;
|
|
||||||
if (diff < 0)
|
|
||||||
diff += 1;
|
|
||||||
state[15] = state[14] + diff * kResampleAllpass[0][2];
|
|
||||||
state[14] = tmp0;
|
|
||||||
|
|
||||||
// average the two allpass outputs, scale down and store
|
|
||||||
out[i << 1] = (out[i << 1] + (state[15] >> 1)) >> 15;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
@ -1,47 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This header file contains some internal resampling functions.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_SPL_RESAMPLE_BY_2_INTERNAL_H_
|
|
||||||
#define WEBRTC_SPL_RESAMPLE_BY_2_INTERNAL_H_
|
|
||||||
|
|
||||||
#include "typedefs.h"
|
|
||||||
|
|
||||||
/*******************************************************************
|
|
||||||
* resample_by_2_fast.c
|
|
||||||
* Functions for internal use in the other resample functions
|
|
||||||
******************************************************************/
|
|
||||||
void WebRtcSpl_DownBy2IntToShort(WebRtc_Word32 *in, WebRtc_Word32 len, WebRtc_Word16 *out,
|
|
||||||
WebRtc_Word32 *state);
|
|
||||||
|
|
||||||
void WebRtcSpl_DownBy2ShortToInt(const WebRtc_Word16 *in, WebRtc_Word32 len,
|
|
||||||
WebRtc_Word32 *out, WebRtc_Word32 *state);
|
|
||||||
|
|
||||||
void WebRtcSpl_UpBy2ShortToInt(const WebRtc_Word16 *in, WebRtc_Word32 len,
|
|
||||||
WebRtc_Word32 *out, WebRtc_Word32 *state);
|
|
||||||
|
|
||||||
void WebRtcSpl_UpBy2IntToInt(const WebRtc_Word32 *in, WebRtc_Word32 len, WebRtc_Word32 *out,
|
|
||||||
WebRtc_Word32 *state);
|
|
||||||
|
|
||||||
void WebRtcSpl_UpBy2IntToShort(const WebRtc_Word32 *in, WebRtc_Word32 len,
|
|
||||||
WebRtc_Word16 *out, WebRtc_Word32 *state);
|
|
||||||
|
|
||||||
void WebRtcSpl_LPBy2ShortToInt(const WebRtc_Word16* in, WebRtc_Word32 len,
|
|
||||||
WebRtc_Word32* out, WebRtc_Word32* state);
|
|
||||||
|
|
||||||
void WebRtcSpl_LPBy2IntToInt(const WebRtc_Word32* in, WebRtc_Word32 len, WebRtc_Word32* out,
|
|
||||||
WebRtc_Word32* state);
|
|
||||||
|
|
||||||
#endif // WEBRTC_SPL_RESAMPLE_BY_2_INTERNAL_H_
|
|
||||||
|
|
@ -1,242 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the resampling functions between 48, 44, 32 and 24 kHz.
|
|
||||||
* The description headers can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
// interpolation coefficients
|
|
||||||
static const WebRtc_Word16 kCoefficients48To32[2][8] = {
|
|
||||||
{778, -2050, 1087, 23285, 12903, -3783, 441, 222},
|
|
||||||
{222, 441, -3783, 12903, 23285, 1087, -2050, 778}
|
|
||||||
};
|
|
||||||
|
|
||||||
static const WebRtc_Word16 kCoefficients32To24[3][8] = {
|
|
||||||
{767, -2362, 2434, 24406, 10620, -3838, 721, 90},
|
|
||||||
{386, -381, -2646, 19062, 19062, -2646, -381, 386},
|
|
||||||
{90, 721, -3838, 10620, 24406, 2434, -2362, 767}
|
|
||||||
};
|
|
||||||
|
|
||||||
static const WebRtc_Word16 kCoefficients44To32[4][9] = {
|
|
||||||
{117, -669, 2245, -6183, 26267, 13529, -3245, 845, -138},
|
|
||||||
{-101, 612, -2283, 8532, 29790, -5138, 1789, -524, 91},
|
|
||||||
{50, -292, 1016, -3064, 32010, 3933, -1147, 315, -53},
|
|
||||||
{-156, 974, -3863, 18603, 21691, -6246, 2353, -712, 126}
|
|
||||||
};
|
|
||||||
|
|
||||||
// Resampling ratio: 2/3
|
|
||||||
// input: WebRtc_Word32 (normalized, not saturated) :: size 3 * K
|
|
||||||
// output: WebRtc_Word32 (shifted 15 positions to the left, + offset 16384) :: size 2 * K
|
|
||||||
// K: number of blocks
|
|
||||||
|
|
||||||
void WebRtcSpl_Resample48khzTo32khz(const WebRtc_Word32 *In, WebRtc_Word32 *Out,
|
|
||||||
const WebRtc_Word32 K)
|
|
||||||
{
|
|
||||||
/////////////////////////////////////////////////////////////
|
|
||||||
// Filter operation:
|
|
||||||
//
|
|
||||||
// Perform resampling (3 input samples -> 2 output samples);
|
|
||||||
// process in sub blocks of size 3 samples.
|
|
||||||
WebRtc_Word32 tmp;
|
|
||||||
WebRtc_Word32 m;
|
|
||||||
|
|
||||||
for (m = 0; m < K; m++)
|
|
||||||
{
|
|
||||||
tmp = 1 << 14;
|
|
||||||
tmp += kCoefficients48To32[0][0] * In[0];
|
|
||||||
tmp += kCoefficients48To32[0][1] * In[1];
|
|
||||||
tmp += kCoefficients48To32[0][2] * In[2];
|
|
||||||
tmp += kCoefficients48To32[0][3] * In[3];
|
|
||||||
tmp += kCoefficients48To32[0][4] * In[4];
|
|
||||||
tmp += kCoefficients48To32[0][5] * In[5];
|
|
||||||
tmp += kCoefficients48To32[0][6] * In[6];
|
|
||||||
tmp += kCoefficients48To32[0][7] * In[7];
|
|
||||||
Out[0] = tmp;
|
|
||||||
|
|
||||||
tmp = 1 << 14;
|
|
||||||
tmp += kCoefficients48To32[1][0] * In[1];
|
|
||||||
tmp += kCoefficients48To32[1][1] * In[2];
|
|
||||||
tmp += kCoefficients48To32[1][2] * In[3];
|
|
||||||
tmp += kCoefficients48To32[1][3] * In[4];
|
|
||||||
tmp += kCoefficients48To32[1][4] * In[5];
|
|
||||||
tmp += kCoefficients48To32[1][5] * In[6];
|
|
||||||
tmp += kCoefficients48To32[1][6] * In[7];
|
|
||||||
tmp += kCoefficients48To32[1][7] * In[8];
|
|
||||||
Out[1] = tmp;
|
|
||||||
|
|
||||||
// update pointers
|
|
||||||
In += 3;
|
|
||||||
Out += 2;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Resampling ratio: 3/4
|
|
||||||
// input: WebRtc_Word32 (normalized, not saturated) :: size 4 * K
|
|
||||||
// output: WebRtc_Word32 (shifted 15 positions to the left, + offset 16384) :: size 3 * K
|
|
||||||
// K: number of blocks
|
|
||||||
|
|
||||||
void WebRtcSpl_Resample32khzTo24khz(const WebRtc_Word32 *In, WebRtc_Word32 *Out,
|
|
||||||
const WebRtc_Word32 K)
|
|
||||||
{
|
|
||||||
/////////////////////////////////////////////////////////////
|
|
||||||
// Filter operation:
|
|
||||||
//
|
|
||||||
// Perform resampling (4 input samples -> 3 output samples);
|
|
||||||
// process in sub blocks of size 4 samples.
|
|
||||||
WebRtc_Word32 m;
|
|
||||||
WebRtc_Word32 tmp;
|
|
||||||
|
|
||||||
for (m = 0; m < K; m++)
|
|
||||||
{
|
|
||||||
tmp = 1 << 14;
|
|
||||||
tmp += kCoefficients32To24[0][0] * In[0];
|
|
||||||
tmp += kCoefficients32To24[0][1] * In[1];
|
|
||||||
tmp += kCoefficients32To24[0][2] * In[2];
|
|
||||||
tmp += kCoefficients32To24[0][3] * In[3];
|
|
||||||
tmp += kCoefficients32To24[0][4] * In[4];
|
|
||||||
tmp += kCoefficients32To24[0][5] * In[5];
|
|
||||||
tmp += kCoefficients32To24[0][6] * In[6];
|
|
||||||
tmp += kCoefficients32To24[0][7] * In[7];
|
|
||||||
Out[0] = tmp;
|
|
||||||
|
|
||||||
tmp = 1 << 14;
|
|
||||||
tmp += kCoefficients32To24[1][0] * In[1];
|
|
||||||
tmp += kCoefficients32To24[1][1] * In[2];
|
|
||||||
tmp += kCoefficients32To24[1][2] * In[3];
|
|
||||||
tmp += kCoefficients32To24[1][3] * In[4];
|
|
||||||
tmp += kCoefficients32To24[1][4] * In[5];
|
|
||||||
tmp += kCoefficients32To24[1][5] * In[6];
|
|
||||||
tmp += kCoefficients32To24[1][6] * In[7];
|
|
||||||
tmp += kCoefficients32To24[1][7] * In[8];
|
|
||||||
Out[1] = tmp;
|
|
||||||
|
|
||||||
tmp = 1 << 14;
|
|
||||||
tmp += kCoefficients32To24[2][0] * In[2];
|
|
||||||
tmp += kCoefficients32To24[2][1] * In[3];
|
|
||||||
tmp += kCoefficients32To24[2][2] * In[4];
|
|
||||||
tmp += kCoefficients32To24[2][3] * In[5];
|
|
||||||
tmp += kCoefficients32To24[2][4] * In[6];
|
|
||||||
tmp += kCoefficients32To24[2][5] * In[7];
|
|
||||||
tmp += kCoefficients32To24[2][6] * In[8];
|
|
||||||
tmp += kCoefficients32To24[2][7] * In[9];
|
|
||||||
Out[2] = tmp;
|
|
||||||
|
|
||||||
// update pointers
|
|
||||||
In += 4;
|
|
||||||
Out += 3;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
//
|
|
||||||
// fractional resampling filters
|
|
||||||
// Fout = 11/16 * Fin
|
|
||||||
// Fout = 8/11 * Fin
|
|
||||||
//
|
|
||||||
|
|
||||||
// compute two inner-products and store them to output array
|
|
||||||
static void WebRtcSpl_ResampDotProduct(const WebRtc_Word32 *in1, const WebRtc_Word32 *in2,
|
|
||||||
const WebRtc_Word16 *coef_ptr, WebRtc_Word32 *out1,
|
|
||||||
WebRtc_Word32 *out2)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tmp1 = 16384;
|
|
||||||
WebRtc_Word32 tmp2 = 16384;
|
|
||||||
WebRtc_Word16 coef;
|
|
||||||
|
|
||||||
coef = coef_ptr[0];
|
|
||||||
tmp1 += coef * in1[0];
|
|
||||||
tmp2 += coef * in2[-0];
|
|
||||||
|
|
||||||
coef = coef_ptr[1];
|
|
||||||
tmp1 += coef * in1[1];
|
|
||||||
tmp2 += coef * in2[-1];
|
|
||||||
|
|
||||||
coef = coef_ptr[2];
|
|
||||||
tmp1 += coef * in1[2];
|
|
||||||
tmp2 += coef * in2[-2];
|
|
||||||
|
|
||||||
coef = coef_ptr[3];
|
|
||||||
tmp1 += coef * in1[3];
|
|
||||||
tmp2 += coef * in2[-3];
|
|
||||||
|
|
||||||
coef = coef_ptr[4];
|
|
||||||
tmp1 += coef * in1[4];
|
|
||||||
tmp2 += coef * in2[-4];
|
|
||||||
|
|
||||||
coef = coef_ptr[5];
|
|
||||||
tmp1 += coef * in1[5];
|
|
||||||
tmp2 += coef * in2[-5];
|
|
||||||
|
|
||||||
coef = coef_ptr[6];
|
|
||||||
tmp1 += coef * in1[6];
|
|
||||||
tmp2 += coef * in2[-6];
|
|
||||||
|
|
||||||
coef = coef_ptr[7];
|
|
||||||
tmp1 += coef * in1[7];
|
|
||||||
tmp2 += coef * in2[-7];
|
|
||||||
|
|
||||||
coef = coef_ptr[8];
|
|
||||||
*out1 = tmp1 + coef * in1[8];
|
|
||||||
*out2 = tmp2 + coef * in2[-8];
|
|
||||||
}
|
|
||||||
|
|
||||||
// Resampling ratio: 8/11
|
|
||||||
// input: WebRtc_Word32 (normalized, not saturated) :: size 11 * K
|
|
||||||
// output: WebRtc_Word32 (shifted 15 positions to the left, + offset 16384) :: size 8 * K
|
|
||||||
// K: number of blocks
|
|
||||||
|
|
||||||
void WebRtcSpl_Resample44khzTo32khz(const WebRtc_Word32 *In, WebRtc_Word32 *Out,
|
|
||||||
const WebRtc_Word32 K)
|
|
||||||
{
|
|
||||||
/////////////////////////////////////////////////////////////
|
|
||||||
// Filter operation:
|
|
||||||
//
|
|
||||||
// Perform resampling (11 input samples -> 8 output samples);
|
|
||||||
// process in sub blocks of size 11 samples.
|
|
||||||
WebRtc_Word32 tmp;
|
|
||||||
WebRtc_Word32 m;
|
|
||||||
|
|
||||||
for (m = 0; m < K; m++)
|
|
||||||
{
|
|
||||||
tmp = 1 << 14;
|
|
||||||
|
|
||||||
// first output sample
|
|
||||||
Out[0] = ((WebRtc_Word32)In[3] << 15) + tmp;
|
|
||||||
|
|
||||||
// sum and accumulate filter coefficients and input samples
|
|
||||||
tmp += kCoefficients44To32[3][0] * In[5];
|
|
||||||
tmp += kCoefficients44To32[3][1] * In[6];
|
|
||||||
tmp += kCoefficients44To32[3][2] * In[7];
|
|
||||||
tmp += kCoefficients44To32[3][3] * In[8];
|
|
||||||
tmp += kCoefficients44To32[3][4] * In[9];
|
|
||||||
tmp += kCoefficients44To32[3][5] * In[10];
|
|
||||||
tmp += kCoefficients44To32[3][6] * In[11];
|
|
||||||
tmp += kCoefficients44To32[3][7] * In[12];
|
|
||||||
tmp += kCoefficients44To32[3][8] * In[13];
|
|
||||||
Out[4] = tmp;
|
|
||||||
|
|
||||||
// sum and accumulate filter coefficients and input samples
|
|
||||||
WebRtcSpl_ResampDotProduct(&In[0], &In[17], kCoefficients44To32[0], &Out[1], &Out[7]);
|
|
||||||
|
|
||||||
// sum and accumulate filter coefficients and input samples
|
|
||||||
WebRtcSpl_ResampDotProduct(&In[2], &In[15], kCoefficients44To32[1], &Out[2], &Out[6]);
|
|
||||||
|
|
||||||
// sum and accumulate filter coefficients and input samples
|
|
||||||
WebRtcSpl_ResampDotProduct(&In[3], &In[14], kCoefficients44To32[2], &Out[3], &Out[5]);
|
|
||||||
|
|
||||||
// update pointers
|
|
||||||
In += 11;
|
|
||||||
Out += 8;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
@ -1,199 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* settings.h
|
|
||||||
*
|
|
||||||
* Declaration of #defines used in the iSAC codec
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_SETTINGS_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_SETTINGS_H_
|
|
||||||
|
|
||||||
/* sampling frequency (Hz) */
|
|
||||||
#define FS 16000
|
|
||||||
|
|
||||||
/* number of samples per frame (either 320 (20ms), 480 (30ms) or 960 (60ms)) */
|
|
||||||
#define INITIAL_FRAMESAMPLES 960
|
|
||||||
|
|
||||||
|
|
||||||
#define MAXFFTSIZE 2048
|
|
||||||
#define NFACTOR 11
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* do not modify the following; this will have to be modified if we have a 20ms framesize option */
|
|
||||||
/*************************************************************************************************/
|
|
||||||
/* miliseconds */
|
|
||||||
#define FRAMESIZE 30
|
|
||||||
/* number of samples per frame processed in the encoder, 480 */
|
|
||||||
#define FRAMESAMPLES 480 /* ((FRAMESIZE*FS)/1000) */
|
|
||||||
#define FRAMESAMPLES_HALF 240
|
|
||||||
#define FRAMESAMPLES_QUARTER 120
|
|
||||||
/*************************************************************************************************/
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* max number of samples per frame (= 60 ms frame) */
|
|
||||||
#define MAX_FRAMESAMPLES 960
|
|
||||||
#define MAX_SWBFRAMESAMPLES (MAX_FRAMESAMPLES * 2)
|
|
||||||
/* number of samples per 10ms frame */
|
|
||||||
#define FRAMESAMPLES_10ms ((10*FS)/1000)
|
|
||||||
#define SWBFRAMESAMPLES_10ms (FRAMESAMPLES_10ms * 2)
|
|
||||||
/* number of samples in 30 ms frame */
|
|
||||||
#define FRAMESAMPLES_30ms 480
|
|
||||||
/* number of subframes */
|
|
||||||
#define SUBFRAMES 6
|
|
||||||
/* length of a subframe */
|
|
||||||
#define UPDATE 80
|
|
||||||
/* length of half a subframe (low/high band) */
|
|
||||||
#define HALF_SUBFRAMELEN (UPDATE/2)
|
|
||||||
/* samples of look ahead (in a half-band, so actually half the samples of look ahead @ FS) */
|
|
||||||
#define QLOOKAHEAD 24 /* 3 ms */
|
|
||||||
/* order of AR model in spectral entropy coder */
|
|
||||||
#define AR_ORDER 6
|
|
||||||
/* order of LP model in spectral entropy coder */
|
|
||||||
#define LP_ORDER 0
|
|
||||||
|
|
||||||
/* window length (masking analysis) */
|
|
||||||
#define WINLEN 256
|
|
||||||
/* order of low-band pole filter used to approximate masking curve */
|
|
||||||
#define ORDERLO 12
|
|
||||||
/* order of hi-band pole filter used to approximate masking curve */
|
|
||||||
#define ORDERHI 6
|
|
||||||
|
|
||||||
#define UB_LPC_ORDER 4
|
|
||||||
#define UB_LPC_VEC_PER_FRAME 2
|
|
||||||
#define UB16_LPC_VEC_PER_FRAME 4
|
|
||||||
#define UB_ACTIVE_SUBFRAMES 2
|
|
||||||
#define UB_MAX_LPC_ORDER 6
|
|
||||||
#define UB_INTERPOL_SEGMENTS 1
|
|
||||||
#define UB16_INTERPOL_SEGMENTS 3
|
|
||||||
#define LB_TOTAL_DELAY_SAMPLES 48
|
|
||||||
enum ISACBandwidth {isac8kHz = 8, isac12kHz = 12, isac16kHz = 16};
|
|
||||||
enum ISACBand{isacLowerBand = 0, isacUpperBand = 1};
|
|
||||||
#define UB_LPC_GAIN_DIM SUBFRAMES
|
|
||||||
#define FB_STATE_SIZE_WORD32 6
|
|
||||||
|
|
||||||
|
|
||||||
/* order for post_filter_bank */
|
|
||||||
#define POSTQORDER 3
|
|
||||||
/* order for pre-filterbank */
|
|
||||||
#define QORDER 3
|
|
||||||
/* another order */
|
|
||||||
#define QORDER_ALL (POSTQORDER+QORDER-1)
|
|
||||||
/* for decimator */
|
|
||||||
#define ALLPASSSECTIONS 2
|
|
||||||
|
|
||||||
|
|
||||||
/* array size for byte stream in number of bytes. */
|
|
||||||
#define STREAM_SIZE_MAX 600 /* The old maximum size still needed for the decoding */
|
|
||||||
#define STREAM_SIZE_MAX_30 200 /* 200 bytes = 53.4 kbit/s @ 30 ms.framelength */
|
|
||||||
#define STREAM_SIZE_MAX_60 400 /* 400 bytes = 53.4 kbit/s @ 60 ms.framelength */
|
|
||||||
|
|
||||||
/* storage size for bit counts */
|
|
||||||
#define BIT_COUNTER_SIZE 30
|
|
||||||
/* maximum order of any AR model or filter */
|
|
||||||
#define MAX_AR_MODEL_ORDER 12//50
|
|
||||||
|
|
||||||
|
|
||||||
/* For pitch analysis */
|
|
||||||
#define PITCH_FRAME_LEN (FRAMESAMPLES_HALF) /* 30 ms */
|
|
||||||
#define PITCH_MAX_LAG 140 /* 57 Hz */
|
|
||||||
#define PITCH_MIN_LAG 20 /* 400 Hz */
|
|
||||||
#define PITCH_MAX_GAIN 0.45
|
|
||||||
#define PITCH_MAX_GAIN_06 0.27 /* PITCH_MAX_GAIN*0.6 */
|
|
||||||
#define PITCH_MAX_GAIN_Q12 1843
|
|
||||||
#define PITCH_LAG_SPAN2 (PITCH_MAX_LAG/2-PITCH_MIN_LAG/2+5)
|
|
||||||
#define PITCH_CORR_LEN2 60 /* 15 ms */
|
|
||||||
#define PITCH_CORR_STEP2 (PITCH_FRAME_LEN/4)
|
|
||||||
#define PITCH_BW 11 /* half the band width of correlation surface */
|
|
||||||
#define PITCH_SUBFRAMES 4
|
|
||||||
#define PITCH_GRAN_PER_SUBFRAME 5
|
|
||||||
#define PITCH_SUBFRAME_LEN (PITCH_FRAME_LEN/PITCH_SUBFRAMES)
|
|
||||||
#define PITCH_UPDATE (PITCH_SUBFRAME_LEN/PITCH_GRAN_PER_SUBFRAME)
|
|
||||||
/* maximum number of peaks to be examined in correlation surface */
|
|
||||||
#define PITCH_MAX_NUM_PEAKS 10
|
|
||||||
#define PITCH_PEAK_DECAY 0.85
|
|
||||||
/* For weighting filter */
|
|
||||||
#define PITCH_WLPCORDER 6
|
|
||||||
#define PITCH_WLPCWINLEN PITCH_FRAME_LEN
|
|
||||||
#define PITCH_WLPCASYM 0.3 /* asymmetry parameter */
|
|
||||||
#define PITCH_WLPCBUFLEN PITCH_WLPCWINLEN
|
|
||||||
/* For pitch filter */
|
|
||||||
#define PITCH_BUFFSIZE (PITCH_MAX_LAG + 50) /* Extra 50 for fraction and LP filters */
|
|
||||||
#define PITCH_INTBUFFSIZE (PITCH_FRAME_LEN+PITCH_BUFFSIZE)
|
|
||||||
/* Max rel. step for interpolation */
|
|
||||||
#define PITCH_UPSTEP 1.5
|
|
||||||
/* Max rel. step for interpolation */
|
|
||||||
#define PITCH_DOWNSTEP 0.67
|
|
||||||
#define PITCH_FRACS 8
|
|
||||||
#define PITCH_FRACORDER 9
|
|
||||||
#define PITCH_DAMPORDER 5
|
|
||||||
#define PITCH_FILTDELAY 1.5f
|
|
||||||
/* stepsize for quantization of the pitch Gain */
|
|
||||||
#define PITCH_GAIN_STEPSIZE 0.125
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* Order of high pass filter */
|
|
||||||
#define HPORDER 2
|
|
||||||
|
|
||||||
/* some mathematical constants */
|
|
||||||
#define LOG2EXP 1.44269504088896 /* log2(exp) */
|
|
||||||
#define PI 3.14159265358979
|
|
||||||
|
|
||||||
/* Maximum number of iterations allowed to limit payload size */
|
|
||||||
#define MAX_PAYLOAD_LIMIT_ITERATION 5
|
|
||||||
|
|
||||||
/* Redundant Coding */
|
|
||||||
#define RCU_BOTTLENECK_BPS 16000
|
|
||||||
#define RCU_TRANSCODING_SCALE 0.40f
|
|
||||||
#define RCU_TRANSCODING_SCALE_INVERSE 2.5f
|
|
||||||
|
|
||||||
#define RCU_TRANSCODING_SCALE_UB 0.50f
|
|
||||||
#define RCU_TRANSCODING_SCALE_UB_INVERSE 2.0f
|
|
||||||
|
|
||||||
|
|
||||||
/* Define Error codes */
|
|
||||||
/* 6000 General */
|
|
||||||
#define ISAC_MEMORY_ALLOCATION_FAILED 6010
|
|
||||||
#define ISAC_MODE_MISMATCH 6020
|
|
||||||
#define ISAC_DISALLOWED_BOTTLENECK 6030
|
|
||||||
#define ISAC_DISALLOWED_FRAME_LENGTH 6040
|
|
||||||
#define ISAC_UNSUPPORTED_SAMPLING_FREQUENCY 6050
|
|
||||||
|
|
||||||
/* 6200 Bandwidth estimator */
|
|
||||||
#define ISAC_RANGE_ERROR_BW_ESTIMATOR 6240
|
|
||||||
/* 6400 Encoder */
|
|
||||||
#define ISAC_ENCODER_NOT_INITIATED 6410
|
|
||||||
#define ISAC_DISALLOWED_CODING_MODE 6420
|
|
||||||
#define ISAC_DISALLOWED_FRAME_MODE_ENCODER 6430
|
|
||||||
#define ISAC_DISALLOWED_BITSTREAM_LENGTH 6440
|
|
||||||
#define ISAC_PAYLOAD_LARGER_THAN_LIMIT 6450
|
|
||||||
#define ISAC_DISALLOWED_ENCODER_BANDWIDTH 6460
|
|
||||||
/* 6600 Decoder */
|
|
||||||
#define ISAC_DECODER_NOT_INITIATED 6610
|
|
||||||
#define ISAC_EMPTY_PACKET 6620
|
|
||||||
#define ISAC_DISALLOWED_FRAME_MODE_DECODER 6630
|
|
||||||
#define ISAC_RANGE_ERROR_DECODE_FRAME_LENGTH 6640
|
|
||||||
#define ISAC_RANGE_ERROR_DECODE_BANDWIDTH 6650
|
|
||||||
#define ISAC_RANGE_ERROR_DECODE_PITCH_GAIN 6660
|
|
||||||
#define ISAC_RANGE_ERROR_DECODE_PITCH_LAG 6670
|
|
||||||
#define ISAC_RANGE_ERROR_DECODE_LPC 6680
|
|
||||||
#define ISAC_RANGE_ERROR_DECODE_SPECTRUM 6690
|
|
||||||
#define ISAC_LENGTH_MISMATCH 6730
|
|
||||||
#define ISAC_RANGE_ERROR_DECODE_BANDWITH 6740
|
|
||||||
#define ISAC_DISALLOWED_BANDWIDTH_MODE_DECODER 6750
|
|
||||||
/* 6800 Call setup formats */
|
|
||||||
#define ISAC_INCOMPATIBLE_FORMATS 6810
|
|
||||||
|
|
||||||
#endif /* WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_SETTINGS_H_ */
|
|
||||||
File diff suppressed because it is too large
Load Diff
|
|
@ -1,138 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "spectrum_ar_model_tables.h"
|
|
||||||
#include "settings.h"
|
|
||||||
|
|
||||||
/********************* AR Coefficient Tables ************************/
|
|
||||||
/* cdf for quantized reflection coefficient 1 */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQArRc1Cdf[12] = {
|
|
||||||
0, 2, 4, 129, 7707, 57485, 65495, 65527, 65529, 65531,
|
|
||||||
65533, 65535};
|
|
||||||
|
|
||||||
/* cdf for quantized reflection coefficient 2 */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQArRc2Cdf[12] = {
|
|
||||||
0, 2, 4, 7, 531, 25298, 64525, 65526, 65529, 65531,
|
|
||||||
65533, 65535};
|
|
||||||
|
|
||||||
/* cdf for quantized reflection coefficient 3 */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQArRc3Cdf[12] = {
|
|
||||||
0, 2, 4, 6, 620, 22898, 64843, 65527, 65529, 65531,
|
|
||||||
65533, 65535};
|
|
||||||
|
|
||||||
/* cdf for quantized reflection coefficient 4 */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQArRc4Cdf[12] = {
|
|
||||||
0, 2, 4, 6, 35, 10034, 60733, 65506, 65529, 65531,
|
|
||||||
65533, 65535};
|
|
||||||
|
|
||||||
/* cdf for quantized reflection coefficient 5 */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQArRc5Cdf[12] = {
|
|
||||||
0, 2, 4, 6, 36, 7567, 56727, 65385, 65529, 65531,
|
|
||||||
65533, 65535};
|
|
||||||
|
|
||||||
/* cdf for quantized reflection coefficient 6 */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQArRc6Cdf[12] = {
|
|
||||||
0, 2, 4, 6, 14, 6579, 57360, 65409, 65529, 65531,
|
|
||||||
65533, 65535};
|
|
||||||
|
|
||||||
/* representation levels for quantized reflection coefficient 1 */
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQArRc1Levels[11] = {
|
|
||||||
-32104, -29007, -23202, -15496, -9279, -2577, 5934, 17535, 24512, 29503, 32104
|
|
||||||
};
|
|
||||||
|
|
||||||
/* representation levels for quantized reflection coefficient 2 */
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQArRc2Levels[11] = {
|
|
||||||
-32104, -29503, -23494, -15261, -7309, -1399, 6158, 16381, 24512, 29503, 32104
|
|
||||||
};
|
|
||||||
|
|
||||||
/* representation levels for quantized reflection coefficient 3 */
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQArRc3Levels[11] = {
|
|
||||||
-32104, -29503, -23157, -15186, -7347, -1359, 5829, 17535, 24512, 29503, 32104
|
|
||||||
};
|
|
||||||
|
|
||||||
/* representation levels for quantized reflection coefficient 4 */
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQArRc4Levels[11] = {
|
|
||||||
-32104, -29503, -24512, -15362, -6665, -342, 6596, 14585, 24512, 29503, 32104
|
|
||||||
};
|
|
||||||
|
|
||||||
/* representation levels for quantized reflection coefficient 5 */
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQArRc5Levels[11] = {
|
|
||||||
-32104, -29503, -24512, -15005, -6564, -106, 7123, 14920, 24512, 29503, 32104
|
|
||||||
};
|
|
||||||
|
|
||||||
/* representation levels for quantized reflection coefficient 6 */
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQArRc6Levels[11] = {
|
|
||||||
-32104, -29503, -24512, -15096, -6656, -37, 7036, 14847, 24512, 29503, 32104
|
|
||||||
};
|
|
||||||
|
|
||||||
/* quantization boundary levels for reflection coefficients */
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kQArBoundaryLevels[12] = {
|
|
||||||
-32768, -31441, -27566, -21458, -13612, -4663, 4663, 13612, 21458, 27566, 31441, 32767
|
|
||||||
};
|
|
||||||
|
|
||||||
/* initial index for AR reflection coefficient quantizer and cdf table search */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQArRcInitIndex[6] = {
|
|
||||||
5, 5, 5, 5, 5, 5};
|
|
||||||
|
|
||||||
/* pointers to AR cdf tables */
|
|
||||||
const WebRtc_UWord16 *WebRtcIsac_kQArRcCdfPtr[AR_ORDER] = {
|
|
||||||
WebRtcIsac_kQArRc1Cdf, WebRtcIsac_kQArRc2Cdf, WebRtcIsac_kQArRc3Cdf,
|
|
||||||
WebRtcIsac_kQArRc4Cdf, WebRtcIsac_kQArRc5Cdf, WebRtcIsac_kQArRc6Cdf
|
|
||||||
};
|
|
||||||
|
|
||||||
/* pointers to AR representation levels tables */
|
|
||||||
const WebRtc_Word16 *WebRtcIsac_kQArRcLevelsPtr[AR_ORDER] = {
|
|
||||||
WebRtcIsac_kQArRc1Levels, WebRtcIsac_kQArRc2Levels, WebRtcIsac_kQArRc3Levels,
|
|
||||||
WebRtcIsac_kQArRc4Levels, WebRtcIsac_kQArRc5Levels, WebRtcIsac_kQArRc6Levels
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
/******************** GAIN Coefficient Tables ***********************/
|
|
||||||
/* cdf for Gain coefficient */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQGainCdf[19] = {
|
|
||||||
0, 2, 4, 6, 8, 10, 12, 14, 16, 1172,
|
|
||||||
11119, 29411, 51699, 64445, 65527, 65529, 65531, 65533, 65535};
|
|
||||||
|
|
||||||
/* representation levels for quantized squared Gain coefficient */
|
|
||||||
const WebRtc_Word32 WebRtcIsac_kQGain2Levels[18] = {
|
|
||||||
// 17, 28, 46, 76, 128, 215, 364, 709, 1268, 1960, 3405, 6078, 11286, 17827, 51918, 134498, 487432, 2048000};
|
|
||||||
128, 128, 128, 128, 128, 215, 364, 709, 1268, 1960, 3405, 6078, 11286, 17827, 51918, 134498, 487432, 2048000};
|
|
||||||
/* quantization boundary levels for squared Gain coefficient */
|
|
||||||
const WebRtc_Word32 WebRtcIsac_kQGain2BoundaryLevels[19] = {
|
|
||||||
0, 21, 35, 59, 99, 166, 280, 475, 815, 1414, 2495, 4505, 8397, 16405, 34431, 81359, 240497, 921600, 0x7FFFFFFF};
|
|
||||||
|
|
||||||
/* pointers to Gain cdf table */
|
|
||||||
const WebRtc_UWord16 *WebRtcIsac_kQGainCdf_ptr[1] = {WebRtcIsac_kQGainCdf};
|
|
||||||
|
|
||||||
/* Gain initial index for gain quantizer and cdf table search */
|
|
||||||
const WebRtc_UWord16 WebRtcIsac_kQGainInitIndex[1] = {11};
|
|
||||||
|
|
||||||
/************************* Cosine Tables ****************************/
|
|
||||||
/* Cosine table */
|
|
||||||
const WebRtc_Word16 WebRtcIsac_kCos[6][60] = {
|
|
||||||
{512, 512, 511, 510, 508, 507, 505, 502, 499, 496, 493, 489, 485, 480, 476, 470, 465, 459, 453, 447,
|
|
||||||
440, 433, 426, 418, 410, 402, 394, 385, 376, 367, 357, 348, 338, 327, 317, 306, 295, 284, 273, 262,
|
|
||||||
250, 238, 226, 214, 202, 190, 177, 165, 152, 139, 126, 113, 100, 87, 73, 60, 47, 33, 20, 7},
|
|
||||||
{512, 510, 508, 503, 498, 491, 483, 473, 462, 450, 437, 422, 406, 389, 371, 352, 333, 312, 290, 268,
|
|
||||||
244, 220, 196, 171, 145, 120, 93, 67, 40, 13, -13, -40, -67, -93, -120, -145, -171, -196, -220, -244,
|
|
||||||
-268, -290, -312, -333, -352, -371, -389, -406, -422, -437, -450, -462, -473, -483, -491, -498, -503, -508, -510, -512},
|
|
||||||
{512, 508, 502, 493, 480, 465, 447, 426, 402, 376, 348, 317, 284, 250, 214, 177, 139, 100, 60, 20,
|
|
||||||
-20, -60, -100, -139, -177, -214, -250, -284, -317, -348, -376, -402, -426, -447, -465, -480, -493, -502, -508, -512,
|
|
||||||
-512, -508, -502, -493, -480, -465, -447, -426, -402, -376, -348, -317, -284, -250, -214, -177, -139, -100, -60, -20},
|
|
||||||
{511, 506, 495, 478, 456, 429, 398, 362, 322, 279, 232, 183, 133, 80, 27, -27, -80, -133, -183, -232,
|
|
||||||
-279, -322, -362, -398, -429, -456, -478, -495, -506, -511, -511, -506, -495, -478, -456, -429, -398, -362, -322, -279,
|
|
||||||
-232, -183, -133, -80, -27, 27, 80, 133, 183, 232, 279, 322, 362, 398, 429, 456, 478, 495, 506, 511},
|
|
||||||
{511, 502, 485, 459, 426, 385, 338, 284, 226, 165, 100, 33, -33, -100, -165, -226, -284, -338, -385, -426,
|
|
||||||
-459, -485, -502, -511, -511, -502, -485, -459, -426, -385, -338, -284, -226, -165, -100, -33, 33, 100, 165, 226,
|
|
||||||
284, 338, 385, 426, 459, 485, 502, 511, 511, 502, 485, 459, 426, 385, 338, 284, 226, 165, 100, 33},
|
|
||||||
{510, 498, 473, 437, 389, 333, 268, 196, 120, 40, -40, -120, -196, -268, -333, -389, -437, -473, -498, -510,
|
|
||||||
-510, -498, -473, -437, -389, -333, -268, -196, -120, -40, 40, 120, 196, 268, 333, 389, 437, 473, 498, 510,
|
|
||||||
510, 498, 473, 437, 389, 333, 268, 196, 120, 40, -40, -120, -196, -268, -333, -389, -437, -473, -498, -510}
|
|
||||||
};
|
|
||||||
|
|
@ -1,76 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* spectrum_ar_model_tables.h
|
|
||||||
*
|
|
||||||
* This file contains definitions of tables with AR coefficients,
|
|
||||||
* Gain coefficients and cosine tables.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_SPECTRUM_AR_MODEL_TABLES_H_
|
|
||||||
#define WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_SPECTRUM_AR_MODEL_TABLES_H_
|
|
||||||
|
|
||||||
#include "structs.h"
|
|
||||||
|
|
||||||
/********************* AR Coefficient Tables ************************/
|
|
||||||
/* cdf for quantized reflection coefficient 1 */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQArRc1Cdf[12];
|
|
||||||
|
|
||||||
/* cdf for quantized reflection coefficient 2 */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQArRc2Cdf[12];
|
|
||||||
|
|
||||||
/* cdf for quantized reflection coefficient 3 */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQArRc3Cdf[12];
|
|
||||||
|
|
||||||
/* cdf for quantized reflection coefficient 4 */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQArRc4Cdf[12];
|
|
||||||
|
|
||||||
/* cdf for quantized reflection coefficient 5 */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQArRc5Cdf[12];
|
|
||||||
|
|
||||||
/* cdf for quantized reflection coefficient 6 */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQArRc6Cdf[12];
|
|
||||||
|
|
||||||
/* quantization boundary levels for reflection coefficients */
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kQArBoundaryLevels[12];
|
|
||||||
|
|
||||||
/* initial indices for AR reflection coefficient quantizer and cdf table search */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQArRcInitIndex[AR_ORDER];
|
|
||||||
|
|
||||||
/* pointers to AR cdf tables */
|
|
||||||
extern const WebRtc_UWord16 *WebRtcIsac_kQArRcCdfPtr[AR_ORDER];
|
|
||||||
|
|
||||||
/* pointers to AR representation levels tables */
|
|
||||||
extern const WebRtc_Word16 *WebRtcIsac_kQArRcLevelsPtr[AR_ORDER];
|
|
||||||
|
|
||||||
|
|
||||||
/******************** GAIN Coefficient Tables ***********************/
|
|
||||||
/* cdf for Gain coefficient */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQGainCdf[19];
|
|
||||||
|
|
||||||
/* representation levels for quantized Gain coefficient */
|
|
||||||
extern const WebRtc_Word32 WebRtcIsac_kQGain2Levels[18];
|
|
||||||
|
|
||||||
/* squared quantization boundary levels for Gain coefficient */
|
|
||||||
extern const WebRtc_Word32 WebRtcIsac_kQGain2BoundaryLevels[19];
|
|
||||||
|
|
||||||
/* pointer to Gain cdf table */
|
|
||||||
extern const WebRtc_UWord16 *WebRtcIsac_kQGainCdf_ptr[1];
|
|
||||||
|
|
||||||
/* Gain initial index for gain quantizer and cdf table search */
|
|
||||||
extern const WebRtc_UWord16 WebRtcIsac_kQGainInitIndex[1];
|
|
||||||
|
|
||||||
/************************* Cosine Tables ****************************/
|
|
||||||
/* Cosine table */
|
|
||||||
extern const WebRtc_Word16 WebRtcIsac_kCos[6][60];
|
|
||||||
|
|
||||||
#endif /* WEBRTC_MODULES_AUDIO_CODING_CODECS_ISAC_MAIN_SOURCE_SPECTRUM_AR_MODEL_TABLES_H_ */
|
|
||||||
|
|
@ -1,159 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
// This header file includes the inline functions in
|
|
||||||
// the fix point signal processing library.
|
|
||||||
|
|
||||||
#ifndef WEBRTC_SPL_SPL_INL_H_
|
|
||||||
#define WEBRTC_SPL_SPL_INL_H_
|
|
||||||
|
|
||||||
#ifdef WEBRTC_ARCH_ARM_V7A
|
|
||||||
#include "spl_inl_armv7.h"
|
|
||||||
#else
|
|
||||||
|
|
||||||
static __inline WebRtc_Word16 WebRtcSpl_SatW32ToW16(WebRtc_Word32 value32) {
|
|
||||||
WebRtc_Word16 out16 = (WebRtc_Word16) value32;
|
|
||||||
|
|
||||||
if (value32 > 32767)
|
|
||||||
out16 = 32767;
|
|
||||||
else if (value32 < -32768)
|
|
||||||
out16 = -32768;
|
|
||||||
|
|
||||||
return out16;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline WebRtc_Word16 WebRtcSpl_AddSatW16(WebRtc_Word16 a,
|
|
||||||
WebRtc_Word16 b) {
|
|
||||||
return WebRtcSpl_SatW32ToW16((WebRtc_Word32) a + (WebRtc_Word32) b);
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline WebRtc_Word32 WebRtcSpl_AddSatW32(WebRtc_Word32 l_var1,
|
|
||||||
WebRtc_Word32 l_var2) {
|
|
||||||
WebRtc_Word32 l_sum;
|
|
||||||
|
|
||||||
// perform long addition
|
|
||||||
l_sum = l_var1 + l_var2;
|
|
||||||
|
|
||||||
// check for under or overflow
|
|
||||||
if (WEBRTC_SPL_IS_NEG(l_var1)) {
|
|
||||||
if (WEBRTC_SPL_IS_NEG(l_var2) && !WEBRTC_SPL_IS_NEG(l_sum)) {
|
|
||||||
l_sum = (WebRtc_Word32)0x80000000;
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
if (!WEBRTC_SPL_IS_NEG(l_var2) && WEBRTC_SPL_IS_NEG(l_sum)) {
|
|
||||||
l_sum = (WebRtc_Word32)0x7FFFFFFF;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return l_sum;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline WebRtc_Word16 WebRtcSpl_SubSatW16(WebRtc_Word16 var1,
|
|
||||||
WebRtc_Word16 var2) {
|
|
||||||
return WebRtcSpl_SatW32ToW16((WebRtc_Word32) var1 - (WebRtc_Word32) var2);
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline WebRtc_Word32 WebRtcSpl_SubSatW32(WebRtc_Word32 l_var1,
|
|
||||||
WebRtc_Word32 l_var2) {
|
|
||||||
WebRtc_Word32 l_diff;
|
|
||||||
|
|
||||||
// perform subtraction
|
|
||||||
l_diff = l_var1 - l_var2;
|
|
||||||
|
|
||||||
// check for underflow
|
|
||||||
if ((l_var1 < 0) && (l_var2 > 0) && (l_diff > 0))
|
|
||||||
l_diff = (WebRtc_Word32)0x80000000;
|
|
||||||
// check for overflow
|
|
||||||
if ((l_var1 > 0) && (l_var2 < 0) && (l_diff < 0))
|
|
||||||
l_diff = (WebRtc_Word32)0x7FFFFFFF;
|
|
||||||
|
|
||||||
return l_diff;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline WebRtc_Word16 WebRtcSpl_GetSizeInBits(WebRtc_UWord32 n) {
|
|
||||||
int bits;
|
|
||||||
|
|
||||||
if (0xFFFF0000 & n) {
|
|
||||||
bits = 16;
|
|
||||||
} else {
|
|
||||||
bits = 0;
|
|
||||||
}
|
|
||||||
if (0x0000FF00 & (n >> bits)) bits += 8;
|
|
||||||
if (0x000000F0 & (n >> bits)) bits += 4;
|
|
||||||
if (0x0000000C & (n >> bits)) bits += 2;
|
|
||||||
if (0x00000002 & (n >> bits)) bits += 1;
|
|
||||||
if (0x00000001 & (n >> bits)) bits += 1;
|
|
||||||
|
|
||||||
return bits;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline int WebRtcSpl_NormW32(WebRtc_Word32 a) {
|
|
||||||
int zeros;
|
|
||||||
|
|
||||||
if (a <= 0) a ^= 0xFFFFFFFF;
|
|
||||||
|
|
||||||
if (!(0xFFFF8000 & a)) {
|
|
||||||
zeros = 16;
|
|
||||||
} else {
|
|
||||||
zeros = 0;
|
|
||||||
}
|
|
||||||
if (!(0xFF800000 & (a << zeros))) zeros += 8;
|
|
||||||
if (!(0xF8000000 & (a << zeros))) zeros += 4;
|
|
||||||
if (!(0xE0000000 & (a << zeros))) zeros += 2;
|
|
||||||
if (!(0xC0000000 & (a << zeros))) zeros += 1;
|
|
||||||
|
|
||||||
return zeros;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline int WebRtcSpl_NormU32(WebRtc_UWord32 a) {
|
|
||||||
int zeros;
|
|
||||||
|
|
||||||
if (a == 0) return 0;
|
|
||||||
|
|
||||||
if (!(0xFFFF0000 & a)) {
|
|
||||||
zeros = 16;
|
|
||||||
} else {
|
|
||||||
zeros = 0;
|
|
||||||
}
|
|
||||||
if (!(0xFF000000 & (a << zeros))) zeros += 8;
|
|
||||||
if (!(0xF0000000 & (a << zeros))) zeros += 4;
|
|
||||||
if (!(0xC0000000 & (a << zeros))) zeros += 2;
|
|
||||||
if (!(0x80000000 & (a << zeros))) zeros += 1;
|
|
||||||
|
|
||||||
return zeros;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline int WebRtcSpl_NormW16(WebRtc_Word16 a) {
|
|
||||||
int zeros;
|
|
||||||
|
|
||||||
if (a <= 0) a ^= 0xFFFF;
|
|
||||||
|
|
||||||
if (!(0xFF80 & a)) {
|
|
||||||
zeros = 8;
|
|
||||||
} else {
|
|
||||||
zeros = 0;
|
|
||||||
}
|
|
||||||
if (!(0xF800 & (a << zeros))) zeros += 4;
|
|
||||||
if (!(0xE000 & (a << zeros))) zeros += 2;
|
|
||||||
if (!(0xC000 & (a << zeros))) zeros += 1;
|
|
||||||
|
|
||||||
return zeros;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline int32_t WebRtc_MulAccumW16(int16_t a,
|
|
||||||
int16_t b,
|
|
||||||
int32_t c) {
|
|
||||||
return (a * b + c);
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif // WEBRTC_ARCH_ARM_V7A
|
|
||||||
|
|
||||||
#endif // WEBRTC_SPL_SPL_INL_H_
|
|
||||||
|
|
@ -1,137 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
// This header file includes the inline functions for ARM processors in
|
|
||||||
// the fix point signal processing library.
|
|
||||||
|
|
||||||
#ifndef WEBRTC_SPL_SPL_INL_ARMV7_H_
|
|
||||||
#define WEBRTC_SPL_SPL_INL_ARMV7_H_
|
|
||||||
|
|
||||||
static __inline WebRtc_Word32 WEBRTC_SPL_MUL_16_32_RSFT16(WebRtc_Word16 a,
|
|
||||||
WebRtc_Word32 b) {
|
|
||||||
WebRtc_Word32 tmp;
|
|
||||||
__asm__("smulwb %0, %1, %2":"=r"(tmp):"r"(b), "r"(a));
|
|
||||||
return tmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline WebRtc_Word32 WEBRTC_SPL_MUL_32_32_RSFT32(WebRtc_Word16 a,
|
|
||||||
WebRtc_Word16 b,
|
|
||||||
WebRtc_Word32 c) {
|
|
||||||
WebRtc_Word32 tmp;
|
|
||||||
__asm__("pkhbt %0, %1, %2, lsl #16" : "=r"(tmp) : "r"(b), "r"(a));
|
|
||||||
__asm__("smmul %0, %1, %2":"=r"(tmp):"r"(tmp), "r"(c));
|
|
||||||
return tmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline WebRtc_Word32 WEBRTC_SPL_MUL_32_32_RSFT32BI(WebRtc_Word32 a,
|
|
||||||
WebRtc_Word32 b) {
|
|
||||||
WebRtc_Word32 tmp;
|
|
||||||
__asm__("smmul %0, %1, %2":"=r"(tmp):"r"(a), "r"(b));
|
|
||||||
return tmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline WebRtc_Word32 WEBRTC_SPL_MUL_16_16(WebRtc_Word16 a,
|
|
||||||
WebRtc_Word16 b) {
|
|
||||||
WebRtc_Word32 tmp;
|
|
||||||
__asm__("smulbb %0, %1, %2":"=r"(tmp):"r"(a), "r"(b));
|
|
||||||
return tmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline int32_t WebRtc_MulAccumW16(int16_t a,
|
|
||||||
int16_t b,
|
|
||||||
int32_t c) {
|
|
||||||
int32_t tmp = 0;
|
|
||||||
__asm__("smlabb %0, %1, %2, %3":"=r"(tmp):"r"(a), "r"(b), "r"(c));
|
|
||||||
return tmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline WebRtc_Word16 WebRtcSpl_AddSatW16(WebRtc_Word16 a,
|
|
||||||
WebRtc_Word16 b) {
|
|
||||||
WebRtc_Word32 s_sum;
|
|
||||||
|
|
||||||
__asm__("qadd16 %0, %1, %2":"=r"(s_sum):"r"(a), "r"(b));
|
|
||||||
|
|
||||||
return (WebRtc_Word16) s_sum;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline WebRtc_Word32 WebRtcSpl_AddSatW32(WebRtc_Word32 l_var1,
|
|
||||||
WebRtc_Word32 l_var2) {
|
|
||||||
WebRtc_Word32 l_sum;
|
|
||||||
|
|
||||||
__asm__("qadd %0, %1, %2":"=r"(l_sum):"r"(l_var1), "r"(l_var2));
|
|
||||||
|
|
||||||
return l_sum;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline WebRtc_Word16 WebRtcSpl_SubSatW16(WebRtc_Word16 var1,
|
|
||||||
WebRtc_Word16 var2) {
|
|
||||||
WebRtc_Word32 s_sub;
|
|
||||||
|
|
||||||
__asm__("qsub16 %0, %1, %2":"=r"(s_sub):"r"(var1), "r"(var2));
|
|
||||||
|
|
||||||
return (WebRtc_Word16)s_sub;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline WebRtc_Word32 WebRtcSpl_SubSatW32(WebRtc_Word32 l_var1,
|
|
||||||
WebRtc_Word32 l_var2) {
|
|
||||||
WebRtc_Word32 l_sub;
|
|
||||||
|
|
||||||
__asm__("qsub %0, %1, %2":"=r"(l_sub):"r"(l_var1), "r"(l_var2));
|
|
||||||
|
|
||||||
return l_sub;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline WebRtc_Word16 WebRtcSpl_GetSizeInBits(WebRtc_UWord32 n) {
|
|
||||||
WebRtc_Word32 tmp;
|
|
||||||
|
|
||||||
__asm__("clz %0, %1":"=r"(tmp):"r"(n));
|
|
||||||
|
|
||||||
return (WebRtc_Word16)(32 - tmp);
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline int WebRtcSpl_NormW32(WebRtc_Word32 a) {
|
|
||||||
WebRtc_Word32 tmp;
|
|
||||||
|
|
||||||
if (a <= 0) a ^= 0xFFFFFFFF;
|
|
||||||
|
|
||||||
__asm__("clz %0, %1":"=r"(tmp):"r"(a));
|
|
||||||
|
|
||||||
return tmp - 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline int WebRtcSpl_NormU32(WebRtc_UWord32 a) {
|
|
||||||
int tmp;
|
|
||||||
|
|
||||||
if (a == 0) return 0;
|
|
||||||
|
|
||||||
__asm__("clz %0, %1":"=r"(tmp):"r"(a));
|
|
||||||
|
|
||||||
return tmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline int WebRtcSpl_NormW16(WebRtc_Word16 a) {
|
|
||||||
WebRtc_Word32 tmp;
|
|
||||||
|
|
||||||
if (a <= 0) a ^= 0xFFFFFFFF;
|
|
||||||
|
|
||||||
__asm__("clz %0, %1":"=r"(tmp):"r"(a));
|
|
||||||
|
|
||||||
return tmp - 17;
|
|
||||||
}
|
|
||||||
|
|
||||||
static __inline WebRtc_Word16 WebRtcSpl_SatW32ToW16(WebRtc_Word32 value32) {
|
|
||||||
WebRtc_Word16 out16;
|
|
||||||
|
|
||||||
__asm__("ssat %r0, #16, %r1" : "=r"(out16) : "r"(value32));
|
|
||||||
|
|
||||||
return out16;
|
|
||||||
}
|
|
||||||
#endif // WEBRTC_SPL_SPL_INL_ARMV7_H_
|
|
||||||
|
|
@ -1,184 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_Sqrt().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
WebRtc_Word32 WebRtcSpl_SqrtLocal(WebRtc_Word32 in);
|
|
||||||
|
|
||||||
WebRtc_Word32 WebRtcSpl_SqrtLocal(WebRtc_Word32 in)
|
|
||||||
{
|
|
||||||
|
|
||||||
WebRtc_Word16 x_half, t16;
|
|
||||||
WebRtc_Word32 A, B, x2;
|
|
||||||
|
|
||||||
/* The following block performs:
|
|
||||||
y=in/2
|
|
||||||
x=y-2^30
|
|
||||||
x_half=x/2^31
|
|
||||||
t = 1 + (x_half) - 0.5*((x_half)^2) + 0.5*((x_half)^3) - 0.625*((x_half)^4)
|
|
||||||
+ 0.875*((x_half)^5)
|
|
||||||
*/
|
|
||||||
|
|
||||||
B = in;
|
|
||||||
|
|
||||||
B = WEBRTC_SPL_RSHIFT_W32(B, 1); // B = in/2
|
|
||||||
B = B - ((WebRtc_Word32)0x40000000); // B = in/2 - 1/2
|
|
||||||
x_half = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(B, 16);// x_half = x/2 = (in-1)/2
|
|
||||||
B = B + ((WebRtc_Word32)0x40000000); // B = 1 + x/2
|
|
||||||
B = B + ((WebRtc_Word32)0x40000000); // Add 0.5 twice (since 1.0 does not exist in Q31)
|
|
||||||
|
|
||||||
x2 = ((WebRtc_Word32)x_half) * ((WebRtc_Word32)x_half) * 2; // A = (x/2)^2
|
|
||||||
A = -x2; // A = -(x/2)^2
|
|
||||||
B = B + (A >> 1); // B = 1 + x/2 - 0.5*(x/2)^2
|
|
||||||
|
|
||||||
A = WEBRTC_SPL_RSHIFT_W32(A, 16);
|
|
||||||
A = A * A * 2; // A = (x/2)^4
|
|
||||||
t16 = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(A, 16);
|
|
||||||
B = B + WEBRTC_SPL_MUL_16_16(-20480, t16) * 2; // B = B - 0.625*A
|
|
||||||
// After this, B = 1 + x/2 - 0.5*(x/2)^2 - 0.625*(x/2)^4
|
|
||||||
|
|
||||||
t16 = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(A, 16);
|
|
||||||
A = WEBRTC_SPL_MUL_16_16(x_half, t16) * 2; // A = (x/2)^5
|
|
||||||
t16 = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(A, 16);
|
|
||||||
B = B + WEBRTC_SPL_MUL_16_16(28672, t16) * 2; // B = B + 0.875*A
|
|
||||||
// After this, B = 1 + x/2 - 0.5*(x/2)^2 - 0.625*(x/2)^4 + 0.875*(x/2)^5
|
|
||||||
|
|
||||||
t16 = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(x2, 16);
|
|
||||||
A = WEBRTC_SPL_MUL_16_16(x_half, t16) * 2; // A = x/2^3
|
|
||||||
|
|
||||||
B = B + (A >> 1); // B = B + 0.5*A
|
|
||||||
// After this, B = 1 + x/2 - 0.5*(x/2)^2 + 0.5*(x/2)^3 - 0.625*(x/2)^4 + 0.875*(x/2)^5
|
|
||||||
|
|
||||||
B = B + ((WebRtc_Word32)32768); // Round off bit
|
|
||||||
|
|
||||||
return B;
|
|
||||||
}
|
|
||||||
|
|
||||||
WebRtc_Word32 WebRtcSpl_Sqrt(WebRtc_Word32 value)
|
|
||||||
{
|
|
||||||
/*
|
|
||||||
Algorithm:
|
|
||||||
|
|
||||||
Six term Taylor Series is used here to compute the square root of a number
|
|
||||||
y^0.5 = (1+x)^0.5 where x = y-1
|
|
||||||
= 1+(x/2)-0.5*((x/2)^2+0.5*((x/2)^3-0.625*((x/2)^4+0.875*((x/2)^5)
|
|
||||||
0.5 <= x < 1
|
|
||||||
|
|
||||||
Example of how the algorithm works, with ut=sqrt(in), and
|
|
||||||
with in=73632 and ut=271 (even shift value case):
|
|
||||||
|
|
||||||
in=73632
|
|
||||||
y= in/131072
|
|
||||||
x=y-1
|
|
||||||
t = 1 + (x/2) - 0.5*((x/2)^2) + 0.5*((x/2)^3) - 0.625*((x/2)^4) + 0.875*((x/2)^5)
|
|
||||||
ut=t*(1/sqrt(2))*512
|
|
||||||
|
|
||||||
or:
|
|
||||||
|
|
||||||
in=73632
|
|
||||||
in2=73632*2^14
|
|
||||||
y= in2/2^31
|
|
||||||
x=y-1
|
|
||||||
t = 1 + (x/2) - 0.5*((x/2)^2) + 0.5*((x/2)^3) - 0.625*((x/2)^4) + 0.875*((x/2)^5)
|
|
||||||
ut=t*(1/sqrt(2))
|
|
||||||
ut2=ut*2^9
|
|
||||||
|
|
||||||
which gives:
|
|
||||||
|
|
||||||
in = 73632
|
|
||||||
in2 = 1206386688
|
|
||||||
y = 0.56176757812500
|
|
||||||
x = -0.43823242187500
|
|
||||||
t = 0.74973506527313
|
|
||||||
ut = 0.53014274874797
|
|
||||||
ut2 = 2.714330873589594e+002
|
|
||||||
|
|
||||||
or:
|
|
||||||
|
|
||||||
in=73632
|
|
||||||
in2=73632*2^14
|
|
||||||
y=in2/2
|
|
||||||
x=y-2^30
|
|
||||||
x_half=x/2^31
|
|
||||||
t = 1 + (x_half) - 0.5*((x_half)^2) + 0.5*((x_half)^3) - 0.625*((x_half)^4)
|
|
||||||
+ 0.875*((x_half)^5)
|
|
||||||
ut=t*(1/sqrt(2))
|
|
||||||
ut2=ut*2^9
|
|
||||||
|
|
||||||
which gives:
|
|
||||||
|
|
||||||
in = 73632
|
|
||||||
in2 = 1206386688
|
|
||||||
y = 603193344
|
|
||||||
x = -470548480
|
|
||||||
x_half = -0.21911621093750
|
|
||||||
t = 0.74973506527313
|
|
||||||
ut = 0.53014274874797
|
|
||||||
ut2 = 2.714330873589594e+002
|
|
||||||
|
|
||||||
*/
|
|
||||||
|
|
||||||
WebRtc_Word16 x_norm, nshift, t16, sh;
|
|
||||||
WebRtc_Word32 A;
|
|
||||||
|
|
||||||
WebRtc_Word16 k_sqrt_2 = 23170; // 1/sqrt2 (==5a82)
|
|
||||||
|
|
||||||
A = value;
|
|
||||||
|
|
||||||
if (A == 0)
|
|
||||||
return (WebRtc_Word32)0; // sqrt(0) = 0
|
|
||||||
|
|
||||||
sh = WebRtcSpl_NormW32(A); // # shifts to normalize A
|
|
||||||
A = WEBRTC_SPL_LSHIFT_W32(A, sh); // Normalize A
|
|
||||||
if (A < (WEBRTC_SPL_WORD32_MAX - 32767))
|
|
||||||
{
|
|
||||||
A = A + ((WebRtc_Word32)32768); // Round off bit
|
|
||||||
} else
|
|
||||||
{
|
|
||||||
A = WEBRTC_SPL_WORD32_MAX;
|
|
||||||
}
|
|
||||||
|
|
||||||
x_norm = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(A, 16); // x_norm = AH
|
|
||||||
|
|
||||||
nshift = WEBRTC_SPL_RSHIFT_W16(sh, 1); // nshift = sh>>1
|
|
||||||
nshift = -nshift; // Negate the power for later de-normalization
|
|
||||||
|
|
||||||
A = (WebRtc_Word32)WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)x_norm, 16);
|
|
||||||
A = WEBRTC_SPL_ABS_W32(A); // A = abs(x_norm<<16)
|
|
||||||
A = WebRtcSpl_SqrtLocal(A); // A = sqrt(A)
|
|
||||||
|
|
||||||
if ((-2 * nshift) == sh)
|
|
||||||
{ // Even shift value case
|
|
||||||
|
|
||||||
t16 = (WebRtc_Word16)WEBRTC_SPL_RSHIFT_W32(A, 16); // t16 = AH
|
|
||||||
|
|
||||||
A = WEBRTC_SPL_MUL_16_16(k_sqrt_2, t16) * 2; // A = 1/sqrt(2)*t16
|
|
||||||
A = A + ((WebRtc_Word32)32768); // Round off
|
|
||||||
A = A & ((WebRtc_Word32)0x7fff0000); // Round off
|
|
||||||
|
|
||||||
A = WEBRTC_SPL_RSHIFT_W32(A, 15); // A = A>>16
|
|
||||||
|
|
||||||
} else
|
|
||||||
{
|
|
||||||
A = WEBRTC_SPL_RSHIFT_W32(A, 16); // A = A>>16
|
|
||||||
}
|
|
||||||
|
|
||||||
A = A & ((WebRtc_Word32)0x0000ffff);
|
|
||||||
A = (WebRtc_Word32)WEBRTC_SPL_SHIFT_W32(A, nshift); // De-normalize the result
|
|
||||||
|
|
||||||
return A;
|
|
||||||
}
|
|
||||||
|
|
@ -1,53 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_SqrtFloor().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
#define WEBRTC_SPL_SQRT_ITER(N) \
|
|
||||||
try1 = root + (1 << (N)); \
|
|
||||||
if (value >= try1 << (N)) \
|
|
||||||
{ \
|
|
||||||
value -= try1 << (N); \
|
|
||||||
root |= 2 << (N); \
|
|
||||||
}
|
|
||||||
|
|
||||||
// (out) Square root of input parameter
|
|
||||||
WebRtc_Word32 WebRtcSpl_SqrtFloor(WebRtc_Word32 value)
|
|
||||||
{
|
|
||||||
// new routine for performance, 4 cycles/bit in ARM
|
|
||||||
// output precision is 16 bits
|
|
||||||
|
|
||||||
WebRtc_Word32 root = 0, try1;
|
|
||||||
|
|
||||||
WEBRTC_SPL_SQRT_ITER (15);
|
|
||||||
WEBRTC_SPL_SQRT_ITER (14);
|
|
||||||
WEBRTC_SPL_SQRT_ITER (13);
|
|
||||||
WEBRTC_SPL_SQRT_ITER (12);
|
|
||||||
WEBRTC_SPL_SQRT_ITER (11);
|
|
||||||
WEBRTC_SPL_SQRT_ITER (10);
|
|
||||||
WEBRTC_SPL_SQRT_ITER ( 9);
|
|
||||||
WEBRTC_SPL_SQRT_ITER ( 8);
|
|
||||||
WEBRTC_SPL_SQRT_ITER ( 7);
|
|
||||||
WEBRTC_SPL_SQRT_ITER ( 6);
|
|
||||||
WEBRTC_SPL_SQRT_ITER ( 5);
|
|
||||||
WEBRTC_SPL_SQRT_ITER ( 4);
|
|
||||||
WEBRTC_SPL_SQRT_ITER ( 3);
|
|
||||||
WEBRTC_SPL_SQRT_ITER ( 2);
|
|
||||||
WEBRTC_SPL_SQRT_ITER ( 1);
|
|
||||||
WEBRTC_SPL_SQRT_ITER ( 0);
|
|
||||||
|
|
||||||
return root >> 1;
|
|
||||||
}
|
|
||||||
|
|
@ -1,25 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_get_version().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <string.h>
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
WebRtc_Word16 WebRtcSpl_get_version(char* version, WebRtc_Word16 length_in_bytes)
|
|
||||||
{
|
|
||||||
strncpy(version, "1.2.0", length_in_bytes);
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
@ -1,198 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the splitting filter functions.
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
// Number of samples in a low/high-band frame.
|
|
||||||
enum
|
|
||||||
{
|
|
||||||
kBandFrameLength = 160
|
|
||||||
};
|
|
||||||
|
|
||||||
// QMF filter coefficients in Q16.
|
|
||||||
static const WebRtc_UWord16 WebRtcSpl_kAllPassFilter1[3] = {6418, 36982, 57261};
|
|
||||||
static const WebRtc_UWord16 WebRtcSpl_kAllPassFilter2[3] = {21333, 49062, 63010};
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////////////////////
|
|
||||||
// WebRtcSpl_AllPassQMF(...)
|
|
||||||
//
|
|
||||||
// Allpass filter used by the analysis and synthesis parts of the QMF filter.
|
|
||||||
//
|
|
||||||
// Input:
|
|
||||||
// - in_data : Input data sequence (Q10)
|
|
||||||
// - data_length : Length of data sequence (>2)
|
|
||||||
// - filter_coefficients : Filter coefficients (length 3, Q16)
|
|
||||||
//
|
|
||||||
// Input & Output:
|
|
||||||
// - filter_state : Filter state (length 6, Q10).
|
|
||||||
//
|
|
||||||
// Output:
|
|
||||||
// - out_data : Output data sequence (Q10), length equal to
|
|
||||||
// |data_length|
|
|
||||||
//
|
|
||||||
|
|
||||||
void WebRtcSpl_AllPassQMF(WebRtc_Word32* in_data, const WebRtc_Word16 data_length,
|
|
||||||
WebRtc_Word32* out_data, const WebRtc_UWord16* filter_coefficients,
|
|
||||||
WebRtc_Word32* filter_state)
|
|
||||||
{
|
|
||||||
// The procedure is to filter the input with three first order all pass filters
|
|
||||||
// (cascade operations).
|
|
||||||
//
|
|
||||||
// a_3 + q^-1 a_2 + q^-1 a_1 + q^-1
|
|
||||||
// y[n] = ----------- ----------- ----------- x[n]
|
|
||||||
// 1 + a_3q^-1 1 + a_2q^-1 1 + a_1q^-1
|
|
||||||
//
|
|
||||||
// The input vector |filter_coefficients| includes these three filter coefficients.
|
|
||||||
// The filter state contains the in_data state, in_data[-1], followed by
|
|
||||||
// the out_data state, out_data[-1]. This is repeated for each cascade.
|
|
||||||
// The first cascade filter will filter the |in_data| and store the output in
|
|
||||||
// |out_data|. The second will the take the |out_data| as input and make an
|
|
||||||
// intermediate storage in |in_data|, to save memory. The third, and final, cascade
|
|
||||||
// filter operation takes the |in_data| (which is the output from the previous cascade
|
|
||||||
// filter) and store the output in |out_data|.
|
|
||||||
// Note that the input vector values are changed during the process.
|
|
||||||
WebRtc_Word16 k;
|
|
||||||
WebRtc_Word32 diff;
|
|
||||||
// First all-pass cascade; filter from in_data to out_data.
|
|
||||||
|
|
||||||
// Let y_i[n] indicate the output of cascade filter i (with filter coefficient a_i) at
|
|
||||||
// vector position n. Then the final output will be y[n] = y_3[n]
|
|
||||||
|
|
||||||
// First loop, use the states stored in memory.
|
|
||||||
// "diff" should be safe from wrap around since max values are 2^25
|
|
||||||
diff = WEBRTC_SPL_SUB_SAT_W32(in_data[0], filter_state[1]); // = (x[0] - y_1[-1])
|
|
||||||
// y_1[0] = x[-1] + a_1 * (x[0] - y_1[-1])
|
|
||||||
out_data[0] = WEBRTC_SPL_SCALEDIFF32(filter_coefficients[0], diff, filter_state[0]);
|
|
||||||
|
|
||||||
// For the remaining loops, use previous values.
|
|
||||||
for (k = 1; k < data_length; k++)
|
|
||||||
{
|
|
||||||
diff = WEBRTC_SPL_SUB_SAT_W32(in_data[k], out_data[k - 1]); // = (x[n] - y_1[n-1])
|
|
||||||
// y_1[n] = x[n-1] + a_1 * (x[n] - y_1[n-1])
|
|
||||||
out_data[k] = WEBRTC_SPL_SCALEDIFF32(filter_coefficients[0], diff, in_data[k - 1]);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Update states.
|
|
||||||
filter_state[0] = in_data[data_length - 1]; // x[N-1], becomes x[-1] next time
|
|
||||||
filter_state[1] = out_data[data_length - 1]; // y_1[N-1], becomes y_1[-1] next time
|
|
||||||
|
|
||||||
// Second all-pass cascade; filter from out_data to in_data.
|
|
||||||
diff = WEBRTC_SPL_SUB_SAT_W32(out_data[0], filter_state[3]); // = (y_1[0] - y_2[-1])
|
|
||||||
// y_2[0] = y_1[-1] + a_2 * (y_1[0] - y_2[-1])
|
|
||||||
in_data[0] = WEBRTC_SPL_SCALEDIFF32(filter_coefficients[1], diff, filter_state[2]);
|
|
||||||
for (k = 1; k < data_length; k++)
|
|
||||||
{
|
|
||||||
diff = WEBRTC_SPL_SUB_SAT_W32(out_data[k], in_data[k - 1]); // =(y_1[n] - y_2[n-1])
|
|
||||||
// y_2[0] = y_1[-1] + a_2 * (y_1[0] - y_2[-1])
|
|
||||||
in_data[k] = WEBRTC_SPL_SCALEDIFF32(filter_coefficients[1], diff, out_data[k-1]);
|
|
||||||
}
|
|
||||||
|
|
||||||
filter_state[2] = out_data[data_length - 1]; // y_1[N-1], becomes y_1[-1] next time
|
|
||||||
filter_state[3] = in_data[data_length - 1]; // y_2[N-1], becomes y_2[-1] next time
|
|
||||||
|
|
||||||
// Third all-pass cascade; filter from in_data to out_data.
|
|
||||||
diff = WEBRTC_SPL_SUB_SAT_W32(in_data[0], filter_state[5]); // = (y_2[0] - y[-1])
|
|
||||||
// y[0] = y_2[-1] + a_3 * (y_2[0] - y[-1])
|
|
||||||
out_data[0] = WEBRTC_SPL_SCALEDIFF32(filter_coefficients[2], diff, filter_state[4]);
|
|
||||||
for (k = 1; k < data_length; k++)
|
|
||||||
{
|
|
||||||
diff = WEBRTC_SPL_SUB_SAT_W32(in_data[k], out_data[k - 1]); // = (y_2[n] - y[n-1])
|
|
||||||
// y[n] = y_2[n-1] + a_3 * (y_2[n] - y[n-1])
|
|
||||||
out_data[k] = WEBRTC_SPL_SCALEDIFF32(filter_coefficients[2], diff, in_data[k-1]);
|
|
||||||
}
|
|
||||||
filter_state[4] = in_data[data_length - 1]; // y_2[N-1], becomes y_2[-1] next time
|
|
||||||
filter_state[5] = out_data[data_length - 1]; // y[N-1], becomes y[-1] next time
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcSpl_AnalysisQMF(const WebRtc_Word16* in_data, WebRtc_Word16* low_band,
|
|
||||||
WebRtc_Word16* high_band, WebRtc_Word32* filter_state1,
|
|
||||||
WebRtc_Word32* filter_state2)
|
|
||||||
{
|
|
||||||
WebRtc_Word16 i;
|
|
||||||
WebRtc_Word16 k;
|
|
||||||
WebRtc_Word32 tmp;
|
|
||||||
WebRtc_Word32 half_in1[kBandFrameLength];
|
|
||||||
WebRtc_Word32 half_in2[kBandFrameLength];
|
|
||||||
WebRtc_Word32 filter1[kBandFrameLength];
|
|
||||||
WebRtc_Word32 filter2[kBandFrameLength];
|
|
||||||
|
|
||||||
// Split even and odd samples. Also shift them to Q10.
|
|
||||||
for (i = 0, k = 0; i < kBandFrameLength; i++, k += 2)
|
|
||||||
{
|
|
||||||
half_in2[i] = WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)in_data[k], 10);
|
|
||||||
half_in1[i] = WEBRTC_SPL_LSHIFT_W32((WebRtc_Word32)in_data[k + 1], 10);
|
|
||||||
}
|
|
||||||
|
|
||||||
// All pass filter even and odd samples, independently.
|
|
||||||
WebRtcSpl_AllPassQMF(half_in1, kBandFrameLength, filter1, WebRtcSpl_kAllPassFilter1,
|
|
||||||
filter_state1);
|
|
||||||
WebRtcSpl_AllPassQMF(half_in2, kBandFrameLength, filter2, WebRtcSpl_kAllPassFilter2,
|
|
||||||
filter_state2);
|
|
||||||
|
|
||||||
// Take the sum and difference of filtered version of odd and even
|
|
||||||
// branches to get upper & lower band.
|
|
||||||
for (i = 0; i < kBandFrameLength; i++)
|
|
||||||
{
|
|
||||||
tmp = filter1[i] + filter2[i] + 1024;
|
|
||||||
tmp = WEBRTC_SPL_RSHIFT_W32(tmp, 11);
|
|
||||||
low_band[i] = WebRtcSpl_SatW32ToW16(tmp);
|
|
||||||
|
|
||||||
tmp = filter1[i] - filter2[i] + 1024;
|
|
||||||
tmp = WEBRTC_SPL_RSHIFT_W32(tmp, 11);
|
|
||||||
high_band[i] = WebRtcSpl_SatW32ToW16(tmp);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void WebRtcSpl_SynthesisQMF(const WebRtc_Word16* low_band, const WebRtc_Word16* high_band,
|
|
||||||
WebRtc_Word16* out_data, WebRtc_Word32* filter_state1,
|
|
||||||
WebRtc_Word32* filter_state2)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 tmp;
|
|
||||||
WebRtc_Word32 half_in1[kBandFrameLength];
|
|
||||||
WebRtc_Word32 half_in2[kBandFrameLength];
|
|
||||||
WebRtc_Word32 filter1[kBandFrameLength];
|
|
||||||
WebRtc_Word32 filter2[kBandFrameLength];
|
|
||||||
WebRtc_Word16 i;
|
|
||||||
WebRtc_Word16 k;
|
|
||||||
|
|
||||||
// Obtain the sum and difference channels out of upper and lower-band channels.
|
|
||||||
// Also shift to Q10 domain.
|
|
||||||
for (i = 0; i < kBandFrameLength; i++)
|
|
||||||
{
|
|
||||||
tmp = (WebRtc_Word32)low_band[i] + (WebRtc_Word32)high_band[i];
|
|
||||||
half_in1[i] = WEBRTC_SPL_LSHIFT_W32(tmp, 10);
|
|
||||||
tmp = (WebRtc_Word32)low_band[i] - (WebRtc_Word32)high_band[i];
|
|
||||||
half_in2[i] = WEBRTC_SPL_LSHIFT_W32(tmp, 10);
|
|
||||||
}
|
|
||||||
|
|
||||||
// all-pass filter the sum and difference channels
|
|
||||||
WebRtcSpl_AllPassQMF(half_in1, kBandFrameLength, filter1, WebRtcSpl_kAllPassFilter2,
|
|
||||||
filter_state1);
|
|
||||||
WebRtcSpl_AllPassQMF(half_in2, kBandFrameLength, filter2, WebRtcSpl_kAllPassFilter1,
|
|
||||||
filter_state2);
|
|
||||||
|
|
||||||
// The filtered signals are even and odd samples of the output. Combine
|
|
||||||
// them. The signals are Q10 should shift them back to Q0 and take care of
|
|
||||||
// saturation.
|
|
||||||
for (i = 0, k = 0; i < kBandFrameLength; i++)
|
|
||||||
{
|
|
||||||
tmp = WEBRTC_SPL_RSHIFT_W32(filter2[i] + 512, 10);
|
|
||||||
out_data[k++] = WebRtcSpl_SatW32ToW16(tmp);
|
|
||||||
|
|
||||||
tmp = WEBRTC_SPL_RSHIFT_W32(filter1[i] + 512, 10);
|
|
||||||
out_data[k++] = WebRtcSpl_SatW32ToW16(tmp);
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
@ -1,35 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
||||||
*
|
|
||||||
* Use of this source code is governed by a BSD-style license
|
|
||||||
* that can be found in the LICENSE file in the root of the source
|
|
||||||
* tree. An additional intellectual property rights grant can be found
|
|
||||||
* in the file PATENTS. All contributing project authors may
|
|
||||||
* be found in the AUTHORS file in the root of the source tree.
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
* This file contains the function WebRtcSpl_SqrtOfOneMinusXSquared().
|
|
||||||
* The description header can be found in signal_processing_library.h
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "signal_processing_library.h"
|
|
||||||
|
|
||||||
void WebRtcSpl_SqrtOfOneMinusXSquared(WebRtc_Word16 *xQ15, int vector_length,
|
|
||||||
WebRtc_Word16 *yQ15)
|
|
||||||
{
|
|
||||||
WebRtc_Word32 sq;
|
|
||||||
int m;
|
|
||||||
WebRtc_Word16 tmp;
|
|
||||||
|
|
||||||
for (m = 0; m < vector_length; m++)
|
|
||||||
{
|
|
||||||
tmp = xQ15[m];
|
|
||||||
sq = WEBRTC_SPL_MUL_16_16(tmp, tmp); // x^2 in Q30
|
|
||||||
sq = 1073741823 - sq; // 1-x^2, where 1 ~= 0.99999999906 is 1073741823 in Q30
|
|
||||||
sq = WebRtcSpl_Sqrt(sq); // sqrt(1-x^2) in Q15
|
|
||||||
yQ15[m] = (WebRtc_Word16)sq;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue