• The Journal of the Acoustical Society of Korea
• /
• v.21 no.7
• /
• pp.648-655
• /
• 2002

This paper describes implementation of a multi-channel G.723.1 Annex A (G.723.1A) focused on code optimization using a high performance general purpose Digital Signal Processor (DSP), To implement a multi-channel G.723.1A functional complexities of the ITU-T G.723.1A fixed-point C-code are measures an analyzed. Then we sort and optimize C functions in complexity order. In parallel with optimization, we verify the bit-exactness of the optimized code using the ITU-T test vectors. Using only internal memory, the optimized code can perform full-duplex 17 channel processing. In addition, we further increase the number of available channels per DSP into 22 using fast codebook search algorithms, referred to as bit -compatible optimization.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.6 no.2
• /
• pp.83-91
• /
• 1997

Interactive measuring Part Program Generating Tools (IMPPGT) realized on the FANUC 15MA using touch trigger probes and interactive macro functions of the CNC were developed for intelligent measuring and inspection systems on the machine tools. Machine tools. Menu driven measuring and inspection functions of the IMPPGT were studied and implemented on the CNC through the macro executor and ROM writer. In order to automate measurement and inspection procedures in machine shops, measuring G Code system was also proposed. Using the developed measuring G Code system on the machine tool, untended measurement and inspection operation was able to be realized in FMS lines.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.419-425
• /
• 2008

For $q^5-q^3-q^2-q+1{\leq}d{\leq}q^5-q^3-q^2$, we prove the non-existence of a $[g_q(6,d),6,d]_q$ code and we give a $[g_q(6,d)+1,6,d]_q$ code by constructing appropriate 0-cycle in the projective space, where $g_q (k,d)={{\sum}^{k-1}_{i=0}}{\lceil}\frac{d}{q^i}{\rceil}$. Consequently, we have the minimum length $n_q(6,d)=g_q(6,d)+1\;for\;q^5-q^3-q^2-q+1{\leq}d{\leq}q^5-q^3-q^2\;and\;q{\geq}3$.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.45 no.4
• /
• pp.201-210
• /
• 2009

Cast fishing gear needs some time for fishing progress, and catches and their composition by submerged time can change by several cause. Therefore, it is very importance to study fishing capacity of fishing gear by submerged time. This study is to investigate catches and their composition of shrimp trap, that is used in the coastal of the East Sea, and to find the fittest lifting time of trap. Experimental term are September 2006 and August 2007, the location is the coastal of Oho, Goseong, Gangwondo, Korea and one hundred trap is used at each casting and lifting of gear. For convenience of description, survey of 2006 and 2007 are dented as experimental code 1 and 2, and submerged time 21hr, 43hr and 66hr are dented as code A, B and C. The result of obtained from the above approach are summarized as follows: Many Northern shrimps(Pandalus eous), dominated 96.36%, are only catched in experimental code A, and in code B and C, some of coonstripe shrimp(Pandalus hypsinotus) and few morotoge shrimp(Pandalopsis japonica) are catched. CPUE of code 1A, 1B and 1C per trap were 21.67g, 29.51g and 28.48g, and those of code 2A, 2B and 2C per trap were 25.44g, 32.93g and 33.36g. Therefore, 24.66% of catch increased according as submerged time passes from 1 day to 2 days, and almost no change of catch was to be -1.1%. Carapace length of code 1A, 1B and 1C were 23.77mm, 25.00mm and 25.57mm, and those of code 2A, 2B and 2C per trap were 23.83mm, 24.95mm and 25.45mm. Thus, the more submerged time is, the less catch of small fish is and the more catch of large fish is. Consequently, fit lifting time of shrimp trap is after 2 days, and if considered trouble of fishing gear and condition of catch, the fittest lifting time is the third successive day of casting date.

• ETRI Journal
• /
• v.45 no.1
• /
• pp.7-17
• /
• 2023

The error-rate floor of low-density parity-check (LDPC) codes is attributed to the trapping sets of their Tanner graphs. Among them, fully absorbing sets dominantly affect the error-rate performance, especially for short blocklengths. Efficient methods to identify the dominant trapping sets of LDPC codes were thoroughly researched as exhaustively searching them is NP-hard. However, the existing methods are ineffective for Raptor-like LDPC codes, which have many types of trapping sets. An effective method to identify dominant fully absorbing sets of Raptor-like LDPC codes is proposed. The search space of the proposed algorithm is optimized into the Tanner subgraphs of the codes to afford time-efficiency and search-effectiveness. For 5G New Radio (NR) base graph (BG) 2 LDPC codes for short blocklengths, the proposed algorithm finds more dominant fully absorbing sets within one seventh of the computation time of the existing search algorithm, and its search-effectiveness is verified using importance sampling. The proposed method is also applied to 5G NR BG1 LDPC code and Advanced Television Systems Committee 3.0 type A LDPC code for large blocklengths.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.78-80
• /
• 2017

