US 10,855,817 B2Granted

Method and apparatus for network encoding based on low-complexity algorithms for network coding using matrix decomposition

AssigneeEwha University-Industry Collaboration Foundation

InventorsHyunggon Park, Jungmin Kwon

Life of this patent

Estimating the term…

Loading patent…

Abstract

Provided are a network encoding method and apparatus, and a network decoding method and apparatus that performs network encoding and decoding through a transposed matrix of a unitary matrix decomposed from an encoding coefficient matrix by an eigen-decomposition. The network encoding method may include generating a random symmetric matrix indicating a binary square matrix, extracting an encoding coefficient matrix by decomposing the generated random symmetric matrix, generating encoding data by encoding source data using the extracted encoding coefficient matrix, forming a data packet including the generated encoding data and the encoding coefficient matrix, and converting the formed data packet from a real number field to a Galois field.

Claims9

Dependent claims

A network encoding method, comprising:

generating a random symmetric matrix indicating a binary square matrix;
extracting an encoding coefficient matrix by eigen-decomposing the generated random symmetric matrix into a unitary matrix, a diagonal matrix and a transposed matrix of the unitary matrix, the encoding coefficient matrix corresponding to the unitary matrix;
generating encoding data by encoding source data using the extracted encoding coefficient matrix, the encoding data generated by computing a matrix product of the source data with the encoding coefficient matrix as follows:
(
y
1
⁡
(
1
)
…
y
1
⁡
(
L
)
⋮
⋱
⋮
y
N
⁡
(
1
)
…
y
N
⁡
(
L
)
)
=
(
u
1
⁡
(
1
)
…
u
N
⁡
(
1
)
⋮
⋱
⋮
u
1
⁡
(
N
)
…
u
N
⁡
(
N
)
)
⁢
(
x
1
⁡
(
1
)
…
x
1
⁡
(
L
)
⋮
⋱
⋮
x
N
⁡
(
1
)
…
x
N
⁡
(
L
)
)
,
where yj is a j-th component of the encoding data, L is a length of the source data, N is a number of the source data, uj is a j-th component of the encoding coefficient matrix and xj is a j-th component of the source data;
forming a data packet including the generated encoding data and the encoding coefficient matrix;
and
converting the formed data packet from a real number field to a Galois field,
wherein a row of the encoding coefficient matrix is included as a header of the data packet and the encoding data is included as a payload of the data packet.

101 more elements

Dependencies are inferred from the claim text.

Facts

Application: 15/957,689Filed 19 Apr 2018
Priority: KR 10-2017-005939612 May 2017
Published: US 2018/0332147 A115 Nov 2018
Granted: 1 Dec 2020
Term ends: Not estimatedThe source records don’t support an estimate.

Classification7 codes

H04L 69/324
Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions: in the data link layer [OSI layer 2], e.g. HDLC
H04L 1/00
Arrangements for detecting or preventing errors in the information received
H04L 1/0076
By using forward error control: distributed coding, e.g. network coding, involving channel coding
H04W 52/00
Power management