Enum Partition 

#[non_exhaustive]
pub enum Partition {
    Adjacent,
    Interleaved,
    Pseudorandom(u64),
}

How the subcarriers are split into the subblocks of Pts.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Adjacent

Contiguous subblocks.

Interleaved

Subcarrier $i$ in subblock $i \bmod V$.

Pseudorandom(u64)

A balanced random assignment (seeded): the best PAPR reduction.

Implementations

impl Partition

pub fn from_name(name: &str, seed: u64) -> Result<Partition>

The partition of a name: adjacent, interleaved or pseudorandom (drawn with seed), case-insensitive.

Errors

Error::Config for another name.

Examples

use comnum_waveform::papr::Partition;
assert_eq!(Partition::from_name("pseudorandom", 3)?, Partition::Pseudorandom(3));
assert!(Partition::from_name("random", 3).is_err());

Trait Implementations

impl Clone for Partition

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for Partition

impl Debug for Partition

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for Partition

impl PartialEq for Partition

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Partition