Circuit for realizing data ordering and method thereof

Abstract

The invention discloses a circuit and a method for realizing data sorting, which is invented to solve the problem that the existing software sorting time is long and does not meet the real-time requirement. The circuit and method of the present invention: according to the number of extreme values ​​n to be searched, determine the register group, the comparator group, the n-select 1 multiplexer group, the first group 2-select 1 multiplexer and the second group The depth of the multiplexer and the extreme value pointer register, and the width of the first group of 2-to-1 multiplexers and the second group of multiplexers and the extreme value pointer register group; according to the number m of data sources, determine the circuit The running time is m clocks; select the output type of the comparator according to the type of the search value; reset the register group and the extreme value pointer register group; input one sample data to the circuit every clock cycle; stop the circuit after m clocks, At this time, the n extreme values ​​are stored in the register group. The circuit and the method of the present invention have strong real-time processing performance, and the sorting time is doubled.

Description

technical field [0001] The invention relates to the field of digital signal processing, in particular to a hardware circuit and method for realizing data sorting. Background technique [0002] In digital signal processing, it is often necessary to sort a series of data, such as sorting the size order of m data, or finding the n largest (or smallest) data from m data, m≥n, to Prioritize this data. [0003] Existing technologies are mainly software sorting. Although there are many algorithms for software sorting, due to the slow computing speed of the software, it cannot meet the environment with high real-time requirements. For example, when the base station of the communication system searches for a cell, it needs to find the real signal from a large amount of data and quickly feed back the information to the mobile terminal. When there are many communities, the amount of data to be processed is very large, often reaching the order of 100,000. The software cannot search a...

AI Technical Summary

Problems solved by technology

Although there are many algorithms for software sorting, due to the slow computing speed of the software, it cannot meet the environment with high real-time requirements.

For example, when the base station of the communication system searches for a cell, it needs to find the real signal from a large amount of data and quickly feed back the information to the mobile terminal. When there are many communities, the amount of data to be processed is very large, often reaching the order of 100,000. The software cannot search and sort so much data in such a short period of time.

Images