Optimum binary spreading sequences of Markov chains

Electronics Letters

Volumn 37, Issue 20, 2001, Pages 1234-1235

  Fujisaki, H ^a  

^a KANAZAWA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; BIT ERROR RATE; CODE DIVISION MULTIPLE ACCESS; DIRECT SEQUENCE SYSTEMS; MATHEMATICAL MODELS; MULTIPATH PROPAGATION; SIGNAL INTERFERENCE; SIGNAL RECEIVERS;

AUTOCORRELATION FUNCTIONS; AVERAGE INTERFERENCE PARAMETERS (AIP);

MARKOV PROCESSES;

EID: 0035959795     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:20010854     Document Type: Article

References (9)

1. Chaotic complex spreading sequences for asynchronous DS-CDMA, Part I: System modeling and results
2. Chaotic complex spreading sequences for asynchronous DS-CDMA, Part II: Some theoretical performance bounds
3. Interference in DS-CDMA systems with exponentially vanishing autocorrelations: Chaos-based spreading is optimal
4. A tensor approach to higher order expectations of quantized chaotic trajectories - Part I: General theory and specialization to piecewise affine Markov systems
5. A tensor approach to higher order expectations of quantized chaotic trajectories - Part II: Application to chaos-based DS-CDMA in multipath environments
6. Variances of multiple access interference code average against data average
7. On optimum 3-phase spreading sequences of simple Markov chains
8. Performance evaluation for phase-coded spread-spectrum multiple access communication - Part I: System analysis