// Lemma 4.4 private PermutationNetwork CreateBlockNeighborSorter(int blockBitLength, int borderBitLength, int intraBlockSortQuality) { PermutationNetwork pn = new PermutationNetwork(1 << K); int blockSize = 1 << blockBitLength; int blockCount = 1 << (K - blockBitLength); int borderSize = 1 << borderBitLength; PermutationNetwork borderSorter = CreateBorderSorter(borderBitLength, intraBlockSortQuality); for (int i = 0; i < blockCount - 1; i++) { pn.AppendNetwork(borderSorter.Clone() as PermutationNetwork, i * blockSize + (blockSize - borderSize)); } return(pn); }
// the subsequent rounds private LPSortingNetwork(int k, int l, LPSortingCalculationCache calculationCache) : base(1 << k) { Console.WriteLine(k + " " + l); CalculationCache = calculationCache; K = k; if (l <= (int)Math.Floor(gamma * (l + 2)) + c + 5) { // if we would get worse by doing the procedure, then finish if (k <= l) { AppendNetwork(SortingNetworkFactory.CreateBitonicSort(1 << K, false), 0); } else { // Apply Lemma 4.3 AppendNetwork(CreateFinalSorter(l), 0); } } else { // Apply Lemma 4.2 PermutationNetwork tournament = CreateTournament(l + 2); // Apply Lemma 4.1 PermutationNetwork tournamentCorrecter = CreateBlockCorrectionNetwork(l + 2, (int)Math.Floor(gamma * (l + 2)) + c); for (int i = 0; i < 1 << (k - (l + 2)); i++) { AppendNetwork(tournament.Clone() as PermutationNetwork, i * (1 << (l + 2))); AppendNetwork(tournamentCorrecter.Clone() as PermutationNetwork, i * (1 << (l + 2))); } // Apply Lemma 4.4 PermutationNetwork neighborCorrecter = CreateBlockNeighborSorter(l + 2, l + 1, (int)Math.Floor(gamma * (l + 2)) + c + 2); AppendNetwork(neighborCorrecter, 0); AppendNetwork(new LPSortingNetwork(k, (int)Math.Floor(gamma * (l + 2)) + c + 5, CalculationCache), 0); } }