Efficient bounded distance decoders for Barnes-Wall lattices | IEEE Conference Publication | IEEE Xplore

Efficient bounded distance decoders for Barnes-Wall lattices


Abstract:

We describe a new family of parallelizable bounded distance decoding algorithms for the Barnes-Wall lattices, and analyze their decoding complexity. The algorithms are pa...Show More

Abstract:

We describe a new family of parallelizable bounded distance decoding algorithms for the Barnes-Wall lattices, and analyze their decoding complexity. The algorithms are parameterized by the number p = 4k les N2 of available processors, work for Barnes-Wall lattices in arbitrary dimension N = 2n, correct any error up to squared unique decoding radius d2 min / A, and run in worst- case time O (Nlog2 N/radic(p)). Depending on the value of the parameter p, this yields efficient decoding algorithms ranging from a fast sequential algorithm with quasi- linear decoding complexity O(N log2 N), to a fully parallel decoding circuit with polylogarithmic depth O(log2 N) and polynomially many arithmetic gates.
Date of Conference: 06-11 July 2008
Date Added to IEEE Xplore: 08 August 2008
ISBN Information:

ISSN Information:

Conference Location: Toronto, ON, Canada

Contact IEEE to Subscribe

References

References is not available for this document.