• Title/Summary/Keyword: Minimum Distance

Search Result 1,182, Processing Time 0.495 seconds

Minimum Distance based Precoder Design for General MIMO Systems using Gram Matrix

  • Chen, Zhiyong;Xu, Xiaodong
    • Journal of Communications and Networks
    • /
    • v.17 no.6
    • /
    • pp.634-646
    • /
    • 2015
  • Assuming perfect channel state information (CSI) at the transmitter and receiver, the optimization problem of maximizing the minimum Euclidean distance between two received signals by a linear precoder is considered for multiple-input multiple-output (MIMO) systems with arbitrary dimensions and arbitraryary quadrature amplitude modulation (QAM) input. A general precoding framework is first presented based on the Gram matrix, which is shown for 2-dimensional (2-D) and 3-dimensional (3-D) MIMO systems when employing the ellipse expanding method (EEM). An extended precoder for high-dimensional MIMO system is proposed following the precoding framework, where the Gram matrix for high-dimensional precoding matrix can be generated through those chosen from 2-D and 3-D results in association with a permutation matrix. A complexity-reduced maximum likelihood detector is also obtained according to the special structure of the proposed precoder. The analytical and numerical results indicate that the proposed precoder outperforms the other precoding schemes in terms of both minimum distance and bit error rate (BER).

FOOTPRINT AND MINIMUM DISTANCE FUNCTIONS

  • Nunez-Betancourt, Luis;Pitones, Yuriko;Villarreal, Rafael H.
    • Communications of the Korean Mathematical Society
    • /
    • v.33 no.1
    • /
    • pp.85-101
    • /
    • 2018
  • Let S be a polynomial ring over a field K, with a monomial order ${\prec}$, and let I be an unmixed graded ideal of S. In this paper we study two functions associated to I: The minimum distance function ${\delta}_I$ and the footprint function $fp_I$. It is shown that ${\delta}_I$ is positive and that $fp_I$ is positive if the initial ideal of I is unmixed. Then we show that if I is radical and its associated primes are generated by linear forms, then ${\delta}_I$ is strictly decreasing until it reaches the asymptotic value 1. If I is the edge ideal of a Cohen-Macaulay bipartite graph, we show that ${\delta}_I(d)=1$ for d greater than or equal to the regularity of S/I. For a graded ideal of dimension ${\geq}1$, whose initial ideal is a complete intersection, we give an exact sharp lower bound for the corresponding minimum distance function.

Minimum Hellinger Distance Bsed Goodness-of-fit Tests in Normal Models: Empirical Approach

  • Dong Bin Jeong
    • Communications for Statistical Applications and Methods
    • /
    • v.6 no.3
    • /
    • pp.967-976
    • /
    • 1999
  • In this paper we study the Hellinger distance based goodness-of-fit tests that are analogs of likelihood ratio tests. The minimum Hellinger distance estimator (MHDE) in normal models provides an excellent robust alternative to the usual maximum likelihood estimator. Our simulation results show that the Hellinger deviance test (Simpson 1989) based goodness-of-fit test is robust when data contain outliers. The proposed hellinger deviance test(Simpson 1989) is a more direcct method for obtaining robust inferences than an automated outlier screen method used before the likelihood ratio test data analysis.

  • PDF

A Proposal of Heuristic Using Zigzag Steiner Point Locating Strategy for GOSST Problem (GOSST 문제 해결을 위한 지그재그 스타이너 포인트 배치 방법을 이용한 휴리스틱의 제안)

  • Kim, In-Bum;Kim, Chae-Kak
    • The KIPS Transactions:PartA
    • /
    • v.14A no.5
    • /
    • pp.317-326
    • /
    • 2007
  • We propose more enhanced heuristic for the GOSST(Grade of Services Steiner Minimum Tree) problem in this paper. GOSST problem is a variation of Steiner Tree problem and to find a network topology satisfying the G-Condition with minimum network construction cost. GOSST problem is known as one of NP-Hard or NP-Complete problems. In previous our research, we proposed a heuristic employing Direct Steiner Point Locating strategy with Distance Preferring MST building strategy. In this paper, we propose new Steiner point locating strategy, Zigzag Steiner point Locating strategy. Through the results of out experiments, we can assert this strategy is better than our previous works. The Distance Zigzag GOSST method which hires the Distance Preferring MST building strategy and Zigzag Steiner point Locating strategy defrays the least network construction cost and brings 31.5% cost saving by comparison to G-MST, the experimental control and 2.2% enhancement by comparison to the Distance Direct GOSST method, the best GOSST method in our previous research.

A Study on Minimum Separation Distance for Aboveground High-pressure Natural Gas Pipelines (지상 고압 천연가스 배관의 최소 이격거리 기준에 관한 연구)

  • Lee, Jin-Han;Jo, Young-Do
    • Korean Chemical Engineering Research
    • /
    • v.57 no.2
    • /
    • pp.225-231
    • /
    • 2019
  • In Korea, the minimum separation distance between aboveground high-pressure natural gas pipeline and buildings is regulated by Korea gas safety (KGS) code. In this paper, The technical backgrounds for the revision of the KGS code related to the minimum separation distance was presented. A consequence-based approach was adopted to determine the minimum separation distance by a reasonable accident scenario, which was a jet fire caused by the rupture of one inch branch line attached the gas pipeline. Where, the higher thermal radiation flux threshold was selected for workers in industrial area than for people in non-industrial area, because the workers in industrial area were able to escape in a shorter time than the people in public. As result of consequence analysis for the accident scenario, we suggested the KGS code revision that the minimum separation distances between high-pressure natural gas pipeline installed above ground and buildings should be 30 meter in non-industrial area and 15 meter in industrial area. The revised code was accepted by the committee of the KGS code and now in effect.

