o
    װiq                     @   s  d dl Z i ddgddgddgddgddgddgd	g d
ddgddgddgdg ddg ddg dddgdg dddgddgg ddgdgdgdgg ddgg dg dd gd!gg d"d#gg d$d%Zd&Ze ed'Zd)d(d'ZdS )*    N                        )r   r   r   	   
         )r   r   r      )r   r   r	      )r   r   r         )r   r   r         )r   r   r         )      r   r   )         )   r   r   r      )      r   r   )      r   )r   r   r   r   r   r   r   r   r   r   r   r    r       a  
#include <cupy/math_constants.h>
#include <cupy/carray.cuh>
#include <cupy/complex.cuh>

extern "C" __global__ void max_len_seq(
        long long length, long long n_taps, int n_state, long long* taps,
        signed char* state, signed char* seq) {

    int idx = blockDim.x * blockIdx.x + threadIdx.x;
    for(long long i = 0; i < length; i++) {
        signed char next_state = state[(idx + 1) % n_state];
        if(idx == n_state - 1) {
            seq[i] = state[0];
            for(int n_tap = 0; n_tap < n_taps; n_tap++) {
                long long tap = taps[n_tap];
                next_state ^= state[tap];
            }
        }
        state[idx] = next_state;
    }
}
max_len_seqc              	   C   sx  |du r'| t vrttt  }td| | f tt |  tj}n+t	t|tjddd }t
|dk sIt
|| ksI|jdk rMtdt|}d|  d }|du r_|}nt|}|dk rktd|du rytj| tjd	d
}ntj|td	d
tj}|jdks|j| krtdt|dkrtdtj|tjd	d
}t|}td| f||| |||f ||fS )a  
    Maximum length sequence (MLS) generator.

    Parameters
    ----------
    nbits : int
        Number of bits to use. Length of the resulting sequence will
        be ``(2**nbits) - 1``. Note that generating long sequences
        (e.g., greater than ``nbits == 16``) can take a long time.
    state : array_like, optional
        If array, must be of length ``nbits``, and will be cast to binary
        (bool) representation. If None, a seed of ones will be used,
        producing a repeatable representation. If ``state`` is all
        zeros, an error is raised as this is invalid. Default: None.
    length : int, optional
        Number of samples to compute. If None, the entire length
        ``(2**nbits) - 1`` is computed.
    taps : array_like, optional
        Polynomial taps to use (e.g., ``[7, 6, 1]`` for an 8-bit sequence).
        If None, taps will be automatically selected (for up to
        ``nbits == 32``).

    Returns
    -------
    seq : array
        Resulting MLS sequence of 0's and 1's.
    state : array
        The final state of the shift register.

    Notes
    -----
    The algorithm for MLS generation is generically described in:

        https://en.wikipedia.org/wiki/Maximum_length_sequence

    The default values for taps are specifically taken from the first
    option listed for each value of ``nbits`` in:

        https://web.archive.org/web/20181001062252/http://www.newwaveinstruments.com/resources/articles/m_sequence_linear_feedback_shift_register_lfsr.htm

    Nz/nbits must be between %s and %s if taps is Noner   r   zEtaps must be non-empty with values between zero and nbits (inclusive)r   z)length must be greater than or equal to 0c)dtypeorderz'state must be a 1-D array of size nbitszstate must not be all zeros)r   )	_mls_tapscupyarraylistkeys
ValueErrorminmaxint64uniqueanysizeintonesint8boolastypendimallemptylen_max_len_seq)nbitsstatelengthtaps
known_tapsn_maxseqn_taps rE   S/home/ubuntu/.local/lib/python3.10/site-packages/cupyx/scipy/signal/_max_len_seq.pyr"   (   s8   *&
)NNN)r(   r'   MAX_LEN_SEQ_KERNEL	RawKernelr<   r"   rE   rE   rE   rF   <module>   s<    <
	