会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • MULTI-GRANULARITY PARALLEL STORAGE SYSTEM
    • 多粒度并行存储系统
    • US20140344515A1
    • 2014-11-20
    • US14117295
    • 2011-12-31
    • Donglin WangZijun LiuXiaojun XueXing ZhangZhiwei ZhangShaolin Xie
    • Donglin WangZijun LiuXiaojun XueXing ZhangZhiwei ZhangShaolin Xie
    • G11C7/10G11C11/406G11C21/00
    • G11C7/1072G06F3/0601G06F9/3895G06F12/02G06F12/0607G11C11/40615G11C21/00
    • A multi-granularity parallel storage system including a plurality of memories, a shift generator, an address increment lookup unit, an address shifter, a row address generator, and a plurality of address adders. The shift generator is configured to generate a shift value. The address increment lookup unit is configured to generate input data for the address shifter. The address shifter is configured to cyclically shift the input data rightward by Shift elements and then output the shifted data. The row address generator is configured to generate a row address RowAddr and input the generated row address RowAddr to the other input terminal of each address adder. Each address adder is configured to perform a non-sign addition of the input data at the two input terminals to obtain a read/write (R/W) address for one of the memories and input the R/W address to an address input terminal of the memory.
    • 包括多个存储器,移位发生器,地址增量查找单元,地址移位器,行地址生成器和多个地址加法器的多粒度并行存储系统。 移位发生器被配置为产生移位值。 地址增量查找单元被配置为生成地址移位器的输入数据。 地址移位器被配置为通过Shift元素向右循环移位输入数据,然后输出移位的数据。 行地址生成器被配置为生成行地址RowAddr,并将生成的行地址RowAddr输入到每个地址加法器的另一个输入端。 每个地址加法器被配置为在两个输入端子处执行输入数据的非符号相加以获得其中一个存储器的读/写(R / W)地址,并将R / W地址输入到地址输入端 的记忆。
    • 5. 发明申请
    • DATA ACCESS METHOD AND DEVICE FOR PARALLEL FFT COMPUTATION
    • 数据访问方法和并行FFT计算的设备
    • US20140337401A1
    • 2014-11-13
    • US14117375
    • 2011-12-31
    • Shaolin XieDonglin WangXiao LinJie HaoXiaojun XueTao WangLeizu Yin
    • Shaolin XieDonglin WangXiao LinJie HaoXiaojun XueTao WangLeizu Yin
    • G06F17/14
    • G06F17/142
    • 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. Further, the method and device can flexibly define the parallel granularity according to particular applications.
    • 本公开提供了一种用于并行FFT计算的数据访问方法和装置。 在该方法中,FFT数据和旋转因子存储在多粒度并行存储器中,并且根据均匀的蝴蝶表示在整个计算流程中分成组。 每组数据涉及支持并行计算的多个蝴蝶。 同时,根据蝴蝶表示,为每个组生成数据地址和旋转因子系数地址是方便的。 使用不同的R / W粒度,可以从多粒度存储器并行读取/写入数据和相应的旋转因子。 该方法和装置还提供用于并行FFT计算的数据访问装置。 在方法和装置中,在存储器的读/写操作期间不会发生冲突,并且不需要提取步骤来对读/写数据进行排序。 此外,该方法和装置可以根据特定应用灵活地定义平行粒度。
    • 6. 发明授权
    • Data access method and device for parallel FFT computation
    • 用于并行FFT计算的数据访问方法和设备
    • US09317481B2
    • 2016-04-19
    • US14117375
    • 2011-12-31
    • Shaolin XieDonglin WangXiao LinJie HaoXiaojun XueTao WangLeizu Yin
    • Shaolin XieDonglin WangXiao LinJie HaoXiaojun XueTao WangLeizu Yin
    • G06F17/14
    • G06F17/142
    • 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.
    • 用于并行FFT计算的数据访问方法和设备。 在该方法中,FFT数据和旋转因子存储在多粒度并行存储器中,并且根据均匀的蝴蝶表示在整个计算流程中分成组。 每组数据涉及支持并行计算的多个蝴蝶。 同时,根据蝴蝶表示,为每个组生成数据地址和旋转因子系数地址是方便的。 使用不同的R / W粒度,可以从多粒度存储器并行读取/写入数据和相应的旋转因子。 该方法和装置还提供用于并行FFT计算的数据访问装置。 在方法和装置中,在存储器的读/写操作期间不会发生冲突,并且不需要提取步骤来对读/写数据进行排序。 此外,该方法和装置可以根据特定应用灵活地定义平行粒度。
    • 7. 发明授权
    • Multi-granularity parallel FFT computation device
    • 多粒并行FFT计算装置
    • US09176929B2
    • 2015-11-03
    • US14118611
    • 2011-12-31
    • Donglin WangShaolin XieJie HaoXiao LinTao WangLeizu Yin
    • Donglin WangShaolin XieJie HaoXiao LinTao WangLeizu Yin
    • G06F17/14
    • G06F17/142
    • 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.
    • 包括三个存储器,蝶形计算装置,状态控制单元,数据反向网络和第一选择器的多粒度并行FFT计算装置。 三个存储器都是多粒度并行存储器,并且存储对应于蝶形组数据的蝶形组数据和旋转因子。 蝴蝶计算装置基于从第一选择器输出的蝶形组数据和从存储器之一输出的对应旋转因子来执行蝶形组的计算,并将计算结果写回到另外两个存储器。 该设备可以从具有特定R / W粒度的多粒度并行存储器并行读取蝶形组数据和相应的旋转因子。 在读取操作中不会发生内存冲突,并且不需要额外的进程来排序读/写数据。
    • 8. 发明申请
    • METHODS AND DEVICES FOR MULTI-GRANULARITY PARALLEL FFT BUTTERFLY COMPUTATION
    • 多粒度并行FFT BUTTERFLY计算的方法和设备
    • US20140330880A1
    • 2014-11-06
    • US14117192
    • 2011-12-31
    • Donglin WangTao WangShaolin XieJie HaoLeizu Yin
    • Donglin WangTao WangShaolin XieJie HaoLeizu Yin
    • G06F17/14
    • G06F17/142
    • 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.
    • 一种用于多粒度并行FFT蝶形运算的方法和装置。 该方法和设备一次从输入缓冲器和旋转因子缓冲器读取一个蝶形组中的数据和旋转因子,并行执行多级蝶形运算,并将结果写回输入缓冲器 。 该方法和设备大大降低了访问存储器的频率,提高了蝶式运算的速度,降低了功耗。 该方法和设备以并行且高效的方式实现各种数据格式的多粒度蝶形运算。 该方法和装置可以根据特定应用指定蝶式计算的并行粒度和数据格式,适用于平衡和不平衡组的FFT蝶形运算。
    • 9. 发明授权
    • Methods and devices for multi-granularity parallel FFT butterfly computation
    • 多粒度并行FFT蝶形运算的方法与装置
    • US09262378B2
    • 2016-02-16
    • US14117192
    • 2011-12-31
    • Donglin WangTao WangShaolin XieJie HaoLeizu Yin
    • Donglin WangTao WangShaolin XieJie HaoLeizu Yin
    • G06F17/14
    • G06F17/142
    • 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.
    • 一种用于多粒度并行FFT蝶形运算的方法和装置。 该方法和设备一次从输入缓冲器和旋转因子缓冲器读取一个蝶形组中的数据和旋转因子,并行执行多级蝶形运算,并将结果写回输入缓冲器 。 该方法和设备大大降低了访问存储器的频率,提高了蝶式运算的速度,降低了功耗。 该方法和设备以并行且高效的方式实现各种数据格式的多粒度蝶形运算。 该方法和装置可以根据特定应用指定蝶式计算的并行粒度和数据格式,适用于平衡和不平衡组的FFT蝶形运算。