# US 10,771,205 B2 · Method and device for performing communication by using non-orthogonal code multiple access scheme in wireless communication system

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

- Number: US 10,771,205 B2
- Document ID: US10771205B2
- Status: Granted
- Kind: B2
- Application number: 16/323,586
- Filed: 2017-07-27
- Published: 2019-06-13
- Granted: 2020-09-08
- Earliest claimed: 2016-08-12
- Assignees: LG Electronics Inc.
- Applicants: LG Electronics Inc.
- Inventors: Hojae Lee; Sangrim Lee; Kijun Kim; Byounghoon Kim
- Web page: https://patentgrep.com/patent/US10771205B2

## CPC

- H04L 5/0016: {Time-frequency-code}
- H04J 13/0003: {Code application, i.e. aspects relating to how codes are applied to form multiplexed channels}
- H04J 13/10: Code generation
- H04J 13/16: Code allocation
- H04L 27/18: Phase-modulated carrier systems, i.e. using phase-shift keying (H04L27/32 takes precedence)
- H04L 27/34: Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
- H04W 72/044: based on the type of the allocated resource
- H04W 72/23: in the downlink direction of a wireless link, i.e. towards a terminal
- H04J 2013/165: {Joint allocation of code together with frequency or time}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- 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)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

A method and a device for performing communication by using a non-orthogonal code multiple access scheme in a wireless communication system are provided. Particularly, a terminal receives control information from a base station. The terminal modulates or demodulates a terminal-specific NCC on the basis of the control information. The terminal performs the non-orthogonal code multiple access scheme by using the terminal-specific NCC. The control information includes information on a codeword composed of a Grassmannian sequence. The codeword is included in a codebook predefined for the non-orthogonal code multiple access scheme. Each coefficient of the Grassmannian sequence is quantized on the basis of an M-quadrature amplitude modulation (M-QAM) constellation.

## Claims

### Claim 1

A method for performing communication based on a non-orthogonal coded multiple access scheme in a wireless communication system, the method comprising:
receiving, by a user equipment (UE), control information from a base station;
modulating or demodulating, by the UE, a UE specific non-orthogonal code cover (NCC) based on the control information;
performing, by the UE, the non-orthogonal coded multiple access scheme based on the UE specific NCC,
wherein the control information comprises information on a codeword configured in a Grassmannian sequence,
wherein the codeword is included in a codebook predefined for the non-orthogonal coded multiple access scheme,
wherein each coefficient of the Grassmannian sequence is quantized based on an M-quadrature amplitude modulation (QAM) constellation, where M is a quantization level, and
wherein, before being quantized with the M-QAM constellation, the Grassmannian sequence is scaled with a mean value of a magnitude of the M-QAM constellation and is normalized with a mean value of a magnitude of each coefficient of the codeword.

### Claim 2 (depends on 1)

The method of claim 1, wherein the quantized Grassmannian sequence is generated by quantizing each coefficient of the Grassmannian sequence in an In-phase Quadrature-phase (IQ) domain with the M-QAM constellation having a minimum Euclidean distance for each coefficient of the Grassmannian sequence.

### Claim 3 (depends on 2)

The method of claim 2, wherein the quantized Grassmannian sequence corresponds to a codebook C configured in an (N×K) dimension, where N is a spreading factor and K is a superposition factor.

### Claim 4 (depends on 3)

