Por favor, use este identificador para citar o enlazar este ítem:
http://inaoe.repositorioinstitucional.mx/jspui/handle/1009/1174
A versatile linear insertion sorter based on a FIFO scheme | |
JOSE ROBERTO PEREZ ANDRADE RENE ARMANDO CUMPLIDO PARRA FERNANDO MARTIN DEL CAMPO RAMIREZ CLAUDIA FEREGRINO URIBE | |
Acceso Abierto | |
Atribución-NoComercial-SinDerivadas | |
Hardware sorters Linear Sorters FIFO | |
A linear sorter based on First In First Out (FIFO) scheme is presented. It is capable of discarding the oldest value, inserting the incoming data while keeping the values sorted in a single clock cycle. This type of sorter can be used as coprocessor or as module in specialized architectures for order statistics filtering. The architecture is composed of identical processing elements thus can be easily adapted to any length according to specific application needs. The use of compact identical processing elements results in a high performance yet small architecture. Results of implementing the architecture on a Field Programmable Gate Array (FPGA) are presented and compared against other reported hardware based sorters. | |
IEEE | |
2008 | |
Artículo | |
Inglés | |
Estudiantes Investigadores Público en general | |
Perez-Andrade, R., et al. A versatile linear insertion sorter based on a FIFO scheme, IEEE Computer Society Annual Symposium on VLSI, (2008): 357-362 | |
CIENCIA DE LOS ORDENADORES | |
Versión aceptada | |
acceptedVersion - Versión aceptada | |
Aparece en las colecciones: | Artículos de Ciencias Computacionales |
Cargar archivos:
Fichero | Tamaño | Formato | |
---|---|---|---|
2009-CumplidoParraRene-A Versatile Linear Insertion Sorter Based on a FIFO Scheme.pdf | 223.87 kB | Adobe PDF | Visualizar/Abrir |