• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2008년도 춘계종합학술대회 A
• /
• pp.567-571
• /
• 2008

In this paper, an overview on the ordering sphere decoder (SD) class for space-time codes (STC) will be presented. In SDs, the ordering techniques are considered as promising methods for reducing complexity by exploiting a sorted list of candidates, thus decreasing the number of tested points. First, we will present the current state of art of SD with their advantages and disadvantages. Then, the overview of simply geometrical approaches for ordering is presented to address the question to overcome the disadvantages. The computer simulation results shown that, thanks to the aid of ordering, the ordering SDs can achieve optimal bit-error-rate (BER) performance while requiring the very low complexity, which is comparable to that of linear sub-optimal decoders.

• 한국경영과학회지
• /
• 제4권1호
• /
• pp.25-31
• /
• 1979

We consider the optimal ordering policy for a single-product two-stage inventory system where the main assumptions are as follows: (i) constant continuous demand only at stage 2, (ii) constant input (production) rate at stage 1, (iii) instantaneous delivery (transportation) from stage 1 to stage 2, (iv) backlogging is allowed only at stage 2, (v) an infinite planning horizon. Costs considered are ordering and linear holding costs at both stages, and linear shortage cost only at stages 2. By solving 9 different case problems, we have observed the general from of the optimal ordering policies for our model which minimizes the total cost per unit time. It is noticeable from this observation that the questionable but more often than not adopted assumption by many authors in determining the optimal potimal policy for multistage inventory systems, that the ordering (lot) sizes at each stage remain constant thruout the planning horizon, is not valid.

• 산업경영시스템학회지
• /
• 제17권31호
• /
• pp.59-72
• /
• 1994

This paper deals with ordering policies of consumable goods which have large demand rates in a multi-level distribution system. The system we are concerned consists of one Central Distribution Center(CDC) and N non-identical Regional Distribution Centers(RDCs) which have different demand rates, minimum fillrates, leadtimes, etc. The customer demand on the RDC is stationary poisson and the RDCs demand on the CDC is superposition of Q-stage Erlang distributions. We approximate the RDCs and CDC demand distribution to nomal in order to enhance the efficiency of algorithm. The relevant costs include a fixed ordering cost and inventory holding cost, and backorder cost. The objective is to find a continuous-review ordering policy that minimizes the expected average costs under constraints of minimum fill rates of RDCs and maximum allowable mean delay of CDC. We developed an algorithm for determining the optimal ordering policies of the CDC and the RDCs. We verified and compared the performance of the algorithm through the simulation using the algorithm result as the input parameters.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2009년도 춘계학술대회
• /
• pp.143-146
• /
• 2009

In this paper, we investigated the list sphere decoders (LSD) for multiple-input multiple-output (MIMO) systems. We showed that the ordering procedures play an important role in LSD in order to achieve the low complexity without degrading the bit-error-rate (BER) performance. Then, we proposed a novel ordering algorithm for the LSD which uses a look-up table and simply comparative operations. Comparative results in terms of BER performance and computational complexity are provided through computer simulations.

• ETRI Journal
• /
• 제29권2호
• /
• pp.240-242
• /
• 2007

This letter proposes a simplified maximum likelihood detection (SMLD) scheme to improve the detection performance of multiple-input multiple-output receivers. The SMLD detects V streams according to the first detected V sub-streams. Through an ML test, the most probable stream is selected. Moreover, to detect the layer with the worst post-detection SNR accurately, reverse ordering is applied to the SMLD. Simulation results show that the performance of the Vertical Bell Laboratories layered space-time (V-BLAST) system can be improved by adopting the SMLD technique. In the case of reverse ordering, the SMLD can achieve a similar ML performance with significant reduction in computational complexity.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2000년도 춘계학술대회논문집
• /
• pp.1487-1492
• /
• 2000

To identify forklift's booming noise in cabin under idling engine revolution, we discussed and applied conditioned input analysis. Acceleration signals at engine mounts and front window and rear window were considered as candidate input signals and output signal was sound pressure signal at driver's ear position in cabin. To reduce the numbers of the input signals, one idea were applied; Each one input signal from each input groups was selected, respectively because input signals in the same group were highly correlated. And Hilbert transform was used to determine the ordering of three selected inputs. Partial coherence functions, multiple coherence function and conditioned spectral density functions were investigate to the effects of booming noise by partial inputs.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제34권6호
• /
• pp.572-583
• /
• 2007

