pxdct 0.3.6

Discrete cosine transform
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96

/*
 * // Copyright (c) Radzivon Bartoshyk 12/2025. All rights reserved.
 * //
 * // Redistribution and use in source and binary forms, with or without modification,
 * // are permitted provided that the following conditions are met:
 * //
 * // 1.  Redistributions of source code must retain the above copyright notice, this
 * // list of conditions and the following disclaimer.
 * //
 * // 2.  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.
 * //
 * // 3.  Neither the name of the copyright holder 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.
 */
use crate::avx::util::define_avx_butterfly;
use crate::avx::{AvxDct2Butterfly3, AvxDct2Butterfly4};
use crate::bidirectional::{BidirectionalStore, InPlaceStore};
use crate::util::DctSample;
use crate::{PxdctError, PxdctExecutor};
use num_traits::AsPrimitive;

#[derive(Debug, Clone)]
pub(crate) struct AvxDct2Butterfly12<T: DctSample> {
    bf4: AvxDct2Butterfly4<T>,
    bf3: AvxDct2Butterfly3<T>,
}

impl<T: DctSample> Default for AvxDct2Butterfly12<T>
where
    f64: AsPrimitive<T>,
    usize: AsPrimitive<T>,
{
    fn default() -> Self {
        Self {
            bf4: AvxDct2Butterfly4::default(),
            bf3: AvxDct2Butterfly3::default(),
        }
    }
}

impl<T: DctSample> AvxDct2Butterfly12<T>
where
    f64: AsPrimitive<T>,
{
    #[inline(always)]
    fn exec<S: BidirectionalStore<T>>(&self, data: &mut S) {
        // co-prime 3x4 DCT-II algorithm

        let mut c0 = [data[0], data[7], data[8]];
        let mut c1 = [data[6], data[1], data[9]];
        let mut c2 = [data[5], data[10], data[2]];
        let mut c3 = [data[11], data[4], data[3]];

        self.bf3.exec(&mut InPlaceStore::new(&mut c0));
        self.bf3.exec(&mut InPlaceStore::new(&mut c1));
        self.bf3.exec(&mut InPlaceStore::new(&mut c2));
        self.bf3.exec(&mut InPlaceStore::new(&mut c3));

        let mut rows0 = [c0[0], c1[0], c2[0], c3[0]];
        let mut rows1 = [c0[1], c1[1], c2[1], c3[1]];
        let mut rows2 = [c0[2], c1[2], c2[2], c3[2]];

        self.bf4.exec(&mut InPlaceStore::new(&mut rows0));
        self.bf4.exec(&mut InPlaceStore::new(&mut rows1));
        self.bf4.exec(&mut InPlaceStore::new(&mut rows2));

        data[0] = rows0[0];
        data[1] = rows1[1] + rows2[3];
        data[2] = rows1[2] + rows2[2];
        data[3] = rows0[1];
        data[4] = rows1[0];
        data[5] = rows1[3] + rows2[1];
        data[6] = rows0[2];
        data[7] = -rows2[3] + rows1[1];
        data[8] = rows2[0];
        data[9] = rows0[3];
        data[10] = -rows2[2] + rows1[2];
        data[11] = rows2[1] - rows1[3];
    }
}

define_avx_butterfly!(AvxDct2Butterfly12, 12);