Depth-13 Sorting Networks for 28 Channels

📅 2025-11-06
📈 Citations: 0
Influential: 0
📄 PDF

career value

189K/year
🤖 AI Summary
This work addresses the problem of improving the depth upper bounds for 27- and 28-channel sorting networks. We propose a constructive method integrating reflection-symmetric architecture design, reuse of high-quality prefixes (16-channel and 12-channel), and greedy comparator extension, followed by formal verification and completion of remaining layers using a SAT solver. Our key contribution is the first reduction of the depth upper bound for 28-channel sorting networks from 14 to 13, concurrently improving the bound for 27-channel networks. The resulting depth-13 28-channel network is currently optimal, achieving significant gains in both construction efficiency and structural quality. This advance tightens the theoretical depth bounds for small-scale sorting networks and establishes a novel paradigm for combinatorial construction leveraging symmetry-aware design and formal methods.

Technology Category

Application Category

📝 Abstract
We establish new depth upper bounds for sorting networks on 27 and 28 channels, improving the previous best bound of 14 to 13. Our 28-channel network is constructed with reflectional symmetry by combining high-quality prefixes of 16- and 12-channel networks, extending them greedily one comparator at a time, and using a SAT solver to complete the remaining layers.
Problem

Research questions and friction points this paper is trying to address.

Establishing new depth upper bounds for sorting networks
Improving sorting network depth from 14 to 13 layers
Constructing 28-channel networks using SAT solver optimization
Innovation

Methods, ideas, or system contributions that make the work stand out.

Depth-13 sorting networks for 28 channels
Combining prefixes from smaller networks symmetrically
Using SAT solver to complete remaining layers
🔎 Similar Papers
No similar papers found.