Evaluation of required seismic gap between adjacent buildings in relation to the Egyptian Code

  • Hussein, Manar M.;Mostafa, Ahmed A.;Attia, Walid A.
    • Structural Engineering and Mechanics
    • /
    • v.78 no.2
    • /
    • pp.219-230
    • /
    • 2021
  • International seismic codes stipulate that adjacent buildings should be separated by a specified minimum distance, otherwise the pounding effect should be considered in the design. Recent researches proposed an alternative method (Double Difference Combination Rule) to estimate seismic gap between structures, as this method considers the cross relation of adjacent buildings behavior during earthquakes. Four different criteria were used to calculate the minimum separation distance using this method and results are compared to the international codes for five separation cases. These cases used four case study buildings classified by different heights, lateral load resisting systems and fundamental periods of vibrations to assess the consistency in results for the alternative methods. Non-linear analysis was performed to calculate the inelastic displacements of the four buildings, and the results were used to evaluate the relation between elastic and inelastic displacements due to the ductility of structural elements resisting seismic loads. A verification analysis was conducted to guarantee that the separation distance calculated is sufficient to avoid pounding. Results shows that the use of two out of the four studied methods yields separation distances smaller than that calculated by the code specified equations without under-estimating the minimum separation distance required to avoid pounding.

A Study on the Minimum Safe Distance Under the Low Speed Sailing of T.S. HANBADA (실습선 한바다호의 저속 항해시 최소안전 이격거리에 관한 연구)

  • Park Young-Soo;Ji Sang-Won;Lee Yun-Sok;Jung Chang-Hyun;Jeong Jin-A;Jung Min
    • Journal of Navigation and Port Research
    • /
    • v.29 no.10 s.106
    • /
    • pp.833-838
    • /
    • 2005
  • This paper is to investigate the minimum safe distance between T/S Hanbada and a group of vessels participating in the event hosted by M broadcasting station who asked T/S Hanbada to keep a distance from $100m{\sim}500m$. The minimum safe distance was assessed by using ES Model which evaluates quantitatively the difficulty of shiphandling, and the simulation of marine traffic flow. As a result the minimum safe distance of T/S Hanbada moving at a speed of 2 knots turns out about 260m and is compared with the actual value.

Study on Minimum Heat Flux Point in Spray Cooling of Hot Plate (고온 강판의 분무냉각에 있어서 MHF 점에 관한 연구)

  • Kim, Yeung-Chan
    • Proceedings of the KSME Conference
    • /
    • 2001.06d
    • /
    • pp.175-180
    • /
    • 2001
  • In this study, the minimum heat flux conditions are experimentally investigated for the spray cooling of hot plate. The hot plates are cooled down from the initial temperature of about $900^{\circ}C$, and the local heat flux and surface temperatures are calculated from the measured temperature-time history. The results show that the minimum heat flux point temperatures increase linearly resulting from the propagation of wetting front with the increase of the distance from the stagnation point of spray flow. However, in the wall region, the minimum heat flux point temperature becomes independent of the distance. Also, the experimental results show that the velocity of wetting front increases with the increase of the droplet flow rate.

  • PDF

Obstacle-Free Optimal Motions of a Manipulator Arm Using Penetration Growth Distance (침투성장거리를 이용한 로봇팔의 장애물회피 최적운동)

  • Park, Jong-Keun
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.18 no.10
    • /
    • pp.116-126
    • /
    • 2001
  • This paper suggests a numerical method to find optimal geometric path and minimum-time motion for a spatial 6-link manipulator arm (PUMA 560 type). To find a minimum-time motion, the optimal geometric paths minimizing 2 different dynamic performance indices are searched first, and the minimum-time motions are searched on these optimal paths. In the algorithm to find optimal geometric paths, the objective functions (performance indices) are selected to minimize joint velocities, actuator forces or the combinations of them as well as to avoid one static obstacle. In the minimum-time algorithm the traveling time is expressed by the power series including 21 terms. The coefficients of the series are obtained using nonlinear programming to minimize the total traveling time subject to the constraints of velocity-dependent actuator forces.

  • PDF

Study on Minimum Heat Flux Point in Spray Cooling of Hot Plate (고온 평판의 분무냉각에 있어서 MHF점에 관한 연구)

  • 김영찬
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.13 no.10
    • /
    • pp.974-981
    • /
    • 2001
  • In this study, the minimum heat flux conditions are experimentally investigated for the spray cooling of hot plate. The hot plates are cooled down from the initial temperature of about$ 900^{\circ}C$, and the local heat flux and surface temperatures are calculated from the measured temperature-time history. The results show that the minimum heat flux point temperatures increase linearly resulting from the propagation of wetting front with the increase of the distance from the stagnation point of spray flow. However, in the wall region, the minimum heat flux point temperature becomes independent of the distance. Also, the velocity of wetting front increases with the increase of the droplet flow rate.

  • PDF