3D 프린터를 이용하여 출력을 하기 위해서는 3D 모델 데이터를 G-code로 변환하는 과정을 수행해야 한다. 일반적으로 3D 모델은 STL 파일 형식으로 저장되는데, 이 파일은 대개 삼각형 형식인 페이셋들의 좌표 데이터를 포함하고 있다. 만약 3D 모델의 크기가 커지거나 정밀도가 높아진다면, 페이셋의 수가 매우 많아지게 되고, 결과적으로 3D 모델에서 G-code로 변환하는 시간이 길어지게 된다. 본 논문에서는 널리 활용되고 있는 Hadoop에서 변환 소프트웨어를 개발하고자 하였다. Hadoop은 마스터 노드와 여러 데이터 노드들이 Map-Reduce 방식으로 작업을 수행한다. 이러한 노드들은 하둡 파일시스템(HDFS)을 공유할 수 있어 작업을 효율적으로 수행할 수 있다. 이에 본 논문에서는 이 시스템의 기능을 활용하여 기존에 개발된 분산 알고리즘을 변형한 후 이를 구현하고자 한다.

• Journal of the Korean Institute of Gas
• /
• v.21 no.6
• /
• pp.1-7
• /
• 2017

This study is aimed to investigate the US code and European code on the evaluation of fuel economy of natural gas vehicles and deduce the formula suitable for domestic natural gas fuel. The fuel consumption formula have been derived by carbon balance relation between fuel composition and exhaust emission. The US code does not limit the composition of the test gas, but European code should be used the reference gases such as G20 and G23. In the case of NGV using domestic city gas, it is confirmed that the fuel economy determined by European code is 12% worse than that of US code because of difference of test gas. Also, a method of determining the fuel properties from the calorific value is proposed to evaluate the fuel economy of natural gas vehicles.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.1
• /
• pp.11-16
• /
• 2020

3D printing is one of the emerging technologies and getting a lot of attention. To do 3D printing, 3D model is first generated, and then converted to G-code which is 3D printer's operations. Facet, which is a small triangle, represents a small surface of 3D model. Depending on the height or precision of the 3D model, the number of facets becomes very large and so the conversion time from 3D model to G-code takes longer. Apach Hadoop is a software framework to support distributed processing for large data set and its application range gets widening. In this paper, Hadoop is used to do the conversion works time-efficient way. 2-phase distributed algorithm is developed first. In the algorithm, all facets are sorted according to its lowest Z-value, divided into N parts, and converted on several nodes independently. The algorithm is implemented in four steps; preprocessing - Map - Shuffling - Reduce of Hadoop. Finally, to show the performance evaluation, Hadoop systems are set up and converts testing 3D model while changing the height or precision.

• The Journal of the Korea Contents Association
• /
• v.5 no.4
• /
• pp.150-159
• /
• 2005

With the increase of interest in ubiquitous computing, image code is attracting attention in various areas. Image code is important in ubiquitous computing in that it can complement or replace RFID (radio frequency identification) in quite a few areas as well as it is more economical. However, because of the difficulty in reading precise colors due to the severe distortion of colors, its application is quite restricted by far. In this paper, we present an efficient method of image code recognition including automatically locating the image code using the hue and saturation values. In our experiments, we use an image code whose design seems most practical among currently commercialized ones. This image code uses six safe colors, i.e., R, G, B, C, M, and Y. We tested for 72 true-color field images with the size of $2464{\times}1632$ pixels. With the color calibration based on the histogram, the localization accuracy was about 96%, and the accuracy of color classification for localized codes was about 91.28%. It took approximately 5 seconds to locate and recognize the image code on a PC with 2 GHz P4 CPU.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.7 s.98
• /
• pp.697-708
• /
• 2005

The forward link of the 3G CDMA system may become limited under the increasing of the number of users. The conventional channelization code, Walsh code, has not enough sizes f3r much possible users, therefore, the quasi orthogonal function(QOF), which process optimal crosscorrelation with Walsh code, is considered. In this paper, we investigate quasi orthogonal function on Jacket matrices, which can lead lower correlations values and better performance in 3G CDMA system. Moreover, to simplify the detector and improve the BER performance, a novel detection for QOF CDMA system is proposed. Finally, the simple recursive generation of the bent sequences for QOF mask function is discussed.