// Except Silence and Discrete channels, duplicate channels aren't allowed. fn get_channel_map(channels: &[Channel]) -> Result<ChannelMap, Error> { letmut map = ChannelMap::empty(); for channel in channels { let bitmask = ChannelMap::from(*channel); if (channel != &Channel::Silence && channel != &Channel::Discrete)
&& map.contains(bitmask)
{ return Err(Error::DuplicateChannel);
}
map.insert(bitmask);
}
Ok(map)
}
}
#[derive(Debug)] pubstruct Coefficient<T> where
T: MixingCoefficient,
T::Coef: Copy,
{
input_layout: ChannelLayout,
output_layout: ChannelLayout,
matrix: Vec<Vec<T::Coef>>,
would_overflow_from_coefficient_value: Option<bool>, // Only used when T is i16
}
impl<T> Coefficient<T> where
T: MixingCoefficient,
T::Coef: Copy,
{ // Given a M-channel input layout and a N-channel output layout, generate a NxM coefficients // matrix m such that out_audio = m * in_audio, where in_audio, out_audio are Mx1, Nx1 matrix // storing input and output audio data in their rows respectively. // // data in channel #1 ▸ │ Silence │ │ 0, 0, 0, 0 │ │ FrontRight │ ◂ data in channel #1 // data in channel #2 ▸ │ FrontRight │ = │ 1, C, 0, L │ x │ FrontCenter │ ◂ data in channel #2 // data in channel #3 ▸ │ FrontLeft │ │ 0, C, 1, L │ │ FrontLeft │ ◂ data in channel #3 // ▴ ▴ │ LowFrequency │ ◂ data in channel #4 // ┊ ┊ ▴ // ┊ ┊ ┊ // out_audio mixing matrix m in_audio // // The FrontLeft, FrontRight, ... etc label the data for front-left, front-right ... etc channel // in both input and output audio data buffer. // // C and L are coefficients mixing input data from front-center channel and low-frequency channel // to front-left and front-right. // // In math, the in_audio and out_audio should be a 2D-matrix with several rows containing only // one column. However, the in_audio and out_audio are passed by 1-D matrix here for convenience. pubfn create(input_channels: &[Channel], output_channels: &[Channel]) -> Self { let input_layout = ChannelLayout::new(input_channels).expect("Invalid input layout"); let output_layout = ChannelLayout::new(output_channels).expect("Invalid output layout");
// Check if this is a professional audio interface rather than a sound card for playback, in // which case it is expected to simply pass all the channel through without change. // Those interfaces only have an explicit mapping for the stereo pair, but have lots of channels. letmut only_stereo_or_discrete = true; for channel in output_channels { if *channel != Channel::Discrete
&& *channel != Channel::FrontLeft
&& *channel != Channel::FrontRight
{
only_stereo_or_discrete = false; break;
}
} let coefficient_matrix = if only_stereo_or_discrete && output_channels.len() > 2 { letmut matrix = Vec::with_capacity(output_channels.len()); // Create a diagonal line of 1.0 for input channels for (output_channel_index, _) in output_channels.iter().enumerate() { letmut coefficients = Vec::with_capacity(input_channels.len());
coefficients.resize(input_channels.len(), 0.0); if output_channel_index < coefficients.len() {
coefficients[output_channel_index] = 1.0;
}
matrix.push(coefficients);
}
matrix
} else { let mixing_matrix = Self::build_mixing_matrix(input_layout.channel_map, output_layout.channel_map)
.unwrap_or_else(|_| Self::get_basic_matrix()); Self::pick_coefficients(
&input_layout.channels,
&output_layout.channels,
&mixing_matrix,
)
};
let normalized_matrix = Self::normalize(T::max_coefficients_sum(), coefficient_matrix);
let would_overflow = T::would_overflow_from_coefficient_value(&normalized_matrix);
// Convert the type of the coefficients from f64 to T::Coef. let matrix = normalized_matrix
.into_iter()
.map(|row| row.into_iter().map(T::coefficient_from_f64).collect())
.collect();
// Given audio input and output channel-maps, generate a CxC mixing coefficients matrix M, // whose indice are ordered by the values defined in enum Channel, such that // output_data(i) = Σ M[i][j] * input_data(j), for all j in [0, C), // where i is in [0, C) and C is the number of channels defined in enum Channel, // output_data and input_data are buffers containing data for channels that are also ordered // by the values defined in enum Channel. // // │ FrontLeft │ │ 1, 0, ..., 0 │ │ FrontLeft │ ◂ data in front-left channel // │ FrontRight │ │ 0, 1, ..., 0 │ │ FrontRight │ ◂ data in front-right channel // │ FrontCenter │ = │ ........., 0 │ x │ FrontCenter │ ◂ data in front-center channel // │ ........... │ │ ........., 0 | │ ........... │ ◂ ... // │ Silence │ │ 0, 0, ..., 0 | │ Silence │ ◂ data in silence channel // ▴ ▴ ▴ // out_audio coef matrix M in_audio // // ChannelMap would be used as a hash table to check the existence of channels. #[allow(clippy::cognitive_complexity)] fn build_mixing_matrix(
input_map: ChannelMap,
output_map: ChannelMap,
) -> Result<[[f64; CHANNELS]; CHANNELS], Error> { // Mixing coefficients constants. use std::f64::consts::FRAC_1_SQRT_2; use std::f64::consts::SQRT_2; const CENTER_MIX_LEVEL: f64 = FRAC_1_SQRT_2; const SURROUND_MIX_LEVEL: f64 = FRAC_1_SQRT_2; const LFE_MIX_LEVEL: f64 = 1.0;
if !is_symmetric(input_map) || !is_symmetric(output_map) { return Err(Error::AsymmetricChannels);
}
letmut matrix = Self::get_basic_matrix();
// Get input channels that are not in the output channels. let unaccounted_input_map = input_map & !output_map;
// When input has front-center but output has not, and output has front-stereo, // mix input's front-center to output's front-stereo. if unaccounted_input_map.contains(ChannelMap::FRONT_CENTER)
&& output_map.contains(ChannelMap::FRONT_2)
{ let coefficient = if input_map.contains(ChannelMap::FRONT_2) {
CENTER_MIX_LEVEL
} else {
FRAC_1_SQRT_2
};
matrix[FRONT_LEFT][FRONT_CENTER] += coefficient;
matrix[FRONT_RIGHT][FRONT_CENTER] += coefficient;
}
// When input has front-stereo but output has not, and output has front-center, // mix input's front-stereo to output's front-center. if unaccounted_input_map.contains(ChannelMap::FRONT_2)
&& output_map.contains(ChannelMap::FRONT_CENTER)
{
matrix[FRONT_CENTER][FRONT_LEFT] += FRAC_1_SQRT_2;
matrix[FRONT_CENTER][FRONT_RIGHT] += FRAC_1_SQRT_2; if input_map.contains(ChannelMap::FRONT_CENTER) {
matrix[FRONT_CENTER][FRONT_CENTER] = CENTER_MIX_LEVEL * SQRT_2;
}
}
// When input has back-center but output has not, if unaccounted_input_map.contains(ChannelMap::BACK_CENTER) { // if output has back-stereo, mix input's back-center to output's back-stereo. if output_map.contains(ChannelMap::BACK_2) {
matrix[BACK_LEFT][BACK_CENTER] += FRAC_1_SQRT_2;
matrix[BACK_RIGHT][BACK_CENTER] += FRAC_1_SQRT_2; // or if output has side-stereo, mix input's back-center to output's side-stereo.
} elseif output_map.contains(ChannelMap::SIDE_2) {
matrix[SIDE_LEFT][BACK_CENTER] += FRAC_1_SQRT_2;
matrix[SIDE_RIGHT][BACK_CENTER] += FRAC_1_SQRT_2; // or if output has front-stereo, mix input's back-center to output's front-stereo.
} elseif output_map.contains(ChannelMap::FRONT_2) {
matrix[FRONT_LEFT][BACK_CENTER] += SURROUND_MIX_LEVEL * FRAC_1_SQRT_2;
matrix[FRONT_RIGHT][BACK_CENTER] += SURROUND_MIX_LEVEL * FRAC_1_SQRT_2; // or if output has front-center, mix input's back-center to output's front-center.
} elseif output_map.contains(ChannelMap::FRONT_CENTER) {
matrix[FRONT_CENTER][BACK_CENTER] += SURROUND_MIX_LEVEL * FRAC_1_SQRT_2;
}
}
// When input has back-stereo but output has not, if unaccounted_input_map.contains(ChannelMap::BACK_2) { // if output has back-center, mix input's back-stereo to output's back-center. if output_map.contains(ChannelMap::BACK_CENTER) {
matrix[BACK_CENTER][BACK_LEFT] += FRAC_1_SQRT_2;
matrix[BACK_CENTER][BACK_RIGHT] += FRAC_1_SQRT_2; // or if output has side-stereo, mix input's back-stereo to output's side-stereo.
} elseif output_map.contains(ChannelMap::SIDE_2) { let coefficient = if input_map.contains(ChannelMap::SIDE_2) {
FRAC_1_SQRT_2
} else { 1.0
};
matrix[SIDE_LEFT][BACK_LEFT] += coefficient;
matrix[SIDE_RIGHT][BACK_RIGHT] += coefficient; // or if output has front-stereo, mix input's back-stereo to output's side-stereo.
} elseif output_map.contains(ChannelMap::FRONT_2) {
matrix[FRONT_LEFT][BACK_LEFT] += SURROUND_MIX_LEVEL;
matrix[FRONT_RIGHT][BACK_RIGHT] += SURROUND_MIX_LEVEL; // or if output has front-center, mix input's back-stereo to output's front-center.
} elseif output_map.contains(ChannelMap::FRONT_CENTER) {
matrix[FRONT_CENTER][BACK_LEFT] += SURROUND_MIX_LEVEL * FRAC_1_SQRT_2;
matrix[FRONT_CENTER][BACK_RIGHT] += SURROUND_MIX_LEVEL * FRAC_1_SQRT_2;
}
}
// When input has side-stereo but output has not, if unaccounted_input_map.contains(ChannelMap::SIDE_2) { // if output has back-stereo, mix input's side-stereo to output's back-stereo. if output_map.contains(ChannelMap::BACK_2) { let coefficient = if input_map.contains(ChannelMap::BACK_2) {
FRAC_1_SQRT_2
} else { 1.0
};
matrix[BACK_LEFT][SIDE_LEFT] += coefficient;
matrix[BACK_RIGHT][SIDE_RIGHT] += coefficient; // or if output has back-center, mix input's side-stereo to output's back-center.
} elseif output_map.contains(ChannelMap::BACK_CENTER) {
matrix[BACK_CENTER][SIDE_LEFT] += FRAC_1_SQRT_2;
matrix[BACK_CENTER][SIDE_RIGHT] += FRAC_1_SQRT_2; // or if output has front-stereo, mix input's side-stereo to output's front-stereo.
} elseif output_map.contains(ChannelMap::FRONT_2) {
matrix[FRONT_LEFT][SIDE_LEFT] += SURROUND_MIX_LEVEL;
matrix[FRONT_RIGHT][SIDE_RIGHT] += SURROUND_MIX_LEVEL; // or if output has front-center, mix input's side-stereo to output's front-center.
} elseif output_map.contains(ChannelMap::FRONT_CENTER) {
matrix[FRONT_CENTER][SIDE_LEFT] += SURROUND_MIX_LEVEL * FRAC_1_SQRT_2;
matrix[FRONT_CENTER][SIDE_RIGHT] += SURROUND_MIX_LEVEL * FRAC_1_SQRT_2;
}
}
// When input has front-stereo-of-center but output has not, if unaccounted_input_map.contains(ChannelMap::FRONT_2_OF_CENTER) { // if output has front-stereo, mix input's front-stereo-of-center to output's front-stereo. if output_map.contains(ChannelMap::FRONT_2) {
matrix[FRONT_LEFT][FRONT_LEFT_OF_CENTER] += 1.0;
matrix[FRONT_RIGHT][FRONT_RIGHT_OF_CENTER] += 1.0; // or if output has front-center, mix input's front-stereo-of-center to output's front-center.
} elseif output_map.contains(ChannelMap::FRONT_CENTER) {
matrix[FRONT_CENTER][FRONT_LEFT_OF_CENTER] += FRAC_1_SQRT_2;
matrix[FRONT_CENTER][FRONT_RIGHT_OF_CENTER] += FRAC_1_SQRT_2;
}
}
// When input has low-frequency but output has not, if unaccounted_input_map.contains(ChannelMap::LOW_FREQUENCY) { // if output has front-center, mix input's low-frequency to output's front-center. if output_map.contains(ChannelMap::FRONT_CENTER) {
matrix[FRONT_CENTER][LOW_FREQUENCY] += LFE_MIX_LEVEL; // or if output has front-stereo, mix input's low-frequency to output's front-stereo.
} elseif output_map.contains(ChannelMap::FRONT_2) {
matrix[FRONT_LEFT][LOW_FREQUENCY] += LFE_MIX_LEVEL * FRAC_1_SQRT_2;
matrix[FRONT_RIGHT][LOW_FREQUENCY] += LFE_MIX_LEVEL * FRAC_1_SQRT_2;
}
}
Ok(matrix)
}
// Return a CHANNELSxCHANNELS matrix M that is (CHANNELS-1)x(CHANNELS-1) identity matrix // padding with one extra row and one column containing only zero values. The result would be: // // identity padding // matrix column // ▾ ▾ // ┌┈┈┈┈┈┈┈┈┈┈┈┈┈┈┈┈┈┐ i ┐ // │ 1, 0, 0, ..., 0 ┊, 0 │ ◂ 0 ┊ channel i // │ 0, 1, 0, ..., 0 ┊, 0 │ ◂ 1 ┊ for // │ 0, 0, 1, ..., 0 ┊, 0 │ ◂ 2 ┊ audio // │ 0, 0, 0, ..., 0 ┊, 0 │ . ┊ output // │ ............... ┊ │ . ┊ // │ 0, 0, 0, ..., 1 ┊, 0 │ ◂ 16 ┊ // ├┈┈┈┈┈┈┈┈┈┈┈┈┈┈┈┈┈┼┈┈┈┈┤ ◂ 17 ┊ // │ 0, 0, 0, ..., 0 ┊, 0 │ ◂ padding row ◂ 18 ┊ // ▴ ▴ ▴ .... ▴ ▴ ┘ // j 0 1 2 .... 17 18 // └┈┈┈┈┈┈┈┈┈┈┈┈┈┈┈┈┈┈┈┈┈┈┘ // channel j for audio input // // Given an audio input buffer, in_audio, and an output buffer, out_audio, // and their channel data are both ordered by the values defined in enum Channel. // The generated matrix M makes sure that: // // out_audio(i) = in_audio(j), if i == j and both i, j are non-silence channel // = 0, if i != j or i, j are silence channel // // │ FrontLeft │ │ FrontLeft │ ◂ data in front-left channel // │ FrontRight │ │ FrontRight │ ◂ data in front-right channel // │ FrontCenter │ = M x │ FrontCenter │ ◂ data in front-center channel // │ ........... │ │ ........... │ ◂ ... // │ Silence │ │ Silence │ ◂ data in silence channel // ▴ ▴ // out_audio in_audio // // That is, // 1. If the input-channel is silence, it won't be mixed into any channel. // 2. If the output-channel is silence, its output-channel data will be zero (silence). // 3. If input-channel j is different from output-channel i, audio data in input channel j // won't be mixed into the audio output data in channel i // 4. If input-channel j is same as output-channel i, audio data in input channel j will be // copied to audio output data in channel i // fn get_basic_matrix() -> [[f64; CHANNELS]; CHANNELS] { const SILENCE: usize = Channel::Silence.number(); letmut matrix = [[0.0; CHANNELS]; CHANNELS]; for (i, row) in matrix.iter_mut().enumerate() { if i != SILENCE {
row[i] = 1.0;
}
}
matrix
}
// Given is an CHANNELSxCHANNELS mixing matrix whose indice are ordered by the values defined // in enum Channel, and the channel orders of M-channel input and N-channel output, generate a // mixing matrix m such that output_data(i) = Σ m[i][j] * input_data(j), for all j in [0, M), // where i is in [0, N) and {input/output}_data(k) means the data of the number k channel in // the input/output buffer. fn pick_coefficients(
input_channels: &[Channel],
output_channels: &[Channel],
source: &[[f64; CHANNELS]; CHANNELS],
) -> Vec<Vec<f64>> { letmut matrix = Vec::with_capacity(output_channels.len()); for output_channel in output_channels { let output_channel_index = (*output_channel).number(); letmut coefficients = Vec::with_capacity(input_channels.len()); for input_channel in input_channels { let input_channel_index = (*input_channel).number();
coefficients.push(source[output_channel_index][input_channel_index]);
}
matrix.push(coefficients);
}
matrix
}
fn normalize(max_coefficients_sum: f64, mut coefficients: Vec<Vec<f64>>) -> Vec<Vec<f64>> { letmut max_sum: f64 = 0.0; for coefs in &coefficients {
max_sum = max_sum.max(coefs.iter().sum());
} if max_sum != 0.0 && max_sum > max_coefficients_sum {
max_sum /= max_coefficients_sum; for coefs in &mut coefficients { for coef in coefs {
*coef /= max_sum;
}
}
}
coefficients
}
}
pubtrait MixingCoefficient { type Coef;
// TODO: These should be private. fn max_coefficients_sum() -> f64; // Used for normalizing. fn coefficient_from_f64(value: f64) -> Self::Coef; // Precheck if overflow occurs when converting value from Self::Coef type to Self type. fn would_overflow_from_coefficient_value(coefficient: &[Vec<f64>]) -> Option<bool>;
fn from_coefficient_value(value: Self::Coef, would_overflow: Option<bool>) -> Self { use std::convert::TryFrom; let would_overflow = would_overflow.expect("would_overflow must have value for i16 type"); letmut converted = (value + (1 << 14)) >> 15; // clip the signed integer value into the -32768,32767 range. if would_overflow && ((converted + 0x8000) & !0xFFFF != 0) {
converted = (converted >> 31) ^ 0x7FFF;
} Self::try_from(converted).expect("Cannot convert coefficient from i32 to i16")
}
}
fn test_create_with_duplicate_channels<T>() where
T: MixingCoefficient,
T::Coef: Copy,
{ // Duplicate of Silence channels is allowed on both input side and output side. let input_channels = [
Channel::FrontLeft,
Channel::Silence,
Channel::FrontRight,
Channel::FrontCenter,
Channel::Silence,
]; let output_channels = [
Channel::Silence,
Channel::FrontRight,
Channel::FrontLeft,
Channel::BackCenter,
Channel::Silence,
]; let _ = Coefficient::<T>::create(&input_channels, &output_channels);
}
fn test_create_with_duplicate_input_channels<T>() where
T: MixingCoefficient,
T::Coef: Copy,
{ let input_channels = [
Channel::FrontLeft,
Channel::Silence,
Channel::FrontLeft,
Channel::FrontCenter,
]; let output_channels = [
Channel::Silence,
Channel::FrontRight,
Channel::FrontLeft,
Channel::FrontCenter,
Channel::BackCenter,
]; let _ = Coefficient::<T>::create(&input_channels, &output_channels);
}
fn test_create_with_duplicate_output_channels<T>() where
T: MixingCoefficient,
T::Coef: Copy,
{ let input_channels = [
Channel::FrontLeft,
Channel::Silence,
Channel::FrontRight,
Channel::FrontCenter,
]; let output_channels = [
Channel::Silence,
Channel::FrontRight,
Channel::FrontLeft,
Channel::FrontCenter,
Channel::FrontCenter,
Channel::BackCenter,
]; let _ = Coefficient::<T>::create(&input_channels, &output_channels);
}
// Check that a matrix is diagonal (1.0 on the diagnoal, 0.0 elsewhere). It's valid to have more input or output channels fn assert_is_diagonal<T>(
coefficients: &Coefficient<T>,
input_channels: usize,
output_channels: usize,
) where
T: MixingCoefficient,
T::Coef: Copy + Debug + PartialEq,
{ for i in0..input_channels { for j in0..output_channels { if i == j {
assert_eq!(coefficients.get(i, j), T::coefficient_from_f64(1.0));
} else {
assert_eq!(coefficients.get(i, j), T::coefficient_from_f64(0.0));
}
}
}
println!( "{:?} = {:?} * {:?}",
output_channels, coefficients.matrix, input_channels
);
}
fn test_get_discrete_mapping_matrix<T>() where
T: MixingCoefficient,
T::Coef: Copy + Debug + PartialEq,
{ // typical 5.1 let input_channels = [
Channel::FrontLeft,
Channel::FrontRight,
Channel::FrontCenter,
Channel::BackLeft,
Channel::BackRight,
Channel::LowFrequency,
]; // going into 8 channels with a tagged stereo pair and discrete channels let output_channels = [
Channel::FrontLeft,
Channel::FrontRight,
Channel::Discrete,
Channel::Discrete,
Channel::Discrete,
Channel::Discrete,
Channel::Discrete,
Channel::Discrete,
];
// Get a pass-through matrix in the first 6 channels let coefficients = Coefficient::<T>::create(&input_channels, &output_channels);
assert_is_diagonal::<T>(&coefficients, input_channels.len(), output_channels.len());
}
fn test_get_discrete_mapping_matrix_too_many_channels<T>() where
T: MixingCoefficient,
T::Coef: Copy + Debug + PartialEq,
{ // 5.1.4 let input_channels = [
Channel::FrontLeft,
Channel::FrontRight,
Channel::FrontCenter,
Channel::LowFrequency,
Channel::FrontLeftOfCenter,
Channel::FrontRightOfCenter,
Channel::TopFrontLeft,
Channel::TopFrontRight,
Channel::BackLeft,
Channel::BackRight,
]; // going into 8 channels with a tagged stereo pair and discrete channels let output_channels = [
Channel::FrontLeft,
Channel::FrontRight,
Channel::Discrete,
Channel::Discrete,
Channel::Discrete,
Channel::Discrete,
Channel::Discrete,
Channel::Discrete,
];
// First 8 channels are to be played, last two are to be dropped. let coefficients = Coefficient::<T>::create(&input_channels, &output_channels);
assert_is_diagonal(&coefficients, input_channels.len(), output_channels.len());
}
fn test_get_regular_mapping_matrix_too_many_channels<T>() where
T: MixingCoefficient,
T::Coef: Copy + Debug + PartialEq,
{ // 5.1.4 let input_channels = [
Channel::FrontLeft,
Channel::FrontRight,
Channel::FrontCenter,
Channel::LowFrequency,
Channel::FrontLeftOfCenter,
Channel::FrontRightOfCenter,
Channel::TopFrontLeft,
Channel::TopFrontRight,
Channel::BackLeft,
Channel::BackRight,
]; // going into a regular 5.1 sound card let output_channels = [
Channel::FrontLeft,
Channel::FrontRight,
Channel::FrontCenter,
Channel::LowFrequency,
Channel::BackLeft,
Channel::BackRight,
];
let coefficients = Coefficient::<T>::create(&input_channels, &output_channels);
// Non-unity gain non-silence coefficients must be present when down mixing. letmut found_non_unity_non_silence = false; for row in coefficients.matrix.iter() { for coeff in row.iter() { if T::coefficient_from_f64(1.0) != *coeff || T::coefficient_from_f64(0.0) != *coeff
{
found_non_unity_non_silence = true; break;
}
}
}
assert!(found_non_unity_non_silence);
}
#[test] fn test_normalize() { use float_cmp::approx_eq;
let m = vec![
vec![1.0_f64, 2.0_f64, 3.0_f64],
vec![4.0_f64, 6.0_f64, 10.0_f64],
];
letmut max_row_sum: f64 = f64::MIN; for row in &m {
max_row_sum = max_row_sum.max(row.iter().sum());
}
// Type of Coefficient doesn't matter here. // If the first argument of normalize >= max_row_sum, do nothing. let n = Coefficient::<f32>::normalize(max_row_sum, m.clone());
assert_eq!(n, m);
// If the first argument of normalize < max_row_sum, do normalizing. let smaller_max = max_row_sum - 0.5_f64;
assert!(smaller_max > 0.0_f64); let n = Coefficient::<f32>::normalize(smaller_max, m); letmut max_row_sum: f64 = f64::MIN; for row in &n {
max_row_sum = max_row_sum.max(row.iter().sum());
assert!(row.iter().sum::<f64>() <= smaller_max);
}
assert!(approx_eq!(f64, smaller_max, max_row_sum));
}
}
Messung V0.5 in Prozent
¤ Dauer der Verarbeitung: 0.15 Sekunden
(vorverarbeitet am 2026-06-20)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.