• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1659-1666
• /
• 1998

The multicode CDMA systems that are widely studied as an effective transmission methodology in the IMT-2000 systems, employ orthogonal codes to transform high rate data into parallel, low rate data for simultaneous transmission. In this paper, we propose a new multicode CDMA system which achieves the same data rate and processing gain of the conventional systems, while significantly improves bit error rate performance by exploiting a convolutional code with code rate r=1/2 and a bi-orthogonal code. The simulation results for synchronous systems using maximal ratio combining Rake receivers under additive white Gaussian noise and multi-path fading channels, show significant improviements by the proposed system.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2008.10a
• /
• pp.113-118
• /
• 2008

Among the geophysical methods, Ground Penetrating Radar (GPR) and Electrical Resistivity Tomography (ERT) comprise the most promising techniques in resolving buried archaeological structures in urban territories. In this work, two case studies which involve an integrated geophysical survey employing the surface three dimensional (3D) ERT and GPR techniques, in order to archaeologically characterize the investigated areas, are presented. Totally more than 4000 square meters were investigated from the test field sites, which are located at the centre of two of the most populated cities of the island of Crete, in Greece. The ERT and the GPR data were collected along dense and parallel profiles. The subsurface resistivity structure was reconstructed by processing the apparent resistivity data with a 3D inversion algorithm. The GPR sections were processed with a systematic way applying specific filters to the data in order to enhance their information context. Finally, horizontal depth slices representing the 3D variation of the physical properties were created and the geophysical anomalies were interpreted in terms of possible archaeological structures. The subsequent excavations in one of the sites verified the geophysical results, enhancing the applicability of ERT and GPR techniques in the archaeological exploration of urban territories.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1999.10a
• /
• pp.387-394
• /
• 1999

Artificial Neural Network (ANN) is a computational model inspired by the structure and operations of the brain. It is massively parallel system consisting of a large number of highly interconnected and simple processing units. The purpose of this paper is to verify the applicability of ANN to predict experimental results through the use of measured experimental data. Although there have been accumulated data based on hysteretic characteristics of structural element with cyclic loading tests, it is difficult to directly apply them for the analysis of elastic and plastic response. Thus, simple models with mathematical formula such as Bi-Linear Model, Ramberg-Osgood Model, Degrading Tri Model, Takeda Model, Slip type Model, and etc, have been used. To verify the practicality and capability of this study, ANN is adapted to several models with mathematical formula using numerical data To show the efficiency of ANN in nonlinear analysis, it is important to determine the adequate input and output variables of hysteretic models and to minimize an error in ANN process. The application example is Beam-Column joint test using the ANN in modeling of the linear and nonlinear hysteretic behavior of structure.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1940-1943
• /
• 2002

In this paper, we presented the design and implementation of 155Mbps satellite Modem adaptively compensated against the rain attenuation. In order to compensate the rain attenuation over high-speed satellite ink, the adaptive coding schemes with variable coding rates and the pragmatic TCM that can be decoded both the QPSK and TC-8PSK using same Viterbi decoder was studied and analyzed. The pragmatic TCM with rate 213, selected to the optimal parameters for implementation, was modeled by VHDL in this paper. The key design issues are how to achieve a high data rate and how to integrated into a single ASIC chip various functions such as the different data rates, Scrambler/descrambler, Interleaver, Encoder/decoder, and BPSK/QPSK/8PSK modulator/demodulator. The implemented 155M0ps adaptive MODEM has the simplified interface circuits among the many functional blocks, and parallel processing architecture to achieve the high data rate. This 155Mbps adaptive MODEM was designed and implemented by single ASIC chip with the 0.25 $\mu\textrm{m}$ CMOS standard cell technology.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.12
• /
• pp.648-654
• /
• 2002

The Virtual Interface Architecture(VIA) is an industry standard for communication over system area networks(SANs). M-VIA is a software implementation of VIA technology on Linux. In this paper, we implemented the M-VIA on an AceNIC Gigabit Ethernet by developing a new AceNIC driver for the M-VIA. We analyzed the M-VIA data segmentation processes. When a Gigabit Ethernet MTU is larger than 1514 bytes, M-VIA data segmentation size leaves much room for improvement. So we experimented with various MTU and M-VIA data segmentation size and compared the performances.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.389-393
• /
• 2008

