메뉴 건너뛰기




Volumn 2003-January, Issue , 2003, Pages 538-543

Arbitrary long digit integer sorter HW/SW co-design

Author keywords

HW SW co design; Radix Sort; Reusable Embedded Cores; Sorting; System on a Chip (SoC); Technology Independent Methodologies; VLSI design

Indexed keywords

APPLICATION SPECIFIC INTEGRATED CIRCUITS; COMPUTER AIDED DESIGN; COMPUTER SOFTWARE; DESIGN; EMBEDDED SYSTEMS; HARDWARE-SOFTWARE CODESIGN; PROGRAMMABLE LOGIC CONTROLLERS; RECONFIGURABLE HARDWARE; SECURITY OF DATA; SORTING; SYSTEM-ON-CHIP;

EID: 8844272834     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASPDAC.2003.1195075     Document Type: Conference Paper
Times cited : (16)

References (24)
  • 1
    • 0026238131 scopus 로고
    • A 512 16-b Bit-serial Sorter Chip
    • Oct.
    • M. Afghahi, "A 512 16-b Bit-serial Sorter Chip," IEEE J. Solid-State Circuits, vol. 26, pp. 1452-1457, Oct. 1991.
    • (1991) IEEE J. Solid-State Circuits , vol.26 , pp. 1452-1457
    • Afghahi, M.1
  • 2
    • 0024917523 scopus 로고
    • A Pipelined, Expandable VLSI Sorting Engine Implemented in CMOS Technology
    • B. Ahn and J. M. Murray, "A Pipelined, Expandable VLSI Sorting Engine Implemented in CMOS Technology," in Proc. IEEE Int'l. Symp. on Circuits and Systems, 1989, pp. 134-137.
    • (1989) Proc. IEEE Int'l. Symp. on Circuits and Systems , pp. 134-137
    • Ahn, B.1    Murray, J.M.2
  • 5
    • 0017908480 scopus 로고
    • Optimal Sorting Algorithms for Parallel Computer
    • Jan.
    • G. Baudet and D. Stevenson, "Optimal Sorting Algorithms for Parallel Computer," IEEE Trans. Computers, vol. 27, pp.84-87, Jan. 1978.
    • (1978) IEEE Trans. Computers , vol.27 , pp. 84-87
    • Baudet, G.1    Stevenson, D.2
  • 6
    • 0025430594 scopus 로고
    • Sorting n Objects with a k-sorter
    • May
    • R. Beigel and J.Gill, "Sorting n Objects with a k-sorter," IEEE Trans. Computers, vol. 39, pp.714-716, May 1990.
    • (1990) IEEE Trans. Computers , vol.39 , pp. 714-716
    • Beigel, R.1    Gill, J.2
  • 7
    • 0022044037 scopus 로고
    • A Minimum Area VLSI Network for O(log n) Time Sorting
    • May
    • G. Bilardi and F. P. Preparata, "A Minimum Area VLSI Network for O(log n) Time Sorting," IEEE Trans. Computers, vol. 34, pp.336-343, May 1985.
    • (1985) IEEE Trans. Computers , vol.34 , pp. 336-343
    • Bilardi, G.1    Preparata, F.P.2
  • 9
    • 0024091389 scopus 로고
    • Optimal VLSI Circuits for Sorting
    • R. Cole and A. R. Seigel, "Optimal VLSI Circuits for Sorting," JACM, vol. 35, pp.777-809, 1988.
    • (1988) JACM , vol.35 , pp. 777-809
    • Cole, R.1    Seigel, A.R.2
  • 10
    • 84945708324 scopus 로고
    • Sorting on Electronic Computer Systems
    • Edward. H. Friend, "Sorting on Electronic Computer Systems," JACM, vol. 3, pp.134-168, 1956.
    • (1956) JACM , vol.3 , pp. 134-168
    • Friend, E.H.1
  • 13
    • 0000811402 scopus 로고
    • Sorting and Searching
    • Reading: Addison-Wesley
    • D. E. Knuth, The Art of Computer Programming, Vol 3: Sorting and Searching. Reading: Addison-Wesley, 1973.
    • (1973) The Art of Computer Programming , vol.3
    • Knuth, D.E.1
  • 14
    • 0032649504 scopus 로고    scopus 로고
    • Realization of Large-scale Distributors Based on Batcher Sorters
    • July
    • J.-G. Lee and B.-G. Lee, "Realization of Large-scale Distributors Based on Batcher Sorters," IEEE Trans. Communications, vol. 47, pp. 1103-1110, July 1999.
    • (1999) IEEE Trans. Communications , vol.47 , pp. 1103-1110
    • Lee, J.-G.1    Lee, B.-G.2
  • 15
    • 0022043139 scopus 로고
    • Tight Bounds on The Complexity of Parallel Sorting
    • Apr.
    • T. Leighton, "Tight Bounds on The Complexity of Parallel Sorting," IEEE Trans. Computers, vol. 34, pp. 344-354, Apr. 1985.
    • (1985) IEEE Trans. Computers , vol.34 , pp. 344-354
    • Leighton, T.1
  • 18
    • 0032803651 scopus 로고    scopus 로고
    • Data-driven Control Scheme for Linear Arrays: Application to a Stable Insertion Sorter
    • Jan.
    • B. Parhami and D.-M. Kwai, "Data-driven Control Scheme for Linear Arrays: Application to a Stable Insertion Sorter," IEEE Trans. Parallel and Distributed Sys., vol. 10, pp 23-28, Jan. 1999.
    • (1999) IEEE Trans. Parallel and Distributed Sys. , vol.10 , pp. 23-28
    • Parhami, B.1    Kwai, D.-M.2
  • 19
    • 0015017871 scopus 로고
    • Parallel Processing with the Perfect Shuffle
    • Feb.
    • H. S. Stone, "Parallel Processing with the Perfect Shuffle," IEEE Trans. Computers, vol. 20, pp. 153-161, Feb. 1971.
    • (1971) IEEE Trans. Computers , vol.20 , pp. 153-161
    • Stone, H.S.1
  • 21
    • 0020886345 scopus 로고
    • The VLSI Complexity of Sorting
    • Dec.
    • C. D. Thompson, "The VLSI Complexity of Sorting," IEEE Trans. Computers, vol. 32, pp.1171-1184, Dec. 1983.
    • (1983) IEEE Trans. Computers , vol.32 , pp. 1171-1184
    • Thompson, C.D.1
  • 23
    • 0020312595 scopus 로고
    • The Parallel Enumeration Sorting Scheme for VLSI
    • Dec.
    • H. Yasuura, N. Takagi, and S. Yajima, "The Parallel Enumeration Sorting Scheme for VLSI," IEEE Trans. Computers, vol. 31, pp.1192-1201, Dec. 1982.
    • (1982) IEEE Trans. Computers , vol.31 , pp. 1192-1201
    • Yasuura, H.1    Takagi, N.2    Yajima, S.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.