• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.12
• /
• pp.10-19
• /
• 2001

In this paper, we propose an effective but simple multi-rate parallel interference canceller(PIC) for the international mobile telecommunications-2000(IMT-2000) 3rd generation partnership project (3GPP) system. For effective multi-rate processing, we define the basic block as one symbol period of the dedicated physical control channel(DPCCH) having the lowest data rate and common to all users. Then, decision and interference cancellation are performed at every basic block. For an asynchronous channel, we propose an advance removal scheme that removes in advance multiple access interference(MAI) due to the next blockof other users with shorter delay. Introducing a pipeline structure at a sample base, we can implement efficiently the PIC using the advance removal scheme with a minimum hardware and no extra computations. Through computer simulations, we analyze the bit error rate(BER) performance of the proposed PIC with respect to signal-to-noise ratio(SNR) and the number of users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.83-91
• /
• 1993

In the digital transmission system, cyclic redundancy check(CRC) code is widely used because it is easy to be implemented and has good performance in error detection. CRC code generator consists of several shift registers and modulo 2 adders. After manipulation of input data stream in the encoder, the remaining value of shift registers becomes CRC code. At the receiving side, error can be detected and corrected by CRC codes immediately transmitted after data stream. But, in the high speed system such as an A TM switch, it is difficult to implement the serial CRC encoder because of speed limitation of available semiconductor devices. In this paper, we propose the efficient parallel CRC encoder and syndrome calculator to solve the speed problem in implementing these functions using the existing semiconductor technology.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.5
• /
• pp.85-92
• /
• 2000

In this paepr, a multicode CDMA scheme with serial and parallel structure as the transmission scheme of wireless LAN which can transmit high speed data under an indoor channel environment is modeled and optimal values of several parameters needed for implementing wireless LAN modern system are derived through computer simulation. it is verified that given the transmission bandwidth and maximum data rate, the system performance is improved if increasing spreading gain anf the number of channels or decreasing the data rate of each channel. Especially the parallel structure makes not only the system performance much more improved but also the hardware implementation easier than serial structure under the same condition because the effective chip rate is decreased.

• Journal of Advanced Navigation Technology
• /
• v.16 no.5
• /
• pp.781-786
• /
• 2012

In this paper, we propose the design and performance of an unequal divider using transmission line with periodic capacitor shunt connection. To design divider with a high dividing ratio, we limit a high impedance line value to fabricate microstrip line and also, design a low impedance line of below $10{\Omega}$ using periodic capacitor shunt connection. As a design example, a 10:1 ratio divider was designed and measured at center frequency 1 GHz to show the validity of the unequal divider using periodic capacitor shunt connection. Its performance is in good agreements with the simulated results.

• Journal of Internet Computing and Services
• /
• v.18 no.2
• /
• pp.53-60
• /
• 2017

Since processors are handling inputs and outputs independently on distributed memory computers, different file input/output methods are used. In this paper, we implemented and compared various file I/O methods to show their efficiency on distributed memory parallel computers. The implemented I/O systems are as following: (i) parallel I/O using NFS, (ii) sequential I/O on the host processor and domain decomposition, (iii) MPI-IO. For performance analysis, we used a separated file server and multiple processors on one or two computational servers. The results show the file I/O with NFS for inputs and sequential output with domain composition for outputs are best efficient respectively. The MPI-IO result shows unexpectedly the lowest performance.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.10
• /
• pp.766-770
• /
• 2009

Recently, users of multimedia files demand a high capacity file via internet. However, it is difficult to guarantee QoS for high capacity files on internet because of its inconstant bandwidth. For guaranteeing the QoS, CDN (Content Delivery Network) is generally used for contents delivery service. Based on CDN, we propose Content Distribution and Management using Metadata (CDM) system which provides advanced transmission method and searching method. To enhance the transmission rate, CDM system supports segment-unit-based transmission method that enables parallel transmission. Also, we propose a distribution method through content based search.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.771-773
• /
• 1998

광선 추적법(Ray-Tracer)은 물체에 직.간접적으로 영향을 미치는 빛의 반사 및 굴절 경로를 역추적함으로써 실제감있는 이미지를 생성하는 렌더링(rendering)기법이다. 이러한 광성 추적법을 장시간의 계산을 필요로 하는 단점이 있으나. 각각의 광선을 병렬적으로 추적함으로써 속도의 향상을 피할 수 있다. 본 논문에서는 자바를 사용하는 메시지 기반 병렬 프로그래밍 시스템인 JPVM 상에서 동작하는 병렬 광선 추적기를 구현하였다. 병렬 광성 추적기를 사용자에 의해 지정된 장면 정의 파일(Scene Defintion File)을 읽어 들여 피싱(parsing)한후, 생성된 장면 객체를 각 worker프로그램에게 전송한다. 병렬 광선 추적기는 전체 화면 영역을 분활하여 각 worker 프로그램에 할당하며, worker프로그램들은 자신에게 할당된 영역의 이미지를 병렬적으로 생성한다. 실험 결과, 병렬 광선 추적기는 단일 광선 추적기에 비해 빠르게 렌더링을 수행하였으며, worker프로그램의 수가 증가함에 따라 수행 속도가 향상되었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8C
• /
• pp.670-679
• /
• 2012

The recent dissemination of cloud computing makes the amount of data storage to be increased and the cost of storing the data grow rapidly. Accordingly, data and service requests from users also increases the load on the cloud storage. There have been many works that tries to provide low-cost and high-performance schemes on distributed file systems. However, most of them have some weaknesses on performing parallel and random data accesses as well as data accesses of frequent small workloads. Recently, improving the performance of distributed file system based on caching technology is getting much attention. In this paper, we propose a CHPC(Cloud storage High-Performance Caching) framework, providing parallel caching, distributed caching, and proxy caching in distributed file systems. This study compares the proposed framework with existing cloud systems in regard to the reduction of the server's disk I/O, prevention of the server-side bottleneck, deduplication of the page caches in each client, and improvement of overall IOPS. As a results, we show some optimization possibilities on the cloud storage systems based on some evaluations and comparisons with other conventional methods.

• Journal of Internet Computing and Services
• /
• v.7 no.1
• /
• pp.131-141
• /
• 2006

Recently, many researchers have been studied several high performance data transmission techniques such as TCP buffer Tuning, XCP and Parallel Sockets. The Parallel Sockets is an application level library for parallel data transfer, while TCP tuning, XCP and DRS are developed on kernel level. However, parallel socket is not analyzed in detail yet and need more enhancements, In this paper, we verify performance of parallel transfer technique through several experiments and analyze character of traffic interference among socket connections. In order to enhance parallel transfer management mechanism, we predict the number of socket connections to obtain SLA of the network resource and at the same time, affected network bandwidth of existing connections is measured mathematically due to the interference of other parallel transmission. Our analytical scheme predicts very well network bandwidth for applications using the parallel socket only with 8% error.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.1102-1105
• /
• 2015

인터넷 발전이 가속화되고 SNS가 보급된 이후 과거와는 비교할 수 없을 정도로 큰 데이터 트래픽이 발생하고 있다. 기존의 DBMS는 이를 효과적으로 처리할 수 없었기 때문에 Hadoop과 같은 NoSQL이 탄생하였고, 최근 NoSQL 및 기존 SQL DBMS의 협업을 통해 유연하고 강력한 데이터 관리를 수행하는 연구가 진행되었다. 효율적인 질의 처리를 위한 대표적인 연구로 SQL 기반 분산 병렬 질의 처리 기법과 Hive등이 존재한다. 그러나 기존의 기법은 분산 병렬 환경을 고려하지 않아 SQL DBMS의 질의 결과를 효율적으로 Hive에 전송하지 못한다. 본 논문에서는 SQL DBMS에서 Hive로의 효율적인 SQL 데이터 이동을 위해 네트워크 비용을 최소화하는 기법을 제안하고, 제안하는 기법의 우수성을 제시한다.