SSE2 implementation of the PVQ search
We used the SSE reciprocal square root instruction to vectorize the serch rather than compare one at a time with multiplies. Speeds up the entire encoder by 8-10%.
Showing
- celt/bands.c 1 addition, 1 deletioncelt/bands.c
- celt/tests/test_unit_mathops.c 1 addition, 0 deletionscelt/tests/test_unit_mathops.c
- celt/tests/test_unit_rotation.c 1 addition, 0 deletionscelt/tests/test_unit_rotation.c
- celt/vq.c 24 additions, 10 deletionscelt/vq.c
- celt/vq.h 11 additions, 1 deletioncelt/vq.h
- celt/x86/vq_sse.h 50 additions, 0 deletionscelt/x86/vq_sse.h
- celt/x86/vq_sse2.c 217 additions, 0 deletionscelt/x86/vq_sse2.c
- celt/x86/x86_celt_map.c 13 additions, 0 deletionscelt/x86/x86_celt_map.c
- celt_headers.mk 1 addition, 0 deletionscelt_headers.mk
- celt_sources.mk 1 addition, 1 deletioncelt_sources.mk
Loading
Please register or sign in to comment