<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>04215327</id>
  <dt>j</dt>
  <an>04215327</an>
  <augroup>
    <au>Yang, D.</au>
  </augroup>
  <ti>Fast discrete Radon transform and 2-D discrete Fourier transform.</ti>
  <so>Electron. Lett. 26, No.8, 550-551 (1990).</so>
  <py>1990</py>
  <pu></pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>fast Fourier transform</ut>
    <ut>split-radix decomposition</ut>
    <ut>signal processing</ut>
    <ut>discrete Radon transform</ut>
    <ut>discrete Fourier transforms</ut>
    <ut>radix-p algorithm</ut>
    <ut>parallel implementation</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1049/el:19900358</li>
  </ligroup>
  <abgroup>
    <ab>The discrete Radon transform (DRT) is not only used to realize fast computation of two-dimensional discrete Fourier transforms (2-D DFT), but to convert 2-D DFTs into 1-D DFTs. This paper gives a radix-p algorithm for a fast DRT of a $p\sp n\times p\sp n$ array, implementing a $p\sp n\times p\sp n$-point 2-D DFT. The proposed algorithm permits minimal multiplications for the above transformation and can be organized for parallel implementation.</ab>
    <rv>Y.Kobayashi (Tottori)</rv>
  </abgroup>
</item>