| 摘要 |
ej(2n&pgr;/N) calculating section 101 generates a bth chip C(a,b) of an ath spreading code based on C(a,b)=ej(2n&pgr;/N) where e is a base of natural logarithm and N is a length of the spreading code (i.e. spreading code length). It is assumed in the above equation that n=a×b, a=0˜N−1, and b=0˜N−1. It is thereby possible to generate orthogonal spreading codes with arbitrary lengths.
|
