High speed convolving kernels for CT having triangular spectra and/or binary values

Surender K. Kenue, James F. Greenleaf

Research output: Contribution to journalArticle

4 Scopus citations


An algorithm is described to transform sampled CT convolution kernels into “binary” kernels having values which are even powers of 2. Multiplication in the convolution operation can then be replaced by a much faster shift operation. A technique for further reducing the number of shift and addition operations using new computationally fast CT kernels is also given. The binary kernels are computationally faster by about 80−90% on a conventional computer. Reconstructed CT images using both conventional kernels and their transformed binary equivalents are compared.

Original languageEnglish (US)
Pages (from-to)2693-2696
Number of pages4
JournalIEEE Transactions on Nuclear Science
Issue number2
StatePublished - Apr 1979


ASJC Scopus subject areas

  • Nuclear and High Energy Physics
  • Nuclear Energy and Engineering
  • Electrical and Electronic Engineering

Cite this