Beyond 0-1: The 1-N Principle and Fast Validation of N-Sorter Sorting Networks
The well-known 0–1 principle for traditional data-oblivious sorting networks states that a network with L inputs can be fully validated with an input vector set consisting of all <inline-formula> <tex-math notation="LaTeX">$2^{L}$ </tex-math></inline-formula...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2023-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10177149/ |