M-ary spread spectrum technique has been found wide applications in wireless communications, but it needs too many orthogonal spreading codes and its despreading/ demodulation is quite complex computationally, which limit its wider applications. This paper proposes a novel scheme for Code Division Multiple Access (CDMA) communication systems based on M-ary spread spectrum, where only one prototype spreading code is assigned to each user and the codes for different users are orthogonal or quasi-orthogonal with each other. The M spreading codes of each user to represent K bits data are generated by circularly shifting the assigned code and reversing its polarity. The spreading codes generated like that are called as BiOrthogorial Cyclic Codes (BOCCs). At the receiver of the system, a transform domain matched-filter implemented by means of Fast Fourier Transform (FFT) is employed to despread and demodulate the received signals, which has very low computational complexity. The results of simulation experiments and bit-error performance analysis show that the proposed scheme is practical and very useful in many cases. M-ary spread spectrum technique has been found wide applications in wireless communications, but it needs too many orthogonal spreading codes and its despreading / demodulation is quite complex computationally, which limits its wider applications. This paper proposes a novel scheme for Code Division Multiple Access (CDMA) communication systems based on M-ary spread spectrum, where only one prototype spreading code is assigned to each user and the codes for different users are orthogonal or quasi-orthogonal with each other. The M spreading codes of each user to represent K bits data are generated by circularly shifting the assigned code and reversing its polarity. The spreading codes generated like that are called as BiOrthogorial Cyclic Codes (BOCCs). The receiver of the system, a transform domain matched-filter implemented by means of Fast Fourier Transform (FFT) is employed to despread and demodulate the received signals, which has very low computational complexity. The results of s imulation experiments and bit-error performance analysis show that the proposed scheme is practical and very useful in many cases.