The method of claim 3,
wherein when M is 64, N is 2, and K is 2, the quantized Grassmannian sequence
is expressed with a first matrix as follows:
[
5
+
5
⁢
i
5
+
5
⁢
i
5
+
5
⁢
i
-
5
-
5
⁢
i
]
*
P
no
,
2
,
2
,
wherein when N is 64, N is 2, and K is 3, the quantized Grassmannian sequence is expressed with a second matrix as follows:
[
-
3
+
5
⁢
i
-
3
+
7
⁢
i
-
1
-
3
⁢
i
-
7
-
3
⁢
i
7
-
3
⁢
i
-
3
+
1
⁢
i
7
-
3
⁢
i
5
+
3
⁢
i
]
*
P
no
,
2
,
4
wherein when M is 64, N is 2, and K is 6, the quantized Grassmannian sequence is expressed with a third matrix as follows:
[
-
3
+
1
⁢
i
-
7
-
3
⁢
i
-
1
-
5
⁢
i
-
5
+
3
⁢
i
-
1
-
7
⁢
i
-
7
+
1
⁢
i
7
-
3
⁢
i
-
5
+
3
⁢
i
-
1
-
7
⁢
i
-
5
-
5
⁢
i
-
1
-
1
⁢
i
3
-
3
⁢
i
]
*
P
no
,
2
,
6
wherein when M is 64, N is 2, and K is 8, the quantized Grassmannian sequence is expressed with a fourth matrix as follows:
[
-
3
-
7
⁢
i
-
7
-
1
⁢
i
-
3
-
1
⁢
i
-
1
-
5
⁢
i
-
3
-
1
⁢
i
-
7
+
1
⁢
i
-
3
-
7
⁢
i
1
+
5
⁢
i
-
1
-
3
⁢
i
1
-
5
⁢
i
-
1
+
7
⁢
i
-
5
-
7
⁢
i
1
-
7
⁢
i
3
+
1
⁢
i
-
5
+
1
⁢
i
-
1
-
7
⁢
i
]
*
P
no
,
2
,
8
,
and
wherein Pno,N,K is a normalized matrix for power constraints and is expressed as follows:
P
no
,
N
,
K
=
[
P
no
,
1
0
0
0
0
P
no
,
2
0
0
0
0
⋱
0
0
0
0
P
no
,
K
]
,
and
wherein no,K is P expressed as follows:
Pno,k=(1/|c(k)|)×√{square root over (N)}, for k=1, . . . ,K,
where c corresponds to a column vector of the first to fourth matrixes.

### Claim 5 (depends on 3)

The method of claim 3,
wherein when M is 64, N is 4, and K is 4, the quantized Grassmannian sequence is expressed with a first matrix as follows:
[
5
+
5
⁢
i
5
+
5
⁢
i
5
+
5
⁢
i
5
+
5
⁢
i
5
+
5
⁢
i
-
5
-
5
⁢
i
5
+
5
⁢
i
-
5
-
5
⁢
i
5
+
5
⁢
i
5
+
5
⁢
i
-
5
-
5
⁢
i
-
5
-
5
⁢
i
5
+
5
⁢
i
-
5
-
5
⁢
i
-
5
-
5
⁢
i
5
+
5
⁢
i
]
*
P
no
,
4
,
4
wherein when N is 64, N is 4, and K is 6, the quantized Grassmannian sequence is expressed with a second matrix as follows:
[
-
7
+
3
⁢
i
-
3
+
1
⁢
i
-
1
-
7
⁢
i
-
1
+
1
⁢
i
-
7
+
5
⁢
i
-
3
+
1
⁢
i
-
5
+
1
⁢
i
-
1
-
5
⁢
i
-
3
+
1
⁢
i
3
+
5
⁢
i
-
3
-
7
⁢
i
5
+
7
⁢
i
3
+
1
⁢
i
-
1
-
7
⁢
i
-
1
-
3
⁢
i
-
1
+
7
⁢
i
3
+
3
⁢
i
5
-
7
⁢
i
1
-
7
⁢
i
-
7
+
3
⁢
i
-
3
+
1
⁢
i
-
5
+
5
⁢
i
-
1
+
3
⁢
i
1
+
3
⁢
i
]
*
P
no
,
4
,
6
wherein when M is 64, N is 4, and K is 8, the quantized Grassmannian sequence is expressed with a third matrix as follows:
[
-
5
-
3
⁢
i
-
7
+
1
⁢
i
-
1
-
3
⁢
i
-
7
-
3
⁢
i
-
1
-
3
⁢
i
-
5
-
3
⁢
i
-
5
-
3
⁢
i
-
7
+
7
⁢
i
1
-
5
⁢
i
1
+
3
⁢
i
-
7
+
7
⁢
i
5
-
1
⁢
i
7
-
3
⁢
i
3
+
1
⁢
i
-
1
+
5
⁢
i
-
5
+
5
⁢
i
-
7
-
3
⁢
i
1
-
7
⁢
i
-
1
+
3
⁢
i
7
+
1
⁢
i
-
5
+
7
⁢
i
-
3
-
5
⁢
i
-
5
+
3
⁢
i
-
1
-
1
⁢
i
1
-
3
⁢
i
1
-
7
⁢
i
-
5
+
7
⁢
i
-
3
+
5
⁢
i
1
+
1
⁢
i
-
7
+
7
⁢
i
7
-
5
⁢
i
3
+
1
⁢
i
]
*
P
no
,
4
,
8
,
wherein Pno,N,K is a normalized matrix for power constraints and is expressed as follows:
P
no
,
N
,
K
=
[
P
no
,
1
0
0
0
0
P
no
,
2
0
0
0
0
⋱
0
0
0
0
P
no
,
K
]
,
and
wherein Pno,K is expressed as follows:
Pno,k=(1/|c(k)|)×√{square root over (N)}, for k=1, . . . ,K,
where c corresponds to a column vector of the first to third matrixes.