OFDM (Orthogonal Frequency Division Multiplexing) modulation using the orthogonal subcarriers reduces the delay spread by increasing robustness to multipath fading and can use overlapped bandwidth due to orthogonality on frequency domain. Thus data rate and spectral efficiency are increased. Because of these reason, OFDM is used for high speed data transmission for multimedia transmission as HSDPA, WiBro, WLAN. However OFDM also has drawbacks that have the high PAPR (Peak to Average Power Ratio). This high PAPR takes place because of parallel processing a number of data at once using a FFT processor. By high PAPR, amplifier doesn't act in dynamic range, so that BER performance is worse. In this paper, we reduce the PAPR using SLM(Selective Mapping). SLM doesn't effect on BER performance, but should transmit the side information for demodulation [2]. Also PAPR is higher as the number of FFT processor is larger. Thus SLM has high complexity. In this paper, we analyze the performance of SLM using scaling for no side information.

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.37-44
• /
• 2002

Most researches of transforming sequential programs into parallel programs have been based on the loop structure transformation method. However, most programs have implicit interprocedure parallelism. This paper suggests a way of extracting parallelism from the loops with procedure calls using the data dependency elimination method. Most parallelization of the loop with procedure calls have been conducted for extracting parallelism from the uniform code. In this paper, we propose interprocedural transformation, which can be apply to both uniform and nonuniform code. We show the examples of uniform, nonuniform, and complex code parallelization. We then evaluated the performance of the various transformation methods using the CRAY-T3E system. The comparison results show that the proposed algorithm out-performs other conventional methods.

• Journal of Internet Computing and Services
• /
• v.14 no.1
• /
• pp.15-22
• /
• 2013

WAVE(Wireless Access for Vehicular Environment) is new concepts and Vehicles communications technology using for ITS(Intelligent Transportation Systems) service by IEEE standard 802.11p. Also it increases the efficiency and safety of the traffic on the road. However, the efficiency of Scrambler bit computational algorithms of OFDM modulation in WAVE systems will fall as it is not able to process in parallel in terms of hardware and software. This paper proposes an algorithm to configure 64-bits matrix table in scambler bit computation as well as an algorithm to compute 64-bits matrix table and input data in parallel. The proposed algorithm on this thesis is executed using 64-bits matrix table. In the result, the processing speed for 1 and 1000 times is improved about 40.08% ~ 40.27% and processing rate per sec is performed more than 468.35 compared to bit operation scramble. And processing speed for 1 and 1000 times is improved about 7.53% ~ 7.84% and processing rate per sec is performed more than 91.44 compared to 32-bits operation scramble. Therefore, if the 64 bit-CPU is used for 64-bits executable scramble algorithm, it is improved more than 40% compare to 32-bits scrambler.

• Journal of Korea Water Resources Association
• /
• v.55 no.12
• /
• pp.991-998
• /
• 2022

The purpose of this study is to develop GPU (Graphics Processing Unit) acceleration technique for 2-dimensional model and to assess the effectiveness for high resolution flood simulation in wide area In this study, GPU acceleration technique was implemented in the G2D (Grid based 2-Dimensional land surface flood model) model, using implicit scheme and uniform square grid, by using CUDA. The technique was applied to flood simulation in Jinju-si. The spatial resolution of the simulation domain is 10 m × 10 m, and the number of cells to calculate is 5,090,611. Flood period by typhoon Mitag, December 2019, was simulated. Rainfall radar data was applied to source term and measured discharge of Namgang-Dam (Ilryu-moon) and measured stream flow of Jinju-si (Oksan-gyo) were applied to boundary conditions. From this study, 2-dimensional flood model could be implemented to reproduce the measured water level in Nam-gang (Riv.). The results of GPU acceleration technique showed more faster flood simulation than the serial and parallel simulation using CPU (Central Processing Unit). This study can contribute to the study of developing GPU acceleration technique for 2-dimensional flood model using implicit scheme and simulating land surface flood in wide area.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.640-643
• /
• 2003

A Walsh function based associative memory is capable of storing m patterns in a single pattern storage space with Walsh encoding of each pattern. Furthermore, each stored pattern can be matched against the stored patterns extremely fast using algorithmic parallel processing. As such, this special type of memory is ideal for real-time processing of large scale information. However this incredible efficiency generates large amount of crosstalk between stored patterns that incurs mis-recognition. This crosstalk is a function of the set of different sequencies [number of zero crossings] of the Walsh function associated with each pattern to be stored. This sequency set is thus optimized in this paper to minimize mis-recognition, as well as to maximize memory saying. In this paper, this Walsh memory has been applied to the problem of face recognition, where PCA is applied to dimensionality reduction. The maximum Walsh spectral component and genetic algorithm (GA) are applied to determine the optimal Walsh function set to be associated with the data to be stored. The experimental results indicate that the proposed methods provide a novel and robust technology to achieve an error-free, real-time, and memory-saving recognition of large scale patterns.