• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2224-2227
• /
• 2003

본 논문에서는 비동기식 3 세대 이동통신망인 WCDMA의 표준 음성 부호화기인 AMR(Adaptive Multi-Rate)[1]과 VoIP(Voice over Internet Protocol) 응용분야에 최근 널리 활용되고 있는 ITU-T 8kbit/s 0.729A[2]의 효율적인 연동을 위한 상호부호화(transcoding) 알고리듬을 제안한다. AMR은 통신 채널 환경에 따라 4.75kbit/s부터 12.2kbit/s까지 가변 하여 통화품질을 보장한다. 따라서, 제안된 상호부호화 알고리듬은 순방향 8 모드, 역방향 8모드를 합하여 총 16모드를 지원한다. 제안된 알고리듬의 성능 평가를 위해 지연 추정, 연산량 측정과 주/객관적 음질평가를 수행한 결과, 제안한 알고리듬은 기존의 tandem보다 최소 5㎳의 짧은 지연, 평균 50.2％의 적은 연산량으로 우수한 음질의 복호화 음성 신호를 제공함을 확인하였다.

• 전자공학회논문지S
• /
• 제34S권9호
• /
• pp.23-30
• /
• 1997

In this paper, a decision feedback recurrent neural equalization (DFRNE) scheme is proposed for adaptive equalization problems. The proposed equalizer models a nonlinear infinite impulse response (IIR) filter. The modified Real-Time recurrent Learning Algorithm (RTRL) is used to train the DFRNE. The DFRNE is applied to both linear channels with only intersymbol interference and nonlinear channels for digital video cassette recording (DVCR) system. And the performance of the DFRNE is compared to those of the conventional equalizaion schemes, such as a linear equalizer, a decision feedback equalizer, and neural equalizers based on multi-layer perceptron (MLP), in view of both bit error rate performance and mean squared error (MSE) convergence. It is shown that the DFRNE with a reasonable size not only gives improvement of compensating for the channel introduced distortions, but also makes the MSE converge fast and stable.

• 대한의용생체공학회:의공학회지
• /
• 제26권3호
• /
• pp.171-176
• /
• 2005

This paper proposes an automatic liver segmentation method using improved partial histogram threshold (PHT) algorithms. This method removes neighboring abdominal organs regardless of random pixel variation of contrast enhanced CT images. Adaptive multi-modal threshold is first performed to extract a region of interest (ROI). A left PHT (LPHT) algorithm is processed to remove the pancreas, spleen, and left kidney. Then a right PHT (RPHT) algorithm is performed for eliminating the right kidney from the ROI. Finally, binary morphological filtering is processed for removing of unnecessary objects and smoothing of the ROI boundary. Ten CT slices of six patients (60 slices) were selected to evaluate the proposed method. As evaluation measures, an average normalized area and area error rate were used. From the experimental results, the proposed automatic liver segmentation method has strong similarity performance as the MSM by medical Doctor.

• ETRI Journal
• /
• 제29권1호
• /
• pp.79-88
• /
• 2007

This paper proposes a novel concept of adjusting the hardware size in a multi-carrier code division multiple access (MC-CDMA) receiver in real time as per the channel parameters such as delay spread, signal-to-noise ratio, transmission rate, and Doppler frequency. The fast Fourier transform (FFT) or inverse FFT (IFFT) size in orthogonal frequency division multiplexing (OFDM)/MC-CDMA transceivers varies from 1024 points to 16 points. Two low-power reconfigurable radix-4 256-point FFT processor architectures are proposed that can also be dynamically configured as 64-point and 16-point as per the channel parameters to prove the concept. By tailoring the clock of the higher FFT stages for longer FFTs and switching to shorter FFTs from longer FFTs, significant power saving is achieved. In addition, two 256 sub-carrier MC-CDMA receiver architectures are proposed which can also be configured for 64 sub-carriers in real time to prove the feasibility of the concept over the whole receiver.

• 한국통신학회논문지
• /
• 제40권10호
• /
• pp.1931-1933
• /
• 2015

본 논문은 이종 네트워크 환경에서 무선 통신 시스템의 신뢰성 향상을 위한 인접 셀 간 협력 전송 기법을 제안한다. 이종 네트워크는 현존하는 기술을 사용하여 데이터 전송 속도를 높일 수 있다는 장점이 있다. 하지만 셀 가장자리에서의 통신 성능 저하 현상이 심각한 문제로 대두되고 있다. 따라서 본 논문은 문제 해결을 위해 상황에 따라 적응적으로 전송하는 인접 셀 간 협력 전송 기법을 제시한다.

• ETRI Journal
• /
• 제36권6호
• /
• pp.953-959
• /
• 2014

