• Journal of Korean Society for Quality Management
• /
• v.36 no.3
• /
• pp.13-21
• /
• 2008

The orthogonality is an important property in the experimental designs. When we use nearly orthogonal arrays(for example, supersaturated designs), we need evaluate the degree of the orthogonality of given nearly orthogonal arrays. We can use the mutual information as a new criterion for evaluating and testing the degree of the orthogonality of given nearly orthogonal arrays.

• Journal of Korean Society for Quality Management
• /
• v.32 no.4
• /
• pp.220-228
• /
• 2004

The orthogonality is an important property in the experimental designs. When we use nearly orthogonal arrays, we need evaluate the degree of the orthogonality of given experimental designs. Graphical methods for evaluating the degree of the orthogonality of nearly orthogonal arrays are suggested.

• ETRI Journal
• /
• v.42 no.3
• /
• pp.376-387
• /
• 2020

Massive computation of the reconstruction algorithm for compressive sensing (CS) has been a major concern for its real-time application. In this paper, we propose a novel high-speed architecture for the orthogonal matching pursuit (OMP) algorithm, which is the most frequently used to reconstruct compressively sensed signals. The proposed design offers a very high throughput and includes an innovative pipeline architecture and scheduling algorithm. Least-squares problem solving, which requires a huge amount of computations in the OMP, is implemented by using systolic arrays with four new processing elements. In addition, a distributed-arithmetic-based circuit for matrix multiplication is proposed to counterbalance the area overhead caused by the multi-stage pipelining. The results of logic synthesis show that the proposed design reconstructs signals nearly 19 times faster while occupying an only 1.06 times larger area than the existing designs for N = 256, M = 64, and m = 16, where N is the number of the original samples, M is the length of the measurement vector, and m is the sparsity level of the signal.