IP Library Granted Patent US 12,659,080
Granted Patent B2
US 12,659,080 · App. 18/777,738 · Granted Jun 16, 2026

Encoding method, device, and readable storage medium

Inventor: Wei Huang (Guangdong, CN)
Assignee: VIVO MOBILE COMMUNICATION CO., LTD.
H04L1/0643H04L1/0668
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,659,080
App. No.
18/777,738
Granted
Jun 16, 2026
Kind
B2
Abstract

This application discloses an encoding method, a device, and a readable storage medium. The method includes: performing, by an encoder, space-time block code encoding on data based on a preset codebook, where the preset codebook is a non-full-rate orthogonal codebook over a field of complex numbers in which an Alamouti codebook sub-block in the codebook is replaced with an NSTBC codebook sub-block, and columns of the preset codebook are pairwise orthogonal.

Claims (1723)

1 . An encoding method, comprising:

performing, by an encoder, space-time block code encoding on data based on a preset codebook, wherein

the preset codebook is a non-full-rate orthogonal codebook over a field of complex numbers in which an Alamouti codebook sub-block in the codebook is replaced with a new space-time block code (NSTBC) codebook sub-block, and columns of the preset codebook are pairwise orthogonal.

2 . The method according to claim 1 , wherein a structure of an NSTBC codebook is:

S

=

[

s

1

2

s

3

4

*

s

3

4

-

s

1

2

*

]

,

wherein

S is the NSTBC codebook, and elements in S comprise

s

1

2

,

s

3

4

,

s

3

4

*

,

and

-

s

1

2

*

;

s

1

2

is a first basic element, s 34 is a second basic element,

-

s

1

2

*

is a first generation element, and

s

3

4

*

is a second generation element; and

s

1

2

,

s

3

4

,

s

3

4

*

,

and

-

s

1

2

*

meet:

in a case that N is equal to 2, N is a quantity of transmit antennas,

s

1

2

,

s

3

4

,

s

3

4

*

,

and

-

s

1

2

*

are all complex numbers,

s

3

4

*

is a conjugate complex number of s 34 , and

-

s

1

2

*

is an opposite number of a conjugate complex number of s 12 .

3 . The method according to claim 2 , wherein a structure of the preset codebook is:

S

c

=

(

s

1

s

2

*

#

s

2

-

s

1

*

#

#

#

#

)

,

wherein

S c is the preset codebook, dimensions of S c are (p×n), n is a quantity of transmit antennas, p is a symbol period, s 1 and

s

2

*

are transmitted symbols that are on a first transmit antenna and a second transmit antenna and that are obtained by the encoder through encoding in a first symbol period, s 2 and

-

s

1

*

are transmitted symbols that are on the first transmit antenna and the second transmit antenna and that are obtained by the encoder through encoding in a second symbol period, the symbol

s

2

*

is a conjugate of the symbol s 2 , the symbol

-

s

1

*

is a negative conjugate of the symbol s 1 , and # is another symbol over the field of complex numbers in the preset codebook.

4 . The method according to claim 3 , wherein columns B a and B b of the preset codebook meet:

B

a

T

·

B

b

=

0

;

and

the preset codebook meets:

S

c

H

·

S

c

=

α

×

I

n

×

n

,

wherein

a and b are integers, 1≤a, b≤n, and a≠b; and

B

a

T

is a transpose of B a ,

S

c

H

is a conjugate transpose of S c , and α is a coefficient factor related to a symbol in the preset codebook.

5 . The method according to claim 3 , wherein the another symbol # over the field of complex numbers in the preset codebook meets:

#

{

s

1

,

s

1

*

,

-

s

1

,

-

s

1

*

,

s

2

,

s

2

*

,

-

s

2

,

-

s

2

*

}

.

6 . The method according to claim 3 , wherein a rate R of the preset codebook meets:

R

m

+

1

2

m

,

n=2m or n=2m+1, n is the quantity of transmit antennas, and m is an integer greater than or equal to 1.

7 . The method according to claim 6 , wherein in a case of

R

=

3

4

and n=3,

the structure of the preset codebook is:

S

c

,

3

4

3

,

1

