# US 6,731,674 B1 · Device and method for generating quasi-orthogonal code and spreading channel signals in mobile communication system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 6,731,674 B1
- Document ID: US6731674B1
- Status: Granted
- Kind: B1
- Application number: 09/405,333
- Filed: 1999-09-24
- Granted: 2004-05-04
- Earliest claimed: 1998-09-25
- Assignees: Samsung Electronics Co., Ltd.
- Inventors: Kyeong-Cheol Yang; Jae-Yoel Kim; Hee-Won Kang; Young-Ky Kim
- Web page: https://patentgrep.com/patent/US6731674B1

## CPC

- H04J 13/10: Code generation
- H04J 13/0048: {Walsh}
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)

## Abstract

A device and method for generating a binary quasi-orthogonal code in a CDMA communication system. The method comprises generating an m-sequence, and specific left and right sequences having a good full correlation property with the m-sequence; column permuting the specific left and right sequences in a column permutation method used when converting the m-sequence to a Walsh orthogonal code, and connecting the left sequences to the right sequences to generate mask candidates; operating the mask candidates and Walsh orthogonal codes having the same length as the mask candidates to generate quasi-orthogonal code candidate families; and selecting a quasi-orthogonal code out of the generated quasi-orthogonal code candidate families, the selected quasi-orthogonal code satisfying a partial correlation property with the Walsh orthogonal codes, and selecting a mask related to generation of the selected quasi-orthogonal code.

## Claims

### Claim 1

A method for generating a binary quasi-orthogonal code in a code division multiple access (CDMA) communication system, comprising the steps of:
(a) generating an m-sequence, and specific left and right sequences having a full correlation property which have a specific bound of correlation value with the m-sequence;
(b) column permuting the specific left and right sequences in a column permutation method used when converting the m-sequence to a Walsh orthogonal code respectively, and connecting the left sequences to the right sequences to generate mask candidates;
(c) operating the mask candidates and the Walsh orthogonal codes having the same length as the mask candidates to generate quasi-orthogonal code candidate families; and
(d) selecting a quasi-orthogonal code out of the generated quasi-orthogonal code candidate families, wherein the selected quasi-orthogonal code satisfies a partial correlation property with the Walsh orthogonal codes, and selecting a mask corresponding to generation of the selected quasi-orthogonal code.

### Claim 2 (depends on 1)

The method as claimed in claim 1, wherein the specific left and right sequences are Kerdock codes of a Family A sequence, for generating binary quasi-orthogonal code masks.

### Claim 3 (depends on 2)

The method as claimed in claim 2, wherein said step (b) comprises the steps of:
(1) independently shifting the specific left and right sequences, to generate shifted left and right sequences;
(2) independently column permuting the specific left and right sequences and the shifted left and right sequences with a column permutation function; and
(3) connecting the column permuted left sequences to the column permuted right sequences to generate binary quasi-orthogonal code mask candidates.

### Claim 4 (depends on 3)

The method as claimed in claim 3, wherein said step (1) comprises the step of inserting “0” at the head of the shifted left and right sequences.

### Claim 5 (depends on 2)

The method as claimed in claim 2, wherein a mask for generating the binary quasi-orthogonal code is selected as a binary quasi-orthogonal code mask when a correlation value of each part of N/M does not exceed {square root over (N/M)}, where N is the whole length of the binary quasi-orthogonal code candidate and the Walsh orthogonal code, M=2m, and m=0,1, . . . ,log2N, in the step (d).

### Claim 6 (depends on 5)

The method as claimed in claim 5, further comprising the step of storing a mask for generating the binary quasi-orthogonal code as the binary quasi-orthogonal code mask when a correlation value of each part of N/M does not exceed {square root over (N/M)}, where N is the whole length of a binary quasi-orthogonal code candidate generated with the mask and another binary quasi-orthogonal code candidate, M=2m, and m=0,1, . . . ,log2N.

### Claim 7

A channel transmission device for a CDMA communication system, comprising:
a generator for generating a binary quasi-orthogonal code by operating a binary quasi-orthogonal code mask and a Walsh orthogonal code corresponding to designated mask index and Walsh orthogonal code index, respectively;
a channel spreader for operating input signals and the generated binary quasi-orthogonal codes to generate channel spread signals; and
a PN (Pseudo Noise) masking part for operating the channel spread signals and PN sequences to generate PN masked channel signals.

### Claim 8 (depends on 7)

The channel transmission device as claimed in claim 7, wherein the binary quasi-orthogonal code generator comprises:
a first generator for generating the binary quasi-orthogonal code mask corresponding to the designated mask index;
a second generator for generating the Walsh orthogonal code corresponding to the designated Walsh orthogonal code; and
an adder for operating the binary quasi-orthogonal code mask and the Walsh orthogonal code to generate a binary quasi-orthogonal code.

### Claim 9

A channel transmission method for a CDMA communication system, comprising the steps of:
generating a binary quasi-orthogonal code mask corresponding to a designated quasi-orthogonal code index, and generating a binary quasi-orthogonal code by operating the generated binary quasi-orthogonal code mask and a Walsh orthogonal code;
operating input signals and the generated binary quasi-orthogonal codes to generate channel spread signals; and
operating the channel spread signals and complex PN sequences to generate PN masked channel signals.
