From edf1ddf7ba011df2dc6a48e4186e7b5126a57a06 Mon Sep 17 00:00:00 2001 From: Angel Ezquerra Date: Mon, 25 Mar 2024 23:02:29 +0100 Subject: [PATCH] Add an LFSR module This module, which is heavily based on Nikesh Bajaj's pylsfr (https://pylfsr.github.io), implements a Linear Feedback Shift Register that can be used to generate pseudo-random boolean sequences. It supports both Fibonacci and Galois LFSRs. LFSRs are used in many digital communication systems (including, for example LTE and 5GNR). For more information see https://simple.wikipedia.org/wiki/Linear-feedback_shift_register --- README.md | 85 +++++++++++++++- impulse/lfsr.nim | 231 ++++++++++++++++++++++++++++++++++++++++++++ tests/test_lfsr.nim | 61 ++++++++++++ 3 files changed, 376 insertions(+), 1 deletion(-) create mode 100644 impulse/lfsr.nim create mode 100644 tests/test_lfsr.nim diff --git a/README.md b/README.md index f8dddff..3f5fe49 100644 --- a/README.md +++ b/README.md @@ -68,7 +68,6 @@ block Complex: # @[(4.5, 0.0), (2.081559480312316, -1.651098762732523), (-1.831559480312316, 1.608220406444071), (-1.831559480312316, -1.608220406444071), (2.081559480312316, 1.651098762732523)] ``` - ### C++ example When compiling on the C++ backend, the API is a bit different: @@ -99,6 +98,90 @@ echo dOut # @[(4.5, 0.0), (2.081559480312316, -1.651098762732523), (-1.831559480312316, 1.608220406444071), (0.0, 0.0), (0.0, 0.0)] ``` +## LFSR + +LFSR module which implements a Linear Feedback Shift Register that can be +used to generate pseudo-random boolean sequences. It supports both Fibonacci +and Galois LFSRs. + +LFSRs used in many digital communication systems (including, for example LTE +and 5GNR). For more information see: + +https://simple.wikipedia.org/wiki/Linear-feedback_shift_register + +Note that this module uses Arraymancer under the hood, so it depends on it. +Also note that this code is heavily based on Nikesh Bajaj's pylfsr, which can +be found in https://pylfsr.github.io + +### LFSR examples + +The following example creates a Fibonacci-style LFSR with polynomial +`x^5 + x^3 + 1` and uses it to generate a pseudo-random sequence of 31 values. +Note how the `taps` argument is an integer tensor with values `[5, 3]`, +corresponding to the exponents of the coefficients of the polynomial, in +descending order. Exponent 0 was skipped because it is implicitly included +(if it is included it will be ignored). If the exponents are not in +descending order a ValueError exception will be raised. + +```nim +import impulse/lfsr +import arraymancer + +var fibonacci_lfsr = initLFSR( + taps = [5, 3].toTensor, # descending order and 0 can be omitted + # The following 2 lines can be skipped in this case since they are the defaults + # state = single_true, + # conf = fibonacci +) + +let sequence1 = fibonacci_lfsr.generate(31) + +# Print the first few elements +# Note that sequence1 will be a Tensor[bool] but it can be easily converted to +# Tensor[int] for more concise printing +echo sequence1.asType(int)[_..11] +# Tensor[system.int] of shape "[12]" on backend "Cpu" +# 1 0 0 0 0 1 0 0 1 0 1 1 + +# The generator can be reset to start over +fibonacci_lfsr.reset() +let sequence2 = fibonacci_lfsr.generate(31) +doAssert sequence1 == sequence2 +``` + +Galois style LFSRs are also supported and it is also possible to set a custom +start state as a Tensor[bool]: + +```nim +var galois_lfsr = initLFSR( + taps = [5, 3, 0].toTensor, # note how the 0 exponent can be included as well + state = [true, true, true, true, true].toTensor, # this is equivalent to `all_true` + conf = galois +) + +# Generate the first 8 values +let sequence3a = galois_lfsr.generate(8) +echo sequence3a.asType(int) +# Tensor[system.int] of shape "[8]" on backend "Cpu" +# 1 1 1 1 0 0 0 1 + +# Generate a few more values +let sequence3b = galois_lfsr.generate(10) +echo sequence3b.asType(int) +# Tensor[system.int] of shape "[10]" on backend "Cpu" +# 1 0 1 1 1 0 1 0 1 0 + +galois_lfsr.reset() +echo galois_lfsr.generate(18) +# Tensor[system.int] of shape "[18]" on backend "Cpu" +# 1 1 1 1 0 0 0 1 1 0 1 1 1 0 1 0 1 0 +``` + +### Maximal LFSR tap examples + +As a convenience, a `tap_examples` function is provided. This function takes a +`size` and returns one example (out of many) sequence of taps that result in a +"maximal" LSFR sequence. ## License diff --git a/impulse/lfsr.nim b/impulse/lfsr.nim new file mode 100644 index 0000000..04334c3 --- /dev/null +++ b/impulse/lfsr.nim @@ -0,0 +1,231 @@ +## LFSR module which implements a Linear Feedback Shift Register that can be +## used to generate pseudo-random boolean sequences. It supports both Fibonacci +## and Galois LFSRs. +## +## LFSRs used in many digital communication systems (including, for example LTE +## and 5GNR). For more information see: +## https://simple.wikipedia.org/wiki/Linear-feedback_shift_register +## +## Notes: +## - This code is heavily based on Nikesh Bajaj's pylfsr, which can be +## found in https://pylfsr.github.io +## - This implementation is not optimized for performance, but for simplicity. +## It would be relatively trivial to implement a much faster version by +## operating on the bits directly, rather than using tensors. + +import arraymancer +import std/strformat + +type LFSR_TYPE* = enum + ## LFSR types (see https://simple.wikipedia.org/wiki/Linear-feedback_shift_register) + fibonacci, galois + +type LFSR_INIT_STATE_TYPE* = enum + ## Common LFSR Initial States + ## While it is possible to set any LFSR initial `state` by passing a + ## Tensor[bool] to `initLFSR`, for convenience it is also possible + ## to pass one of these enum values as the initial `state`: + ## - `single_true`: all bits set to `false` except the LSB (i.e. the last one) + ## - `all_true`: all bits set to `true` + single_true, all_true + +type LFSR* = object + ## LFSR object used to generate fibonacci or galois pseudo random sequences + ## To use it first create the object using `initLFSR` and then call either + ## the `next` procedure to get the sequence values one by one or `generate` + ## to generate multiple values in one go. + taps*: Tensor[int] + conf*: LFSR_TYPE + state*: Tensor[bool] + init_state: Tensor[bool] + verbose*: bool + counter_starts_at_zero*: bool + outbit*: bool + count*: int + seq_bit_index: int + sequence: Tensor[bool] + feedbackbit: bool + +proc initLFSR*(taps: typeof(LFSR.taps), + conf = fibonacci, + state: Tensor[bool], + verbose = false, + counter_starts_at_zero = true): LFSR = + ## Initialize LFSR with given feedback polynomial and initial state + ## + ## Inputs: + ## - taps: Feedback polynomial taps as a Tensor[int] of exponents in + ## descending order. Note that exponent 0 can be omitted, since it is + ## always implicitly added. For example, to use the `x^5 + x^3 + 1` + ## polinomial you can set taps to `[5, 3].toTensor` or to + ## `[5, 3, 0].toTensor`. + ## - state: Initial state of the LFSR as a Tensor[bool] of size equal to the + ## highest exponent in taps (which must be its first element) + ## - conf: LFSR type as an enum (`fibonacci` or `galois`) + ## - verbose: Enable it to print additonal logs + ## - counter_starts_at_zero: Start the count from 0 or 1 (defaults to `true`) + ## + ## Return: + ## - Ready to use LFSR object + + # Remove the last value from taps if it is a zero + let taps = if taps[taps.size - 1] == 0: taps[_..^2] else: taps + if taps.size > 1 and taps[0] < taps[taps.size - 1]: + raise newException(ValueError, + &"The LFSR polinomial must be ordered in descending exponent order, but it is not:\n{taps=}") + if state.size != taps.max(): + raise newException(ValueError, + &"The LFSR state size is {state.size} but must be {taps.max()} because that is the highest taps exponent ({taps=})") + result = LFSR( + taps: taps, + conf: conf, + state: state, + init_state: state, + verbose: verbose, + counter_starts_at_zero: counter_starts_at_zero, + outbit: false, + count: 0, + seq_bit_index: state.size - 1, + sequence: newTensor[bool](0), + feedbackbit: false + ) + +proc initLFSR*(taps: typeof(LFSR.taps), + conf = fibonacci, + state = single_true, + verbose = false, counter_starts_at_zero = true): LFSR = + ## Overload of initLFSR that takes an enum for the initial state + ## + ## Inputs: + ## - taps: Feedback polynomial taps as a Tensor[int] of exponents in + ## descending order. Note that exponent 0 can be omitted, since it is + ## always implicitly added. For example, to use the `x^5 + x^3 + 1` + ## polinomial you can set taps to `[5, 3].toTensor` or to + ## `[5, 3, 0].toTensor`. + ## - state: Initial state of the LFSR as an enum value (`single_true` or + ## `all_true`). Defaults to `single_true`. + ## - verbose: Enable it to print additonal logs + ## - counter_starts_at_zero: Start the count from 0 or 1 (defaults to `true`) + ## + ## Return: + ## - Ready to use LFSR object + let init_state = if state == all_true: + arraymancer.ones[bool](taps.max()) + else: + zeros[bool](taps.max() - 1).append(true) + initLFSR(taps, conf = conf, state = init_state, + verbose = verbose, counter_starts_at_zero = counter_starts_at_zero) + +proc reset*(self: var LFSR) = + ## Reset the LFSR `state` and `count` to their initial values + self.state = self.init_state + self.count = 0 + +proc next*(self: var LFSR, verbose = false, + store_sequence: static bool = false) : bool = + ## Run one cycle on LFSR with given feedback polynomial and + ## update the count, state, feedback bit, output bit and sequence + ## + ## Inputs: + ## - Preconfigured LFSR object + ## - verbose: Print additonal logs even if LSRF.verbose is disabled + ## - store_sequence: static bool that enables saving the generated sequence + ## + ## Return: + ## - bool output bit + if self.verbose or verbose: + echo "State: ", self.state + + if self.counter_starts_at_zero: + result = self.state[self.seq_bit_index] + when store_sequence: + self.sequence = self.sequence.append(result) + + if self.conf == fibonacci: + var b = self.state[self.taps[0] - 1] xor self.state[self.taps[1] - 1] + if self.taps.size > 2: + for coeff in self.taps[2.._]: + b = self.state[coeff - 1] xor b + + self.state = self.state.roll(1) + self.feedbackbit = b + self.state[0] = self.feedbackbit + else: # galois + self.feedbackbit = self.state[0] + self.state = self.state.roll(-1) + for k in self.taps[1.._]: + self.state[k-1] = self.state[k-1] xor self.feedbackbit + + if not self.counter_starts_at_zero: + result = self.state[self.seq_bit_index] + when store_sequence: + self.sequence = self.sequence.append(result) + + self.count += 1 + self.outbit = result + + return result + +iterator generator*(lfsr: var LFSR,n: int, + store_sequence: static bool = false): bool = + ## Generator that will generate a random sequence of length `n` + ## + ## Inputs: + ## - Preconfigured LFSR object + ## - n: Number of random values to generate + ## - store_sequence: static bool that enables saving the generated sequence + ## + ## Return: + ## - Generated boolean values + yield lfsr.next(store_sequence = store_sequence) + +proc generate*(lfsr: var LFSR, n: int, + store_sequence: static bool = false): Tensor[bool] {.noinit.} = + ## Generate a random sequence of length `n` + ## + ## Inputs: + ## - Preconfigured LFSR object + ## - n: Number of random values to generate + ## - store_sequence: static bool that enables saving the generated sequence + ## + ## Return: + ## - `Tensor[bool]` of size `n` containing the generated values + result = newTensor[bool](n) + for i in 0 ..< n: + result[i] = lfsr.next(store_sequence = store_sequence) + +func tap_example(size: int): seq[int] = + ## Get an example "maximal" LSFR tap sequence for a given size (up to 24) + ## + ## This is a convenience function which can be used to select a set of taps + ## that generates a "maximal" sequence of the given size. + ## Note that there are many more tap sequences that generate maximal + ## sequences and that these examples are have been taken from wikipedia. + doAssert size >= 2 and size <= 24, + "LSFR tap examples are only available for sizes between 2 and 24" + let examples = @[ + @[2, 1], + @[3, 2], + @[4, 3], + @[5, 3], + @[6, 5], + @[7, 6], + @[8, 6, 5, 4], + @[9, 5], + @[10, 7], + @[11, 9], + @[12, 11, 10, 4], + @[13, 12, 11, 8], + @[14, 13, 12, 2], + @[15, 14], + @[16, 15, 13, 4], + @[17, 14], + @[18, 11], + @[19, 18, 17, 14], + @[20, 17], + @[21, 19], + @[22, 21], + @[23, 18], + @[24, 23, 22, 17] + ] + examples[size-2] diff --git a/tests/test_lfsr.nim b/tests/test_lfsr.nim new file mode 100644 index 0000000..6dc9820 --- /dev/null +++ b/tests/test_lfsr.nim @@ -0,0 +1,61 @@ +import ../impulse/lfsr/lfsr +import arraymancer / tensor + +proc test_fibonacci(): bool = + var lfsr = initLFSR( + fpoly = [5, 2].toTensor, + state = all_true, + conf = fibonacci + ) + + let sequence = lfsr.generate(31).asType(int) + let expected_sequence = [1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, + 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0].toTensor + return sequence == expected_sequence + +proc test_galois(): bool = + var lfsr = initLFSR( + fpoly = [5, 2].toTensor, + state = all_true, + conf = galois + ) + + let sequence = lfsr.generate(31).asType(int) + let expected_sequence = [1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, + 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1].toTensor + return sequence == expected_sequence + +proc test_init(): bool = + var lfsr1 = initLFSR( + fpoly = [5, 2].toTensor, + state = all_true + ) + var lfsr2 = initLFSR( + fpoly = [5, 2].toTensor, + state = all_true, + conf = fibonacci + ) + var lfsr3 = initLFSR( + fpoly = [5, 2].toTensor, + state = ones[bool](5), + conf = fibonacci + ) + let s1 = lfsr1.generate(31) + let s2 = lfsr2.generate(31) + let s3 = lfsr3.generate(31) + return s1 == s2 and s2 == s3 + +proc test_reset(): bool = + var lfsr = initLFSR( + fpoly = [5, 2].toTensor, + state = all_true + ) + let s1 = lfsr.generate(31) + lfsr.reset() + let s2 = lfsr.generate(31) + return s1 == s2 + +doAssert test_fibonacci() +doAssert test_galois() +doAssert test_init() +doAssert test_reset()