본 논문에서는 자연스러운 텍스트 생성을 위한 여러 과정 중, 문장 순서를 결정하기 위한 텍스트 구조화(text structuring)에 관한 것으로, 중심화 이론(centering theory)에 기반하여 문장 순서의 자연스러움을 판단할 수 있는 다양한 평가 척도를 논의한다. 먼저, 기존 연구들에서 중심화 이론에 기반한 문장 순서의 평가 척도들 중 가장 효과적이라고 알려진 MIN.NOCB를 텍스트 구조화에 적용할 때 발생할 수 있는 문제점을 지적하고, 대안이 될 수 있는 새로운 평가 척도인 MAX.CPS를 제안한다. 또, 임의의 평가 척도가 주어진 문장들에 대해 가질 수 있는 기대치를 먼저 예측하고, 그것에 따라 다른 평가 척도를 적용하게 하는 프레임워크를 제안하여, 중심화 이론 안에서 최상의 문장 순서를 찾기 위한 새로운 방법론을 모색한다. 또한, 중심화 이론의 적용에 있어 핵심이라 할 수 있는, 명사들의 돋보임성(salience)을 서열화(cf-ranking) 하는 다양한 방식을 중심화 기반 문장 순서 평가 척도의 관점에서 분석하였다. 그 결과, 텍스트 구조화에 관한 한, 단순히 문장에서 실현된 순서에 따라 명사들의 돋보임성의 서열을 정하는 것이 한국어의 특성상 가장 간단하면서도 효율적임을 입증하였다.

• Journal of Communications and Networks
• /
• 제13권2호
• /
• pp.167-174
• /
• 2011

In this paper, we propose and simulate an efficient interference cancellation scheme with an optimal ordering successive interference cancellation (SIC) algorithm for ultra wideband (UWB)/multiple-input-multiple-output (MIMO) systems in a wireless body area network (WBAN). When there are several wireless communication devices on a human body, multiple access interference (MAI) usually occurs. To mitigate the effect of MAI and achieve additional diversity gain, we utilize SIC with an optimal ordering algorithm. A zero correlation duration (ZCD) code with robust MAI capability is employed as a spread code for UWB systems in a multi-device WBAN environment. The performance of the proposed scheme is evaluated in terms of the bit error rate (BER). Simulation results confirm that the BER performance can be improved significantly if the proposed interference cancellation scheme and the ZCD code are jointly employed.

• 대한전자공학회논문지TC
• /
• 제43권3호
• /
• pp.10-17
• /
• 2006

OFDM (orthogonal frequency division multiplexing) 시스템에서 신호를 전송하고자 할 때, 다중 경로 채널에 의한 간섭을 없애기 위해 사이클릭 프리픽스 (CP: cyclic prefix)는 채널 충격 응답보다 길어야 한다. 그러나, 이러한 CP의 사용은 주파수 효율을 저하시킨다. 본 논문에서는 CP 재생성 기법을 불충분한 CP을 갖는 MIMO (multi-input multi-output)-OFDM에 처음으로 적용한다. MIMO 시스템의 경우, 다중 전송 안테나로부터의 ICI (intercarrier interference)가 매우 크기 때문에 SISO (single-input single-output) 시스템에서 사용된 기존의 CP 재생성 절차를 이용하면 ICI 성분을 충분히 줄일 수 없다. 본 논문에서는 CP 재생성 과정에서 ICI 성분을 줄이기 위해 새로운 MMSE (mimum mean-square error) 등화기와 오더링 (ordering) 과정을 제안한다. MIMO-OFDM 시스템에 제안된 CP 재생성 과정을 적용함으로써, 멀티플렉싱 이득과 주파수 효율 이득을 동시에 얻을 수 있다.

• 정보처리학회논문지A
• /
• 제8A권1호
• /
• pp.48-55
• /
• 2001

Using BDD, we can represent Boolean functions uniquely and compactly, Hence, BDD have become widely used for CAD applications, such as logic synthesis, formal verification, and etc. The size of the BDD representation for a function is very sensitive to the choice of orderings on the input variables. Therefore, it is very important to find a good variable ordering which minimize the size of the BDD. Since finding an optimal ordering is NP-complete, several heuristic algorithms have been proposed to find good variable orderings. In this paper, we propose a variable ordering algorithm based on the $\mu$O(microcanonical optimization). $\mu$O consists of two distinct procedures that are alternately applied : Initialization and Sampling. The initialization phase is to executes a fast local search, the sampling phase leaves the local optimum obtained in the previous initialization while remaining close to that area of search space. The proposed algorithm has been experimented on well known benchmark circuits and shows superior performance compared to a algorithm based on simulated annealing.