Design of Optimum M-Phase Spreading Sequences of Markov Chains(Communications and Sequences,<Special Section>Nonlinear Theory and its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
We design M(≥3)-phase spreading sequences of Markov chains optimal in terms of bit error probabilities in asynchronous SSMA (spread spectrum multiple access) communication systems. To this end, we obtain the distributions of the normalized MAI (multiple access interference) for such systems and find a necessary and sufficient condition that the distributions become independent of the phase shifts.
- 社団法人電子情報通信学会の論文
- 2007-10-01
著者
関連論文
- On bit error probabilities of SSMA communication systems using spreading sequences of Markov chains
- Discretized Markov transformations - An example of ultradiscrete dynamical systems
- The Central Limit Theorem for the Normalized Sums of the MAI for SSMA Communication Systems Using Spreading Sequences of Markov Chains(Sequence Design and its Application in Communications)
- On Distributions of Multiple Access Interference for Spread Spectrum Communication Systems Using M-Phase Spreading Sequences of Markov Chains
- Design of Optimum M-Phase Spreading Sequences of Markov Chains(Communications and Sequences,Nonlinear Theory and its Applications)
- Generating Stochastic Processes Based on the Finitary Interval Algorithm
- On Correlation Values of M-Phase Spreading Sequences of Markov Chains
- On Generating Stochastic Processes Based on the Interval Algorithm
- On auto-correlation values of de Bruijn sequences
- Approximations for Bit Error Probabilities in SSMA Communication Systems Using Spreading Sequences of Markov Chains