### Claim 6 (depends on 3)

The method of claim 3, wherein when the base station supports multiple cells, some sequences out of the quantized Grassmannian sequences are used only for a specific cell out of the multiple cells.

### Claim 7 (depends on 1)

The method of claim 1, wherein the Grassmannian sequence is included in a first sequence set which maximizes a chordal distance formed by two random vectors in a same subspace, a second sequence set of which cross-correlation between sequences is equally maintained, and a non-constant-modulus third sequence set.

### Claim 8 (depends on 1)

The method of claim 1, wherein the performing, by the UE, the non-orthogonal coded multiple access scheme based on the UE specific NCC comprises:
receiving, by the UE, data of multiple UEs in a same time frequency resource based on the UE specific NCC when the wireless communication system performs downlink communication; and
transmitting, by the UE, data of multiple UEs in the same time frequency resource based on the UE specific NCC when the wireless communication system performs uplink communication.

### Claim 9

A UE performing communication based on a non-orthogonal coded multiple access scheme in a wireless communication system, the UE comprising:
transmitter and a receiver for transmitting and receiving a radio signal; and
a processor operatively coupled to the transmitter and the receiver, wherein the processor is configured to:
receive control information from a base station;
modulate or demodulate a UE specific NCC based on the control information;
perform the non-orthogonal coded multiple access scheme based on the UE specific NCC,
wherein the control information comprises information on a codeword configured in a Grassmannian sequence,
wherein the codeword is included in a codebook predefined for the non-orthogonal coded multiple access scheme,
wherein each coefficient of the Grassmannian sequence is quantized based on an M-QAM constellation, where M is a quantization level, and
wherein, before being quantized with the M-QAM constellation, the Grassmannian sequence is scaled with a mean value of a magnitude of the M-QAM constellation and is normalized with a mean value of a magnitude of each coefficient of the codeword.

### Claim 10 (depends on 9)

The UE of claim 9, wherein the quantized Grassmannian sequence is generated by quantizing each coefficient of the Grassmannian sequence in an In-phase Quadrature-phase (IQ) domain with the M-QAM constellation having a minimum Euclidean distance for each coefficient of the Grassmannian sequence.

### Claim 11 (depends on 10)

The UE of claim 10, wherein the predefined codebook corresponds to a codebook C configured in an (N×K) dimension, where N is a spreading factor and K is a superposition factor.

### Claim 12 (depends on 11)

The UE of claim 11,
wherein when M is 64, N is 2, and K is 2, the quantized Grassmannian sequence
is expressed with a first matrix as follows:
[
5
+
5
⁢
i
5
+
5
⁢
i
5
+
5
⁢
i
-
5
-
5
⁢
i
]
*
P
no
,
2
,
2
,
wherein when N is 64, N is 2, and K is 3, the quantized Grassmannian sequence is expressed with a second matrix as follows:
[
-
3
+
5
⁢
i
-
3
+
7
⁢
i
-
1
-
3
⁢
i
-
7
-
3
⁢
i
7
-
3
⁢
i
-
3
+
1
⁢
i
7
-
3
⁢
i
5
+
3
⁢
i
]
*
P
no
,
2
,
4
wherein when M is 64, N is 2, and K is 6, the quantized Grassmannian sequence is expressed with a third matrix as follows:
[
-
3
+
1
⁢
i
-
7
-
3
⁢
i
-
1
-
5
⁢
i
-
5
+
3
⁢
i
-
1
-
7
⁢
i
-
7
+
1
⁢
i
7
-
3
⁢
i
-
5
+
3
⁢
i
-
1
-
7
⁢
i
-
5
-
5
⁢
i
-
1
-
1
⁢
i
3
-
3
⁢
i
]
*
P
no
,
2
,
6
wherein when M is 64, N is 2, and K is 8, the quantized Grassmannian sequence is expressed with a fourth matrix as follows:
[
-
3
-
7
⁢
i
-
7
-
1
⁢
i
-
3
-
1
⁢
i
-
1
-
5
⁢
i
-
3
-
1
⁢
i
-
7
+
1
⁢
i
-
3
-
7
⁢
i
1
+
5
⁢
i
-
1
-
3
⁢
i
1
-
5
⁢
i
-
1
+
7
⁢
i
-
5
-
7
⁢
i
1
-
7
⁢
i
-
3
+
1
⁢
i
-
5
+
1
⁢
i
-
1
-
7
⁢
i
]
*
P
no
,
2
,
8
,
and
wherein Pno,N,K is a normalized matrix for power constraints and is expressed as follows:
P
no
,
N
,
K
=
[
P
no
,
1
0
0
0
0
P
no
,
2
0
0
0
0
⋱
0
0
0
0
P
no
,
K
]
,
and
wherein Pno,K is expressed as follows:
Pno,k=(1/|c(k)|)×√{square root over (N)}, for k=1, . . . ,K,
where c corresponds to a column vector of the first to fourth matrixes.

