TY - JOUR

T1 - Initialization Algorithms for Convolutional Network Coding

AU - Lvov, Maxim

AU - Permuter, Haim H.

N1 - Funding Information:
Manuscript received January 9, 2017; revised March 8, 2018; accepted March 26, 2018. Date of publication April 19, 2018; date of current version June 20, 2018. M. Lvov and H. H. Permuter were supported in part by the European Research Council, European Unions Seventh Framework Program (FP7/2007-2013)/ERC under Grant 337752, in part by ISF, and in part by DIP. This paper was presented in part at the 2014 International Symposium on Network Coding, Aalborg, Denmark.
Publisher Copyright:
© 1963-2012 IEEE.

PY - 2018/7/1

Y1 - 2018/7/1

N2 - We present algorithms for initializing a convolutional network coding (CNC) scheme in networks that may contain cycles. An initialization process for finding global encoding kernels (GEK) is needed if the network is unknown or if local encoding kernels are chosen randomly. During the initialization process every source node transmits basis vectors and every sink node gets the impulse response of the network. The impulse response is then used to find the GEK, which are needed for a decoding algorithm and to find the set of all achievable rates. We present two initialization algorithms that find the GEK and one algorithm that finds achievable rates from the GEK. In the first initialization algorithm it is assumed that we can perform a reset operation on the network at some fixed times, while the second algorithm does not operate under this assumption. Unlike acyclic networks, for which it is sufficient to transmit basis vectors one after another, the initialization of cyclic networks is more involved, as test symbols from different times interfere with each other and the impulse response is of infinite duration. Our algorithms use only a finite number of the initial values of the impulse response to find the full GEK. This is possible because a CNC scheme can be described by a state space representation and, using the Cayley-Hamilton theorem, it is possible to find its full impulse response from its initial values.

AB - We present algorithms for initializing a convolutional network coding (CNC) scheme in networks that may contain cycles. An initialization process for finding global encoding kernels (GEK) is needed if the network is unknown or if local encoding kernels are chosen randomly. During the initialization process every source node transmits basis vectors and every sink node gets the impulse response of the network. The impulse response is then used to find the GEK, which are needed for a decoding algorithm and to find the set of all achievable rates. We present two initialization algorithms that find the GEK and one algorithm that finds achievable rates from the GEK. In the first initialization algorithm it is assumed that we can perform a reset operation on the network at some fixed times, while the second algorithm does not operate under this assumption. Unlike acyclic networks, for which it is sufficient to transmit basis vectors one after another, the initialization of cyclic networks is more involved, as test symbols from different times interfere with each other and the impulse response is of infinite duration. Our algorithms use only a finite number of the initial values of the impulse response to find the full GEK. This is possible because a CNC scheme can be described by a state space representation and, using the Cayley-Hamilton theorem, it is possible to find its full impulse response from its initial values.

KW - Cayley-Hamilton theorem

KW - convolutional network coding

KW - cyclic networks

KW - linear network coding

KW - system identification

UR - http://www.scopus.com/inward/record.url?scp=85045771473&partnerID=8YFLogxK

U2 - 10.1109/TIT.2018.2828432

DO - 10.1109/TIT.2018.2828432

M3 - Article

AN - SCOPUS:85045771473

SN - 0018-9448

VL - 64

SP - 5277

EP - 5295

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 7

ER -