There are very few m-sequences of any given length with good cross-correlation properties. Their autocorrelation properties are excellent, but. After reviewing the basic concept of binary sequences, Kasami sequences are introduced and compared with Gold, Gold‐like and Dual‐BCH. Generalized Kasami Sequences: The Large Set. Abstract: In this correspondence , new binary sequence families Fk of period 2n-1 are constructed for even n.
|Published (Last):||11 August 2007|
|PDF File Size:||20.87 Mb|
|ePub File Size:||13.12 Mb|
|Price:||Free* [*Free Regsitration Required]|
If you add a 7th m -sequence into the ksami and it doesn’t matter which the seventh one isthe new sequence will have cross-correlation at least 41 with one of the original 6 sequences. The Generator polynomial parameter specifies the generator polynomial, which determines the connections in the shift register that generates the sequence u.
Character vector or binary vector specifying the generator polynomial for the sequence u.
[cs/] Generalized Kasami Sequences: The Large Set
kkasami Open the model here: Sequence index Integer or vector specifying the shifts of the sequences v and w used to generate the output sequence.
Example Kasami Spreading with Two Users and Multipath This model considers Kasami spreading for a combined two-user transmission in a multipath environment. Seqence can shift the starting point of the Kasami sequence with the Shift parameter, which is an integer representing the length of the shift. This model considers Kasami spreading for a combined two-user transmission in a multipath environment.
Jason S 6 This page has been translated by MathWorks. As a consequence, when several sequences with good cross-correlation properties are needed, one needs to use Gold sequence sets or Kasami sequence sets which have good cross-correlation properties and good though not excellent autocorrelation properties. Click here to see To view all translated materials including this page, select Country from the country navigator on the bottom of this page.
Pursley, “Cross-correlation properties of pseudorandom and related sequences,” Proc. The Initial states parameter specifies the initial states of the shift register that generates the sequence u. Trial Software Product Updates. MathWorks does not warrant, and disclaims all liability for, the accuracy, suitability, or fitness for purpose of the translation.
Select a Web Site
Parameters Generator polynomial Character vector or binary vector specifying the generator polynomial for the sequence u. The first and last entries must be 1. The following table describes the kasamo sequences corresponding to Sequence index m:. This block can output sequences that vary in length during simulation.
Integer scalar that determines the offset of the Kasami sequence from the initial time.
This ensures that the equivalent output rate is not dependent on the Samples per frame parameter. A vector kwsami lists the coefficients of the polynomial in descending order of powers.
Choose a web kadami to get translated content where available and see local events and offers. The time between output updates is equal to the product of Samples per frame and Sample time.
In this case, the output sequence is from the large set. Sign up using Email and Password.
Kasami code – Wikipedia
Translated by Mouseover text to see original. Sign up using Facebook. Only the small set is optimal in the sense of matching Welch’s lower bound for correlation functions.
This is machine translation Translated by. To generate sequences from the small set, for n is even, you can specify the Sequence index as an integer m.
You can specify the parameter in either of two ways:. Select the China site in Chinese or English for best site performance. For example, if Sample time and Samples per frame equal one, the block outputs a sample every second.
There are two sets of Kasami sequences: Home Questions Tags Users Unanswered. When you select Inherit from reference portthe block output inherits sample time, maximum size, and current size from the variable-sized signal at the Ref input port.
The range of m is [-1, This can be attributed to the “good” correlation properties of Kasami sequences, which provide a balance between the ideal cross-correlation properties of orthogonal codes and the ideal auto-correlation properties of PN sequences. To experiment with this model further, try selecting other path delays to see how the performance varies for the same code.
Computer Science > Information Theory
The following table describes the output sequences corresponding to Sequence index m: If I squence correctly, Gold codes are defined as the XOR between two m-sequences with different polynomials of the same degree e. Their autocorrelation properties are excellent, but the cross-correlation properties are variable. Email Required, but never shown. Initial States is a binary kaami or row vector of length equal to the degree of the Generator polynomial.
The default selection is Dialog parameter.