• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.157-162
• /
• 2016

The performance of turbo-like codes highly depends on their frame size and thus, the bit error rate performance of turbo-like codes can be improved by increasing the frame size. Unfortunately, increasing the frame size of channel codes induces some drawbacks such as the increase of not only encoding and decoding complexity but also transmission and decoding latencies. On the other hand, a faster than Nyquist (FTN) transmission causes intentional inter-symbol interference (ISI) and thus, induces some correlation among the transmission symbols. In this paper, we propose an FTN transmission with multiple channel codes. By exploiting the correlation among the modulated symbols, multiple code frames can be regarded as a code frame with a lager frame size. Due to the inherent parallel encoding scheme of proposed scheme, parallel decoding can be easily implemented.

• Proceedings of the KSME Conference
• /
• 2000.04b
• /
• pp.777-782
• /
• 2000

The flow fields in the volute casing of a small-size turbo-compressor at different flowrate (design point ${\pm}20%$) are studied by numerical analysis. The governing equations for three-dimensional steady viscous flow are solved using SIMPLE algorithm with commercial code of STAR-CD. Numerical results show that the three-dimensional flow pattern inside the volute casing of a small-size turbo-compressor is strongly influenced by secondary flows that are typically created by the curvature or the casing passages. The flow pattern in the casing also affects the performance of the turbo-compressor. In order to elucidate the loss mechanism through the volute, we prepared the secondary flow, velocity magnitude, and static pressure distribution at the four cross-sectional planes of the casing.

• Korean Management Science Review
• /
• v.11 no.3
• /
• pp.55-65
• /
• 1994

Given the flow matrix, plant size and department sizes, the algorithms in this paper provide the layout with rectilinear distance. To construct automated facility design, cut tree approach is employed. A branch and bound computer code developed by Tillinghast is modifided to find the feasible fits of departments without shape distortion in the plant rectangle.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1481-1488
• /
• 2009

A construction of Cartesian authentication codes over unitary geometry is presented and its size parameters are computed. Assuming that the encoding rules are chosen according to a uniform probability distribution, the probabilities of success for different types of attacks are also computed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1956-1969
• /
• 1993

The tilted Huffman trees are used in JPEG and MPEG image compression standards for Huffman coding. In this paper we propose a new decoding technique for Huffman code, symbols are decoded by repeatedly obtaining the predefined number of consecutive bits and accessing symbol tables based on the obtaining bits. We show that the size of the symbol table can be small if the Huffman tree is tilted. Specifically, we show an upper bound on the size in this paper. Since the proposed method processes multiple bits at each clock, it can be used for real time processing. We show such evaluation results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.6
• /
• pp.628-646
• /
• 2009

Users want to browse and search various web contents with mobile devices which can be used anywhere and anytime without limitations, in the same manner as desktop. But mobile devices have limited resources compared to desktop in terms of computing performance, network bandwidth, screen size for full browsing, and etc, so there are many difficulties in providing support for mobile devices to fully use desktop-based web contents. Recently, mobile network bandwidth has been greatly improved, however, since mobile devices cannot provide the same environment as desktop, users still feel inconvenienced. To provide web contents optimized for each user device, there have been studies about analyzing code to extract blocks for adaptation to a mobile environment. But since web contents are divided into several items such as menu, login, news, shopping, etc, if the block dividing basis is limited only to code or segment size, it will be difficult for users to recognize and find the items they need. Also it is necessary to resolve interface issues, which are the biggest inconvenience for users browsing in a mobile environment. In this paper, we suggest a personalized adaptation system that extracts item blocks from desktop-based web contents based on user interests, layers them, and adapts them for users so they can see preferred contents first.

• Journal of Satellite, Information and Communications
• /
• v.10 no.2
• /
• pp.19-23
• /
• 2015

In this paper, we present the return link ACM method to improve the link availability and system throughput for satellite communication service. Also, we describe the optimization of an algorithm for channel prediction using the LMS (Least Mean Square) adaptive filter and the MODCOD (Modulation & Code rate) decision. The simulation results show that the optimized filter taps and step-size of adaptive filter are 2 and 0.00026, respectively. And also confirms the required SNR margin for minimization of MODCOD decision error is 0.3dB.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.28 no.5
• /
• pp.373-381
• /
• 2017

DBS(Doppler Beam Sharpening) algorithm is a way to improve azimuth resolution performance in radar. Since DBS image includes the is information about the search area of radar, various clutter components exist besides the target to be detected. To detect and track the desired target in a DBS image, it must be able to identify a target and the clutter components. In this paper, we describe how to use image size and terrain information(DTED) to identify the target in a DBS image. By using morphological filter and chain code, it acquires image size and excludes the clutter components. By matching with DTED, we determine target.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.2
• /
• pp.207-217
• /
• 1993

In this paper, knowing a priori probability of phase offset between transmitted codes and reference codes in the receiver, we construct the state diagram of acquisition process of the direct sequence spread-spectrum communication system using the expanding window search. The scannings are performed from the cell with higher probability code epoch synchronization to that with lower one. We expand window size from initial value by r times of its previous size in each search, construct the corresponding the state diagrams, and derive average synchronization time using the Markov process and Mason's gain formula. Average synchronization times versus number of search n and detection probability $P_d$ are calculated.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.537-539
• /
• 2007

Telemetry processing system requires minimum bit transition level in data streams to maintain a bit synchronization while receiving telemetry signal. PN code has a capability of providing the bit transition and is widely used in the packet communication of CCSDS. CCSDS PN code that generator polynomial is $h(x)=x^{8}+x^{7}+x^{5}+x^{3}+1$, and the random bit sequence that is generated from this polynomial is repeated with the cycle of 255 bits. As the resolution of satellite image increases, the size and transmission rate of data increases. To process of huge and bulky size of satellite image, the speed of CCSDS PN Processing is very important. This paper introduces the way of improving the CCSDS PN Processing speed through processing 128 bits at one time using the feature of cyclic structure that repeats after first 255 bytes by grouping the random bit sequence with 1 byte and Intel Streaming SIMD Extensions 2. And this paper includes the comparison data of processing speed between SSE2-applied implementation and not-applied implementation, in addition, the measured value of speed improvement.