Circuit for realizing data ordering and method thereof

Abstract

The invention discloses a circuit and a method for realizing data sorting and solves the problems of current software that the sorting time is long and the real-time request is not met. The circuit and the method of the invention are that: determining the depths of a register group, a comparator group, a multiplexer group of one chosen from n, a first multiplexer of one chosen from two, a second multiplexer and an extreme-valued pointer register and the widths of the first multiplexer of one chosen from two, the second multiplexer and the extreme-valued pointer register according to the extreme value number n which is needed to be searched; determining the running time of the circuit as m hours according to the number m of a data source; choosing an output type of the comparator according to a searching numerical type; resetting the register group and the extreme-valued pointer register group; inputting a sampled data to the circuit per clock cycle; stopping the circuit after m hours when the extreme value is n which is preserved in the register group. The circuit and the method of the invention are characterized in that: the real-time processing of the circuit is strong and the sorting time is reduced by times.

Description

technical field [0001] The present 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 ...

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