### Claim 13 (depends on 11)

The UE of claim 11,
wherein when M is 64, N is 4, and K is 4, the quantized Grassmannian sequence is expressed with a first matrix as follows:
[
5
+
5
⁢
i
5
+
5
⁢
i
5
+
5
⁢
i
5
+
5
⁢
i
5
+
5
⁢
i
-
5
-
5
⁢
i
5
+
5
⁢
i
-
5
-
5
⁢
i
5
+
5
⁢
i
5
+
5
⁢
i
-
5
-
5
⁢
i
-
5
-
5
⁢
i
5
+
5
⁢
i
-
5
-
5
⁢
i
-
5
-
5
⁢
i
5
+
5
⁢
i
]
*
P
no
,
4
,
4
wherein when N is 64, N is 4, and K is 6, the quantized Grassmannian sequence is expressed with a second matrix as follows:
[
-
7
+
3
⁢
i
-
3
+
1
⁢
i
-
1
-
7
⁢
i
-
1
+
1
⁢
i
-
7
+
5
⁢
i
-
3
+
1
⁢
i
-
5
+
1
⁢
i
-
1
-
5
⁢
i
-
3
+
1
⁢
i
3
+
5
⁢
i
-
3
-
7
⁢
i
5
+
7
⁢
i
3
+
1
⁢
i
-
1
-
7
⁢
i
-
1
-
3
⁢
i
-
1
+
7
⁢
i
3
+
3
⁢
i
5
-
7
⁢
i
1
-
7
⁢
i
-
7
+
3
⁢
i
-
3
+
1
⁢
i
-
5
+
5
⁢
i
-
1
+
3
⁢
i
1
+
3
⁢
i
]
*
P
no
,
4
,
6
wherein when M is 64, N is 4, and K is 8, the quantized Grassmannian sequence is expressed with a third matrix as follows:
[
-
5
-
3
⁢
i
-
7
+
1
⁢
i
-
1
-
3
⁢
i
-
7
-
3
⁢
i
-
1
-
3
⁢
i
-
5
-
3
⁢
i
-
5
-
3
⁢
i
-
7
+
7
⁢
i
1
-
5
⁢
i
1
+
3
⁢
i
-
7
+
7
⁢
i
5
-
1
⁢
i
7
-
3
⁢
i
3
+
1
⁢
i
-
1
+
5
⁢
i
-
5
+
5
⁢
i
-
7
-
3
⁢
i
1
-
7
⁢
i
-
1
+
3
⁢
i
7
+
1
⁢
i
-
5
+
7
⁢
i
-
3
-
5
⁢
i
-
5
+
3
⁢
i
-
1
-
1
⁢
i
1
-
3
⁢
i
1
-
7
⁢
i
-
5
+
7
⁢
i
-
3
+
5
⁢
i
1
+
1
⁢
i
-
7
+
7
⁢
i
7
-
5
⁢
i
3
+
1
⁢
i
]
*
P
no
,
4
,
8
,
wherein Pno,N,K is a normalized matrix for power constraints and is expressed as follows:
P
no
,
N
,
K
=
[
P
no
,
1
0
0
0
0
P
no
,
2
0
0
0
0
⋱
0
0
0
0
P
no
,
K
]
,
and
wherein Pno,K is expressed as follows:
Pno,k=(1/|c(k)|)×√{square root over (N)}, for k=1, . . . ,K,
where c corresponds to a column vector of the first to third matrixes.