• Title/Summary/Keyword: Frequency Assignment

Search Result 180, Processing Time 0.029 seconds

A Channel Assignment Technique for OFDMA-based Wireless Mesh Network with Different Time Delays (서로 다른 지연 시간을 갖는 OFDMA 기반 Wireless Mesh Network에서의 채널 할당 기법)

  • Yoo, Hyun-Il;Park, Chang-Hwan;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6A
    • /
    • pp.568-576
    • /
    • 2011
  • In this paper, a channel assignment technique to mitigate interferences due to ISI(Inter Symbol Interference) and ICI(Inter Carrier Interference) caused by TDoA(Time Difference of Arrival) among distributed MRs(Mesh Routers) in OFDMA(Orthogonal Frequency Division Multiple Access)-based WMN(Wireless Mesh Network) is proposed. The SINR(Signal to Interference and Noise Ratio) associated with the channel assignment for each MR is defined to minimize the effect of ISI and ICI due to TDoA in WMN, which is then used to propose an channel assignment technique considering fairness constraint. It is verified by computer simulation that the proposed channel assignment technique can improve the performance of BER(Bit Error Rate) in WMNs with compared to the conventional technique.

Frequency Domain Properties of EALQR with Indefinite Q

  • Seo, Young-Bong;Park, Jae-Weon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1998.10a
    • /
    • pp.429-434
    • /
    • 1998
  • The previously developed control design methodology, EALQR(Eigenstructure Assignment/LQR), has better performance than that of conventional LQR or eigen-structure assignment. But it has a constraint for the weigting matrix in LQR, that is the weighting matrix could be indefinite for high-order systems. In this paper, the effects of the indefinite weighting matrix in EALQR on the Sequency domain properties are analyzed. The robustness criterion and quantitative frequency domain properties are also presented. Finally, the frequency do-main properties of EALQR has been analyzed by applying to a flight control system design example.

  • PDF

Individual-breed Assignment Analysis in Swine Populations by Using Microsatellite Markers

  • Fan, B.;Chen, Y.Z.;Moran, C.;Zhao, S.H;Liu, B.;Yu, M.;Zhu, M.J.;Xiong, T.A.;Li, K.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.18 no.11
    • /
    • pp.1529-1534
    • /
    • 2005
  • Individual-breed assignments were implemented in six swine populations using twenty six microsatellites recommended by the Food and Agriculture Organization and the International Society for Animal Genetics (FAO-ISAG). Most microsatellites exhibited high polymorphisms as shown by the number of alleles and the polymorphism information content. The assignment accuracy per locus obtained by using the Bayesian method ranged from 33.33% (CGA) to 68.47% (S0068), and the accumulated assignment accuracy of the top ten loci combination added up to 96.40%. The assignment power of microsatellites based on the Bayesian method had positive correlations with the number of alleles and the gene differential coefficient ($G_{st}$) per locus, while it has no relationship to genetic heterozygosity, polymorphism information content per locus and the exclusion probabilities under case II and case III. The percentage of corrected assignment was highest for the Bayesian method, followed by the gene frequency and distancebased methods. The assignment efficiency of microsatellites rose with increase in the number of loci used, and it can reach 98% when using a ten-locus combination. This indicated that such a set of ten microsatellites is sufficient for breed verification purposes.

Low Complexity Subcarrier Allocation Scheme for OFDMA Systems (OFDMA 시스템을 위한 저 복잡도 부반송파 할당기법)

  • Woo, Choong-Chae;Wang, Han-Ho
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.13 no.2
    • /
    • pp.99-105
    • /
    • 2012
  • The focus of this paper is a proposal for a computationally efficient dynamic subcarrier allocation (DSA) algorithm for orthogonal frequency-division multiple access (OFDMA) systems. The proposed DSA algorithm considerably reduces the computational complexity and the amount of channel quality information (CQI) compared to amplitude craving greedy (ACG) algorithms, which use full CQI. At the same time, the performance of the proposed algorithm closely appear to ACG algorithms. Moreover, the authors present a new bandwidth-assignment algorithm produced by modifying bandwidth assignment based on the signal-to-noise ratio (BABS). This modified BABS algorithm enables the proposed DSA algorithm to produce a strong outage performance gain over the conventional scheme.

