Multiplex communications – Generalized orthogonal or special mathematical techniques – Particular set of orthogonal functions
Reexamination Certificate
1998-09-09
2002-04-23
Ton, Dang (Department: 2661)
Multiplex communications
Generalized orthogonal or special mathematical techniques
Particular set of orthogonal functions
C370S203000, C375S130000
Reexamination Certificate
active
06377539
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Technical Field
The present invention relates generally to a mobile communication system and, in particular, to a method for generating quasi-orthogonal codes and spreader using the same in a mobile communication system.
2. Description of the Related Art
In general, a CDMA (Code Division Multiple Access) system separates the channels by using orthogonal codes in order to increase channel capacity. For example, a forward link specified by the IS-95/IS-95A standard separates the channels by using the orthogonal codes. This channel separation method can also be applied to an IS-95/IS-95A reverse link through time alignment.
FIG. 1
illustrates the IS-95/IS-95A forward link in which the channels are separated by orthogonal codes. Referring to
FIG. 1
, the channels are separated by allocated orthogonal codes Wi (where i=0-63), respectively, which typically are Walsh codes. The IS-95/IS-95A forward link uses convolutional codes with a code rate R=1/2, employs a BPSK (Bi-Phase Shift Keying) modulation, and has a bandwidth of 1.2288 MHz. Accordingly, the number of available channels is 1.2288 MHz/(9.6 KHz*2)=64 (i.e., the IS-95/IS-95A forward link can separate 64 channels by using the orthogonal codes).
By selecting a modulation method and detecting the minimum data rate, the number of available orthogonal codes can be determined. However, designers of CDMA system(s) continuously strive to provide an increase in the number of the channels in order to improve the capability. However, even when a CDMA system uses the increased number of channels, the number of the available orthogonal codes are limited. In particular, increasing the channel capacity is restricted due to the limited number of the available orthogonal codes. In a mobile communication system using a variable data rate, the length of the Walsh codes depends upon the variable data rate. Thus, it is desirable to generate quasi-orthogonal codes allowing the minimum interference with the length of the Walsh codes.
SUMMARY OF THE INVENTION
It is therefore an object of the present invention to provide a device and method for generating quasi-orthogonal codes in a mobile communication system using orthogonal codes so as to increase the channel capacity, and provide minimum interference with the orthogonal codes.
It is another object of the present invention to provide a device and method for spreading a signal by using Walsh codes and quasi-orthogonal codes in a CDMA mobile communication system.
It is a further object of the present invention to provide a device and method for generating quasi-orthogonal codes which allow the minimum interference with Walsh codes of varied lengths due to the variable data rate in a mobile communication system using both the Walsh codes and the quasi-orthogonal codes.
According to one aspect of the present invention, a channel transmission device for a CDMA mobile communication system includes a first spreader for spreading at least one input signal with quasi-orthogonal codes, a second spreader for spreading another input signal with Walsh codes, and a PN (Pseudo-Noise) spreader for complex-spreading output signals of the first and second spreaders with PN sequences. The quasi-orthogonal codes are characterized in that a partial correlation value with the Walsh codes does not exceed a lowest partial correlation limit value.
According to another aspect of the present invention, a method for generating quasi-orthogonal codes of length 2
2m
in a mobile communication system using Walsh codes and the quasi-orthogonal codes includes the steps of generating an m-sequence of length 2
2m
and selecting sub-sequences having a period of 2
2m−1
by selecting elements at intervals of 2
m+1
; generating non-zero sub-sequences out of the selected sub-sequences; generating 2
m−1
sequences by connecting the sub-sequences, and column-permuting the generated sequences by a column permutation function; adding Walsh codes to the column-permuted sequences to generate quasi-orthogonal candidate sequences having a full correlation value between the Walsh codes and other quasi-orthogonal codes that is smaller than a lowest full correlation limit value; and selecting, from the quasi-orthogonal candidate sequences, quasi-orthogonal codes having a partial correlation value with the Walsh codes that satisfies a minimum partial correlation value at a variable data rate.
REFERENCES:
patent: 3715508 (1973-02-01), Blasbalg
patent: 5088111 (1992-02-01), McNamara et al.
patent: 5546423 (1996-08-01), Sehier et al.
patent: 5583851 (1996-12-01), Kato et al.
patent: 5623487 (1997-04-01), Natali
patent: 5799010 (1998-08-01), Lomp et al.
patent: 5864548 (1999-01-01), Liu
patent: 5987014 (1999-11-01), Magill et al.
patent: 6144694 (2000-11-01), Uta et al.
Ahn Jae-Min
Chung Ha-Bong
Kang Hee-Woon
Kim Jae-Yoel
Kim Young-Ky
Dilworth & Barrese LLP
Nguyen Brian
Samsung Electronics Co,. Ltd.
Ton Dang
LandOfFree
Method for generating quasi-orthogonal code and spreader... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for generating quasi-orthogonal code and spreader..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for generating quasi-orthogonal code and spreader... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2841483