• Title/Summary/Keyword: Instantaneous Channel

Search Result 164, Processing Time 0.027 seconds

PIV Measurement of Unsteady Flow in Wavy-Walled Channels (기복을 갖는 채널 내부 비정상흐름의 PIV계측)

  • Cho Dae-Hwan;Han Won-Hui;Choi Sang-Bom
    • Proceedings of KOSOMES biannual meeting
    • /
    • 2005.11a
    • /
    • pp.159-163
    • /
    • 2005
  • This experimental study was performed to investigate internal flow and unsteady flow characteristics using a model for actual shape of a plate heat exchanger and visualization of flow through the particle image velocimetry. Seven Reynolds numbers were selected by calculation with the height of grooved channel and sectional mean velocity of inlet flow in the experiment, and instantaneous velocity distributions and flow characteristics were experimently investigated. The triangular grooved channel had a compound flow consisting of the flow in lower channel and the groove flow receiving shear stress by the channel flow in the experiment. The sheared mixing layer, in the boundary between the triangular groove and the channel, affected main flow to raise turbulent in the channel.

  • PDF

Power Allocation and Mode Selection in Unmanned Aerial Vehicle Relay Based Wireless Networks

  • Zeng, Qian;Huangfu, Wei;Liu, Tong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.711-732
    • /
    • 2019
  • Many unmanned aerial vehicle (UAV) applications have been employed for performing data collection in facilitating tasks such as surveillance and monitoring objectives in remote and dangerous environments. In light of the fact that most of the existing UAV relaying applications operate in conventional half-duplex (HD) mode, a full-duplex (FD) based UAV relay aided wireless network is investigated, in which the UAV relay helps forwarding information from the source (S) node to the destination (D). Since the activated UAV relays are always floating and flying in the air, its channel state information (CSI) as well as channel capacity is a time-variant parameter. Considering decode-and-forward (DF) relaying protocol in UAV relays, the cooperative relaying channel capacity is constrained by the relatively weaker one (i.e. in terms of signal-to-noise ratio (SNR) or signal-to-interference-plus-noise ratio (SINR)) between S-to-relay and relay-to-D links. The channel capacity can be optimized by adaptively optimizing the transmit power of S and/or UAV relay. Furthermore, a hybrid HD/FD mode is enabled in the proposed UAV relays for adaptively optimizing the channel utilization subject to the instantaneous CSI and/or remaining self-interference (SI) levels. Numerical results show that the channel capacity of the proposed UAV relay aided wireless networks can be maximized by adaptively responding to the influence of various real-time factors.

Interference Temperature based Frequency Sharing Scheme for Multiple Cognitive Radio Users (간섭 온도 기만의 다중 Cognitive Radio 사용자를 위한 주파수 공유 방안)

  • Kim, Seung-Wang;Kim, Hye-Ryeong;Choe, Sang-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.12
    • /
    • pp.72-81
    • /
    • 2009
  • In this paper, we investigate a spectrum sharing scheme based on the interference temperature (IT), that is a recently introduced receiver-centric metric by FCC. We extend the existing frequency sharing procedure for single CR to the one for multiple CRs (or secondary users, SUs). In the proposed interference model, we consider the practical operating characteristics of primary users (PUs), stochastically activated (ON)/deactivated (OFF) at the time axis, and analyze quantitatively the CR user capacity based on the model. We define the instantaneous capacity for idle time-slot channel allocation and the mean capacity averaging this instantaneous capacity and use them for a proper frequency sharing. Apart from existing schemes, the proposed frequency sharing scheme changes the frequency parameters adaptively depending on the channel characteristics and does not need any sensing information from PUs. Through computer simulation, we verify the proposed model.

