• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.36-42
• /
• 2010

This paper presents a hybrid approach to the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes based on parallel bundles in Euclidean geometries and circulant permutation matrices. Codes constructed by this method are shown to be regular with large girth and low density. Simulation results show that these codes perform very well with iterative decoding and achieve reasonably large coding gains over uncoded system.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06e
• /
• pp.19-22
• /
• 1998

인공 잔향은 콘서튼홀에서와 같이 수백.수천개의 극점과 영점들을 갖는 커다란 시스템을 모델링하기 위한 신호처리 분야 중에서 매우 매력적인 응용 분야중 하나이다. 이러한 인공잔향을 구현하기 위하여, 기존에는 순환적인 디지털 필터인 Comb 필터와 Allpass 필터를 조합시킨 인공 잔향기가 제안되어 왔다. 그러나, 이와 같은 방법은 시스템이 커질수록 실시간 처리와 안정도의 문제가 제기되고, 인공 잔향의 특성이 저하되는 문제점이 있다. 따라서, 최근에는 이와 같은 문제점을 효과적으로 감소시킬 수 있는 귀환 지연 회로망(Feedback Delay Networks : FDN's)과 디지털 도파관 회로망(Digital Waveguide Networks : DWN's)를 이용한 방법이 제안되어지고 있다. 그러므로, 본 연구에서는 귀환 행렬이 Circulant 행렬로 이루어진 귀환 지연 회로망(CFDN's)를 이용한 인공 잔향기 구현에 관하여 논의하고자 한다.

• The Korean Journal of Applied Statistics
• /
• v.2 no.1
• /
• pp.54-64
• /
• 1989

The paper by Kurkjian and Zelen(1963) introducted the Property A which related to a structural property of concordance matrix of the column incidence matrix. On the other hand, Paik(1985) showed the property of the concordance matrix, which has multinested block circulant pattern matrix, and this structural property was termed Property C by Paik(1985). This paper classifies the incomplete block designs according to the pattern of the concordence matrix which has multi-nested block circulant pattern. The purpose of this classification simplified the solution of reduced normal equation and plan of the design.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.5
• /
• pp.508-514
• /
• 2007

Properties and potential applications of the block pulse response circulant matrix (PRCM) and its singular value decomposition (SVD) are investigated in relation to MIMO control and identification. The SVD of the PRCM is found to provide complete directional as well as frequency decomposition of a MIMO system in a real matrix form. Three examples were considered: design of MIMO FIR controller, design of robust reduced-order model predictive controller, and input design for MIMO identification. The examples manifested the effectiveness and usefulness of the PRCM in the design of MIMO control and identification. irculant matrix, SVD, MIMO control, identification.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.4
• /
• pp.413-419
• /
• 1998

A novel order-reduction technique for model predictive control(MPC) is proposed based on the singular value decomposition(SVD) of a pulse response circulant matrix(PRCM) of a concerned system. It is first investigated that the PRCM (in the limit) contains a complete information of the frequency response of a system and its SVD decomposes the information into the respective principal directions at each frequency. This enables us to isolate the significant modes of the system and to devise the proposed order-reduction technique. Though the primary purpose of the proposed technique is to diminish the required computation in MPC, the clear frequency decomposition of the SVD of the PRCM also enables us to improve the robustness through selective excitation of frequency modes. Performance of the proposed technique is illustrated through two numerical examples.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8C
• /
• pp.786-794
• /
• 2006

We proposed a novel preconditioner based PCG(Preconditioned Conjugate Gradient) method for super resolution image reconstruction. Compared with the conventional block circulant type preconditioner, the proposed preconditioner can be more effectively applied for objective functions that include roughness penalty functions. The effectiveness of the proposed method was shown by simulations and experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.123-129
• /
• 2006

In this paper, we concentrate on reducing the complexity for efficient encoder. We design structural LDPC code using circulant matrix and permutation matrix and eIRA code. It is possible to design low complex encoder by using shift register and differential encoder and interleaver than general LDPC encoder that use matrix multiplication operation. The code designed by this structure shows similar performance as random code. And the proposed codes can considerably reduce a number of XOR gates.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.4E
• /
• pp.31-36
• /
• 1999

Circulant Feedback Delay Networks (CFDN's), whose feedback matrix is circulant to control the stability of system and time-frequency response easier than unitary one, were recently proposed. However, the drawback of this structure is that the flatness of the frequency response of CFDN's is not enough and it is difficult to adjust the placement of zeros to decrease this problem. Therefore, we propose Modified CFDN's (MCFDN's) consisted of a general recursive filter and CFDN's to maintain maximally the impulse response of CFDN's and improve the flatness of frequency response without adjusting the placement of zeros. The delay unit of a general recursive filter's feedback loop is replaced by CFDN's, are omitted the direct path. We represent the usefulness of MCFDN's to build artificial reverberators and the main parameter to determine characteristics of MCFDN's in this paper.

• East Asian mathematical journal
• /
• v.26 no.5
• /
• pp.655-670
• /
• 2010

The complete multipartite graph $K_{n(m)}$ with n $ {\geq}$ 4 partite sets of size m is shown to have a decomposition into 4-cycles in such a way that vertices of each cycle belong to distinct partite sets of $K_{n(m)}$, if 4 divides the number of edges. Such cycles are called gregarious, and were introduced by Billington and Hoffman ([2]) and redefined in [3]. We independently came up with the result of [3] by using a difference set method, and improved the result so that the composition is circulant, in the sense that it is invariant under the cyclic permutation of partite sets. The composition is then used to construct gregarious 4-cycle decompositions when one partite set of the graph has different cardinality than that of others. Some results on joins of decomposable complete multipartite graphs are also presented.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.10 no.6
• /
• pp.28-36
• /
• 1992