• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.27-33
• /
• 2013

In this paper, we propose a pilot based channel estimation technique in two-way relay networks. We propose to transmit a pilot symbol together with the data symbol during transmission. In absence of Channel State Information (CSI), destination uses the pilot symbol to estimate the channel. In this system, the relay amplifies the pilot and the data symbol then forward them to the destination using amplify and forward (AF) protocol. We assume that the relay gain is fixed, so the relay does not need to estimate the channel, the destination only estimate the channel. We apply well-known Least-square (LS) and minimum mean-square error (MMSE) channel estimation methods to estimate the channel.

• The KIPS Transactions:PartC
• /
• v.15C no.1
• /
• pp.69-78
• /
• 2008

In this paper, we propose the effective exchange-method of a user profile for adapted contents services in the contents adaptation system. The profiles continuously exchange among the devices of contents adaption system for providing the adapted contents to a user. The profile should be also exchanged according to periodic, aperiodic, event, request and response. Consequently, a lot of network traffic occur and computing power require. Solving theses problem, the profile exchange research needs. we analyze creation information, exchange information, and exchange form of the profile information in contents adaptation system for effective profile exchange and define exchange procedure of the profile using the analyzed profile information. we also propose providing method of the profile configured information for decreasing profile processing time and user setting method for decreasing the number of profile transmission. As a result of performance evaluation, providing method of the profile configured information reduce 7% processing time and user setting method decrease the number of profile transmission are effective to exchange the profile.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.90-95
• /
• 2002

Though the FTP(File Transfer Protocol) has been used widely and stable, It has the structural weakness that can't support current file transmissions so that we have to wait the completion of previous file transmission when try to transmit another file. If try to transmit multiple files concurrently using this FTP, It has to forking multiple FTP servers and clients in each user's PC and ISP's host machine it would result in the waist of memory, resource of network and the high workload of system. In order to solving previous problem, in this paper I have designed the new model of FTP which based on multi-thread and created NFTP(Next-Generation FTP)protocol so that may reduce the workload of system and support current file transmission effectively. I have implemented NFTP and also applied to real service, as a result It have provided reliable service by reducing the workload of system and saved the waiting time which would happened.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.1 s.116
• /
• pp.53-61
• /
• 2007

This paper researches on the scheme superimposing the rotation phases over the pilot and data symbols in order to reduce the peak-to-average power ratio(PAPR) of the orthogonal frequency division multiplexing(OFDM) communication. The bandwidth and power efficiency are the main consideration. The phases of rotation vector are added to those of both pilot symbols and data symbols interlaying between any two pilot symbols in an OFDM block. Owing to this scheme the transmitter reduces the PAPR using the partial transmit sequences(PTS) and the receiver restores the data symbol utilizing the channel estimation of pilot symbols. Therefore, the bandwidth efficiency is accomplished by not using the further subcarriers for the reduction of PAPR and the enormous increase of bit error rate according to the receiving error of the side information, i.e. the phases of rotation vector, is prevented. In other words, both bandwidth-and power-efficiency and quality of communication performance can be improved.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.520-522
• /
• 2011

위성으로부터 전송받은 Telemetry 플레이백 데이터 파일들을 적절한 크기로 또는 저장된 시간에 따라 병합하거나 분할할 수 있는 플레이백 파일 병합/분할 프로그램을 구현하였다. 기존에 플레이백 데이터가 정상적으로 수신되었는지를 점검하기 위한 플레이백 데이터 자동 분석 프로그램이 있는데, 기존의 프로그램을 윈도우 기반으로 보다 편리하게 사용할 수 있도록 전체적으로 보완하였고, 여기에 플레이백 파일 병합/분할 기능을 추가하여 전체적으로 하나로 통합하였다. 본 논문은 차세대 저궤도 위성에서 수행되는 데이터 저장 및 전송에 대한 내용과 새롭게 개선된 플레이백 데이터 자동분석 프로그램 및 플레이백 파일 병합/분할 프로그램에 대해 기술한 것이다.

• Journal of Digital Forensics
• /
• v.12 no.3
• /
• pp.97-108
• /
• 2018

