Abstract
Random linear network coding is an efficient technique for disseminating information in networks, but it is highly susceptible to errors. Kötter-Kschischang (KK) codes and Mahdavifar-Vardy (MV) codes are two important families of subspace codes that provide error control in noncoherent random linear network coding. List decoding has been used to decode MV codes beyond half distance. Existing hardware implementations of the rank metric decoder for KK codes suffer from limited throughput, long latency and high area complexity. The interpolation-based list decoding algorithm for MV codes still has high computational complexity, and its feasibility for hardware implementations has not been investigated. In this paper we propose efficient decoder architectures for both KK and MV codes and present their hardware implementations. Two serial architectures are proposed for KK and MV codes, respectively. An unfolded decoder architecture, which offers high throughput, is also proposed for KK codes. The synthesis results show that the proposed architectures for KK codes are much more efficient than rank metric decoder architectures, and demonstrate that the proposed decoder architecture for MV codes is affordable.
















Similar content being viewed by others
References
Ahlswede, R., Cai, N., Li, S., Yeung, R. (2000). Network information flow. IEEE Transactions Information Theory, 46, 1204–1216.
Chou, P.A., Wu, Y., Jain, K. (2003). Practical network coding. In Allerton conference on commission, control, and computing. Monticello.
Ho, T., Médard, M., Kötter, R., Karger, D., Effros, M., Shi, J., Leong, B. (2006). A random linear network coding approach to multicast. IEEE Transactions Information Theory, 52(10), 4413–4430.
Ho, T., Kötter, R., Médard, M., Karger, D.R., Effros, M. (2003). The benefits of coding over routing in a randomized setting. In Proceedings IEEE international symposium on information theory. Yokohama.
Chen, N., Yan, Z., Gadouleau, M., Wang, Y., Suter, B.W. (2012). Rank metric decoder architectures for random linear network coding with error control. IEEE Transactions VLSI System, 20(2), 296–309.
Kötter, R., & Kschischang, F.R. (2008). Coding for errors and erasures in random network coding. IEEE Transactions Information Theory, 54(8), 3579–3591.
Cai, N., & Yeung, R.W. (2002). Network coding and error correction. In Proceedings IEEE information theory workshop. Bangalore.
Silva, D., Kschischang, F.R., Kötter, R. (2008). A rank-metric approach to error control in random network coding. IEEE Transactions Information Theory, 54(9), 3951– 3967.
Mahdavifar, H., & Vardy, A. (2010). Algebraic list-decoding on the operator channel. In Proceedings IEEE internationaql symposium information theory. Austin.
Mahdavifar, H., & Vardy, A. (2010). Algebraic list-decoding of subspace codes. arXiv:1202.0338.
Mahdavifar, H., & Vardy, A. (2011). Algebraic list-decoding of subspace codes with multiplicities. In Proceedings 2011 Allerton conference communications, control and computing (pp. 1430–1437). Illinois.
Guruswami, V., & Sudan, M. (1999). Improved decoding of reed-solomon codes and algebraic geometry codes. IEEE Transactions Information Theory, 45(6), 1757–1767.
Xie, H., Lin, J., Yan, Z., Suter, B.W. (2013). Linearized polynomial interpolation and its applications. IEEE Transactions Signal Process, 61(1), 206–217.
Sudan, M. (1997). Decoding of Reed-Solomon codes beyond the error-correction bound. Journal of Complexity, 13, 180–193.
Stine, J.E., Castellanos, I., Wood, M., Henson, J., Love, F., Davis, W.R., Franzon, P.D., Bucher, M., Basavarajaiah, S., Oh, J., Jenkal, R. (2007). FreePDK: an open-source variation-aware design kit. In Proceedings IEEE international conference microelectronic system education (MSE07). San Diego.
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix A: Proof of the Lemma 3
Proof
Since f i (u i ) = 0 has two different roots, then the equation concerning u i is \(d^{(i)}_{0,i}+d^{(i)}_{1,i}u_i+d^{(i)}_{2,0}u_{i}^{2} = 0\) according to Eq. (13). Meanwhile, \(d^{(i)}_{0,j}= 0\) and \(d^{(i)}_{1,j}= 0\) for j < i. \(d^{(i)}_{1,i}\neq 0\), according to Lemma 2. Based on Eq. (10) and Eq. (11), we have
where
Let Y = u i + 1, 0 x for Eq. (15). We have
The equation about u i + 1, 0 is
Apply the same arguments and we have
Both f i + 1, 0(u i + 1, 0) = 0 and f i + 1, 1(u i + 1, 1) = 0 are linear equations and have only one root. □
Appendix B: Proof of the Lemma 4
Proof
Based on Eq. (15), it can be computed inductively that
and
As a result, we have
□
Rights and permissions
About this article
Cite this article
Lin, J., Xie, H. & Yan, Z. Efficient Error Control Decoder Architectures for Noncoherent Random Linear Network Coding. J Sign Process Syst 76, 195–209 (2014). https://doi.org/10.1007/s11265-013-0852-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11265-013-0852-1