Opportunistic Spectrum Access Based on a Constrained Multi-Armed Bandit Formulation

  • Ai, Jing;Abouzeid, Alhussein A.
    • Journal of Communications and Networks
    • /
    • v.11 no.2
    • /
    • pp.134-147
    • /
    • 2009
  • Tracking and exploiting instantaneous spectrum opportunities are fundamental challenges in opportunistic spectrum access (OSA) in presence of the bursty traffic of primary users and the limited spectrum sensing capability of secondary users. In order to take advantage of the history of spectrum sensing and access decisions, a sequential decision framework is widely used to design optimal policies. However, many existing schemes, based on a partially observed Markov decision process (POMDP) framework, reveal that optimal policies are non-stationary in nature which renders them difficult to calculate and implement. Therefore, this work pursues stationary OSA policies, which are thereby efficient yet low-complexity, while still incorporating many practical factors, such as spectrum sensing errors and a priori unknown statistical spectrum knowledge. First, with an approximation on channel evolution, OSA is formulated in a multi-armed bandit (MAB) framework. As a result, the optimal policy is specified by the wellknown Gittins index rule, where the channel with the largest Gittins index is always selected. Then, closed-form formulas are derived for the Gittins indices with tunable approximation, and the design of a reinforcement learning algorithm is presented for calculating the Gittins indices, depending on whether the Markovian channel parameters are available a priori or not. Finally, the superiority of the scheme is presented via extensive experiments compared to other existing schemes in terms of the quality of policies and optimality.

A NEW CHANNEL TO SEARCH FOR EXTRA-SOLAR SYSTEMS WITH MULTIPLE PLANETS VIA GRAVITATIONAL MICROLENSING

  • HAN CHEONGHO;PARK MYEONG-GU
    • Journal of The Korean Astronomical Society
    • /
    • v.35 no.1
    • /
    • pp.35-40
    • /
    • 2002
  • Gaudi, Naber & Sackett pointed out that if an event is caused by a lens system containing more than two planets, all planets will affect the central region of the magnification pattern, and thus the existence of the multiple planets can be inferred by detecting additionally deformed anomalies from intensive monitoring of high magnification microlensing events. Unfortunately, this method has important limitations in identifying the existence of multiple planets and determining their parameters (the mass ratio and the instantaneous projected separation) due to the degeneracy of the resulting light curve anomalies from those induced by a single planet and the complexity of multiple planet lensing models. In this paper, we propose a new channel to search for multiple planets via microlensing. The method is based on the fact that the lensing light curve anomalies induced by multiple planets are well approximated by the superposition of those of the single planet systems where the individual planet-primary pairs act as independent lens systems. Then, if the source trajectory passes both of the outer deviation regions induced by the individual planets, one can unambiguously identify the existence of the multiple planets. We illustrate that the probability of successively detecting light curve anomalies induced by two Jovian-mass planets located in the lensing zone through this channel will be substantial. Since the individual anomalies can be well described by much simpler single planet lensing models, the proposed method has an important advantage of allowing one to accurately determine the parameters of the individual planets.

SARAPAN-A Simulated-Annealing-Based Tool to Generate Random Patterned-Channel-Age in CANDU Fuel Management Analyses

  • Kastanya, Doddy
    • Nuclear Engineering and Technology
    • /
    • v.49 no.1
    • /
    • pp.267-276
    • /
    • 2017
  • In any reactor physics analysis, the instantaneous power distribution in the core can be calculated when the actual bundle-wise burnup distribution is known. Considering the fact that CANDU (Canada Deuterium Uranium) utilizes on-power refueling to compensate for the reduction of reactivity due to fuel burnup, in the CANDU fuel management analysis, snapshots of power and burnup distributions can be obtained by simulating and tracking the reactor operation over an extended period using various tools such as the $^*SIMULATE$ module of the Reactor Fueling Simulation Program (RFSP) code. However, for some studies, such as an evaluation of a conceptual design of a next-generation CANDU reactor, the preferred approach to obtain a snapshot of the power distribution in the core is based on the patterned-channel-age model implemented in the $^*INSTANTAN$ module of the RFSP code. The objective of this approach is to obtain a representative snapshot of core conditions quickly. At present, such patterns could be generated by using a program called RANDIS, which is implemented within the $^*INSTANTAN$ module. In this work, we present an alternative approach to derive the patterned-channel-age model where a simulated-annealing-based algorithm is used to find such patterns, which produce reasonable power distributions.

