| 摘要 |
<p>PROBLEM TO BE SOLVED: To divide input bandwidth such as a broadband signal into at least a part of N pieces of channels by executing discrete Fourier transform to N pieces of inputs connected to N pieces of outputs of a window presum part and generating at least a part of outputs of the N pieces of channels. SOLUTION: Window presum circuits WP1 to WP3 parallelly perform function realization processing of a window presum calculating part 20. The number I of circular shift paths of a circular shifting part 24' is equal to a GCD (N, M), each output group of each data word undergoing circular shift is repeated and shifted as many as the number of cycles being equal to N/GCD (N, M), each cycle has a shift value defined by mM*modulo N or -mM*modulo N, and respective channels of at least a part of N pieces of channels are decimated as much as a decimation coefficient M. A discrete Fourier transforming device 26' executes discrete Fourier transform and generates outputs of N pieces of channels.</p> |
