### Abstract

An algorithm for evaluation of the crystallographic FFT for 67 crystallographic space groups is presented. The symmetry is reduced in such a way that it is enough to calculate P1 FFT in the asymmetric unit only and then, in a computationally simpler step, recover the final result. The algorithm yields the maximal symmetry reduction for every space group considered. For the central step in the calculation consisting of general P1 FFTs, any generic fast Fourier subroutine can be used. The approach developed in this paper is an extension of the scheme derived for p3-symmetric data [Rowicka, Kudlicki & Otwinowski (2002). Acta Cryst. A58, 574-579]. Algorithms described here will also be used in our forthcoming papers [Rowicka, Kudlicki & Otwinowski (2003). Acta Cryst A59, 183-192; Rowicka, Kudlicki & Otwinowski (2003), in preparation], where more complicated groups will be considered.

Original language | English (US) |
---|---|

Pages (from-to) | 172-182 |

Number of pages | 11 |

Journal | Acta Crystallographica Section A: Foundations of Crystallography |

Volume | 59 |

Issue number | 2 |

DOIs | |

State | Published - Mar 1 2003 |

### ASJC Scopus subject areas

- Structural Biology

## Fingerprint Dive into the research topics of 'The crystallographic fast Fourier transform. II. One-step symmetry reduction'. Together they form a unique fingerprint.

## Cite this

*Acta Crystallographica Section A: Foundations of Crystallography*,

*59*(2), 172-182. https://doi.org/10.1107/S0108767303002320