• Geophysics and Geophysical Exploration
• /
• v.16 no.4
• /
• pp.211-216
• /
• 2013

In general, smoothing filters regularize functions by reducing differences between adjacent values. The smoothing filters, therefore, can regularize inverse solutions and produce more accurate subsurface structure when we apply it to full waveform inversion. If we apply a smoothing filter with a constant coefficient to subsurface image or velocity model, it will make layer interfaces and fault structures vague because it does not consider any information of geologic structures and variations of velocity. In this study, we develop a selective smoothing regularization technique, which adapts smoothing coefficients according to inversion iteration, to solve the weakness of smoothing regularization with a constant coefficient. First, we determine appropriate frequencies and analyze the corresponding wavenumber coverage. Then, we define effective maximum wavenumber as 99 percentile of wavenumber spectrum in order to choose smoothing coefficients which can effectively limit the wavenumber coverage. By adapting the chosen smoothing coefficients according to the iteration, we can implement multi-scale full waveform inversion while inverting multi-frequency components simultaneously. Through the successful inversion example on a salt model with high-contrast velocity structures, we can note that our method effectively regularizes the inverse solution. We also verify that our scheme is applicable to field data through the numerical example to the synthetic data containing random noise.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6A
• /
• pp.405-419
• /
• 2012

In this paper, we propose a joint base station(BS) and relay precoders design in multi-relay aided multi-user all-multiple-input multiple-output(MIMO) system. The design criterion is to minimize user sum mean square error(SMSE) with relay sum power constraint(RSPC) where only local channel state information(CSI)s are available at relays. Local CSI at a relay is defined as the CSI of the channel which the relay itself accesses, out of among all the 1st hop and the 2nd hop channel in the system. With BS precoder structure which is concatenated with block diagonalization(BD) precoder, each relay can determine its own precoder using only local CSI. Proposed scheme is based on sequential iteration of two stages; stage 1 determines BS precoder and relay precoders jointly with SMSE duality, and stage 2 determines user receivers. Proposed scheme can be demonstrated theoretically to be always converge. We verify that proposed scheme outperforms simple amplify-and-forward(SAF), MMSE relay, and proposed schemes in [1] in terms of both SMSE and sum-rate performances.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.14 no.2
• /
• pp.317-324
• /
• 1994

The circulation of Lake Paldang is analysed numerically as an ultimate goal to develop a vehicle predicting the dispersion and concentration of pollutants and sediment flowed into the lake. In finite difference formulation of 2-D depth averaged governing equations. Abbott's 3-time level scheme is employed and for nonlinear terms time centering iteration technique in time and space is used. Model parameters for shear stresses and eddy diffusivities are determined through measured data in and near the lake. Predicted velocities for steady flow are shown to be close to the measured velocities and further improved by taking into account of wind effect. This indicates that the wind effect is needed for proper circulation analysis and it calls for the inclusion of the wind effect. Simulated results of unsteady flow caused by flood inflows and release through Paldang dam are found to characterize the flow features quite well as expected. This implies that the developed model can be used as a tool to analysing the circulation in the lake.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.12
• /
• pp.91-102
• /
• 2005

Recently, concurrent error detection for the processor becomes important. But it imposes too much overhead to adopt concurrent error detection capability on the system. In this paper, a new approach to resolve the problems of concurrent error detection is proposed. A loop detection scheme is introduced to reduce the repetitive loop iteration and memory access. To reduce the memory overheat an offset to calculate the target address of branching node is proposed. Performance evaluation shows that the new architecture has lower memory overhead and frequency of memory access than previous works. In addition, the new architecture provides the same error coverage and requires nearly constant memory size regardless of the size of the application program. Consequently, the proposed architecture can be used as an cost effective method to detect control flow errors in the commercial on the shelf products.

• Journal of Korea Multimedia Society
• /
• v.15 no.4
• /
• pp.526-539
• /
• 2012

This paper proposes a high capacity data hiding method using high frequence secret data indexing algorithm. Many novel data hiding methods based on LSB and PVD methods were presented to enlarge hiding capacity and provide an imperceptible quality. In this paper, first, calculating data iteration frequency of the secret message and make up the high frequency data index matrix (HFDT) using high frequence data's location information. Next, HFDT uses to that data hiding process on the cover image and recovering process on the stego image. The experimental results demonstrate the efficiency of the proposed high frequency secret data indexing method. For the data hiding method, experiments are conducted for four cases: 2 pattern secret data (2PD), 4 pattern secret data (4PD), 8 pattern secret data (8PD) and higher pattern secret data (HPD). When comparing the proposed method with other data hiding methods, for the HPD case, the results show that the proposed method has a good PSNR and more capacity, and for the other case, the results show that the proposed method has a higher PSNR and larger capacity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.1
• /
• pp.45-51
• /
• 2016

