• Journal of computational fluids engineering
• /
• v.13 no.4
• /
• pp.114-125
• /
• 2008

Current state and perspective of DNS of turbulence and turbulent combustion are discussed with feature trend of the fastest supercomputer in the world. Based on the perspective of DNS of turbulent combustion, possibility of perfect simulations of IC engine is shown. In 2020, the perfect simulation will be realized with 30 billion grid points by 1EXAFlops supercomputer, which requires 4 months CPU time. The CPU time will be reduced to about 4 days if several developments were achieved in the current fundamental researches. To shorten CPU time required for DNS of turbulent combustion, two numerical methods are introduced to full-explicit full-compressible DNS code. One is compact finite difference filter to reduce spatial resolution requirements and numerical oscillations in small scales, and another is well-known point-implicit scheme to avoid quite small time integration of the order of nanosecond for fully explicit DNS. Availability and accuracy of these numerical methods have been confirmed carefully for auto-ignition, planar laminar flame and turbulent premixed flames. To realize DNS of IC engine with realistic kinetic mechanism, several DNS of elemental combustion process in IC engines has been conducted.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03a
• /
• pp.359-366
• /
• 2008

Current state and perspective of DNS of turbulence and turbulent combustion are discussed with feature trend of the fastest supercomputer in the world. Based on the perspective of DNS of turbulent combustion, possibility of perfect simulations of IC engine is shown. In 2020, the perfect simulation will be realized with 30 billion grid points by 1EXAFlops supercomputer, which requires 4 months CPU time. The CPU time will be reduced to about 4 days if several developments were achieved in the current fundamental researches. To shorten CPU time required for DNS of turbulent combustion, two numerical methods are introduced to full-explicit full-compressible DNS code. One is compact finite difference filter to reduce spatial resolution requirements and numerical oscillations in small scales, and another is well-known point-implicit scheme to avoid quite small time integration of the order of nanosecond for fully explicit DNS. Availability and accuracy of these numerical methods have been confirmed carefully for auto-ignition, planar laminar flame and turbulent premixed flames. To realize DNS of IC engine with realistic kinetic mechanism, several DNS of elemental combustion process in IC engines has been conducted.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.10a
• /
• pp.359-366
• /
• 2008

Current state and perspective of DNS of turbulence and turbulent combustion are discussed with feature trend of the fastest supercomputer in the world. Based on the perspective of DNS of turbulent combustion, possibility of perfect simulations of IC engine is shown. In 2020, the perfect simulation will be realized with 30 billion grid points by 1EXAFlops supercomputer, which requires 4 months CPU time. The CPU time will be reduced to about 4 days if several developments were achieved in the current fundamental researches. To shorten CPU time required for DNS of turbulent combustion, two numerical methods are introduced to full-explicit full-compressible DNS code. One is compact finite difference filter to reduce spatial resolution requirements and numerical oscillations in small scales, and another is well-known point-implicit scheme to avoid quite small time integration of the order of nanosecond for fully explicit DNS. Availability and accuracy of these numerical methods have been confirmed carefully for auto-ignition, planar laminar flame and turbulent premixed flames. To realize DNS of IC engine with realistic kinetic mechanism, several DNS of elemental combustion process in IC engines has been conducted.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3353-3370
• /
• 2016

The way of combination of Product Perfect Codes (PPCs) is based on the theory of short codes constructing long codes. PPCs have larger embedding rate than Hamming codes by expending embedding columns in a coding block, and they have been proven to enhance the performance of the F₅ steganographic method. In this paper, the proposed modified product codes called MPCs are introduced as an efficient way to embed more data than PPCs by increasing 2^r₂-1-r₂ embedding columns. Unlike PPC, the generation of the check matrix H in MPC is random, and it is different from PPC. In addition a simple solving way of the linear algebraic equations is applied to figure out the problem of expending embedding columns or compensating cases. Furthermore, the MPCs over ℤ₄ have been proposed to further enhance not only the performance but also the computation speed which reaches O(n₁+σ). Finally, the proposed ℤ₄-MPC intends to maximize the embedding rate with maintaining less distortion , and the performance surpasses the existing improved product perfect codes. The performance of large embedding rate should have the significance in the high-capacity of covert communication.

• Journal of Communications and Networks
• /
• v.2 no.1
• /
• pp.76-84
• /
• 2000

