Fast Finite Field Hartley Transforms Based on Hadamard Decomposition

@article{Oliveira2015FastFF,
  title={Fast Finite Field Hartley Transforms Based on Hadamard Decomposition},
  author={H{\'e}lio Magalh{\~a}es de Oliveira and R. G. F. T{\'a}vora and Renato J. Cintra and Ricardo M. Campello de Souza},
  journal={CoRR},
  year={2015},
  volume={abs/1502.00277}
}
A new transform over finite fields, the finite field Hartley transform (FFHT), was recently introduced and a number of promising applications on the design of efficient multiple access systems and multilevel spread spectrum sequences were proposed. The FFHT exhibits interesting symmetries, which are exploited to derive tailored fast transform algorithms. The proposed fast algorithms are based on successive decompositions of the FFHT by means of Hadamard-Walsh transforms (HWT). The introduced… CONTINUE READING

Tables and Topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

Similar Papers

Loading similar papers…