Araştırma Çıktıları | WoS | Scopus | TR-Dizin | PubMed

Permanent URI for this communityhttps://hdl.handle.net/20.500.14719/1741

Browse

Start date: 2010End date: 2019Type: search.filters.itemtype.Conference PaperHas files: NoAuthor: search.filters.author.Soysal, AlkanSubject: search.filters.subject.Mimo SystemsSubject: search.filters.subject.Channel State Information

Search Results

Now showing 1 - 5 of 5
  • No Thumbnail Available
    PublicationMetadata only
    MIMO systems with non-exact CSI, Eksik kanal bilgisi Altinda MIMO sistemler
    (2010) Soysal, Alkan; Soysal, Alkan, Bahçeşehir Üniversitesi, Istanbul, Turkey
    Multiple antenna systems are known to provide very large data rates, when the perfect channel state information is available at the receiver. However, this requires the receiver to perform a noise-free, multi-dimensional channel estimation, without using communication resources. In practice, any channel estimation is noisy and uses system resources. We shall examine the trade-off between improving channel estimation and increasing the achievable data rate. Lower and upper bounds for the capacity of the system will be derived. ©2010 IEEE. © 2011 Elsevier B.V., All rights reserved.
  • No Thumbnail Available
    PublicationMetadata only
    A fast power allocation algorithm for MIMO relay channels, MIMO aktarma kanallarinda güç tahsisi i̇çin hizli bir algoritma
    (2011) Aygün, Bengi; Soysal, Alkan; Aygün, Bengi, Bahçeşehir Üniversitesi, Istanbul, Turkey; Soysal, Alkan, Bahçeşehir Üniversitesi, Istanbul, Turkey
    By assuming full-duplex mode, we consider a MIMO relay channel where the receivers have perfect channel state information (CSI) and the transmitters have partial CSI. Lower bound achieving transmit covariance matrices are derived using an iterative algorithm. Lower bound to the capacity is analyzed for three cases depending on the channel covariance matrix. In the first case, lower bound on the capacity is equal to the capacity of the link from source to relay. In the second case, lower bound on the capacity is equal to the multi access channel capacity from source and relay to the destination. In the last case, lower bound on the capacity depends on both multi access channel and source to relay channel. In that case, under a certain practical channel assumption, we propose a fast power allocation algorithm. © 2011 IEEE. © 2011 Elsevier B.V., All rights reserved.
  • No Thumbnail Available
    PublicationMetadata only
    Achieving the lower bound of fading MIMO relay channels with covariance feedback at the transmitters
    (2011) Aygün, Bengi; Soysal, Alkan; Aygün, Bengi, Department of Electrical and Electronic Engineering, Bahçeşehir Üniversitesi, Istanbul, Turkey; Soysal, Alkan, Department of Electrical and Electronic Engineering, Bahçeşehir Üniversitesi, Istanbul, Turkey
    In this paper, we consider a full-duplex mode MIMO relay channel for decode and forward strategy where the receivers have perfect channel state information (CSI) and the transmitters have only covariance feedback at the transmitters. We derive a lower bound to the ergodic capacity for this scenario and propose an iterative algorithm that finds lower bound achieving transmit covariance matrices of the source and relay nodes. The solution of the optimization problem in the lower bound expression is given for three cases depending on channel covariance matrices. For one of these cases, it seems that an efficient and fast algorithm achieving the lower bound is not possible. However, under a certain practical channel assumption, we propose a power allocation algorithm that gives a solution much faster than classical convex optimization methods. Moreover, we show that this fast algorithm results in a data rate which is very close to the lower bound to the capacity. © 2011 IEEE. © 2011 Elsevier B.V., All rights reserved.
  • No Thumbnail Available
    PublicationMetadata only
    Fading MIMO relay channels with channel estimation error
    (Institute of Electrical and Electronics Engineers Inc., 2013) Aygün, Bengi; Soysal, Alkan; Aygün, Bengi, Department of Electrical and Electronic Engineering, Bahçeşehir Üniversitesi, Istanbul, Turkey; Soysal, Alkan, Department of Electrical and Electronic Engineering, Bahçeşehir Üniversitesi, Istanbul, Turkey
    In this paper, we consider a full-duplex, decode-and-forward, fading MIMO relay channel where the transmitters have partial channel state information (CSI) and the receivers have noisy channel estimates. Under block fading assumption, we divide the transmission block into two parts: training phase and data transmission phase. The destination and relay receivers estimate the instantaneous channel realizations during the training phase by using linear minimum mean square error (MMSE) estimation, extract the covariance information of the channel, and feed it back to the source and relay transmitters. We obtain a lower bound expression to the relay channel capacity in terms of a max-min optimization problem over channel estimation and data transmission parameters. By applying matrix differential calculus, we jointly optimize this achievable rate over source and relay transmit covariance matrices, training phase length, training phase powers and training sequences. © 2013 IEEE. © 2016 Elsevier B.V., All rights reserved.
  • No Thumbnail Available
    PublicationMetadata only
    Optimality of beamforming in fading MIMO with noisy channel estimation
    (Institute of Electrical and Electronics Engineers Inc., 2014) Soysal, Alkan; Soysal, Alkan, Department of Electrical and Electronic Engineering, Bahçeşehir Üniversitesi, Istanbul, Turkey
    In this paper, we consider a single user block fading communication system where both the transmitter and receiver have multIPle antennas. A transmission block is divided into training and data transmission phases. The channel estimation at the receiver is noisy. The transmitter has long term statistics of the estimated channel in the form of a covariance matrix. The general problem is to find optimum transmit covariance matrix under these channel state information (CSI) assumptions. Beamforming strategy is optimum when the optimum transmit covariance matrix is unit rank. Previous works find conditions under which beamforming is optimal when the receiver has instantaneous and full CSI. Here, we consider noisy CSI at the receiver and introduce a condition over channel covariance matrix, block length and the transmit power constraint, where beamforming is always the optimum transmission strategy. We show through simulations that beamforming is optimal for a larger set of parameters when block duration is short and when SNR is low. An interesting result we observe through simulations is that beamforming is always optimal when transmission block is at most three symbols long. This means that when block fading becomes faster, beamforming becomes optimal almost always regardless of number of antennas or other parameters. © 2017 Elsevier B.V., All rights reserved.