On Pseudo-Random and Orthogonal Binary Spreading Sequences

@inproceedings{Mitra2007OnPA,
  title={On Pseudo-Random and Orthogonal Binary Spreading Sequences},
  author={Abhijit Mitra},
  year={2007}
}
Different pseudo-random or pseudo-noise (PN) as well as orthogonal sequences that can be used as spreading codes for code division multiple access (CDMA) cellular networks or can be used for encrypting speech signals to reduce the residual intelligence are investigated. We briefly review the theoretical background for direct sequence CDMA systems and describe the main characteristics of the maximal length, Gold, Barker, and Kasami sequences. We also discuss about variableand fixed-length… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

Design and Analyze the various m-sequences codes in MATLAB

Anshul Khatter, Poonam Goyal
2012
View 3 Excerpts
Highly Influenced

Monitoring LED Lights with Current Signatures

IEEE INFOCOM 2018 - IEEE Conference on Computer Communications • 2018
View 2 Excerpts

References

Publications referenced by this paper.
Showing 1-10 of 20 references

An efficient algorithm to generate binary sequences for cryptographic purposes,

A. Fuster, L. J. Garcia
Theoretical Computer Science, • 2001

Digital Communications: Fundamentals and Applications

B. Sklar
2nd Ed., Prentice Hall • 2001

Spreading codes for direct sequence CDMA and wideband CDMA cellular networks,

E. H. Dinan, B. Jabbari
IEEE Commun. Magazine, • 1998

Hadamard transform application in speech scrambling,

V. Milosevic, V. Delic, V. Senk
Proc. IEEE, • 1997

CDMA: Principles of Spread Spectrum Communication

A. J. Viterbi
Addison-Wesley • 1995

Generalised Barker-like PN sequences for quasisynchronous spread spectrum multiple access communication systems,

C. K. Chan, W. H. Lam
IEE Proc. Commun., • 1995

Similar Papers

Loading similar papers…