Mobile QR Code QR CODE

The Journal of Semiconductor Technology and Science (JSTS) is an international, peer-reviewed, and open-access journal that is published bimonthly.
- Scope: semiconductor processes, devices, circuits, and MEMS.
- Editor-in-Chief: Prof. Woo Young Choi (ECE, Seoul National University)
- Indexed within Science Citation Index Expanded (SCIE), SCOPUS, Korea Citation Index (KCI), and other databases.

Journal Search

  1. Home
  2. Archive
  3. 2026-04 (Vol.26 No.02)
  4. 10.5573/JSTS.2026.26.2.174
XML PDF INFO REF

REFERENCES

1 
Wen L. , Fen L. , DangDang D. , Huan X. , XiangLi P. , 2020, Adaptive sorting method of big data with scattered defects based on cloud computing, Proc. of 2020 13th International Conference on Intelligent Computation Technology and Automation (ICICTA), pp. 370-376DOI
2 
Li P. , Lilja D. J. , Qian W. , Bazargan K. , Riedel M. D. , 2014, Computation on stochastic bit streams digital image processing case studies, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 22, No. 3, pp. 449-462DOI
3 
Graefe G. , 2006, Implementing sorting in database systems, ACM Computing Surveys, Vol. 38, No. 3, pp. 10DOI
4 
Chang R. C. , Wei M. , Chen H. , Lin K. , Chen H. , Gao Y. , Lin S. , 2014, Implementation of a high-throughput modified merge sort in mimo detection systems, IEEE Transactions on Circuits and Systems I, Vol. 61, No. 9, pp. 2730-2737DOI
5 
Colavita A. A. , Cicuttin A. , Fratnik F. , Capello G. , 2003, Sortchip: A VLSI implementation of a hardware algorithm for continuous data sorting, IEEE Journal of Solid-State Circuits, Vol. 38, No. 6, pp. 1076-1079DOI
6 
Batcher K. E. , 1968, Sorting network and their applications, Proc. of 1968 Spring Joint Computer Conference, AFIPS, Vol. 32, pp. 307-314DOI
7 
Liszka K. J. , Batcher K. E. , 1993, A generalized bitonic sorting network, Proc. of 1993 International Conference on Parallel Processing - ICPP'93, pp. 105-108DOI
8 
Ajtai M. , Komlos J. , Szemeredi E. , 1983, An O(N logN) sorting network, Proc. of 15th Annual ACM Symposium on Theory of Computing, pp. 1-9DOI
9 
Leighton F. , 1985, Tight bounds on the complexity of parallel sorting, IEEE Transactions on Computers, Vol. 34, No. 4, pp. 344-354DOI
10 
Paterson M. S. , 1990, Improved sorting networks with O(logN) depth, Algorithmica, Vol. 5, pp. 75-92DOI
11 
Chen R. , Prasanna V. K. , 2017, Computer generation of high throughput and memory efficient sorting designs on FPGA, IEEE Transactions on Parallel and Distributed Systems, Vol. 28, No. 11, pp. 3100-3113DOI
12 
Lee J.-D. , Batcher K. E. , 2000, Minimizing communication in the bitonic sort, IEEE Transactions on Parallel and Distributed Systems, Vol. 11, No. 5, pp. 459-474DOI
13 
Lee J.-D. , Batcher K.E. , 1996, Minimizing communication of a recirculating bitonic sorting network, Proc. of the 1996 ICPP Workshop on Challenges for Parallel Processing, Vol. I, pp. I-251-254DOI
14 
Najafi M. H. , Lilja D. J. , Riedel M. , Bazargan K. , 2017, Power and area efficient sorting networks using unary processing, Proc. of 2017 IEEE International Conference on Computer Design (ICCD), pp. 125-128DOI
15 
Najafi M. H. , Lilja D. J. , Riedel M. D. , Bazargan K. , 2018, Low-cost sorting network circuits using unary processing, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 26, No. 8, pp. 1471-1480DOI
16 
Han Z. , Yoshikawa N. , Yamanashi Y. , 2025, Small-area sorting network based on unary coding using single flux quantum circuits, IEEE Transactions on Applied Superconductivity, Vol. 35, No. 5, pp. 1-5DOI