This paper studies the uplink resource allocation for multiple radio access (MRA) in reconfigurable radio systems, where multiple-input and multiple-output (MIMO) multicarrier-code division multiple access (MC-CDMA) and MIMO orthogonal frequency-division multiple access (OFDMA) networks coexist. By assuming multi-radio user equipment with network-guided operation, the optimal resource allocation for MRA is analyzed as a cross-layer optimization framework with and without fairness consideration to maximize the uplink sum-rate capacity. Numerical results reveal that parallel MRA, which uses MC-CDMA and OFDMA networks concurrently, outperforms the performance of each MC-CDMA and OFDMA network by exploiting the multiuser selection diversity.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2018년도 하계학술대회
• /
• pp.175-177
• /
• 2018

This paper proposes an algorithm to speed up block structure partition of quad tree plus binary tree (QTBT) in Joint Exploration Test Model (JEM) encoder. The proposed fast encoding of QTBT block partition employs three spatially neighbor coded blocks, such as left, top-left, and top of current block, to early terminate QTBT block structure pruning. The propose algorithm is organized based on statistical similarity of those spatially neighboring blocks, such as block depths and coded block types, which are coded with overlapped block motion compensation (OBMC) and adaptive multi transform (AMT). The experimental results demonstrate about 30% encoding time reduction with 1.3% BD-rate loss on average compared to the anchor JEM-7.1 software under random access configuration.

• 상하수도학회지
• /
• 제25권4호
• /
• pp.581-589
• /
• 2011

Generally, treated water or raw water is transported into storage reservoirs which are receiving facilities of local governments from multi-regional water supply systems. A water supply control and operation center is operated not only to manage the water facilities more economically and efficiently but also to mitigate the shortage of water resources due to the increase in water consumption. To achieve the goal, important information such as the flow-rate in the systems, water levels of storage reservoirs or tanks, and pump-operation schedule should be considered based on the resonable water demand forecasting. However, it is difficult to acquire the pattern of water demand used in local government, since the operating information is not shared between multi-regional and local water systems. The pattern of water demand is irregular and unpredictable. Also, additional changes such as an abrupt accident and frequent changes of electric power rates could occur. Consequently, it is not easy to forecast accurate water demands. Therefore, it is necessary to introduce a short-term water demands forecasting and to develop an application of the forecasting models. In this study, the forecasting simulator for water demand is developed based on mathematical and neural network methods as linear and non-linear models to implement the optimal water demands forecasting. It is shown that MLP(Multi-Layered Perceptron) and ANFIS(Adaptive Neuro-Fuzzy Inference System) can be applied to obtain better forecasting results in multi-regional water supply systems with a large scale and local water supply systems with small or medium scale than conventional methods, respectively.

• 정보처리학회논문지C
• /
• 제12C권6호
• /
• pp.901-906
• /
• 2005

본 논문에서는 초고속 전승을 위해 제안된 HCOC(High Capacity Orthogonal Code) 대역확산(Spread Spectrum) 시스템의 높은 PAPR(Peak power to Average Power Ratio)을 줄여주는 새로운 MHCOC (Mapped HCOC) 대역확산 기술을 제안하고, 같은 비트 수를 전송할 수 있는 기존의 MQAM 대역확산 시스템과 비교 분석한다. 또한 전송 채널의 상황에 따라 알맞은 데이터 서비스를 하는 QoS (Quality of Service)를 만족시키기 위해 제안한 시스템의 적응성에 대하여 연구한다. 컴퓨터 시뮬레이션을 통하여 제안한 시스템의 성능을 평가 및 분석하고, 기존의 시스템과 비교 분석한다.

• Journal of Communications and Networks
• /
• 제10권1호
• /
• pp.28-37
• /
• 2008

In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink channels. We design a scheduler that selects a user for transmission and determines the transmission rate of the selected user based on the channel and backlog information of users. Since it requires prohibitively high computation complexity to determine an optimal scheduler for multi-user systems, we propose a low-complexity scheduling scheme that can achieve near-optimal performance. In this scheme, we reduce the complexity by decomposing the multiuser problem into multiple individual user problems. We arrange the probability of selecting each user such that it can be determined only by the information of the corresponding user and then optimize the transmission rate of each user independently. We solve the user problem by using a dynamic programming approach and analyze the upper and lower bounds of average transmission power and average delay, respectively. In addition, we investigate the effects of the user selection algorithm on the performance for different channel models. We show that a channel-adaptive user selection algorithm can improve the energy efficiency under uncorrelated channels but the gain is obtainable only for loose delay requirements in the case of correlated channels. Based on this, we propose a user selection algorithm that adapts itself to both the channel condition and the backlog level, which turns out to be energy-efficient over wide range of delay requirement regardless of the channel model.