Patents by Inventor Leizu Yin
Leizu Yin has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9966932Abstract: An apparatus for parallel filtering, including a multi-granularity memory, a data cache device, a coefficient buffer broadcast device, a vector operation device and a command queue device. The multi-granularity memory is configured to store data to be filtered, filter coefficients and filtering result data. The data cache device is configured to cache, read and update the data to be filtered. The coefficient buffer broadcast device is configured to cache and broadcast the read filter coefficients. The command queue device is configured to store and output a queue of operation commands for the parallel filtering operation. The vector operation device is configured to perform a vector operation based on the data to be filtered and the output coefficient data, and write an operation result into the multi-granularity filtering result storage unit. A method is also provided.Type: GrantFiled: April 19, 2013Date of Patent: May 8, 2018Assignee: BEIJING SMARTLOGIC TECHNOLOGY LTD.Inventors: Donglin Wang, Leizu Yin, Yongyong Yang, Shaolin Xie, Tao Wang
-
Publication number: 20160233850Abstract: The present disclosure provides a method and apparatus for parallel filtering. The apparatus comprises: a multi-granularity memory, a data cache device, a coefficient buffer broadcast device, a vector operation device and a command queue device. The multi-granularity memory is configured to store data to be filtered, filter coefficients and filtering result data. The data cache device is configured to cache, read and update the data to be filtered. The coefficient buffer broadcast device is configured to cache and broadcast the read filter coefficients. The command queue device is configured to store and output a queue of operation commands for the parallel filtering operation. The vector operation device is configured to perform a vector operation based on the data to be filtered and the output coefficient data, and write an operation result into the multi-granularity filtering result storage unit.Type: ApplicationFiled: April 19, 2013Publication date: August 11, 2016Inventors: Donglin Wang, Leizu Yin, Yongyong Yang, Shaolin Xie, Tao Wang
-
Publication number: 20160162290Abstract: The present disclosure provides a processor having polymorphic instruction set architecture. The processor comprises a scalar processing unit, at least one polymorphic instruction processing unit, at least one multi-granularity parallel memory and a DMA controller. The polymorphic instruction processing unit comprises at least one functional unit. The polymorphic instruction processing unit is configured to interpret and execute a polymorphic instruction and the functional unit is configured to perform specific data operation tasks. The scalar processing unit is configured to invoke the polymorphic instruction and inquire an execution state of the polymorphic instruction. The DMA controller is configured to transmit configuration information for the polymorphic instruction and transmit data required by the polymorphic instruction to the multi-granularity parallel memory.Type: ApplicationFiled: April 19, 2013Publication date: June 9, 2016Inventors: Donglin Wang, Shaolin Xie, Yongyong Yang, Leizu Yin, Lei Wang, Zijun Liu, Tao Wang, Xing Zhang
-
Patent number: 9317481Abstract: A data access method and device for parallel FFT computation. In the method, FFT data and twiddle factors are stored in multi-granularity parallel memories, and divided into groups throughout the computation flow according to a uniform butterfly representation. Each group of data involves multiple butterflies that support parallel computation. Meanwhile, according to the butterfly representation, it is convenient to generate data address and twiddle factor coefficient address for each group. With different R/W granularities, it is possible to read/write data and corresponding twiddle factors in parallel from the multi-granularity memories. The method and device further provide data access devices for parallel FFT computation. In the method and device, no conflict will occur during read/write operations of memories, and no extract step is required for sorting the read/written data. Further, the method and device can flexibly define the parallel granularity according to particular applications.Type: GrantFiled: December 31, 2011Date of Patent: April 19, 2016Assignee: Institute of Automation, Chinese Academy of SciencesInventors: Shaolin Xie, Donglin Wang, Xiao Lin, Jie Hao, Xiaojun Xue, Tao Wang, Leizu Yin
-
Patent number: 9268744Abstract: A parallel bit reversal device and method. The device includes a parallel bit reversal unit, a butterfly computation and control unit, and a memory. The butterfly computation and control unit is coupled to the memory via a data bus. The parallel bit reversal unit is configured to bit-reverse butterfly group data used by the butterfly computation and control unit. The parallel bit reversal unit includes an address reversing logic coupled to the butterfly computation and control unit, and configured to perform mirror reversal and right-shift operations on a read address from the butterfly computation and control unit.Type: GrantFiled: December 31, 2011Date of Patent: February 23, 2016Assignee: Institute of Automation, Chinese Academy of SciencesInventors: Shaolin Xie, Donglin Wang, Jie Hao, Tao Wang, Leizu Yin
-
Patent number: 9262378Abstract: A method and device for multi-granularity parallel FFT butterfly computation. The method and device read data and twiddle factors for computation in one butterfly group from the input buffers and the twiddle factor buffer at a time, perform multi-stage butterfly computation in parallel using uniform butterfly representations, and write the results back to the input buffers. The method and device greatly reduce the frequency for accessing the memory, improve speed for butterfly computation, and reduce power consumption. The method and device achieve multi-granularity butterfly computation of various data formats in a parallel and efficient manner. The method and device can specify the parallel granularity and data format for butterfly computation according to particular applications, and are applicable to FFT butterfly computation of balanced and unbalanced groups.Type: GrantFiled: December 31, 2011Date of Patent: February 16, 2016Assignee: Institute of Automation, Chinese Academy of SciencesInventors: Donglin Wang, Tao Wang, Shaolin Xie, Jie Hao, Leizu Yin
-
Patent number: 9176929Abstract: A multi-granularity parallel FFT computation device including three memories, a butterfly computation device, a state control unit, a data reversing network and a first selector. The three memories are each a multi-granularity parallel memory, and store butterfly group data and twiddle factors corresponding to the butterfly group data. The butterfly computation device perform computations of a butterfly group based on the butterfly group data outputted from the first selector and the corresponding twiddle factors outputted from one of the memories, and write a computation result back to the other two memories. The device can read butterfly group data and corresponding twiddle factors in parallel from the multi-granularity parallel memories with a specific R/W granularity. No memory conflict will occur in the read operation, and no additional process is required for sorting the read/written data.Type: GrantFiled: December 31, 2011Date of Patent: November 3, 2015Assignee: Institute of Automation, Chinese Academy of SciencesInventors: Donglin Wang, Shaolin Xie, Jie Hao, Xiao Lin, Tao Wang, Leizu Yin
-
Publication number: 20140337401Abstract: The present disclosure provides A data access method and device for parallel FFT computation. In the method, FFT data and twiddle factors are stored in multi-granularity parallel memories, and divided into groups throughout the computation flow according to a uniform butterfly representation. Each group of data involves multiple butterflies that support parallel computation. Meanwhile, according to the butterfly representation, it is convenient to generate data address and twiddle factor coefficient address for each group. With different R/W granularities, it is possible to read/write data and corresponding twiddle factors in parallel from the multi-granularity memories. The method and device further provide data access devices for parallel FFT computation. In the method and device, no conflict will occur during read/write operations of memories, and no extract step is required for sorting the read/written data.Type: ApplicationFiled: December 31, 2011Publication date: November 13, 2014Applicant: Institute of Automation, Chinese Academy of SciencesInventors: Shaolin Xie, Donglin Wang, Xiao Lin, Jie Hao, Xiaojun Xue, Tao Wang, Leizu Yin
-
Publication number: 20140330880Abstract: A method and device for multi-granularity parallel FFT butterfly computation. The method and device read data and twiddle factors for computation in one butterfly group from the input buffers and the twiddle factor buffer at a time, perform multi-stage butterfly computation in parallel using uniform butterfly representations, and write the results back to the input buffers. The method and device greatly reduce the frequency for accessing the memory, improve speed for butterfly computation, and reduce power consumption. The method and device achieve multi-granularity butterfly computation of various data formats in a parallel and efficient manner. The method and device can specify the parallel granularity and data format for butterfly computation according to particular applications, and are applicable to FFT butterfly computation of balanced and unbalanced groups.Type: ApplicationFiled: December 31, 2011Publication date: November 6, 2014Applicant: Institute of Automation, Chinese Academy of SciencesInventors: Donglin Wang, Tao Wang, Shaolin Xie, Jie Hao, Leizu Yin
-
Publication number: 20140089369Abstract: A multi-granularity parallel FFT computation device including three memories, a butterfly computation device, a state control unit, a data reversing network and a first selector. The three memories are each a multi-granularity parallel memory, and store butterfly group data and twiddle factors corresponding to the butterfly group data. The butterfly computation device perform computations of a butterfly group based on the butterfly group data outputted from the first selector and the corresponding twiddle factors outputted from one of the memories, and write a computation result back to the other two memories. The device can read butterfly group data and corresponding twiddle factors in parallel from the multi-granularity parallel memories with a specific R/W granularity. No memory conflict will occur in the read operation, and no additional process is required for sorting the read/written data.Type: ApplicationFiled: December 31, 2011Publication date: March 27, 2014Applicant: Institute of Automation, Chinese Academy of Scienc of SciencesInventors: Donglin Wang, Shaolin Xie, Jie Hao, Xiao Lin, Tao Wang, Leizu Yin
-
Publication number: 20140089370Abstract: A parallel bit reversal device and method. The device includes a parallel bit reversal unit, a butterfly computation and control unit, and a memory. The butterfly computation and control unit is coupled to the memory via a data bus. The parallel bit reversal unit is configured to bit-reverse butterfly group data used by the butterfly computation and control unit. The parallel bit reversal unit includes an address reversing logic coupled to the butterfly computation and control unit, and configured to perform mirror reversal and right-shift operations on a read address from the butterfly computation and control unit.Type: ApplicationFiled: December 31, 2011Publication date: March 27, 2014Applicant: Institute of Automation, Chinese Academy of SciencesInventors: Shaolin Xie, Donglin Wang, Jie Hao, Tao Wang, Leizu Yin