On the self-interferences of SS codes generated by a Markov chain

Yutaka Jitsumatsu; T. Kohda

On the self-interferences of SS codes generated by a Markov chain

Yutaka Jitsumatsu, T. Kohda

Mathematical Informatics

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

The self-interference of spreading sequence (SS) codes for asynchronous direct sequence (DS)/code division multiple access (DS/CDMA) generated by a Markov chain, was discussed. The central limit theorem was applied and E_S and σ_S ² were averaged where E_S and σ_S ² denoted mean and variance of S_p ⁽ⁱ⁾/√N with respect to X⁽ⁱ⁾ respectively. An estimated bit error rate (BER) of a nearly synchronized correlation receiver was also obtained.

Original language	English
Pages (from-to)	67
Number of pages	1
Journal	Unknown Journal
Publication status	Published - 2002

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Cite this

@article{7073971c246945e280c2806144dcc5f5,

title = "On the self-interferences of SS codes generated by a Markov chain",

abstract = "The self-interference of spreading sequence (SS) codes for asynchronous direct sequence (DS)/code division multiple access (DS/CDMA) generated by a Markov chain, was discussed. The central limit theorem was applied and ES and σS 2 were averaged where ES and σS 2 denoted mean and variance of Sp (i)/√N with respect to X(i) respectively. An estimated bit error rate (BER) of a nearly synchronized correlation receiver was also obtained.",

author = "Yutaka Jitsumatsu and T. Kohda",

year = "2002",

language = "English",

pages = "67",

journal = "Unknown Journal",

publisher = "Elsevier Limited",

}

TY - JOUR

T1 - On the self-interferences of SS codes generated by a Markov chain

AU - Jitsumatsu, Yutaka

AU - Kohda, T.

PY - 2002

Y1 - 2002

N2 - The self-interference of spreading sequence (SS) codes for asynchronous direct sequence (DS)/code division multiple access (DS/CDMA) generated by a Markov chain, was discussed. The central limit theorem was applied and ES and σS 2 were averaged where ES and σS 2 denoted mean and variance of Sp (i)/√N with respect to X(i) respectively. An estimated bit error rate (BER) of a nearly synchronized correlation receiver was also obtained.

AB - The self-interference of spreading sequence (SS) codes for asynchronous direct sequence (DS)/code division multiple access (DS/CDMA) generated by a Markov chain, was discussed. The central limit theorem was applied and ES and σS 2 were averaged where ES and σS 2 denoted mean and variance of Sp (i)/√N with respect to X(i) respectively. An estimated bit error rate (BER) of a nearly synchronized correlation receiver was also obtained.

UR - http://www.scopus.com/inward/record.url?scp=0036354347&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036354347&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0036354347

SP - 67

JO - Unknown Journal

JF - Unknown Journal

ER -

On the self-interferences of SS codes generated by a Markov chain

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this