Quantum, Qnn, Fpga.
UF decoder that exploits parallel computing resources for further speedup. Using an FPGA-based implementation, we empirically show that this distributed UF decoder has a sublinear average time complexity with regard to d, given O(d 3 ) parallel computing resources. The decoding time per measurement