Rank metric decoder architectures for noncoherent error control in random network coding

IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation

Volumn , Issue , 2009, Pages 127-132

  Chen, Ning ^a   Gadouleau, Maximilien ^a   Yan, Zhiyuan ^a  

^a Lehigh University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECODER ARCHITECTURE; ERROR CONTROL; HARDWARE IMPLEMENTATIONS; HIGH THROUGHPUT; IN-NETWORK; NON-COHERENT; RANDOM NETWORK CODING; RANK METRIC CODES;

CODING ERRORS; HARDWARE; INFORMATION DISSEMINATION; RANDOM ERRORS; SIGNAL PROCESSING;

DECODING;

EID: 74549181017     PISSN: 15206130     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SIPS.2009.5336237     Document Type: Conference Paper

References (14)

1. R. Kötter and F. R. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3579-3591, Aug. 2008.
2. D. Silva, F. R. Kschischang, and R. Kötter, "A rank-metric approach to error control in random network coding," IEEE Trans. Inf. Theory, vol. 54, no. 9, pp. 3951-3967, Sep. 2008.
3. E. M. Gabidulin, "Theory of codes with maximum rank distance," Probl. Inf. Transm., vol. 21, no. 1, pp. 1-12, Jan.-Mar. 1985.
4. M. Gadouleau and Z. Yan, "Complexity of decoding Gabidulin codes," in Proc. 42nd Ann. Conf. Information Sciences and Systems (CISS'08), Princeton, NJ, Mar. 19-21, 2008, pp. 1081-1085.
5. G. Richter and S. Plass, "Error and erasure decoding of rank-codes with a modified Berlekamp-Massey algorithm," in Proc. 5th Int. ITG Conf Source and Channel Coding (SCC'04), Erlangen, Germany, Jan. 2004, pp. 249-256.
6. E. R. Berlekamp, Algebraic Coding Theory. New York, NY: McGraw-Hill, 1968.
7. V. Skachek and R. M. Roth, "Probabilistic algorithm for finding roots of linearized polynomials," Des. Codes Cryptogr., vol. 46, no. 1, pp. 17-23, Jan. 2008.
8. E. D. Mastrovito, "VLSI architectures for computations in Galois fields," Ph.D. dissertation, Linköping Univ., Linköping, Sweden, 1991.
9. m)," IEEE Trans. Comput., vol. 51, no. 5, pp. 511-520, May 2002.
10. N. Chen and Z. Yan, "Cyclotomic FFTs with reduced additive complexities based on a novel common subexpressian elimination algorithm," IEEE Trans. Signal Process., vol. 57, no. 3, pp. 1010-1020, Mar. 2009.
11. D. V. Sarwate and N. R. Shanbhag, "High-speed architectures for Reed-Solomon decoders," IEEE Trans. VLSI Syst., vol. 9, no. 5, pp. 641-655, Oct. 200l.
12. A. Bogdanov, M. C. Mertens, C. Paar, J. Pelzl, and A. Rupp, "A parallel hardware architecture for fast Gaussian elimination over GF(2)," in Proc. 14th Ann. IEEE Symp. Field-Programmable Custom Computing Machines (FCCM'06), Napa Valley, CA, Apr. 24-26, 2006, pp. 237-248.
13. J. E. Stine, J. Grad, I. Castellanos, J. Blank, V. Dave, M. Prakash, N. Iliev, and N. Jachimiec, "A framework for high-level synthesis of system-an-chip designs," in Proc. IEEE Int. Conf. Microelectronic Systems Education (MSE'05), Anaheim, CA, Jun. 12-13, 2005, pp. 11-12.
14. H. Lee, "High-speed VLSI architecture for parallel Reed-Solomon decoder," IEEE Trans. VLSI Syst., vol. 11, no. 2, pp. 288-294, Apr. 2003.