Large-Scale Joint Rate and Power Allocation Algorithm Combined with Admission Control in Cognitive Radio Networks

  • Shin, Woo-Jin;Park, Kyoung-Youp;Kim, Dong-In;Kwon, Jang-Woo
    • Journal of Communications and Networks
    • /
    • v.11 no.2
    • /
    • pp.157-165
    • /
    • 2009
  • In this paper, we investigate a dynamic spectrum sharing problem for the centralized uplink cognitive radio networks using orthogonal frequency division multiple access. We formulate a large-scale joint rate and power allocation as an optimization problem under quality of service constraint for secondary users and interference constraint for primary users. We also suggest admission control to nd a feasible solution to the optimization problem. To implement the resource allocation on a large-scale, we introduce a notion of using the conservative factors $\alpha$ and $\beta$ depending on the outage and violation probabilities. Since estimating instantaneous channel gains is costly and requires high complexity, the proposed algorithm pursues a practical and implementation-friendly resource allocation. Simulation results demonstrate that the large-scale joint rate and power allocation incurs a slight loss in system throughput over the instantaneous one, but it achieves lower complexity with less sensitivity to variations in shadowing statistics.

A Study on LMMSE Receiver for Single Stream HSDPA MIMO Systems using Precoding Weights (Single Stream HSDPA MIMO 시스템에서 Precoding Weight 적용에 따른 LMMSE 수신기 성능 고찰)

  • Joo, Jung Suk
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.4
    • /
    • pp.3-8
    • /
    • 2013
  • In CDMA-based systems, recently, researches on chip-level equalization have been studied in order to improve receiving performance when supporting high-rate data services. In this paper, we consider a chip-level LMMSE (linear minimum mean-squared error) receiver for D-TxAA (dual stream transmit antenna array) based single stream HSDPA MIMO systems using precoding weights. First, we will derive precoding weights for maximizing the total instantaneous received power. We will also analyze the effects of both transmit delay of precoding weights and mobile velocity on chip-level LMMSE receivers, which is verified through computer simulations in various mobile channel environments.

Exact and Approximate Symbol Error Probability of cooperative systems with best relay selection and all participating relaying using Amplify and Forward or Decode and Forward Relaying over Nakagami-m fading channels

  • Halima, Nadhir Ben;Boujemaa, Hatem
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.81-108
    • /
    • 2018
  • In this paper, we derive the theoretical Symbol Error Probability (SEP) of cooperative systems with best relay selection for Nakagami-m fading channels. For Amplify and Forward (AF) relaying, the selected relay offers the best instantaneous Signal to Noise Ratio (SNR) of the relaying link (source-relay-destination). In cooperative networks using Decode and Forward (DF), the selected relay offers the best instantaneous SNR of the link between the relay and the destination among the relays that have correctly decoded the transmitted information by the source. In the second part of the paper, we derive the SEP when all participating AF and DF relaying is performed. In the last part of the paper, we extend our results to cognitive radio networks where there is interference constraints : only relays that generate interference to primary receiver lower than a predefined threshold T can transmit. Both AF and DF relaying with and without relay selection are considered.

Evolutionary Neural Network based on Quantum Elephant Herding Algorithm for Modulation Recognition in Impulse Noise

  • Gao, Hongyuan;Wang, Shihao;Su, Yumeng;Sun, Helin;Zhang, Zhiwei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.7
    • /
    • pp.2356-2376
    • /
    • 2021
  • In this paper, we proposed a novel modulation recognition method based on quantum elephant herding algorithm (QEHA) evolving neural network under impulse noise environment. We use the adaptive weight myriad filter to preprocess the received digital modulation signals which passing through the impulsive noise channel, and then the instantaneous characteristics and high order cumulant features of digital modulation signals are extracted as classification feature set, finally, the BP neural network (BPNN) model as a classifier for automatic digital modulation recognition. Besides, based on the elephant herding optimization (EHO) algorithm and quantum computing mechanism, we design a quantum elephant herding algorithm (QEHA) to optimize the initial thresholds and weights of the BPNN, which solves the problem that traditional BPNN is easy into local minimum values and poor robustness. The experimental results prove that the adaptive weight myriad filter we used can remove the impulsive noise effectively, and the proposed QEHA-BPNN classifier has better recognition performance than other conventional pattern recognition classifiers. Compared with other global optimization algorithms, the QEHA designed in this paper has a faster convergence speed and higher convergence accuracy. Furthermore, the effect of symbol shape has been considered, which can satisfy the need for engineering.