• Journal of Korea Society of Digital Industry and Information Management
• /
• v.14 no.3
• /
• pp.77-85
• /
• 2018

Multi-User Multiple-Input Multiple-Output (MU-MIMO) is the core technology for improving the channel capacity compared to Single-User MIMO (SU-MIMO) by using multiuser gain and spatial diversity. Key problem for the MU-MIMO is the user selection which is the grouping the users optimally. To solve this problem, we adopt Extreme Value Theory (EVT) at the beginning of the proposed algorithm, which defines a primary user set instead of a single user that has maximum channel power according to a predetermined threshold. Each user in the primary set is then paired with all of the users in the system to define user groups. By comparing these user groups, the group that produces a maximum sum rate can be determined. Through computer simulations, we have found that the proposed method outperforms the conventional technique yielding a sum rate that is 0.81 bps/Hz higher when the transmit signal to noise ratio (SNR) is 30 dB and the total number of users is 100.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5C
• /
• pp.364-370
• /
• 2005

The first step of face recognition is to align an input face picture with database images. We propose a new algorithm of removing registration error in eigenspace. Our algorithm can correct for translation, rotation and scale changes. Linear matrix modeling of registration error enables us to compensate for subpixel errors in eigenspace. After calculating derivative of a weighting vector in eigenspace we can obtain the amount of translation or rotation without time consuming search. We verify that the correction enhances the recognition rate dramatically.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.9
• /
• pp.1091-1101
• /
• 1988

In this paper, a method to segment each character and extract figure from Korean documents is proposed. At first, each character string is extracted by means of iterative horizontal propagation, shrink algorithm and run-length algorithm. Individual character region is extracted by iterative horizontal and vertical manipulation. Next, characters of right pitch are searched. Each character is segmented by the position information. Overlapped character is segmented on the ground of the width of already extracted character. The rest are extracted as special characters of half pitch. Using 9 data input in the form of 840 X 600 from Korean monthly magazine, experiment was simulated. Extraction rate of character is 100%, and that of individual character is 98%. Judging from these results, efficiency on extracting character region and segmenting individual character is proved.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.7 no.3
• /
• pp.55-61
• /
• 2011

This paper presents an implementation of Lattice Reduction (LR)-aided detector for Multiple-Input Multiple-Output (MIMO) system using Graphics Processing Unit (GPU). GPU is a parallel processor which has a number of Arithmetic Logic Units (ALUs), thus, it can minimize the operation time of LR algorithm through the parallelization using multiple threads in the GPU. Through the implemented LR-aided detector, we verify that the LR-aided detector operates a lot faster than Maximum Likelihood (ML) detector. The implemented LR-aided detector has been applied to WiMAX system to show the feasibility of its real-time processing. In addition, we demonstrate that the processing time can be reduced at the cost of 3dB SNR loss by limiting the repeating loop in Lenstra-Lenstra-Lovasz (LLL) algorithm which is frequently used in LR-aided detector.

• ETRI Journal
• /
• v.32 no.1
• /
• pp.163-165
• /
• 2010

A trend in 3D mesh compression is codec design with low computational complexity which preserves the input vertex and face order. However, this added information increases the complexity. We present a fast 3D mesh compression method that compresses the redundant shared vertex information between neighboring faces using simple first-order differential coding followed by fast entropy coding with a fixed length prefix. Our algorithm is feasible for low complexity designs and maintains the order, which is now part of the MPEG-4 scalable complexity 3D mesh compression standard. The proposed algorithm is 30 times faster than MPEG-4 3D mesh coding extension.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.229-232
• /
• 2007

This paper investigates on the use of constant-amplitude zero-autocorrelation (CAZAC) sequence for channel estimation in multiple-input multiple-output (MIMO) system over indoor wireless channel. Since the symbol-length of the conventional 4-phase CAZAC sequence is short, there is a limitation to use it for MIMO system in multipath environments. An algorithm which generates longer CAZAC sequences is proposed to overcome that problem. Flexible symbol-length of 4-phase CAZAC sequences can be made by the proposed algorithm. Therefore appropriate symbol-length of CAZAC sequences could be utilized as preambles in accordance with the number of transmit antennas and channel condition. The effect of the number of CAZAC sequences for channel estimation is presented in terms of mean square error (MSE).

• Annual Conference of KIPS
• /
• 2000.10b
• /
• pp.883-886
• /
• 2000

Two fast search algorithms are proposed for VQ encoding in subband/VQ coding schemes. These algorithms exploit the property of the transform domain that the large coefficients rarely exist in the decomposed subbands. And the exit condition of PDE algorithm can be satisfied by comparing the large values of the codeword with the corresponding ones of the input vector. The computational complexity can be reduced at the expense of memories without extra coding errors.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.4
• /
• pp.140-145
• /
• 2008

Fuzzy partition is a conceptual vehicle that encapsulates data into information granules. Fuzzy equalization concerns a process of building information granules that are semantically and experimentally meaningful. A few algorithms generating fuzzy partitions with fuzzy equalization have been suggested. Simulations and experiments have showed that fuzzy partition representing more characteristics of given input distribution usually produces meaningful results. In this paper, given two points and cardinality of fuzzy partition, we prove that it is not true that there always exists a fuzzy partition with fuzzy equalization in which two of points having peaks fall on the given two points. Then, we establish an algorithm that minimizes the maximum distance between given two points and adjacent points having peaks in the partition. A numerical example is presented to show the validity of the suggested algorithm.

• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.2
• /
• pp.7-13
• /
• 1999

This paper propose a fuzzy regression method using fuzzy neural networks when a membership value is attached to each input -output pair. First, an architecture of fuzzy neural networks with fuzzy weights and fuzzy biases is shown. Next, a cost function is defined using the fuzzy output from the fuzzy neural network and the corresponding target output with a membership value. A learning algorithm is derived from the cost function. The derived learning algorithm trains the fuzzy neural network so that the level set of the fuzzy output includes the target output. Last, the proposed method is applied to the quality evaluation problem of injection molding

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.287-293
• /
• 1999

The first stage for computer security is password. If security of password is impotent even constructing of perfect fire-wall, fire-wall is not anything but a good-for-nothing. Because management of password is depend upon an end-user rather than a system-manager, carelessness of password management is an inevitable result. It is a reason that an end-user is actually not able to manage a high-difficulty-password. In this paper, algorithm of password is improved to be difficult of hacking, having a existing password input pattern for an end-user.