| 摘要 |
<P>PROBLEM TO BE SOLVED: To speed up an FFT operation. <P>SOLUTION: An arithmetic unit comprises: an operation unit 21 that applies transformation operation to multidimensional first matrix data; a first memory 10 that stores second matrix data which is part of data including at least one sequential row in the first matrix data; and a second memory 12 that includes the minimum number of bits allowing access by one-time access and stores the first matrix data. The operation unit executes: a step for dividing the second matrix data into third matrix data which is matrix data with a size equal to or greater than the minimum number of bits; a step for applying matrix transpose to each piece of the third matrix data; a step for using the second memory to store the second matrix data in units of the third matrix data after the matrix transpose; a step for transferring fourth matrix data, which is part of the data including at least one sequential row in the first matrix data after the matrix transpose, from the second memory to the first memory, and using the first memory to store the fourth matrix data in units of the third matrix data, so that the matrix transpose is applied to the first matrix data; and a step for applying transform operation by row to the fourth matrix data stored in the first memory. <P>COPYRIGHT: (C)2012,JPO&INPIT |
