FAST FOURIER TRANSFORM USING A DISTRIBUTED COMPUTING SYSTEM
    1.
    发明申请
    FAST FOURIER TRANSFORM USING A DISTRIBUTED COMPUTING SYSTEM 审中-公开
    使用分布式计算系统的快速傅立叶变换

    公开(公告)号:WO2016057783A1

    公开(公告)日:2016-04-14

    申请号:PCT/US2015/054673

    申请日:2015-10-08

    CPC classification number: H04L67/10 G06F17/14 G06F17/142 H04L41/04

    Abstract: Techniques are disclosed relating to performing Fast Fourier Transforms (FFTs) using distributed processing. In some embodiments, results of local transforms that are performed in parallel by networked processing nodes are scattered across processing nodes in the network and then aggregated. This may transpose the local transforms and store data in the correct placement for performing further local transforms to generate a final FFT result. The disclosed techniques may allow latency of the scattering and aggregating to be hidden behind processing time, in various embodiments, which may greatly reduce the time taken to perform FFT operations on large input data sets.

    Abstract translation: 公开了使用分布式处理执行快速傅里叶变换(FFT)的技术。 在一些实施例中,由网络处理节点并行执行的局部变换的结果分散在网络中的处理节点上,然后被聚合。 这可以转置局部变换并将数据存储在正确的位置,以进行进一步的局部变换以产生最终的FFT结果。 所公开的技术可以允许散射和聚合的等待时间在各种实施例中被隐藏在处理时间之后,这可以大大减少对大输入数据集执行FFT操作所花费的时间。

Patent Agency Ranking