• 제목/요약/키워드: multiple channel

검색결과 2,107건 처리시간 0.036초

MIMO Channel Capacity and Configuration Selection for Switched Parasitic Antennas

  • Pal, Paramvir Kaur;Sherratt, Robert Simon
    • ETRI Journal
    • /
    • 제40권2호
    • /
    • pp.197-206
    • /
    • 2018
  • Multiple-input multiple-output (MIMO) systems offer significant enhancements in terms of their data rate and channel capacity compared to traditional systems. However, correlation degrades the system performance and imposes practical limits on the number of antennas that can be incorporated into portable wireless devices. The use of switched parasitic antennas (SPAs) is a possible solution, especially where it is difficult to obtain sufficient signal decorrelation by conventional means. The covariance matrix represents the correlation present in the propagation channel, and has significant impact on the MIMO channel capacity. The results of this work demonstrate a significant improvement in the MIMO channel capacity by using SPA with the knowledge of the covariance matrix for all pattern configurations. By employing the "water-pouring algorithm" to modify the covariance matrix, the channel capacity is significantly improved compared to traditional systems, which spread transmit power uniformly across all the antennas. A condition number is also proposed as a selection metric to select the optimal pattern configuration for MIMO-SPAs.

Link Scheduling and Channel Assignment in Multi-channel Cognitive Radio Networks: Spectrum Underlay Approach

  • Nguyen, Mui Van;Hong, Choong-Seon
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(D)
    • /
    • pp.300-302
    • /
    • 2012
  • In this paper, we investigate the performance of multi-channel cognitive radio networks (CRNs) by taking into consideration the problem of channel assignment and link scheduling. We assume that secondary nodes are equipped with multiple radios and can switch among multiple channels. How to allocate channels to links and how much power used on each channel to avoid mutual interference among secondary links are the key problem for such CRNs. We formulate the problem of channel assignment and link scheduling as a combinatorial optimization problem. Then, we propose a the optimal solution and show that it converges to maximum optimum in some iterations by using numerical results.

Impact of Fin Aspect Ratio on Short-Channel Control and Drivability of Multiple-Gate SOI MOSFET's

  • Omura, Yasuhisa;Konishi, Hideki;Yoshimoto, Kazuhisa
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제8권4호
    • /
    • pp.302-310
    • /
    • 2008
  • This paper puts forward an advanced consideration on the design of scaled multiple-gate FET (MuGFET); the aspect ratio ($R_{h/w}$) of the fin height (h) to fin width (w) of MuGFET is considered with the aid of 3-D device simulations. Since any change in the aspect ratio must consider the trade-off between drivability and short-channel effects, it is shown that optimization of the aspect ratio is essential in designing MuGFET's. It is clearly seen that the triple-gate (TG) FET is superior to the conventional FinFET from the viewpoints of drivability and short-channel effects as was to be expected. It can be concluded that the guideline of w < L/3, where L is the channel length, is essential to suppress the short-channel effects of TG-FET.

A New Approach to Estimating the MIMO Channel in Wireless Networks

  • Kim, Jee-Hoon;Song, Hyoung-Kyu
    • Journal of information and communication convergence engineering
    • /
    • 제5권3호
    • /
    • pp.229-232
    • /
    • 2007
  • This paper investigates on the use of constant-amplitude zero-autocorrelation (CAZAC) sequence for channel estimation in multiple-input multiple-output (MIMO) system over indoor wireless channel. Since the symbol-length of the conventional 4-phase CAZAC sequence is short, there is a limitation to use it for MIMO system in multipath environments. An algorithm which generates longer CAZAC sequences is proposed to overcome that problem. Flexible symbol-length of 4-phase CAZAC sequences can be made by the proposed algorithm. Therefore appropriate symbol-length of CAZAC sequences could be utilized as preambles in accordance with the number of transmit antennas and channel condition. The effect of the number of CAZAC sequences for channel estimation is presented in terms of mean square error (MSE).

Spectrum Management Models for Cognitive Radios

  • Kaur, Prabhjot;Khosla, Arun;Uddin, Moin
    • Journal of Communications and Networks
    • /
    • 제15권2호
    • /
    • pp.222-227
    • /
    • 2013
  • This paper presents an analytical framework for dynamic spectrum allocation in cognitive radio networks. We propose a distributed queuing based Markovian model each for single channel and multiple channels access for a contending user. Knowledge about spectrum mobility is one of the most challenging problems in both these setups. To solve this, we consider probabilistic channel availability in case of licensed channel detection for single channel allocation, while variable data rates are considered using channel aggregation technique in the multiple channel access model. These models are designed for a centralized architecture to enable dynamic spectrum allocation and are compared on the basis of access latency and service duration.

Wireless MIMO를 위한 Confluent Hypergeometric Function를 이용한 Closed Form Channel Capacity의 유도 (Derivation of Closed Form Channel Capacity Using Confluent Hypergeometric Function for Wireless MIMO)

  • ;;;윤기완
    • 한국정보통신학회논문지
    • /
    • 제12권6호
    • /
    • pp.1082-1086
    • /
    • 2008
  • MIMO기술은 대역폭과 전력에 의해 제한을 받는 무선네트워크의 데이터 전송률을 증대시켜주는 효과적인 기술이다. 송수신단사이의 데이터 전송률은 채널용량에 의해 결정되며, MIMO기술은 이 채널용량을 적절히 이용함으로써 무선채널에서의 통신신뢰도를 높이는 이점을 가지고 있다. 본 논문은 Confluent Hypergeometric Function를 이용하여 새로운 공식 인 closed form capacity formula를 유도한다.

