• DocumentCode
    533403
  • Title

    Galois field hardware architectures for network coding

  • Author

    Nagarajan, Aishwarya ; Schulte, Michael J. ; Ramanathan, Parameswaran

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Wisconsin-Madison, Madison, WI, USA
  • fYear
    2010
  • fDate
    25-26 Oct. 2010
  • Firstpage
    1
  • Lastpage
    9
  • Abstract
    This paper presents and analyzes novel hardware designs for high-speed network coding. Our designs provide efficient methods to perform Galois field (GF) dot products and matrix inversions, which are important operations in network coding. Encoder designs that perform GF dot products and vary with respect to the number of messages combined, Galois field size, and input message size are implemented and analyzed to evaluate design tradeoffs. We investigate single cycle, multicycle, and pipelined designs with and without feedback mechanisms for encoding multiple sets of messages. The decoder is implemented as a multi-cycle design and performs GF matrix inversion followed by multiple GF dot products. Our designs are synthesized with a 65nm standard cell library and compared in terms of area, critical path delay, and throughput. Designs combining four messages achieve throughputs of more than 30 Gbps. Our designs can scale to achieve much higher throughput through the use of additional hardware.
  • Keywords
    Galois fields; matrix algebra; network coding; GF matrix inversion; Galois field dot products; Galois field hardware architectures; high speed network coding; matrix inversions; Computer architecture; Decoding; Encoding; Galois fields; Hardware; Network coding; Polynomials; Content Distribution Networks; Galois field arithmetic; Gauss-Jordan elimination; Matrix inversion; Network coding; Router designs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Architectures for Networking and Communications Systems (ANCS), 2010 ACM/IEEE Symposium on
  • Conference_Location
    La Jolla, CA
  • Print_ISBN
    978-1-4244-9127-8
  • Electronic_ISBN
    978-1-4503-0379-8
  • Type

    conf

  • Filename
    5623819