=

(

s

1

s

2

*

s

3

*

2

s

2

-

s

1

*

s

3

*

2

s

3

*

2

-

s

3

*

2

(

-

s

1

-

s

1

*

-

s

2

+

s

2

*

)

2

s

3

*

2

s

3

*

2

(

-

s

2

-

s

2

*

-

s

1

+

s

1

*

)

2

)

;

or

the structure of the preset codebook is:

S

c

,

3

4

3

,

2

=

(

s

1

s

2

*

-

s

3

*

2

s

2

-

s

1

*

s

3

*

2

s

3

*

2

-

s

3

*

2

(

-

s

2

-

s

2

*

+

s

1

-

s

1

*

)

2

s

3

*

2

s

3

*

2

(

s

1

+

s

1

*

-

s

2

+

s

2

*

)

2

)

;

or

the structure of the preset codebook is:

S

c

,

3

4

3

,

3

=

(

s

1

s

2

*

s

3

2

s

2

-

s

1

*

s

3

2

s

3

*

2

-

s

3

*

2

(

-

s

1

-

s

1

*

+

s

2

-

s

2

*

)

2

s

3

*

2

s

3

*

2

(

-

s

2

-

s

2

*

+

s

1

-

s

1

*

)

2

)

;

or

the structure of the preset codebook is:

S

c

,

3

4

3

,

4

=

(

s

1

s

2

*

-

s

3

2

s

2

-

s

1

*

s

3

2

s

3

*

2

-

s

3

*

2

(

-

s

2

-

s

2

*

-

s

1

+

s

1

*

)

2

s

3

*

2

s

3

*

2

(

s

1

+

s

1

*

+

s

2

-

s

1

*

)

2

)

.

8 . The method according to claim 6 , wherein in a case of

R

=

3

4

and n=4,

the structure of the preset codebook is:

S

c

,

3

4

4

,

1

=

(

s

1

s

2

*

s

3

*

2

-

s

3

*

2

s

2

-

s

1

*

s

3

*

2

s

3

*

2

s

3

*

2

-

s

3

*

2

(

-

s

1

-

s

1

*

-

s

2

+

s

2

*

)

2

(

-

s

2

-

s

2

*

+

s

1

-

s

1

*

)

2

s

3

*

2

s

3

*

2

(

-

s

2

-

s

2

*

-

s

1

+

s

1

*

)

2

(

s

1

+

s

1

*

-

s

2

+

s

2

*

)

2

)

;

or

the structure of the preset codebook is:

S

c

,

3

4

4

,

2

=

(

s

1

s

2

*

s

3

2

-

s

3

2

s

2

-

s

1

*

s

3

2

s

3

2

s

3

*

2

-

s

3

*

2

(

-

s

1

-

s

1

*

+

s

2

-

s

2

*

)

2

(

-

s

2

-

s

2

*

-

s

1

+

s

1

*

)

2

s

3

*

2

s

3

*

2

(

-

s

2

-

s

2

*

+

s

1

-

s

1

*

)

2

(

s

1

+

s

1

*

+

s

2

-

s

2

*

)

2

)

.

9 . A non-transitory readable storage medium, wherein the non-transitory readable storage medium stores a program or instructions, and when the program or instructions are executed by a processor, the steps of the encoding method according to claim 1 are implemented.

10 . A chip, comprising a processor and a communication interface, wherein the communication interface is coupled to the processor, and the processor is configured to run a program or instructions to implement the steps of the encoding method according to claim 1 .

11 . A computer program product, wherein the program product is stored in a non-volatile storage medium, and the program product is executed by at least one processor to implement the steps of the encoding method according to claim 1 .

12 . A terminal, comprising a processor and a memory, wherein the memory stores a program or instructions capable of running on the processor, wherein the program or instructions, when executed by the processor, cause the terminal to perform:

performing space-time block code encoding on data based on a preset codebook, wherein

the preset codebook is a non-full-rate orthogonal codebook over a field of complex numbers in which an Alamouti codebook sub-block in the codebook is replaced with a new space-time block code (NSTBC) codebook sub-block, and columns of the preset codebook are pairwise orthogonal.

13 . The terminal according to claim 12 , wherein a structure of an NSTBC codebook is:

S

=

[

s

1

2

s

3

4

*

s

3

4

-

s

1

2

*

]

,

wherein

S is the NSTBC codebook, and elements in S comprise

s

1

2

,

s

3

4

,

s

3

4

*

,

and

-

s

1

2

*

;

s

1

2

is a first basic element, s 34 is a second basic element,

-

s

1

2

*

is a first generation element, and

s

3

4

*

is a second generation element; and

s

1

2

,

s

3

4

,

s

3

4

*

,

and

-

s

1

2

*

meet:

in a case that N is equal to 2, N is a quantity of transmit antennas,

s

1

2

,

s

3

4

,

s

3

4

*

,

and

-

s

1

2

*

are all complex numbers,

s

3

4

*

is a conjugate complex number of s 34 , and

-

s

1

2

*

is an opposite number of a conjugate complex number of s 12 .

14 . The terminal according to claim 13 , wherein a structure of the preset codebook is:

S

c

=

(

s

1

s

2

*

#

s

2

-

s

1

*

#

#

#

#

)

,

wherein

S c is the preset codebook, dimensions of S c are (p×n), n is a quantity of transmit antennas, p is a symbol period, s 1 and

s

2

*

are transmitted symbols that are on a first transmit antenna and a second transmit antenna and that are obtained by an encoder through encoding in a first symbol period, s 2 and

-

s

1

*

are transmitted symbols that are on the first transmit antenna and the second transmit antenna and that are obtained by the encoder through encoding in a second symbol period, the symbol

s

2

*

is a conjugate of the symbol s 2 , the symbol

-

s

1

*

is a negative conjugate of the symbol s 1 , and # is another symbol over the field of complex numbers in the preset codebook.

15 . The terminal according to claim 14 , wherein columns B a and B b of the preset codebook meet:

B

a

T

·

B

b

=

0

;

and

the preset codebook meets:

S

c

H

·

S

c

=

α

×

I

n

×

n

,

wherein

a and b are integers, 1≤a, b≤n, and a≠b; and

B

a

T

is a transpose of B a ,

S

c

H

is a conjugate transpose of S c , and α is a coefficient factor related to a symbol in the preset codebook.

16 . The terminal according to claim 14 , wherein the another symbol # over the field of complex numbers in the preset codebook meets:

#

{

s

1

,

s

1

*

,

-

s

1

,

-

s

1

*

,

s

2

,

s

2

*

,

-

s

2

,

-

s

2

*

}

.

17 . The terminal according to claim 14 , wherein a rate R of the preset codebook meets:

R

m

+

1

2

m

,

wherein

n=2m or n=2m+1, n is the quantity of transmit antennas, and m is an integer greater than or equal to 1.

18 . The terminal according to claim 17 , wherein in a case of

R

=

3

4

and n=3,

the structure of the preset codebook is:

S

c

,

3

4

3

,

1

=

(

s

1

s

2

*

s

3

*

2

s

2

-

s

1

*

s

3

*

2

s

3

*

2

-

s

3

*

2

(

-

s

1

-

s

1

*

-

s

2

+

s

2

*

)

2

s

3

*

2

s

3

*

2

(

-

s

2

-

s

2

*

-

s

1

+

s

1

*

)

2

)

;

or

the structure of the preset codebook is:

S

c

,

3

4

3

,

2

=

(

s

1

s

2

*

-

s

3

*

2

s

2

-

s

1

*

s

3

*

2

s

3

*

2

-

s

3

*

2

(

-

s

2

-

s

2

*

+

s

1

-

s

1

*

)

2

s

3

*

2

s

3

*

2

(

s

1

+

s

1

*

-

s

2

+

s

2

*

)

2

)

;

or

the structure of the preset codebook is:

S

c

,

3

4

3

,

3

=

(

s

1

s

2

*

s

3

2

s

2

-

s

1

*

s

3

2

s

3

*

2

-

s

3

*

2

(

-

s

1

-

s

1

*

+

s

2

-

s

2

*

)

2

s

3

*

2

s

3

*

2

(

-

s

2

-

s

2

*

+

s

1

-

s

1

*

)

2

)

;

or

the structure of the preset codebook is:

S

c

,

3

4

3

,

4

=

(

s

1

s

2

*

-

s

3

2

s

2

-

s

1

*

s

3

2

s

3

*

2

-

s

3

*

2

(

-

s

2

-

s

2

*

-

s

1

+

s

1

*

)

2

s

3

*

2

s

3

*

2

(

s

1

+

s

1

*

+

s

2

-

s

2

*

)

2

)

.

19 . The terminal according to claim 17 , wherein in a case of

R

=

3

4

and n=4,

the structure of the preset codebook is:

S

c

,

3

4

4

,

1

=

(

s

1

s

2

*

s

3

*

2

-

s

3

*

2

s

2

-

s

1

*

s

3

*

2

s

3

*

2

s

3

*

2

-

s

3

*

2

(

-

s

1

-

s

1

*

-

s

2

+

s

2

*

)

2

(

-

s

2

-

s

2

*

+

s

1

-

s

1

*

)

2

s

3

*

2

s

3

*

2

(

-

s

2

-

s

2

*

-

s

1

+

s

1

*

)

2

(

s

1

+

s

1

*

-

s

2

+

s

2

*

)

2

)

;

or

the structure of the preset codebook is:

S

c

,

3

4

4

,

2

=

(

s

1

s

2

*

s

3

2

-

s

3

2

s

2

-

s

1

*

s

3

2

s

3

2

s

3

*

2

-

s

3

*

2

(

-

s

1

-

s

1

*

+

s

2

-

s

2

*

)

2

(

-

s

2

-

s

2

*

-

s

1

+

s

1

*

)

2

s

3

*

2

s

3

*

2

(

-

s

2

-

s

2

*

+

s

1

-

s

1

*

)

2

(

s

1

+

s

1

*

+

s

2

-

s

2

*

)

2

)

.

20 . A network-side device, comprising a processor and a memory, wherein the memory stores a program or instructions capable of running on the processor, wherein the program or instructions, when executed by the processor, cause the network-side device to perform:

performing space-time block code encoding on data based on a preset codebook, wherein

the preset codebook is a non-full-rate orthogonal codebook over a field of complex numbers in which an Alamouti codebook sub-block in the codebook is replaced with a new space-time block code (NSTBC) codebook sub-block, and columns of the preset codebook are pairwise orthogonal.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 19, 2024
From: HUANG, WEI
To: VIVO MOBILE COMMUNICATION CO., LTD.
Reel/Frame 068029/0036 →
Priority Claims (1)
CN 202210067513.9 · Jan 20, 2022 · national
Continuity (2)
Continuation PCTCN2023072301 · Jan 16, 2023
Related Publication 20240388382A1 · Nov 21, 2024
References Cited (17)
US 20060039495A1 · Chae et al. · 2006 [cited by applicant]
US 20160308595A1 · Yamada · 2016 [cited by examiner]
US 20210242919A1 · Park · 2021 [cited by examiner]
US 20210250868A1 · Ma et al. · 2021 [cited by applicant]
CN 101141232A · 2008 [cited by applicant]
CN 101789814A · 2010 [cited by applicant]
CN 102045134A · 2011 [cited by applicant]
CN 108234082A · 2018 [cited by applicant]
JP 2006039495A1 · 2006 [cited by applicant]
JP 2012510187A · 2012 [cited by applicant]
WO WO2020166086A1 · 2020 [cited by applicant]
WO WO2021007810A1 · 2021 [cited by applicant]
Extended Search Report on EP Patent Appl. No. 23742838.8 dtd Apr. 14, 2025. [cited by applicant]
Huawei: “Transmit diversity for distributed, common and broadcast channels”, 3GPP Draft; R1-051406, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis … [cited by applicant]
International Search Report on PCT Patent Appl. No. PCT/CN2023/072301 dtd Mar. 24, 2023. [cited by applicant]
JP Office Action on JP 2024-543173 dtd Jul. 29, 2025. [cited by applicant]
On converting OSTC scheme from Non-full rate to Full-rate with better error performance. [cited by applicant]