• 정보와 통신
• /
• 제19권7호
• /
• pp.40-55
• /
• 2002

The advent of Third Generation (3G) communication systems, with their ability to process real-time multimedia applications and their large bandwidths, will greatly enhance mobile Internet access. Not only does Wideband Code Division Multiple Access (WCDMA) and cdma2000 radio technology offer an advantageous density for voice in terms of spectral efficiency, it also supports higher rates and offers differentiated levels of duality of Service (QoS) for data applications. The early introduction of packet and multimedia technologies will be a key element in realizing a quick and successful return on the operator's investments in Universal Mobile Telecommunications System (UMTS) and cdma2000.

• 한국군사과학기술학회지
• /
• 제10권2호
• /
• pp.5-11
• /
• 2007

In digital warfare, communications between combat vehicles should be managed and synchronized in order to ensure the survivability of vehicles. Embedded battle management systems is designed to share battle information with combat vehicles in real-time. In this study, the details of embedded battle management systems which are successfully implemented in combat vehicles are presented.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2007년도 추계학술발표논문집
• /
• pp.174-177
• /
• 2007

이동통신망의 규모나 서비스 등이 기하급수적으로 증가하기 때문에 데이터 트래픽에 대한 정확한 특성분석은 매우 어렵지만, 트래픽 특성분석이 망 설계나 운용에 상당한 영향을 미친다는 점을 고려하면, 데이터 트래픽 모델링에 대한 연구는 가장 기본적으로 이루어져야 할 사항이라 할 수 있다. 따라서 본 논문에서는 데이터 트래픽에 대한 특성을 분석하기 위해 cdma2000 시스템의 국제적인 표준화 단체인 3GPP2에서 언급한 HTTP, FTP, WAP, Near Real Time Video 트래픽에 대한 트래픽 특성을 분석하여 자기 유사성(Self-similarity)을 가짐을 입증하였다.

• 한국통신학회논문지
• /
• 제29권8A호
• /
• pp.879-888
• /
• 2004

본 논문에서는 이동성 IP기반 네트워크의 혼잡노드에서 MPEG 비디오 트래픽의 효율적인 전송을 위하여 QoS를 고려한 실시간 비디오 트래픽 전송기법을 제안한다. 최근의 인터넷 사용의 확산으로 실시간 멀티미디어 서비스의 요구가 급증되고 있다. 하지만 인터넷 서비스형태는 최선형 전송기법을 제공하기 때문에, 모든 형태의 차등적 COS 트래픽을 처리하기에 어려움이 있다. 일반적으로 MPEG 데이터 계층적 코딩 기법은 이동프레임의 예측에 대한 참조 프레임을 사용하는데, 이러한 참조 프레임의 손실은 비트손실로 인한 연속적인 패킷 손실로 연계될 수 있어서 비디오 트래픽의 품질을 저하시킨다. 따라서 본 논문에서는 기존의 기법들을 분석하여 QoS를 고려한 실시간 비디오 트래픽 전송기법에 대한 연구를 수행하였다. 컴퓨터 시뮬레이션을 수행하여 제안된 기법의 성능을 분석한 결과 그 성능이 개선됨을 확인하였다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2002년도 Proceedings of International Symposium on Remote Sensing
• /
• pp.810-814
• /
• 2002

According to the image level definition for KOMPSAT-2 in KOMPSAT-2 Ground Station Specification, the level 0 is frame formatted, unprocessed data at full resolution; any and all communications artifacts (e.g., synchronization frames, communications headers) removed. The level 0 is used for two purposes: 1) exchange of imagery between image receiving & processing element (IRPE), and 2) image transfer from the Receiving & Archiving Subsystem to Search & Processing Subsystem. On-board processing of imagery data of KOMPSAT-2 includes JPEG-like compression and encryption besides conventional CCSDS packetization. The encryption is used to secure imagery data from any intervention during downlink and compression allows real-time downlink of image data reducing data rate produced from the camera. While developing ground receiving system for KOMPSAT-2, it was necessarily to define level 0 products. In this paper, we will suggest level 0 product definition for KOMPSAT-2 and explain reasons of the decisions made. The key factor used while defining the level 0 products is the efficiency of whole ground receiving system. The latter half of the paper will explain the implementation of software that generates level 0 products. The necessary steps to produce level 0 products will be explained, and the performance achieved will be presented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권5호
• /
• pp.1369-1389
• /
• 2024

In the era of 6G, the rapid increase in communication data volume poses higher demands on traditional channel estimation techniques and those based on deep learning, especially when processing large-scale data as their computational load and real-time performance often fail to meet practical requirements. To overcome this bottleneck, this paper introduces quantum computing techniques, exploring for the first time the application of Quantum Generative Adversarial Networks (QGAN) to broadband channel estimation challenges. Although generative adversarial technology has been applied to channel estimation, obtaining instantaneous channel information remains a significant challenge. To address the issue of instantaneous channel estimation, this paper proposes an innovative QGAN with a dual-module design in the generator. The adversarial loss function and the Mean Squared Error (MSE) loss function are separately applied for the parameter updates of these two modules, facilitating the learning of statistical channel information and the generation of instantaneous channel details. Experimental results demonstrate the efficiency and accuracy of the proposed dual-module QGAN technique in channel estimation on the Pennylane quantum computing simulation platform. This research opens a new direction for physical layer techniques in wireless communication and offers expanded possibilities for the future development of wireless communication technologies.

