IP Library › Granted Patent US 11,121,823
Granted Patent B2
US 11,121,823 · App. 16/692,401 · Granted Sep 14, 2021

Method and apparatus for hybrid automatic repeat request in non-terrestrial network

Inventor: Duk Hyun You (Daejeon, KR)
Assignee: Electronics and Telecommunications Research Institute
H04L1/1812H03M13/05H03M13/2778H03M13/6312H04L1/1822H04L1/1845H04L1/1861
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 11,121,823
App. No.
16/692,401
Granted
Sep 14, 2021
Kind
B2
Abstract

Methods and apparatuses for HARQ in a non-terrestrial network are disclosed. An operation method of a first node may comprise receiving a transport block (TB) from a second node; classifying total soft bits for the TB into information values and sign values; configuring the information values of the total soft bits into one or more subsets; performing a compression operation on each of the one or more subsets; and performing a compression operation on the sign values. Therefore, performance of the communication system can be improved.

Claims (66)

1. An operation method of a first node in a communication network, the operation method comprising:

receiving, by a processor included in the first node, a transport block (TB) from a second node;

classifying, by the processor, total soft bits for the TB into information values and sign values;

configuring, by the processor, the information values of the total soft bits into one or more subsets;

performing, by the processor, a compression operation on each of the one or more subsets; and

performing, by the processor, a compression operation on the sign values,

wherein the each of the one or more subsets includes a part of the information values.

2. The operation method according to claim 1 , wherein the total soft bits are original soft bits generated based on the TB when the TB is an initial transmitted TB, and the total soft bits are a combination of the original soft bits generated based on the TB and previous soft bits stored in a memory of the first node when the TB is a re-transmitted TB.

3. The operation method according to claim 1 , wherein the performing of the compression operation on each of the one or more subsets further comprises:

mapping each of the one or more subsets to a subblock consisting of a plurality of resource elements (REs);

performing a transform coding operation on each of the subblocks to which the one or more subsets are mapped;

performing a thresholding operation on a result of the transform coding operation;

generating an intra sequence based on a result of the thresholding operation; and

generating compressed information values by performing an encoding operation on each of intra sequences corresponding to the one or more subsets.

4. The operation method according to claim 3 , wherein the intra sequence is generated based on a zigzag read scheme or a diagonal read scheme.

5. The operation method according to claim 3 , wherein the encoding operation is performed based on a run-length encoding algorithm.

6. The operation method according to claim 1 , wherein the compression operation on the sign values is performed based on a Lempel-Ziv-Welch (LZW) algorithm.

7. The operation method according to claim 1 , wherein the performing of the compression operation on each of the one or more subsets further comprises:

mapping each of the one or more subsets to a subblock consisting of a plurality of REs;

performing a transform coding operation on each of the subblocks to which the one or more subsets are mapped;

performing a thresholding operation on a result of the transform coding operation;

generating an intra sequence based on a result of the thresholding operation;

generating one inter sequence consisting of intra sequences corresponding to the one or more subsets; and

generating compressed information values by performing an encoding operation on the one inter sequence.

8. The operation method according to claim 7 , wherein the one inter sequence is generated by applying matrix interleaving to the intra sequences.

9. An operation method of a first node in a communication network, the operation method comprising:

receiving, by a processor included in the first node, a first transport block (TB) and a second TB from a second node;

configuring, by the processor, first information values included in first soft bits for the first TB into one or more first subsets;

generating, by the processor first intra sequences by performing a transform coding operation on each of the one or more first subsets;

configuring, by the processor, second information values included in second soft bits for the second TB into one or more second subsets;

generating, by the processor, second intra sequences by performing the transform coding operation on each of the one or more second subsets;

generating, by the processor, one hybrid automatic repeat request (HARQ) sequence including a first inter sequence consisting of the first intra sequences and a second inter sequence consisting of the second intra sequences; and

generating, by the processor, compressed information values by performing an encoding operation on the one HARQ sequence,

wherein the each of the one or more first subsets includes a part of the first information values and the each of the one or more second subsets includes a part of the second information. values.

10. The operation method according to claim 9 , wherein the encoding operation is performed based on a run-length encoding algorithm.

11. The operation method according to claim 9 , wherein the generating of the first intra sequences further comprises:

mapping each of the one or more first subsets to a subblock consisting of a plurality of resource elements (REs);

performing the transform coding operation on each of the subblocks to which the one or more first subsets are mapped;

performing a thresholding operation on a result of the transform coding operation; and

generating the first intra sequences based on a result of the thresholding operation.

12. The operation method according to claim 9 , further comprising performing a compression operation on first sign values included in the first soft bits and second sign values included in the second soft bits, wherein the compression operation on the first sign values and the second sign values is performed based on a Lempel-Ziv-Welch (LZW) algorithm.

13. A first node in a communication network, the first node comprising a processor and a memory storing at least one instruction executable by the processor, wherein when executed by the processor, the at least one instruction configures the processor to:

receive a transport block (TB) from a second node;

classify total soft bits for the TB into information values and sign values;

configure the information values of the total soft bits into one or more subsets;

perform a compression operation on each of the one or more subsets; and

perform a compression operation on the sign values,

wherein the each of the one or more subsets includes a part of the information values.

14. The first node according to claim 13 , wherein the total soft bits are original soft bits generated based on the TB when the TB is an initial transmitted TB, and the total soft bits are a combination of the original soft bits generated based on the TB and previous soft bits stored in a memory of the first node when the TB is a re-transmitted TB.

15. The first node according to claim 13 , wherein in the performing of the compression operation on each of the one or more subsets, the at least one instruction further configures the processor to:

map each of the one or more subsets to a subblock consisting of a plurality of resource elements (REs);

perform a transform coding operation on each of subblocks to which the one or more subsets are mapped;

perform a thresholding operation on a result of the transform coding operation;

generate an intra sequence based on a result of the thresholding operation; and

generate compressed information values by performing an encoding operation on each of intra sequences corresponding to the one or more subsets.

16. The first node according to claim 15 , wherein the intra sequence is generated based on a zigzag read scheme or a diagonal read scheme.

17. The first node according to claim 15 , wherein the encoding operation is performed based on a run-length encoding algorithm.

18. The first node according to claim 13 , wherein the compression operation on the sign values is performed based on a Lempel-Ziv-Welch (LZW) algorithm.

19. The first node according to claim 13 , wherein in the performing of the compression operation on each of the one or more subsets, the at least one instruction further configures the processor to:

map each of the one or more subsets to a subblock consisting of a plurality of REs;

perform a transform coding operation on each of subblocks to which the one or more subsets are mapped;

perform a thresholding operation on a result of the transform coding operation;

generate an intra sequence based on a result of the thresholding operation;

generate one inter sequence consisting of intra sequences corresponding to the one or more subsets; and

generate compressed information values by performing an encoding operation on the one inter sequence.

20. The first node according to claim 19 , wherein the one inter sequence is generated by applying matrix interleaving to the intra sequences.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 22, 2019
From: YOU, DUK HYUN
To: ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE
Reel/Frame 051089/0232 →
Priority Claims (2)
KR 10-2018-0158256 · Dec 10, 2018 · national
KR 10-2019-0145456 · Nov 13, 2019 · national
Continuity (1)
Related Publication 20200186293A1 · Jun 11, 2020