SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Sezgin Aydin) "

Sökning: WFRF:(Sezgin Aydin)

  • Resultat 1-10 av 12
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Ahmad, Bilal, et al. (författare)
  • The Perfect Match : RIS-enabled MIMO Channel Estimation Using Tensor Decomposition
  • 2023
  • Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
    • The deployment of reconfigurable intelligent surfaces (RISs) in a communication system provides control over the propagation environment, which facilitates the augmentation of a multitude of communication objectives. As these performance gains are highly dependent on the applied phase shifts at the RIS, accurate channel state information at the transceivers is imperative. However, not only do RISs traditionally lack signal processing capabilities, but their end-to-end channels also consist of multiple components. Hence, conventional channel estimation (CE) algorithms become incompatible with RIS-aided communication systems as they fail to provide the necessary information about the channel components, which are essential for a beneficial RIS configuration. To enable the full potential of RISs, we propose to use tensor-decomposition-based CE, which facilitates smart configuration of the RIS by providing the required channel components. We use canonical polyadic (CP) decomposition, that exploits a structured time domain pilot sequence. Compared to other state-of-the-art decomposition methods, the proposed Semi-Algebraic CP decomposition via Simultaneous Matrix Diagonalization (SECSI) algorithm is more time efficient as it does not require an iterative process. The benefits of SECSI for RIS-aided networks are validated with numerical results, which show the improved individual and end-to-end CE accuracy of SECSI.
  •  
2.
  • Cisija, Emrah, et al. (författare)
  • Ris-Aided mmWave MIMO Radar System for Adaptive Multi-Target Localization
  • 2021
  • Ingår i: IEEE Workshop on Statistical Signal Processing Proceedings. ; 2021-July, s. 196-200
  • Konferensbidrag (refereegranskat)abstract
    • In this paper, we propose to utilize a reconfigurable intelligent surface (RIS) aided millimeter wave (mmWave) multiple-input-multiple-output (MIMO) radar system for multi-target localization. The goal is to detect multiple targets with sufficient accuracy using an adaptive localization algorithm utilizing the concept of hierarchical codebook design. The simulation results show that in case of a blocked line of sight (LOS) between the transmitter and the targets, the receiver can still localize all the targets with very good accuracy using the RIS.
  •  
3.
  • Jorswieck, Eduard A., 1975-, et al. (författare)
  • Feedback reduction in uplink MIMO OFDM systems by chunk optimization
  • 2008
  • Ingår i: EURASIP Journal on Advances in Signal Processing. - : Springer Science and Business Media LLC. - 1687-6172 .- 1687-6180.
  • Tidskriftsartikel (refereegranskat)abstract
    • The performance of multiuser MIMO systems can be significantly increased by channel-aware scheduling and signal processing at the transmitters based on channel state information. In the multiple antenna uplink multicarrier scenario, the base station decides centrally on the optimal signal processing and spectral power allocation as well as scheduling. An interesting challenge is the reduction of the overhead in order to inform the mobiles about their transmit strategies. In this work, we propose to reduce the feedback by chunk processing and quantization. We maximize the weighted sum rate of a MIMO OFDM MAC under individual power constraints and chunk size constraints. An efficient iterative algorithm is developed and convergence is proved. The feedback overhead as a function of the chunk size is considered in the rate computation and the optimal chunk size is determined by numerical simulations for various channel models. Finally, the issues of finite modulation and coding schemes as well as quantization of the precoding matrices are addressed.
  •  
4.
  • Jorswieck, Eduard A., 1975-, et al. (författare)
  • Framework for Analysis of Opportunistic Schedulers : Average Sum Rate vs. Average Fairness
  • 2008
  • Ingår i: Proceedings of the 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2008. - 9789639799189 ; , s. 100-105
  • Konferensbidrag (refereegranskat)abstract
    • Channel aware and opportunistic scheduling algorithms exploit the channel knowledge and fading to increase the average throughput. The maximum throughput scheduler (MTS) transmits only to the best user at a time. It is unfair to users at the cell edge. Obviously, there is a tradeoff between average throughput and fairness in the system. In this work, we study four representative schedulers, namely the MTS, the proportional fair scheduler (PFS), the (relative) opportunistic round robin scheduler (ORS), and the round robin scheduler (RRS). We show that the average sum rate performance and the average worst-case delay depend strongly on the user distribution within the cell. MTS gains from asymmetrically distributed users whereas the other three schedulers suffer. On the other hand, the average fairness of MTS and PFS decreases with asymmetrical user distribution. The key contribution of this paper is to put these tradeoffs and observations on a solid theoretical basis. The scaling laws of the average sum rate with the number of users as well as of the average worst-case delay are derived. Both the PFS and the ORS provide a reasonable performance in terms of throughput and fairness. However, PFS outperforms ORS for symmetrical user distributions, whereas ORS outperforms PFS for asymmetrical user distributions.
  •  
5.
  • Jorswieck, Eduard A., et al. (författare)
  • Guaranteed performance region in fading orthogonal space-time coded broadcast channels
  • 2007
  • Ingår i: 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS. - NEW YORK : IEEE. - 9781424413973 ; , s. 96-100
  • Konferensbidrag (refereegranskat)abstract
    • Recently, the capacity region of the MIMO broadcast channel (BC) was completely characterized and duality between MIMO multiple access channel (MAC) and MIMO BC with perfect channel state information (CSI) at transmitter and receiver was established. In this work, we propose a MIMO BC approach in which only information about the channel norm is available at the base and hence no dirty paper precoding (DPC) can be applied. However, a certain set of individual performances in terms of MSE or zero-outage rates can be guaranteed at any time by applying an orthogonal space time block code (OSTBC). The guaranteed MSE region without superposition coding is characterized in closed form and the impact of diversity, fading statistics, and number of transmit antennas is analyzed. The guaranteed MSE region with superposition coding is also studied. Finally, the guaranteed sum MSE is briefly discussed.
  •  