• Communications for Statistical Applications and Methods
• /
• 제30권4호
• /
• pp.369-388
• /
• 2023

In this paper, we develop the two-step procedure that detects and estimates the position of structural changes for multivariate nonstationary time series, either on mean parameters or second-order structures. We first investigate the presence of mean structural change by monitoring data through the aggregated cumulative sum (CUSUM) type statistic, a sequential procedure identifying the likely position of the change point on its trend. If no mean change point is detected, the proposed method proceeds to scan the second-order structural change by modeling the multivariate nonstationary time series with a multivariate locally stationary Wavelet process, allowing the time-localized auto-correlation and cross-dependence. Under this framework, the estimated dynamic spectral matrices derived from the local wavelet periodogram capture the time-evolving scale-specific auto- and cross-dependence features of data. We then monitor the change point from the lower-dimensional approximated space of the spectral matrices over time by applying the dynamic principal component analysis. Different from existing methods requiring prior information on the type of changes between mean and covariance structures as an input for the implementation, the proposed algorithm provides the output indicating the type of change and the estimated location of its occurrence. The performance of the proposed method is demonstrated in simulations and the analysis of two real finance datasets.

• Communications for Statistical Applications and Methods
• /
• 제29권5호
• /
• pp.561-589
• /
• 2022

When multiple classifications and regression trees are combined, tree-based ensemble models, such as random forest (RF) and Bayesian additive regression trees (BART), are produced. We compare the model structures and performances of various ensemble models for regression settings in this study. RF learns bootstrapped samples and selects a splitting variable from predictors gathered at each node. The BART model is specified as the sum of trees and is calculated using the Bayesian backfitting algorithm. Throughout the extensive simulation studies, the strengths and drawbacks of the two methods in the presence of missing data, high-dimensional data, or highly correlated data are investigated. In the presence of missing data, BART performs well in general, whereas RF provides adequate coverage. The BART outperforms in high dimensional, highly correlated data. However, in all of the scenarios considered, the RF has a shorter computation time. The performance of the two methods is also compared using two real data sets that represent the aforementioned situations, and the same conclusion is reached.

• 한국정보처리학회논문지
• /
• 제7권2호
• /
• pp.536-541
• /
• 2000

터보코드는 인터리버의 크기가 클수록 반복 복호횟수가 많을수록 복호 성능은 우수하지만 시스템이 복잡해져 한 개의 정보비트를 복호할 때 많은 시간지연을 발생시켜 실시간 통신에는 부적합하다는 단점이 있다. 따라서 본 논문에서는 터보코드 부$\cdot$복호기에 사용되는 인터리버의 크기를 감소시켜 한 개의 정보비트를 복호할 때 소요되는 시간지연을 줄이는 새로운 세미 랜덤(Semi-Random) 인터리버 알고리즘을 제안하였다. 세미 랜덤 인터리버 알고리즘은 입력 데이터 길이의 1/2 크기만큼 인터리버를 구성하고, 인터리버 내에 쓸때는 블록 인터리버처럼 행으로 쓰고, 읽을 때는 랜덤하게 읽음과 동시에 다음 데이터가 그 주소 번지에 위치하게 된다. 따라서 기존의 블록, 대각, 랜덤 인터리버와 알고리즘의 복잡도를 비교할 시 그 복잡도를 1/2로 감소시킬 수 있게 된다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2006년도 학술대회
• /
• pp.283-288
• /
• 2006

In the future television broadcasting a flood of information from various sources will not always be welcomed by everyone. The need of accessing specific information as required is becoming a necessity. We are interested to make the life of television consumer easier by providing an intelligent television set which can adaptively proposed certain shows to the viewer based on the user historical consumed shows. The TV watching history data consists of TV program titles with their respective genres, channels, watched times and durations, etc. The method proposed is by utilizing Hidden Markov Model (HMM) to model the user preference of kind of genres the viewer will watch based on recorded genres of several weeks time. We take watching schedule from 6 PM to midnight as boundary. The range thus divided into 3 independent time band of 2 hours each resulting in 3 time bands from 6 PM to 8 PM, 8 PM to 10 PM, and lastly 10 PM to midnight. Each time band will be represented by an HMM. From each HMM we can generate a sequence of predicted genre that the user will probably watch during corresponding time-band. Our approach assumes that the user shows a consistent behavior of watching pattern in week to week basis and during the moment of watching TV. To asses the method performance experiment is conducted using real data collected from December 2002 to May 2003. Some user's data are selected and based on that predictions are made. The resulting predictions are then compared with the actual user's history. The experiment shows satisfactory result for user with middle to high consistent behavior level.