CN110532104B - Multi-channel data real-time sequencing method and system - Google Patents
Multi-channel data real-time sequencing method and system Download PDFInfo
- Publication number
- CN110532104B CN110532104B CN201910840588.4A CN201910840588A CN110532104B CN 110532104 B CN110532104 B CN 110532104B CN 201910840588 A CN201910840588 A CN 201910840588A CN 110532104 B CN110532104 B CN 110532104B
- Authority
- CN
- China
- Prior art keywords
- event
- data
- time
- channel
- cache
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/52—Program synchronisation; Mutual exclusion, e.g. by means of semaphores
- G06F9/524—Deadlock detection or avoidance
Abstract
The invention discloses a method and a system for real-time sequencing of multichannel data, wherein the method comprises the following steps: s1, when the multi-detector electronic signals are output, designing a token ring to perform multi-channel to one-channel conversion on the data packet of the detector event read out by the multi-detector electronic part, and storing the data packet into a data register; s2, extracting the timestamp information of each event in the data register; s3, buffering and delaying the data by adopting a cache register, and obtaining a timestamp of an event in the cache register; s4, the time stamp of the event in the data register is compared with the time stamp of the event in the cache register for updating, the event in the cache memory is updated according to the new time sequence order, the ordering is completed in the cache memory group, and the event with the minimum time is output and identified.
Description
Technical Field
The invention relates to a method and a system for real-time sequencing of multi-channel data, which are used for real-time sequencing of output signals of multiple detectors according to signal generation time and relate to various fields for generating sequences of data, such as the technical fields of pattern recognition based on FPGA (field programmable gate array) or electronic reading systems for processing detectors by big data sequencing and the like.
Background
After data acquisition with the task collection is accomplished, use CPU to carry out serial sequencing processing, two liang of comparisons to store, exist among the prior art: bubble sorting, quick sorting, insert sorting, and the like.
Bubble sorting is a basic and simple sorting algorithm, and the sorting principle is as follows: by comparing adjacent elements in the array and swapping if necessary. Taking ascending order as an example, define the sort array q [ n ]]If the first element q [0]]Q [1 ] is greater than the second element]Large, they exchange two; the same work is done for each pair of adjacent elements from the beginning of the first pair of data to the last pair at the end, and after the first cycle is finished, the last element n of the array should be the maximum number in the array; then aiming at the front n-1, repeating the steps, and returning one element at a time; the ith loop repeats the above steps for the first n-i +1 elements until no pair of numbers need to be compared. This homing process is like bubbles rising in the water, and is therefore termed bubble sorting. It is readily known through code implementation that the temporal complexity of bubble ordering is O (n) even in the optimal case2) The core part of the algorithm is a double nested loop, and many people try to improve the double nested loop, namely the most famous cocktail algorithm, namely directional bubble sorting.
The fast sorting is one of ten algorithms in the 20 th century, and compared with bubble sorting, each exchange of the fast sorting is a leap type and is an application of dichotomy: when sorting is carried out from small to large, one number in the interval is taken as a reference value during each sorting, all numbers smaller than the reference point are placed on the left side of the reference point, and numbers larger than or equal to the reference point are placed on the right side of the reference point. Therefore, the exchange between adjacent numbers can not be carried out like bubbling sequencing in each exchange, the exchange distance is much larger, the total comparison and exchange times are fewer, and the speed is naturally high. In the worst case, i.e. when all data is to be exchanged, its time complexity is also O (n)2)。
The core idea of the insertion ordering is to add insertion on the basis of query: the array is divided into two parts: sorted and unsorted. And inserting the unordered elements into the ordered sequence until the array as a whole has the orderliness. Defining an ordering array q [ n ], firstly, assuming that a first element q [0] in the array is ordered, defining an element to be inserted currently as k, and the value of the element to be inserted as temp, circularly comparing the temp with the ordered elements, when the element is greater than the temp, moving the element backwards, and finally, when a number greater than the temp exists, inserting the temp into a vacant position, and repeating the process for n-1 times to complete the ordering.
A special sequence analysis module: the event coincidence processing module is used for storing the time of each detector according to the event sequence of each channel, then the data of one channel is taken to compare with the data of the other channel in sequence for sequencing in a Data Acquisition Processing Server (DAPS), the obtained events are sequenced with the events of the next channel after being stored, and the sequencing work of all the events is finished in sequence. The method has the advantages of more sequencing times, more used storage resources, high processing frequency due to the integrated processing module, stronger offline processing capability and still insufficient real-time performance.
The existing method needs time and has high complexity for data to be processed, and is not beneficial to being used in data processing occasions with high real-time requirements.
Disclosure of Invention
In view of the above problems, an object of the present invention is to provide a method and a system for real-time sorting multi-channel data, which have high calculation efficiency and can effectively process output data of multiple detectors in real time.
In order to achieve the purpose, the invention adopts the following technical scheme:
in a first aspect, the present invention provides a method for real-time sequencing multi-channel data, comprising the steps of:
s1, when multi-detector electronic signals are output, designing a token ring to perform multi-channel to one-channel conversion on data packets of the events read by the multi-detector electronic reading system, and storing the data packets into a data register;
s2, extracting the time stamp of each event in the data register;
s3, buffering and delaying the data by adopting a cache register, and obtaining the time stamp of each event in the cache register;
s4, the time stamp of the event in the data register is compared with the time stamp of the event in the cache register for updating, the event in the cache memory is updated according to the new time sequence order, the ordering is completed in the cache memory group, and the event with the minimum time is output and identified.
Further, the implementation process of completing the sorting in the cache memory group and outputting and identifying the event with the smallest time in S4 is as follows: for a group of events, if the number of events is a, and the event sequence is arranged from 1, 2 to a in the sequence from small to large, when a new event arrives, the event with the minimum occurrence time is output by judging the time information of the event and the time of the event group in the sequence, the event data with the time less than the new event is transmitted to the previous stage of storage, the new event is inserted according to the time sequence, and the new sequence is still arranged according to the time sequence after being generated.
Further, in the initial state, the storage values in the cache memory are all 0, so that the first event is placed in the last level of cache memory when entering, and the subsequent events are sequentially supplemented to form an ordered event sequence cache, thereby facilitating the completion of the sequencing operation of the subsequent events.
In a second aspect, the present invention further provides a multi-channel data real-time sequencing system, including:
the token ring polling structure is used for receiving an output data frame of the multi-channel detector electronic reading system, sequentially reading detection channels with effective events according to the sequence of packing time, and converting multi-channel output into single-channel data output;
the data detection module is used for detecting that the data frame output by the token ring polling structure is stored through the data register;
the event detection module is used for extracting event timestamp information stored in the data register;
the buffer module is used for carrying out a plurality of levels of buffer delay through the buffer register group, and delaying the identified event data into a buffer memory for a plurality of clock cycles;
the sequencing implementation module is used for comparing the timestamp extracted by the event detection module with timestamp information of each event in the buffer module, and rearranging the buffer events and corresponding timestamp sequences;
and the sequence generating module is used for moving all the event data and the time stamps which are smaller than the new event to the previous event position, generating a sequence vector and outputting the smallest event in the cache.
Further, there are two design ideas of the token ring polling structure, which are respectively:
a: first come and first read: for multi-path input, which path arrives and outputs data;
b: polling: for the multi-path input number, sequentially and circularly accessing and reading the data of each channel, and accessing and reading the next channel if the access channel has no data.
Furthermore, the data detection module is used for guiding the detected token ring output data frame into the data register group, each level of register group can collect the input of the previous level after the clock comes, and transmits the original data to the next level of register group to form data register pipeline transmission, the data register pipeline transmission is transmitted from the tail part to the head part of the data register group, when the head part and the tail part of the data frame correspond to the register group respectively detect the packet head and the packet tail, when the packet head is received by the last level of register group, the data obtained by the register group connected with the token ring is certainly the packet tail, and the effective data frame is considered to pass through, so that the effective event data is obtained.
Further, the sequence generation module compares the extracted event time information with the timestamp of the cache event, and makes the comparison result be '1' when the timestamp of the new event is greater than that of the cache comparison event, and makes the comparison result be '0' when the timestamp of the new event is less than that of the cache comparison event; according to the ordering principle, the cache events are arranged according to the time sequence, so that the comparison result can form a sequential array, the events with the timestamp smaller than that of the new event are arranged on the side smaller than that of the new event, and the values are all '0'; events larger than the new event timestamp are arranged on the side larger than the new event, and the values are all '1', and the minimum event output is cached.
Due to the adoption of the technical scheme, the invention has the following advantages:
1. the invention meets the engineering requirement based on the development requirement of TOF-PET, realizes the real-time sequence rearrangement of effective events output by a plurality of detectors according to the occurrence time, converts low time correlation events output by the plurality of detectors in parallel into serial single event stream output according to the occurrence time sequence, thereby reducing the event noise, discriminating the coincident events, reducing the dead time of a data processing system, improving the working efficiency of the system and improving the imaging precision;
2. the method is used in a PET principle prototype to simultaneously sequence data output by multiple detectors, cache time-related events, and then rearrange the sequences according to time stamps to realize real-time event data output.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention are clearly and completely described below, and it is obvious that the described embodiments are a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present invention.
Example 1:
the method for performing real-time sequencing on the multi-channel data based on the FPGA comprises the following specific processes:
and S1, when processing the electronic signal output of the multi-detector, designing the token ring to perform multi-channel to one-channel conversion on the data packet of the event read by the electronic part, and storing the data into the data register.
And S2, extracting the data time stamp information in the data register.
S3, delaying the data by using the cache register, and obtaining the time stamp of each event in the cache register;
s4, the time stamp of the event in the data register is compared with the time stamp of the event in the cache register for updating, the event in the cache memory is updated according to the new time sequence order, the ordering is completed in the cache memory group, and the event with the minimum time is output and identified.
S5, the output result may be further subjected to time window matching with the time stamps of the preceding and following adjacent output events, thereby confirming whether the output result is a valid matching event.
Specifically, the implementation process of completing the sorting in the cache memory group and outputting and identifying the event with the minimum time in the step S4 is as follows:
for a group of events, if the number of events is a, and the event sequence is arranged in the order from small to large, such as from 1, 2 to a, when a new event arrives, by judging the time information of the event and the time of the event group in the sequence, if the occurrence time of the new event is 9.5, the due order of the event in the sequence can be obtained: should be between 9 and 10, at which time event number 1 is output, events from number 2 to 9 are passed forward respectively, and new event 9.5 is put in the place of the original event 9. And outputting the event with the minimum occurrence time, wherein event data with the time less than that of the new event are transmitted to the previous stage of storage, and the new event is inserted according to the time sequence, so that the new sequence can still be arranged according to the time sequence after being generated. Particularly, in the initial state, the storage values in the cache are all 0, so that the first event is placed in the last level of cache storage when entering, and the subsequent events are sequentially supplemented to form an ordered event sequence cache, thereby completing the sorting operation for the subsequent events.
Example 2:
the embodiment further provides a multi-channel data real-time sequencing system based on the FPGA, which includes:
and the token ring polling structure is used for receiving the output data frames of the multi-channel detector electronic reading system, sequentially reading the detection channels with effective events according to the sequence of the packing time, and converting the multi-channel output into single-channel data output. At this time, the token ring cannot realize effective sequential reading for events with close time intervals, only has certain time correlation, and needs a cache module to perform sequence correction.
Specifically, there are two design ideas for the token ring polling structure, which are respectively:
a: first come and first read: for multi-path Input, which path reaches and outputs data First, and is usually realized by FIFO (First Input First output) in FPGA;
b: polling: for the multi-path input number, sequentially and circularly accessing and reading the data of each channel, and accessing and reading the next channel if the access channel has no data. The FPGA can be realized by FIFO or register group, and the register group is preferably used.
And the data detection module is used for detecting that the data frame output by the token ring polling structure is stored by the data register.
Specifically, the data detection module is composed of a shift register group, and the bit width of the register group is the same as the data frame width. The detected token ring output data frame is led into a data register group, because the token ring output bit width is fixed, and the total bit number of a data packet is generally a multiple of the bit width, the data is stored by a multi-stage register group, each stage of register group collects the input of the previous stage after the clock comes, and transmits the original data to the next stage of register to form the data register pipeline transmission, and the data is transmitted from the tail part to the head part of the data register group, and then is output by an output register, for example, the data of 13 x 16bit, the token ring output bit width is 16, and the 13 stages of register groups are needed, when the token ring outputs the packet head, the data transmission is carried out according to the clock, and the data reception is completed by 13 clocks. When the register groups corresponding to the head and the tail of the data frame respectively detect the head and the tail of the packet, when the last stage register group receives the head of the packet, the data obtained by the register group connected with the token ring is certainly the tail of the packet, and the effective data frame is considered to pass through, the part aims to obtain the effective event data in the data register group, because the event data has a fixed data format under the normal condition, when the data sequence of the data packet enters the data register group, the head and the tail of the data register group are identified, and when the data at the head and the tail of the data packet conforms to the data packet format, the data register group can be judged and determined to have an effective data event currently. And because the length of one data packet is fixed, the situation of data packet misidentification is avoided by identifying the head and the tail of the packet at the same time.
And the event detection module is used for identifying the data frames detected by the data detection module, extracting the complete data packet and extracting the time information of the complete data packet before the complete data packet is output to the cache event group, wherein the time information is used as a time stamp of the data packet and is used for comparing with the time associated with a certain time sequence in the cache to determine the relative position of the new event and the cache event.
The buffer module is used for adding a plurality of stages of output register groups behind the data register group to perform a plurality of stages of buffer delay, delaying the identified event data for a plurality of clock cycles and entering the buffer memory for storage, namely realizing the buffer function;
specifically, the sequencing determination of the event sequence requires time, and at this time, the data packet in the data register group cannot be directly imported into the corresponding memory in the cache, and in order to implement data transfer after the sequencing is completed, the data register group is followed by several stages of output registers to perform several stages of buffering and delaying cache operations: although a data packet is identified at present, because the sorting algorithm is not completed yet, that is, the determined time of the new event and the buffer event is not determined to be associated, the new event is not led into the buffer memory until the sorting algorithm is completed, the sorting algorithm is added with an output register group, the identified event data is delayed for several clock cycles to enter the buffer memory, that is, the buffer function is realized, the time is determined by the sorting time, the time data can be continuously transmitted to the next stage register group until the sorting is completed, the number of stages is determined according to the time required by the sorting algorithm, for example, under a 100MHz clock, the number of stages of the output register group can be set to 30ns/10 ns-3 when 30ns is finished.
The sequencing implementation module is used for comparing the timestamp extracted by the event detection module with timestamp information of each event in the buffer module, and rearranging the buffer events and corresponding timestamp sequences;
specifically, there are two bases for implementing this sort, specifically:
a: since there are only two types of events in the cache: an event that occurs earlier than the new event (characteristic value of 0), and an event that does not occur earlier than the new event (characteristic value of 1). Therefore, the sequence vector has only N permutations, i.e., a events occur before a new event, and N-a events do not occur before a new event. Here, N states can be generated in the FPGA, when a new event satisfies the a-th state, a first occurring events move forward synchronously, the new event is inserted into the vacated event position, and the remaining N-a events remain unchanged.
B: there are only two movement patterns for events in the cache: 1) keeping the same; 2) the synchronization moves forward. The two movement modes depend on the precedence relationship between the event and the new event, that is, corresponding to the characteristic value, it can be considered that all events with the characteristic value of 0 need to move forward synchronously. Events with a characteristic value of 1 remain unchanged. At this time, although the movement direction of the event in the buffer can be judged, the position to which the new event should arrive cannot be judged, and the judgment is not performed by using two characteristic values: the motion judgment of a certain event and the update of the position event can be determined according to the event characteristic value and the characteristic value of the event which occurs after the event is adjacent to the event characteristic value, if the characteristic vector is 11, the two events occur later than the new event, and the event and the position do not need to be changed; if the feature vector is 10, the current event is earlier than the new event, and the next adjacent event is not earlier than the new event, so that the new event can be placed in the current event; when the feature vector is 00, the events are all earlier than the new event, and the storage of the position of the current event should be updated by the next event. Specifically, the feature vector of the minimum event is determined to be added with a previous event feature value, the default is 0, when the minimum event occurs earlier than the new event, the feature vector is 00, namely, the minimum event is output, and when the minimum event occurs later than the new event, the feature vector is 10, and the new event is input into the feature vector.
And the sequence generating module is used for moving all the event data and the time stamps which are smaller than the new event to the previous event position, generating a sequence vector and outputting the smallest event in the cache.
Specifically, according to the comparison between the extracted event time information (which may be referred to as a timestamp) and the timestamp of the cache event, the comparison result is "1" when the timestamp of the new event is greater than that of the cache comparison event, and the comparison result is "0" when the timestamp of the new event is less than that of the cache comparison event. According to the ordering principle, the cache events are arranged according to the time sequence, so that the comparison result can form a sequential array, the events with the timestamp smaller than that of the new event are arranged on the side smaller than that of the new event, and the values are all '0'; events larger than the new event timestamp are arranged on the side larger than the new event, and all have a value of '1'. The mechanism of the cache is that a new event comes in and a minimum event is cached and output, so that a new sequence is generated only by moving all cache events smaller than the new event forward by one event and placing the new event at an empty position, the minimum event is output at the moment, the events smaller than the new event are moved forward by one event for storage, the number of the cache events is unchanged, and the sequence from small to large is still kept. The caching mechanism can be realized by judging whether the occurrence time of a certain event and the backward event is greater than the new event: if an event and its successor events both occur before the new event, the value is determined to be "00" so that the event should be refreshed by the successor event. The output of the sorted data may be designed according to the width of the output channel, and the matching between the data and the output bit width may be completed by using a tool such as FIFO, which is not described herein.
In summary, the above module implementation process is completed before the next event is judged and identified by the data register set, when the register clock arrives, the above data shift is completed, and if the register stores, an event can be completed; if the FIFO or the memory with a certain depth is used, a plurality of clocks are needed to completely move the event, the design and the test are finished under both conditions, and the sequencing method is rapid and does not occupy the dead time of the system.
The correctness of the real-time sequencing method of multi-channel data of the invention is verified through the specific embodiment, in this embodiment, the real-time sequencing test analysis of the multi-detector channel events of the prototype based on the TOF-PET principle is performed, according to the test, when the method of the invention is not used, the output sequencing effect is not good, and the test result is shown in the following table 1:
TABLE 1
| Name of test variable | Data statistics | Note |
| DirectotyName1 | C:\User\Default\Desktop | Test file address |
| Error_list | 21784 | The quantity of the events which are disordered in sequence in the acquired file |
| Fid1 | 3 | Test sequence number (meaningless) |
| FileName | Ceshi1.dat | Testing file names |
| I | 91923 | Number of events tested |
By using the method of the invention, the disorder condition under the actual measurement condition is greatly reduced, the test capacity is 300000 groups of events, the sequence error is 0, the laboratory test shows that the multi-channel respectively uses clocks with different frequencies, such as 13K, 30K, 20K and the like, so that the output sequence of each channel is random, 30 ten thousand events have no error sequence, and the test result is shown in table 2:
TABLE 2
| Name of test variable | Data statistics | Note |
| DirectotyName1 | C:\User\Default\Desktop | Test file address |
| Error_list | 0 | The quantity of the events which are disordered in sequence in the acquired file |
| Fid1 | 3 | Test sequence number (meaningless) |
| FileName | C:\Users\ | Test file address |
| I | 300000 | Number of events tested |
The actual measurement verifies that when the multi-channel detector detects the radioactive source signal, under the condition that the token ring polling has no problem, the data sequencing is normal, and 30 ten thousand events have no sequence with one error.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting the scope of protection thereof, and although the present application is described in detail with reference to the above embodiments, those of ordinary skill in the art should understand that: numerous variations, modifications, and equivalents will occur to those skilled in the art upon reading the present application and are within the scope of the claims appended hereto.
Claims (3)
1. A multi-channel real-time data sorting system, comprising:
the token ring polling structure is used for receiving an output data frame of the multi-channel detector electronic reading system, sequentially reading detection channels with effective events according to the sequence of packing time, and converting multi-channel output into single-channel data output;
the data detection module is used for detecting that the data frame output by the token ring polling structure is stored through the data register;
the event detection module is used for extracting event timestamp information stored in the data register;
the buffer module is used for carrying out a plurality of levels of buffer delay through the buffer register group, and delaying the identified event data into a buffer memory for a plurality of clock cycles;
the sequencing implementation module is used for comparing the timestamp extracted by the event detection module with timestamp information of each event in the buffer module, and rearranging the buffer events and corresponding timestamp sequences;
the sequence generating module is used for moving all the event data and the time stamps which are smaller than the time stamp of the new event to the previous event position to generate a sequence vector and outputting the smallest event in the cache;
the data detection module is used for guiding detected token ring output data frames into a data register group, each level of register group can collect the input of the previous level after a clock arrives, and transmits the original data to the next level of register group to form data register pipeline transmission, the tail part of the data register group is transmitted to the head part, when the head part and the tail part of the data frame correspond to the register group respectively detect a packet head and a packet tail, when the last level of register group receives the packet head, the data obtained by the register group connected with the token ring is certainly the packet tail, and an effective data frame is considered to pass, so that effective event data is obtained.
2. The multi-channel data real-time sequencing system of claim 1, wherein the token ring polling structure is designed according to two concepts, which are:
a: first come and first read: for multi-path input, which path arrives and outputs data;
b: polling: for the multi-path input number, sequentially and circularly accessing and reading the data of each channel, and accessing and reading the next channel if the channel has no data.
3. The multi-channel data real-time sequencing system of claim 1, wherein the sequence generation module compares the extracted event time information with the timestamp of the cache event, and makes the comparison result '1' if the timestamp of the new event is greater than that of the cache comparison event, and makes the comparison result '0' if the timestamp of the new event is less than that of the cache comparison event; according to the ordering principle, the cache events are arranged according to the time sequence, so that the comparison result can form a sequential array, the events with the timestamp smaller than that of the new event are arranged on the side smaller than that of the new event, and the values are all '0'; events larger than the new event timestamp are arranged on the side larger than the new event, and the values are all '1', and the minimum event output is cached.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910840588.4A CN110532104B (en) | 2019-09-06 | 2019-09-06 | Multi-channel data real-time sequencing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910840588.4A CN110532104B (en) | 2019-09-06 | 2019-09-06 | Multi-channel data real-time sequencing method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110532104A CN110532104A (en) | 2019-12-03 |
| CN110532104B true CN110532104B (en) | 2020-09-11 |
Family
ID=68667252
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910840588.4A Active CN110532104B (en) | 2019-09-06 | 2019-09-06 | Multi-channel data real-time sequencing method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110532104B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111524269B (en) * | 2020-04-22 | 2021-12-07 | 武汉卓目科技有限公司 | Control system of sorter |
| CN116048453B (en) * | 2023-01-19 | 2023-08-08 | 中国科学院近代物理研究所 | Multichannel triggering asynchronous scheduling system and method based on FPGA |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5192378B2 (en) * | 2005-08-04 | 2013-05-08 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | Modular signal processing backbone for PET |
| EP2033017B1 (en) * | 2006-06-15 | 2015-08-26 | Koninklijke Philips N.V. | Integrated multi-channel time-to-digital converter for time-of-flight pet |
| US9535145B2 (en) * | 2007-11-09 | 2017-01-03 | Koninklijke Philips N.V. | MR-PET cyclic motion gating and correction |
| CN109302367B (en) * | 2018-10-09 | 2021-09-17 | 重庆会凌电子新技术有限公司 | Multichannel signal analog demodulation system and method thereof |
-
2019
- 2019-09-06 CN CN201910840588.4A patent/CN110532104B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN110532104A (en) | 2019-12-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110532104B (en) | Multi-channel data real-time sequencing method and system | |
| CN110633154B (en) | Data full-sorting method and system | |
| US9983876B2 (en) | Non-deterministic finite state machine module for use in a regular expression matching system | |
| CN1324557C (en) | Broadcast router having a serial digital audio data stream decoder | |
| CN102752098B (en) | For the measurement of error code method synchronous based on pseudo-random code sequence of communication system | |
| US5666547A (en) | Method and apparatus for framing a serial data stream | |
| US7349498B2 (en) | Method and system for data and edge detection with correlation tables | |
| CN101938332A (en) | Method and device for synchronizing blocks and frames | |
| US7558355B2 (en) | Syncword detecting circuit and a baseband signal receiving circuit | |
| CN111787325A (en) | Entropy encoder and encoding method thereof | |
| JP5508922B2 (en) | System and method for frame synchronization | |
| CN111290305A (en) | Multi-channel digital quantity acquisition and processing anti-collision method and system for multiple sets of inertial navigation systems | |
| US7602868B2 (en) | Asynchronous transmission device, asynchronous transmission method | |
| US20110261900A1 (en) | Mechanism for constructing an oversampled waveform for a set of signals received by a receiver | |
| CN112637134A (en) | Signal sorting method for time hopping signals of data link communication system | |
| CN112073990B (en) | Method for realizing peak-to-average ratio detection in serial data stream | |
| CN101350709B (en) | Method and device for synchronizing block and frame | |
| CN111585742A (en) | Multi-channel signal peak value synchronous detection system | |
| US6658505B2 (en) | System and method for checking bits in a buffer with multiple entries | |
| CN110912767A (en) | Single-point measurement method of network flow | |
| CN114710480B (en) | Processing method and system for read-out electronic data | |
| CN103051356B (en) | CDMA communication system reduces the method and apparatus of the error rate | |
| JPH10222346A (en) | Information processor | |
| US10756880B2 (en) | Systems and methods for aligning received data | |
| CN113364738B (en) | High-speed FT3 message dynamic self-adaptive receiving method and system based on low-speed clock |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |