Information Theory Based Analysis and Design of Sorting Networks
عنوان مقاله: Information Theory Based Analysis and Design of Sorting Networks
شناسه ملی مقاله: ICEE15_305
منتشر شده در پانزدهیمن کنفرانس مهندسی برق ایران در سال 1386
شناسه ملی مقاله: ICEE15_305
منتشر شده در پانزدهیمن کنفرانس مهندسی برق ایران در سال 1386
مشخصات نویسندگان مقاله:
Nemati - University of Tehran
Ghaderi - University of Tehran
خلاصه مقاله:
Nemati - University of Tehran
Ghaderi - University of Tehran
m this paper the concepts of infirmation theory are utilized to perform the performance analysis of the sorting networks which is selected as an example of the parallel architectures. It is shown that using this method, the source -of the redundancy and the short comings of the erformance can be monitored spec$cally and an analytical proving for eflciency of designs can be presented. Also it is expected that the optimized design can be obtained at first try in design state instead of try and error methods. It may have more contribution in the large size and complicated
approximate working architectures. In addition to this a more accurate boundaries for the performance characteristics can be determined using this method.
کلمات کلیدی: Information Theory (IT), Sorting Networks, Parallel Architectures
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/25373/