Discrete Gould transform - Fast realisations and data hiding

The computational complexity of the discrete Gould transform (DGT) is studied and a fast realisation approach is proposed. The reversible difference expansion data hiding method is applied to the DGT coefficients and experimental results are given.