• JSTS:Journal of Semiconductor Technology and Science
• /
• v.3 no.4
• /
• pp.211-216
• /
• 2003

This work describes a 3 V 12b 100 MS/s CMOS digital-to-analog converter (DAC) for high-speed communication system applications. The proposed DAC is composed of a unit current-cell matrix for 8 MSBs and a binary-weighted array for 4 LSBs, trading-off linearity, power consumption, chip area, and glitch energy with this process. The low-glitch switch driving circuits are employed to improve linearity and dynamic performance. Current sources of the DAC are laid out separately from the current-cell switch matrix core block to reduce transient noise coupling. The prototype DAC is implemented in a 0.35 um n-well single-poly quad-metal CMOS technology and the measured DNL and INL are within ${\pm}0.75$ LSB and ${\pm}1.73$ LSB at 12b, respectively. The spurious-free dynamic range (SFDR) is 64 dB at 100 MS/s with a 10 MHz input sinewave. The DAC dissipates 91 mW at 3 V and occupies the active die area of $2.2{\;}mm{\;}{\times}{\;}2.0{\;}mm$

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.17-21
• /
• 2008

As with the binary pseudo-random sequences q-ary m-sequences possess very good properties which make them useful in many applications. So we construct a class of Jacket matrices by applying additive characters of the finite field $F_q$ to entries of all shifts of q-ary m-sequence. In this paper, we generalize a method of obtaining conventional Hadamard matrices from binary PN-sequences. By this way we propose Jacket matrix construction based on q-ary M-sequences.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.14 no.3
• /
• pp.208-214
• /
• 2021

Recently, much of the intelligent security scenario and criminal investigation demands for matching photo and non-photo. Existing face recognition system can not sufficiently guarantee these needs. In this paper, we propose an algorithm to improve the performance of heterogeneous face recognition systems by reducing the different modality between sketches and photos of the same person. The proposed algorithm extracts each image's texture features through texture descriptors (gray level co-occurrence matrix, multiscale local binary pattern), and based on this, generates a transformation matrix through eigenfeature regularization and extraction techniques. The score value calculated between the vectors generated in this way finally recognizes the identity of the sketch image through the score normalization methods.

• Journal of the Korean Mathematical Society
• /
• v.54 no.4
• /
• pp.1317-1329
• /
• 2017

A Boolean rank one matrix can be factored as $\text{uv}^t$ for vectors u and v of appropriate orders. The perimeter of this Boolean rank one matrix is the number of nonzero entries in u plus the number of nonzero entries in v. A Boolean matrix of Boolean rank k is the sum of k Boolean rank one matrices, a rank one decomposition. The perimeter of a Boolean matrix A of Boolean rank k is the minimum over all Boolean rank one decompositions of A of the sums of perimeters of the Boolean rank one matrices. The arctic rank of a Boolean matrix is one half the perimeter. In this article we characterize the linear operators that preserve the symmetric arctic rank of symmetric Boolean matrices.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11b
• /
• pp.933-936
• /
• 2003

본 논문은 비트 매트릭스(bit matrix) 확률 모델과 이를 입력으로 사용하는 개량된 이진 산술부호 알고리즘을 제안한다. 비트들로 이루어진 비트 평면에서 3$\times$3 비트 매트릭스를 정의하였다. 그리고 비트 평면을 조사하여 2연속 혹은 3연속 비트 매트릭스들에 대한 확률모델을 구하였다. 본 연구에서는 3 가지의 확률간격(interval)을 가지는 개량된 이진 산술부호기률 사용하였다. 개량된 이진 산술부호 알고리즘의 장점은 구조가 간결하고 또한 부호화가 진행되는 도중에 결과 비트스트림을 생성하는 특징이 있다. 이진 산술부호기는 2연속 혹은 3연속 비트매트릭스를 입력하여 산술부호화를 수행하도록 한다.

• Information and Communications Magazine
• /
• v.7 no.3
• /
• pp.27-34
• /
• 1990

The $(L,\psi)$ feature description on the binary boundary air craft image is introduced of classifying 3-D object (aircraft) identification. Three types for associative matrix memories are employed and tested for their classification performance. The fast association involved in these memories can be implemented using a parallel optical matrix-vector operation. Two associative memories are based on pseudoinverse solutions and the third one is interoduced as a paralell version of a nearest-neighbor classifier. Detailed simulation results for each associative processor are provided.

• Journal of the Korean Statistical Society
• /
• v.14 no.1
• /
• pp.29-38
• /
• 1985

Cyclic Factorial Association Scheme (CFAS) for incomplete block designs in a factorial experiment is defined. It is a generalization of EGD/($2^n-1$)-PBIB designs defined by Hinkelmann (1964) or Binary Number Association Scheme (BNAS) named by Paik and Federer (1973). A property of PBIB designs having CFAS is investigated and it is shown that the structural matrix NN' of such designs has a pattern of multi-nested block circulant matrix. The generalized inverse of (rI-NN'/k) is obtained. Generalized Cyclic incomplete block designs for factorial experiments introduced by John (1973) are presented as the examples of CFAS-PBIB designs. Finally, the relationship between CFAS and BNAS in block designs is briefly discussed.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.702-705
• /
• 2004

Collaborative filtering (CF) is originally based on the ratings of customers who vote on the items they used. When customers' votes are not available, user-item binary data set which represents choice and non-choice can also be used in this analysis. In this case the similarities between active user and the other users must be modified. Therefore we compare eight types of binary similarities by applying them in the modified CF Algorithm. Some experimental results will be reported.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.3
• /
• pp.118-128
• /
• 2012

An attempt is given to the problem of analyzing the two-way binary attribute data using the logistic regression model in order to find a sound statistical methodology. It is demonstrated that the analysis of variance (ANOVA) may not be good enough, especially for the case that the proportion is very low or high. The logistic transformation of proportion data could be a help, but not sound in the statistical sense. Meanwhile, the adoption of generalized least squares (GLS) method entails much to estimate the variance-covariance matrix. On the other hand, the logistic regression methodology provides sound statistical means in estimating related confidence intervals and testing the significance of model parameters. Based on simulated data, the efficiencies of estimates are ensured with a view to demonstrate the usefulness of the methodology.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.1
• /
• pp.111-130
• /
• 2019

The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding minimum pseudoweight equals its minimum Hamming distance. By using the value assignment of Chen and Kløve we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give several upper bounds on the pseudoredundancies of certain codes with repeated and added coordinates and of certain shortened subcodes. We also investigate several kinds of k-dimensional binary codes and compute their exact pseudocodeword redundancy.