Communication systems, including cell-based mobile communication systems, multiple satellite communication systems of multi-beam satellite systems, require reliable handoff methods between cell-to-cell, satellite-to-satellite of beam-to-team, respectively. Recent measurement of a CDMA cellular system indicates that the system is in handoff at about 35% to 70% of an average call period. Therefore, system reliability during handoff is one of the major system performance parameters and eventually becomes a factor in the overall system capacity. This paper presents novel and improved techniques for handoff in cellular communications, multi-beam and multi-satellite systems that require handoff during a session. this new handoff system combines the soft handoff mechanism currently implemented in the IS-95 CDMA with code and packet diversity combining techniques and an iterative decoding algorithm (Turbo Coding). the Turbo code introduced by Berrou et all. has been demonstrated its remarkable performance achieving the near Shannon channel capacity [1]. Recently. Turbo codes have been adapted as the coding scheme for the data transmission of the third generation international cellular communication standards : UTRA and CDMA 2000. Our proposed encoder and decoder schemes modified from the original Turbo code is suitable for the code and packet diversity combining techniques. this proposed system provides not only an unprecedented coding gain from the Turbo code and it iterative decoding, but also gain induced by the code and packet diversity combining technique which is similar to the hybrid Type II ARQ. We demonstrate performance improvements in AWGN channel and Rayleigh fading channel with perfect channel state information (CSI) through simulations for at low signal to noise ratio and analysis using exact upper bounding techniques for medium to high signal to noise ratio.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.1
• /
• pp.19-26
• /
• 2022

This paper presents a pre-processing method to facilitate the container's BIC-code recognition. We propose a network that can find ROI(Region Of Interests) containing a BIC-code region and estimate a homography matrix for warping. Taking the structure of STN(Spatial Transformer Networks), the proposed network consists of next 3 steps, ROI detection, homography matrix estimation, and warping using the homography estimated in the previous step. It contributes to improving the accuracy of BIC-code recognition by estimating ROI and matrix using the proposed network and correcting perspective distortion of ROI using the estimated matrix. For performance evaluation, five evaluators evaluated the output image as a perfect score of 5 and received an average of 4.25 points, and when visually checked, 224 out of 312 photos are accurately and perfectly corrected, containing ROI.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.85-88
• /
• 2005

Space-time code is a good solution to get transmit diversity. During the last years a number of space-time block codes have been proposed for use in multiple transmit antenna systems. This code, however, was presented only for the special case of the certain numbers of transmit antennas and the certain modulation schemes. and designed under the assumption that the transmitter has no knowledge about the channel. In this work, on the other hand, we consider the case when the transmitter has partial, but not perfect knowledge about the channel. This system can have full diversity for arbitrary number of the transmit antennas with a little bits of feedback.

• Journal of computational fluids engineering
• /
• v.6 no.2
• /
• pp.32-39
• /
• 2001

Hypersonic analysis on the KSR-Ⅲ payload configuration has been performed using an axisymmetric Navier-Stokes code. A numerical code based on the Harten and Yee's upwind TVD scheme with simplified curve fits in the chemically reacting equilibrium air was developed. The carbuncle phenomenon on detached shock in front of the payload is controlled by using pressure gradients to tune the dissipation. Chemically reacting equilibrium computations for the reentry flight conditions of Mach No. 10.2, 8, 4.9 are presented and compared with the results of calorically perfect gas.

• Journal of Communications and Networks
• /
• v.12 no.6
• /
• pp.605-615
• /
• 2010

Intercarrier interference (ICI) in orthogonal frequency division multiplexing (OFDM) systems, which causes substantial performance degradation in time-varying fading channels, is analyzed. An equivalent spreading code formulation is derived based on the analogy of OFDM and code division multiple access (CDMA) systems. Techniques as linear multiuser detection in CDMA systems are applied to suppress the ICI in OFDM systems. The performance of linear detection, measured using multiuser efficiency and asymptotic multiuser efficiency, is analyzed given the assumption of perfect channel state information (CSI), which serves as an upper bound for the performance of practical systems. For systems without CSI, time domain and frequency domain channel estimation based linear detectors are proposed. The performance gains and robustness of a linear minimum mean square error (LMMSE) filter over a traditional filter (TF) and matched filter (MF) in the high signal-to-noise ratio (SNR) regime are demonstrated with numerical simulation results.

• Journal of Advanced Navigation Technology
• /
• v.11 no.2
• /
• pp.170-176
• /
• 2007

In this paper, we improve performance for system when the carrier recovery signal is not perfect in the multipath mobile wireless communication fast fading channel based on DS-CDMA system. In the case, we use the phase estimation, diversity and adaptive FEC code technique in order to overcome this carrier phase error and mobile wireless fading. As a results in DS-CDMA system, we know that the appropriate use of diversity and adaptive FEC code technique reduced considerably performance degradation due to phase error.