reed_solomon_simd/engine/tables.rs
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 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262
//! Lookup-tables used by [`Engine`]:s.
//!
//! All tables are global and each is initialized at most once.
//!
//! # Tables
//!
//! | Table | Size | Used in encoding | Used in decoding | By engines |
//! | ------------ | ------- | ---------------- | ---------------- | ------------------ |
//! | [`Exp`] | 128 kiB | yes | yes | all |
//! | [`Log`] | 128 kiB | yes | yes | all |
//! | [`LogWalsh`] | 128 kiB | - | yes | all |
//! | [`Mul16`] | 8 MiB | yes | yes | [`NoSimd`] |
//! | [`Mul128`] | 8 MiB | yes | yes | [`Avx2`] [`Ssse3`] |
//! | [`Skew`] | 128 kiB | yes | yes | all |
//!
//! [`NoSimd`]: crate::engine::NoSimd
//! [`Avx2`]: crate::engine::Avx2
//! [`Ssse3`]: crate::engine::Ssse3
//! [`Engine`]: crate::engine
//!
use std::sync::LazyLock;
use crate::engine::{
fwht, utils, GfElement, CANTOR_BASIS, GF_BITS, GF_MODULUS, GF_ORDER, GF_POLYNOMIAL,
};
// ======================================================================
// TYPE ALIASES - PUBLIC
/// Used by [`Naive`] engine for multiplications
/// and by all [`Engine`]:s to initialize other tables.
///
/// [`Naive`]: crate::engine::Naive
/// [`Engine`]: crate::engine
pub type Exp = [GfElement; GF_ORDER];
/// Used by [`Naive`] engine for multiplications
/// and by all [`Engine`]:s to initialize other tables.
///
/// [`Naive`]: crate::engine::Naive
/// [`Engine`]: crate::engine
pub type Log = [GfElement; GF_ORDER];
/// Used by [`Avx2`] and [`Ssse3`] engines for multiplications.
///
/// [`Avx2`]: crate::engine::Avx2
/// [`Ssse3`]: crate::engine::Ssse3
pub type Mul128 = [Multiply128lutT; GF_ORDER];
/// Elements of the Mul128 table
#[derive(Clone, Debug)]
pub struct Multiply128lutT {
/// Lower half of `GfElements`
pub lo: [u128; 4],
/// Upper half of `GfElements`
pub hi: [u128; 4],
}
/// Used by all [`Engine`]:s in [`Engine::eval_poly`].
///
/// [`Engine`]: crate::engine
/// [`Engine::eval_poly`]: crate::engine::Engine::eval_poly
pub type LogWalsh = [GfElement; GF_ORDER];
/// Used by [`NoSimd`] engine for multiplications.
///
/// [`NoSimd`]: crate::engine::NoSimd
pub type Mul16 = [[[GfElement; 16]; 4]; GF_ORDER];
/// Used by all [`Engine`]:s for FFT and IFFT.
///
/// [`Engine`]: crate::engine
pub type Skew = [GfElement; GF_MODULUS as usize];
// ======================================================================
// ExpLog - PUBLIC
/// Struct holding the [`Exp`] and [`Log`] lookup tables.
pub struct ExpLog {
/// Exponentiation table.
pub exp: Box<Exp>,
/// Logarithm table.
pub log: Box<Log>,
}
// ======================================================================
// STATIC - PUBLIC
/// Lazily initialized exponentiation and logarithm tables.
pub static EXP_LOG: LazyLock<ExpLog> = LazyLock::new(initialize_exp_log);
/// Lazily initialized logarithmic Walsh transform table.
pub static LOG_WALSH: LazyLock<Box<LogWalsh>> = LazyLock::new(initialize_log_walsh);
/// Lazily initialized multiplication table for the `NoSimd` engine.
pub static MUL16: LazyLock<Box<Mul16>> = LazyLock::new(initialize_mul16);
/// Lazily initialized multiplication table for SIMD engines.
pub static MUL128: LazyLock<Box<Mul128>> = LazyLock::new(initialize_mul128);
/// Lazily initialized skew table used in FFT and IFFT operations.
pub static SKEW: LazyLock<Box<Skew>> = LazyLock::new(initialize_skew);
// ======================================================================
// FUNCTIONS - PUBLIC - math
/// Calculates `x * log_m` using [`Exp`] and [`Log`] tables.
#[inline(always)]
pub fn mul(x: GfElement, log_m: GfElement, exp: &Exp, log: &Log) -> GfElement {
if x == 0 {
0
} else {
exp[utils::add_mod(log[x as usize], log_m) as usize]
}
}
// ======================================================================
// FUNCTIONS - PRIVATE - initialize tables
#[allow(clippy::needless_range_loop)]
fn initialize_exp_log() -> ExpLog {
let mut exp = Box::new([0; GF_ORDER]);
let mut log = Box::new([0; GF_ORDER]);
// GENERATE LFSR TABLE
let mut state = 1;
for i in 0..GF_MODULUS {
exp[state] = i;
state <<= 1;
if state >= GF_ORDER {
state ^= GF_POLYNOMIAL;
}
}
exp[0] = GF_MODULUS;
// CONVERT TO CANTOR BASIS
log[0] = 0;
for i in 0..GF_BITS {
let width = 1usize << i;
for j in 0..width {
log[j + width] = log[j] ^ CANTOR_BASIS[i];
}
}
for i in 0..GF_ORDER {
log[i] = exp[log[i] as usize];
}
for i in 0..GF_ORDER {
exp[log[i] as usize] = i as GfElement;
}
exp[GF_MODULUS as usize] = exp[0];
ExpLog { exp, log }
}
fn initialize_log_walsh() -> Box<LogWalsh> {
let log = *EXP_LOG.log;
let mut log_walsh: Box<LogWalsh> = Box::new([0; GF_ORDER]);
log_walsh.copy_from_slice(log.as_ref());
log_walsh[0] = 0;
fwht::fwht(log_walsh.as_mut(), GF_ORDER);
log_walsh
}
fn initialize_mul16() -> Box<Mul16> {
let exp = &*EXP_LOG.exp;
let log = &*EXP_LOG.log;
let mut mul16 = vec![[[0; 16]; 4]; GF_ORDER];
for log_m in 0..=GF_MODULUS {
let lut = &mut mul16[log_m as usize];
for i in 0..16 {
lut[0][i] = mul(i as GfElement, log_m, exp, log);
lut[1][i] = mul((i << 4) as GfElement, log_m, exp, log);
lut[2][i] = mul((i << 8) as GfElement, log_m, exp, log);
lut[3][i] = mul((i << 12) as GfElement, log_m, exp, log);
}
}
mul16.into_boxed_slice().try_into().unwrap()
}
fn initialize_mul128() -> Box<Mul128> {
// Based on:
// https://github.com/catid/leopard/blob/22ddc7804998d31c8f1a2617ee720e063b1fa6cd/LeopardFF16.cpp#L375
let exp = &*EXP_LOG.exp;
let log = &*EXP_LOG.log;
let mut mul128 = vec![
Multiply128lutT {
lo: [0; 4],
hi: [0; 4],
};
GF_ORDER
];
for log_m in 0..=GF_MODULUS {
for i in 0..=3 {
let mut prod_lo = [0u8; 16];
let mut prod_hi = [0u8; 16];
for x in 0..16 {
let prod = mul((x << (i * 4)) as GfElement, log_m, exp, log);
prod_lo[x] = prod as u8;
prod_hi[x] = (prod >> 8) as u8;
}
mul128[log_m as usize].lo[i] = u128::from_le_bytes(prod_lo);
mul128[log_m as usize].hi[i] = u128::from_le_bytes(prod_hi);
}
}
mul128.into_boxed_slice().try_into().unwrap()
}
#[allow(clippy::needless_range_loop)]
fn initialize_skew() -> Box<Skew> {
let exp = &*EXP_LOG.exp;
let log = &*EXP_LOG.log;
let mut skew = Box::new([0; GF_MODULUS as usize]);
let mut temp = [0; GF_BITS - 1];
for i in 1..GF_BITS {
temp[i - 1] = 1 << i;
}
for m in 0..GF_BITS - 1 {
let step: usize = 1 << (m + 1);
skew[(1 << m) - 1] = 0;
for i in m..GF_BITS - 1 {
let s: usize = 1 << (i + 1);
let mut j = (1 << m) - 1;
while j < s {
skew[j + s] = skew[j] ^ temp[i];
j += step;
}
}
temp[m] = GF_MODULUS - log[mul(temp[m], log[(temp[m] ^ 1) as usize], exp, log) as usize];
for i in m + 1..GF_BITS - 1 {
let sum = utils::add_mod(log[(temp[i] ^ 1) as usize], temp[m]);
temp[i] = mul(temp[i], sum, exp, log);
}
}
for i in 0..GF_MODULUS as usize {
skew[i] = log[skew[i] as usize];
}
skew
}