A construction from the exact Fourier paper

Reorder once.
Transform each sector.

Each axis splits into an ordered pair and a singleton. Choosing one block on each axis gives a sector. Packing places its coordinates together, so the simultaneous pair layer becomes four independent calls.

PAIR LAYER012345678
The ordered pair is (2, 0), with singleton (1), on both axes. Nonconsecutive coordinates can therefore belong to the same sector.

Original array: coordinates are indexed by I = 3a + b.

The selected sector

Two pairs

For each axis, p counts coordinates in earlier blocks, q is the chosen block’s width, and t is its local position. The first axis has suffix width 3.

Follow all nine coordinate addresses
Original I(a, b)Packed S + oSector
0(0, 0)31
1(0, 1)52
2(0, 2)21
3(1, 0)73
4(1, 1)84
5(1, 2)63
6(2, 0)11
7(2, 1)42
8(2, 2)01

Indices identify the entries. Packing permutes their positions; the values are unchanged.

Follow the argument

This illustrates the packing step in Lemma 4.1 and the pair-slot decomposition in Proposition 4.2. The full Fourier algorithm also needs the other stages in the manuscript’s roadmap.

This nine-coordinate example explains a construction. It does not establish the paper’s complete algorithm or its running-time claim.