Orthogonal NOMA Strong Channel User Capacity: Zero Power Non-Zero Capacity Transmission

  • Chung, Kyuhyuk
    • 전기전자학회논문지
    • /
    • 제23권2호
    • /
    • pp.735-738
    • /
    • 2019
  • Recently, orthogonal non-orthogonal multiple access (O NOMA) with polar on-off keying (POOK) has been proposed to mitigate the severe effect of the superposition. However, it is observed that the performance of the O NOMA strong channel user is better than that of the perfect successive interference cancellation (SIC), i.e., the performance of a single user transmission with binary phase shift keying (BPSK). Can the performance of the BPSK modulation be better that that of itself? It is not normal. It should be clearly understood theoretically, with the ultimate bound, i.e., the channel capacity. This paper proves that the channel capacity of the O NOMA strong channel user is non-zero with zero power allocation. Thus, it is shown that the interference is transformed effectively into the meaningful signal.

A Trellis-based Technique for Blind Channel Estimation and Equalization

  • Cao, Lei;Chen, Chang-Wen;Orlik, Philip;Zhang, Jinyun;Gu, Daqing
    • Journal of Communications and Networks
    • /
    • 제6권1호
    • /
    • pp.19-25
    • /
    • 2004
  • In this paper, we present a trellis-based blind channel estimation and equalization technique coupling two kinds of adaptive Viterbi algorithms. First, the initial blind channel estimation is accomplished by incorporating the list parallel Viterbi algorithm with the least mean square (LMS) updating approach. In this operation, multiple trellis mappings are preserved simultaneously and ranked in terms of path metrics. Equivalently, multiple channel estimates are maintained and updated once a single symbol is received. Second, the best channel estimate from the above operation will be adopted to set up the whole trellis. The conventional adaptive Viterbi algorithm is then applied to detect the signal and further update the channel estimate alternately. A small delay is introduced for the symbol detection and the decision feedback to smooth the noise impact. An automatic switch between the above two operations is also proposed by exploiting the evolution of path metrics and the linear constraint inherent in the trellis mapping. Simulation has shown an overall excellent performance of the proposed scheme in terms of mean square error (MSE) for channel estimation, robustness to the initial channel guess, computational complexity, and channel equalization.

UMMAC: A Multi-Channel MAC Protocol for Underwater Acoustic Networks

  • Su, Yishan;Jin, Zhigang
    • Journal of Communications and Networks
    • /
    • 제18권1호
    • /
    • pp.75-83
    • /
    • 2016
  • In this paper, we propose a multi-channel medium access control (MAC) protocol, named underwater multi-channel MAC protocol (UMMAC), for underwater acoustic networks (UANs). UMMAC is a split phase and reservation based multi-channel MAC protocol which enables hosts to utilize multiple channels via a channel allocation and power control algorithm (CAPC). In UMMAC, channel information of neighboring nodes is gathered via exchange of control packets. With such information, UMMAC allows for as many parallel transmissions as possible while avoiding using extra time slot for channel negotiation. By running CAPC algorithm, which aims at maximizing the network's capacity, users can allocate their transmission power and channels in a distributed way. The advantages of the proposed protocol are threefold: 1) Only one transceiver is needed for each node; 2) based on CAPC, hosts are coordinated to negotiate the channels and control power in a distributed way; 3) comparing with existing RTS/CTS MAC protocols, UMMAC do not introduce new overhead for channel negotiation. Simulation results show that UMMAC outperforms Slotted floor acquisition multiple access (FAMA) and multi-channel MAC (MMAC) in terms of network goodput (50% and 17% respectively in a certain scenario). Furthermore, UMMAC can lower the end-to-end delay and achieves a lower energy consumption compared to Slotted FAMA and MMAC.

Fast Channel Allocation for Ultra-dense D2D-enabled Cellular Network with Interference Constraint in Underlaying Mode

  • Dun, Hui;Ye, Fang;Jiao, Shuhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권6호
    • /
    • pp.2240-2254
    • /
    • 2021
  • We investigate the channel allocation problem in an ultra-dense device-to-device (D2D) enabled cellular network in underlaying mode where multiple D2D users are forced to share the same channel. Two kinds of low complexity solutions, which just require partial channel state information (CSI) exchange, are devised to resolve the combinatorial optimization problem with the quality of service (QoS) guaranteeing. We begin by sorting the cellular users equipment (CUEs) links in sequence in a matric of interference tolerance for ensuring the SINR requirement. Moreover, the interference quota of CUEs is regarded as one kind of communication resource. Multiple D2D candidates compete for the interference quota to establish spectrum sharing links. Then base station calculates the occupation of interference quota by D2D users with partial CSI such as the interference channel gain of D2D users and the channel gain of D2D themselves, and carries out the channel allocation by setting different access priorities distribution. In this paper, we proposed two novel fast matching algorithms utilize partial information rather than global CSI exchanging, which reduce the computation complexity. Numerical results reveal that, our proposed algorithms achieve outstanding performance than the contrast algorithms including Hungarian algorithm in terms of throughput, fairness and access rate. Specifically, the performance of our proposed channel allocation algorithm is more superior in ultra-dense D2D scenarios.