Computer technology and Internet advances enable easy massive file transfer by messenger, email, and web hard service users this means that a child pornography file owner who is illegally possessing itself can quickly transfer that to other users However there are currently no specific ways to prevent or block the distribution of child pornography between messenger, email, and web hard service users. in this paper, we propose a method to prevent the distribution of child pornography using the MD5, SHA-1 hash value stored in the 'police Child pornography Profiling system' and to identify the child pornography suspects using the subscriber information. the user extracts the hash value of the file before distributing the file, compared it with police system, and if it has the same value, blocks the transmission of the file and sends warning to the owner. the service provider sends the subscriber information to investigation agency child pornography owners can conduct a quick and accurate investigation.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.287-290
• /
• 2003

최근, 인터넷을 통한 VOD와 같은 멀티미디어 서비스의 증대로 대용량 파일 서비스의 효율적인 저장 시스템과 전송 기법들이 필요하다. 본 논문에서는 현재의 인터넷 환경 하에서 VOD 서비스와 같은 대용량 파일 서비스를 위한 효율적인 부호화 기법을 제안한다. 제안한 방법은 QoS가 보장되지 않는 비동기 패킷 망에서 클라이언트 측의 네트워크 상태에 따라 정보 전송량을 조절함과 동시에 다수의 비디오 스트림을 이용한 병렬 전송과 체크 스트림을 이용한 에러 정정을 통해 버퍼링시 미전송된 블록을 복원함으로서 신뢰성 있는 전송과 네트워크의 지터에도 강하며, 클라이언트가 가진 대역폭을 최대한 활용 할 수 있는 최선의 서비스를 제공한다

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.910-912
• /
• 2002

자바 코드의 무결성(integrity)과 인증(authenticity)을 보장하기 위해, JAR파일에 대해 전자서명하는 방법이 이용되고 있다. JAR파일은 기본적으로 애플리케이션이나 애플릿의 효율적인 배포를 위해 이용된다 즉, 애플리케이션이나 애플릿을 구성하는 모든 클래스 파일이나 데이터 파일을 묶어 하나의 JAR 파일에 포함시켜 온라인 상으로 클라이언트로 이러한 JAR 파일의 내용은 변경되기 쉽다. 즉, 기존 클래스 파일의 제거, 변경 또는 새로운 클래스 파일의 추가 등으로 인해 기존 JAR파일의 내용이 변경되고, 또한 클라이언트의 요구에 맞추어 데이터나 코드를 즉시 생성하여 전송하여야 하는 경우, 새로운 JAR 파일이 생성되어야 한다. 따라서 애플리케이션 서버는 예기치 않은 JAR 파일의 변경에 맞추어 동적으로 JAR 파일에 대해 전자서명을 수행하는 기능이 포함되어야 한다. 이 논문에서는 JAR 파일의 포맷과 전자서명 절차를 분석하여, JAR 파일에 대한 전자서명의 특징과 문제점들을 제시하고, 애플리케이션 서버에서 발생 가능만 에러에 적절히 대처하면서 동적으로 JAR 파일들을 전자서명할 수 있는 프로그램 프로시저의 구현을 예시하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.1109-1112
• /
• 2005

In this paper, we evaluate the performance of pilot channel-aided channel estimation for multicarrier direct-sequence (DS) code division multiple access (CDMA) communication system as proposed by Kondo and Milstein [1]. We investigate the optimum number of pilot channels for various coherence bandwidths and different number of subchannels. Keeping the total transmit bandwidth fixed, an optimum number of total subchannels and pilot channels exists under specific channel and transmitted energy. We show that there is a tradeoff between the number of pilot channels and data subchannels, thereby requiring differing numbers of optimum pilot channels according to channel conditions.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.9
• /
• pp.197-206
• /
• 2020

Collaborative research in science applications based on HPC service needs rapid transfers of massive data between research colleagues over wide area network. With regard to this requirement, researches on enhancing data transfer performance between major superfacilities in the U.S. have been conducted recently. In this paper, we deploy multiple data transfer nodes(DTNs) over high-speed science networks in order to move rapidly large amounts of data in the parallel filesystem of KISTI's Nurion supercomputer, and perform transfer experiments between endpoints with approximately 130ms round trip time. We have shown the results of transfer throughput in different size file sets and compared them. In addition, it has been confirmed that the DTN cluster with three nodes can provide about 1.8 and 2.7 times higher transfer throughput than a single node in two types of concurrency and parallelism settings.