Sliding mode control for structures based on the frequency content of the earthquake loading

  • Pnevmatikos, Nikos G.;Gantes, Charis J.
    • Smart Structures and Systems
    • /
    • v.5 no.3
    • /
    • pp.209-221
    • /
    • 2009
  • A control algorithm for seismic protection of building structures based on the theory of variable structural control or sliding mode control is presented. The paper focus in the design of sliding surface. A method for determining the sliding surface by pole assignment algorithm where the poles of the system in the sliding surface are obtained on-line, based on the frequency content of the incoming earthquake signal applied to the structure, is proposed. The proposed algorithm consists of the following steps: (i) On-line FFT process is applied to the incoming part of the signal and its frequency content is recognized. (ii) A transformation of the frequency content to the complex plane is performed and the desired location of poles of the controlled structure on the sliding surface is estimated. (iii) Based on the estimated poles the sliding surface is obtained. (iv) Then, the control force which will drive the response trajectory into the estimated sliding surface and force it to stay there all the subsequent time is obtained using Lyapunov stability theory. The above steps are repeated continuously for the entire duration of the incoming earthquake. The potential applications and the effectiveness of the improved control algorithm are demonstrated by numerical examples. The simulation results indicate that the response of a structure is reduced significantly compared to the response of the uncontrolled structure, while the required control demand is achievable.

A Channel Assigmnent Algorithm by Controlling the Transmitted Power Level which is based on the Distance between the Cell Site and the Mobile Unit (이동국과 기지국간의 거리에 따라 송신전력을 제어하는 채널할당 알고리즘)

  • 박덕규
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.1 no.1
    • /
    • pp.47-54
    • /
    • 1997
  • New algorithms for frequency channel assignment in small cellular mobile radio system are proposed. The algorithms are for a channel assignment method which control the transmitter power level based on the distance between the cell site and the mobile unit. These algorithms are such that any channel can be used by any cell site and mobile unit, as long as a required threshold level of carrier to interference ratio is maintained. As the cochannel reuse distance decreases, the proposed algorithms have given an increase in capacity in comparison to a fixed channel assignment.

  • PDF

Two phase algorithm for frequency assignment in cellular mobile systems with maximal distance of channel interference

  • Kim, Sehun;Kim, Seong-Lyun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1994.04a
    • /
    • pp.291-300
    • /
    • 1994
  • In this paper we consider the frequency assignment problem (FAP) in a cellular mobile communication system which has a maximal distance of channel interference. This special structure is observed in most cellular systems. To handle the considered FAP, we use the pattern approach which fits naturally to the problem. Based on this approach, we are able to formulate the considered FAP into a manageable optimization problem and propose a two phase heuristic algorithm for the problem. Computational experiments show that our algorithm performs much better in both solution quality and computational time than the recently developed algorithms for FAP. Since the considered FAP well reflects most cellular systems, our algorithm can be applied to many practical situations.

The Storage Method of a Leaf Tobacco Warehouse in Leaf Tobacco Factory (원료공장 잎담배 창고의 저장방법)

  • Han-Joo Chung;Byong-Kwon Jeh;Yong-Ok Kim
    • Journal of the Korean Society of Tobacco Science
    • /
    • v.25 no.1
    • /
    • pp.53-58
    • /
    • 2003
  • This study deals with the leaf tobacco assignment problem of a leaf tobacco warehouse with multiple input points and single output point. Also, the number of storage frequences is not necessary the same as that of retrieval for each leaf tobacco. A mathematical model is developed with the objective of minimizing the total travel distance associated with storage and retrieval operations. We also develop several heuristics based on the retrieval order frequency, retrieval/storage frequency ratio of leaf tobacco, and ABC curve. It is observed that the ABC curve based heuristic gives the best solution which is near optimal. Based on the test results from real world data, the ABC curve based heuristic is found to give a best performance. Comparing to current assignment method, the ABC curve based heuristic reduced total travel distance about 17.2%.

Capacity Improvement with Dynamic Channel Assignment and Reuse Partitioning in Cellular Systems

  • Chen Steven Li;Chong Peter Han Joo
    • Journal of Communications and Networks
    • /
    • v.8 no.1
    • /
    • pp.13-20
    • /
    • 2006
  • In cellular mobile communications, how to achieve optimum system capacity with limited frequency spectrum is one of the main research issues. Many dynamic channel assignment (DCA) schemes have been proposed and studied to allocate the channels more efficiently, thus, the capacity of cellular systems is improved. Reuse partitioning (RP) is another technique to achieve higher capacity by reducing the overall reuse distance. In this paper, we present a network-based DCA scheme with the implementation of RP technique, namely dynamic reuse partitioning with interference information (DRP-WI). The scheme aims to minimize the effect of assigned channels on the availability of channels for use in the interfering cells and to reduce their overall reuse distances. The performance of DRP-WI is measured in terms of blocking probability and system capacity. Simulation results have confirmed the effectiveness of DRP-WI scheme. Under both uniform and non-uniform traffic distributions, DRP-WI exhibits outstanding performance in improving the system capacity. It can provide about 100% capacity improvement as compared to conventional fixed channel assignment scheme with 70 system channels.