On a Synchronization Problem in Asynchronous DS/CDMA System (5th Workshop on Stochastic Numerics)
Yutaka Jitsumatsu, Tohru Kohda · Kyoto University Research Information Repository (Kyoto University) · 2001
福岡市東区箱崎 6 丁 目 10-1 $\mathrm{A}\mathrm{b}\mathrm{s}\mathrm{t}\mathrm{r}\mathrm{a}\mathrm{c}\mathrm{t}-\mathrm{R}\mathrm{e}\mathrm{c}\mathrm{e}\mathrm{n}\mathrm{t}\mathrm{l}\mathrm{y}$ studies on spreading sequences (SS) codes generated by aMarkov chain have been extensively discussed since it was reported that, for an asynchronous $\mathrm{D}\mathrm{S}/\mathrm{C}\mathrm{D}\mathrm{M}\mathrm{A}$ system, SS codes can achieve smaller bit error rate (BER) than linear feedback shift register (LFSR) sequences.However these results follow from the assumption that the receiver is completely syn-