In this paper, we develop an iterative maximum likelihood (ML) receiver for generalized spatial modulation systems. In the proposed ML receiver, to mitigate the deleterious effect of channel information errors on symbol detection, the instantaneous covariance matrix of effective noise is estimated, which is then used to obtain improved ML solutions. The estimated covariance matrix is updated through multiple iterations to enhance the estimation accuracy. The simulation results show that the proposed ML receiver outperforms the conventional ML detection scheme, which does not take the effect of channel information errors into account.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.25-36
• /
• 2004

This paper proposes and measures the performance of a distributed EIT (Electrical Impedance Tomography) image reconstruction algorithm which has a master-slave structure. The image construction is a computation based application of which the execute time is proportional to the cube of the unknowns. After receiving a specific frame from the master, each computing node extracts the basic elements by executing the first iteration of Kalman Filter in parallel. Then the master merges the basic element lists into one group and then performs the sequential iterations with the reduced number of unknowns. Every computing node has MATLAB functions as well as extended library implemented for the exchange of MATLAB data structure. The master implements another libraries such as threaded multiplication, partitioned inverse, and fast Jacobian to improve the speed of the serial execution part. The parallel library reduces the reconstruction time of image visualization about by half, while the distributed grouping scheme further reduces by about 12 times for the given target object when there are 4 computing nodes.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.6
• /
• pp.1620-1632
• /
• 1998

This paper presents a fast parallel algorithm for volume rendering and its implementation using C language and MPI MasPar Programming Language) on the 4,096 processor MasPar MP-2 machine. This parallel algorithm is a parallelization hased on the Lacroute' s sequential shear - warp algorithm currently acknowledged to be the fastest sequential volume rendering algorithm. This algorithm reduces communication overheads by using the sheared space partition scheme and the load balancing technique using load estimates from the previous iteration, and the number of voxels to be processed by using the run-length encoded volume data structure.Actual performance is 3 to 4 frames/second on the human hrain scan dataset of $128\times128\times128$ voxels. Because of the scalability of this algorithm, performance of ]2-16 frames/sc.'cond is expected on the 16,384 processor MasPar MP-2 machine. It is expected that implementation on more current SIMD or MIMD architectures would provide 3O~60 frames/second on large volumes.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.19 no.1
• /
• pp.9-17
• /
• 2015

The basic flow configuration is composed of a plane, double shear layer where relatively thin mid gas layer is sandwiched between air and fuel stream. The present study describes numerical investigations concerning the combustion enhancement according to a variation of mid layer thickness. In this case, the effect of heat release in turbulent mixing layers is important. For the numerical solution, a fully conservative unsteady $2^{nd}$ order time accurate sub-iteration method and $2^{nd}$ order TVD scheme are used with the finite volume method including k-${\omega}$ SST model. The results consists of three categories; single shear layer consists of fuel and air, inert gas sandwiched between fuel and air, cold fuel gas sandwiched between fuel and air. The numerical calculations has been carried out in case of 1, 2, 4 mm of mid layer thickness. The height of total gas stream is 4 cm. The combustion region is broadened in case of inert gas layer of 2, 4 mm thickness and cold fuel layer of 4 mm thickness compared with single shear layer.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.10
• /
• pp.2143-2149
• /
• 2012

DVB-S2 employs LDPC codes which approach to the Shannon's limit, since it has characteristics of a good distance, error floor does not appear. Furthermore it is possible to processes full parallel processing. However, it is very difficult to high speed decoding because of a large block size and number of many iterations. This paper present HSS algorithm to reduce the iteration numbers without performance degradation. In the flooding scheme, the decoder waits until all the check-to-variable messages are updated at all parity check nodes before computing the variable metric and updating the variable-to-check messages. The HSS algorithm is to update the variable metric on a check by check basis in the same way as one code draws benefit from the other. Eventually, LDPC decoding speed based on HSS algorithm improved 30% ~50% compared to conventional one without performance degradation.