6.
  • Jorswieck, Eduard A., 1975-, et al. (författare)
  • Guaranteed performance region in fading orthogonal space-time coded broadcast channels
  • 2008
  • Ingår i: EURASIP Journal on Wireless Communications and Networking. - : Springer Science and Business Media LLC. - 1687-1472 .- 1687-1499.
  • Tidskriftsartikel (refereegranskat)abstract
    • Recently, the capacity region of the MIMO broadcast channel (BC) was completely characterized and duality between MIMO multiple access channel (MAC) and MIMO BC with perfect channel state information (CSI) at transmitter and receiver was established. In this work, we propose a MIMO BC approach in which only information about the channel norm is available at the base and hence no joint beamforming and dirty paper precoding (DPC) can be applied. However, a certain set of individual performances in terms of MSE or zero-outage rates can be guaranteed at any time by applying an orthogonal space-time block code (OSTBC). The guaranteed MSE region without superposition coding is characterized in closed form and the impact of diversity, fading statistics, and number of transmit antennas and receive antennas is analyzed. Finally, six CSI and precoding scenarios with different levels of CSI and precoding are compared numerically in terms of their guaranteed MSE region. Depending on the long-term SNR, superposition coding as well as successive interference cancellation (SIC) with norm feedback performs better than linear precoding with perfect CSI.
  •  
7.
  • Jorswieck, Eduard A., 1975-, et al. (författare)
  • Throughput versus Fairness : Channel-Aware Scheduling in Multiple Antenna Downlink
  • 2009
  • Ingår i: EURASIP Journal on Wireless Communications and Networking. - : Springer Science and Business Media LLC. - 1687-1472 .- 1687-1499. ; , s. 271540-
  • Tidskriftsartikel (refereegranskat)abstract
    • Channel aware and opportunistic scheduling algorithms exploit the channel knowledge and fading to increase the average throughput. Alternatively, each user could be served equally in order to maximize fairness. Obviously, there is a tradeoff between average throughput and fairness in the system. In this paper, we study four representative schedulers, namely the maximum throughput scheduler (MTS), the proportional fair scheduler (PFS), the (relative) opportunistic round robin scheduler (ORS), and the round robin scheduler (RRS) for a space-time coded multiple antenna downlink system. The system applies TDMA based scheduling and exploits the multiple antennas in terms of spatial diversity. We show that the average sum rate performance and the average worst-case delay depend strongly on the user distribution within the cell. MTS gains from asymmetrical distributed users whereas the other three schedulers suffer. On the other hand, the average fairness of MTS and PFS decreases with asymmetrical user distribution. The key contribution of this paper is to put these tradeoffs and observations on a solid theoretical basis. Both the PFS and the ORS provide a reasonable performance in terms of throughput and fairness. However, PFS outperforms ORS for symmetrical user distributions, whereas ORS outperforms PFS for asymmetrical user distribution.
  •  
8.
  • Jorswieck, Eduard, et al. (författare)
  • Feedback reduction in uplink MIMO OFDM systems by chunk optimization
  • 2008
  • Ingår i: 2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS. - 9781424420742 ; , s. 4348-4352
  • Konferensbidrag (refereegranskat)abstract
    • The performance of multiuser MIMO systems can be significantly increased by channel aware scheduling and signal processing at the transmitters based on channel state information. In the multiple-antenna uplink multi-carrier scenario, the base station decides centrally on the optimal signal processing and spectral power allocation as well as scheduling. An interesting challenge is the reduction of the overhead in order to inform the mobiles about their transmit strategies. In this work, we propose to reduce the feedback by chunk processing and quantization. We maximize the weighted sum rate of a MIMO OFDM MAC under individual power constraints and chunk size constraints. An efficient iterative algorithm is developed and convergence proved. The feedback overhead as a function of the chunk size is considered in the rate computation and the optimal chunk size is determined by numerical simulations for various channel models. Finally, the issues of finite modulation and coding schemes as well as quantization of the precoding matrices are addressed.
  •  
9.
  •  
10.
  • Sezgin, Aydin, et al. (författare)
  • Complete characterization of the equivalent MIMO channel for quasi-orthogonal space-time codes
  • 2008
  • Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 54:7, s. 3315-3327
  • Tidskriftsartikel (refereegranskat)abstract
    • Recently, a quasi-orthogonal space-time block code (QSTBC) capable of achieving a significant fraction of the outage mutual information of a multiple-input-multiple-output (MIMO) wireless communication system for the case of n(T) = 4 transmit and n(R) = 1 receive antennas was proposed. We generalize these results to n(T) = 2(n) transmit and an arbitrary number of receive antennas. Furthermore, we completely characterize the structure of the equivalent channel for the general case and show that for all n(T) = 2(n) and n(R) the eigenvectors of the equivalent channel are fixed and independent from the channel realization. Furthermore, the eigenvalues of the equivalent channel are independent identically distributed random variables each following a noncentral chi-square distribution with 4n(R) degrees of freedom. Based on these important insights into the structure of the QSTBC, we derive tight lower and upper bounds for the outage probability achieved with QSTBC. Finally, by utilizing the special structure of the QSTBC, we propose a new transmit strategy, which decouples the signals transmitted from different antennas in order to detect the symbols separately with a linear ML-detector rather than joint detection, an up to now only known advantage of orthogonal space-time block codes (OSTBC).
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 12

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy