SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Celebi Hasan Basri) "

Sökning: WFRF:(Celebi Hasan Basri)

  • Resultat 1-10 av 20
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Celebi, Hasan Basri, et al. (författare)
  • Multi-coset sampling and reconstruction of signals : Exploiting sparsity in spectrum monitoring
  • 2013
  • Konferensbidrag (refereegranskat)abstract
    • We present an analytical representation of multi-coset sampling (MCS) and implement the proposed scheme on spectrum data to analyze the effect of MCS that requires less samples. Sampling pattern (SP) selection, which is one of the most significant phases of MCS, is investigated and the effect of the SP on reconstruction matrices and reconstruction process of the signal is analyzed. Different algorithms, which aim to find the optimum SP, are presented and their performances are compared. In order to present the feasibility of the process, MCS is implemented to measurements captured by a spectrum analyzer. The wideband spectrum measurements are obtained over 700-3000 MHz. They are sub-sampled and reconstructed again, so that the RMSE values of the reconstructed signals are evaluated. Effects of the SP search algorithms on the reconstruction process are analyzed for the spectrum monitoring application.
  •  
2.
  • Cavarec, Baptiste, et al. (författare)
  • A Learning-Based Approach to Address Complexity-Reliability Tradeoff in OS Decoders
  • 2020
  • Ingår i: Conference Record - Asilomar Conference on Signals, Systems and Computers. - : IEEE Computer Society. ; , s. 689-692
  • Konferensbidrag (refereegranskat)abstract
    • In this paper, we study the tradeoffs between complexity and reliability for decoding large linear block codes. We show that using artificial neural networks to predict the required order of an ordered statistics based decoder helps in reducing the average complexity and hence the latency of the decoder. We numerically validate the approach through Monte Carlo simulations.
  •  
3.
  • Celebi, Hasan Basri, et al. (författare)
  • A joint blind carrier frequency and phase offset detector and modulation order identifier for MPSK signals
  • 2010
  • Ingår i: 2010 IEEE Radio and Wireless Symposium (RWS). - : IEEE conference proceedings. ; , s. 348-351
  • Konferensbidrag (refereegranskat)abstract
    • In this paper, a new blind carrier frequency and phase offset detector, and modulation order identifier are presented for phase shift keying (PSK) signals. These operations are intermediate steps between signal detection and demodulation, and play a key role in various military and non- military applications. As compared with previous related approaches, the proposed algorithm provides a fully blind phase-frequency offset detector structure without having the knowledge of modulation order. After correcting the frequency offset, the modulation order is detected by investigating the probability density function (PDF) of the phase distribution.
  •  
4.
  • Celebi, Hasan Basri, et al. (författare)
  • A Multi-Objective Optimization Framework for URLLC With Decoding Complexity Constraints
  • 2022
  • Ingår i: IEEE Transactions on Wireless Communications. - : Institute of Electrical and Electronics Engineers (IEEE). - 1536-1276 .- 1558-2248. ; 21:4, s. 2786-2798
  • Tidskriftsartikel (refereegranskat)abstract
    • Stringent constraints on both reliability and latency must be guaranteed in ultra-reliable low-latency communication (URLLC). To fulfill these constraints with computationally constrained receivers, such as low-budget IoT receivers, optimal transmission parameters need to be studied in detail. In this paper, we introduce a multi-objective optimization framework for the optimal design of URLLC in the presence of decoding complexity constraints. We consider transmission of short-blocklength codewords that are encoded with linear block encoders, transmitted over a binary-input AWGN channel, and finally decoded with order-statistics (OS) decoder. We investigate the optimal selection of a transmission rate and power pair, while satisfying the constraints. For this purpose, a multi-objective optimization problem (MOOP) is formulated. Based on the empirical model that accurately quantifies the trade-off between the performance of an OS decoder and its computational complexity, the MOOP is solved and the Pareto boundary is derived. In order to assess the overall performance among several Pareto-optimal transmission pairs, two scalarization methods are investigated. To exemplify the importance of the MOOP, a case study on a battery-powered communication system is provided. It is shown that, compared to the classical fixed rate-power transmissions, the MOOP provides the optimum usage of the battery and increases the energy efficiency of the communication system while maintaining the constraints.
  •  
5.
  • Celebi, Hasan Basri, et al. (författare)
  • Goodput Maximization With Quantized Feedback in the Finite Blocklength Regime for Quasi-Static Channels
  • 2022
  • Ingår i: IEEE Transactions on Communications. - : Institute of Electrical and Electronics Engineers (IEEE). - 0090-6778 .- 1558-0857. ; 70:8, s. 5071-5084
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper, we study a quantized feedback scheme to maximize the goodput of a finite blocklength communication scenario over a quasi-static fading channel. It is assumed that the receiver has perfect channel state information (CSI) and sends back the CSI to the transmitter over a resolution-limited error-free feedback channel. With this partial CSI, the transmitter is supposed to select the optimum transmission rate, such that it maximizes the overall goodput of the communication system. This problem has been studied for the asymptotic blocklength regime, however, no solution has so far been presented for finite blocklength. Here, we study this problem in two cases: with and without constraint on reliability. We first formulate the optimization problems and analytically solve them. Iterative algorithms that successfully exploit the system parameters for both cases are presented. It is shown that although the achievable maximum goodput decreases with shorter blocklengths and higher reliability requirements, significant improvement can be achieved even with coarsely quantized feedback schemes.
  •  
6.
  • Celebi, Hasan Basri, et al. (författare)
  • Latency and Reliability Trade-Off With Computational Complexity Constraints : OS Decoders and Generalizations
  • 2021
  • Ingår i: IEEE Transactions on Communications. - : Institute of Electrical and Electronics Engineers (IEEE). - 0090-6778 .- 1558-0857. ; 69:4, s. 2080-2092
  • Tidskriftsartikel (refereegranskat)abstract
    • In this article, we study the problem of latency and reliability trade-off in ultra-reliable low-latency communication (URLLC) in the presence of decoding complexity constraints. We consider linear block encoded codewords transmitted over a binary-input AWGN channel and decoded with order-statistic (OS) decoder. We first investigate the performance of OS decoders as a function of decoding complexity and propose an empirical model that accurately quantifies the corresponding trade-off. Next, a consistent way to compute the aggregate latency for complexity constrained receivers is presented, where the latency due to decoding is also included. It is shown that, with strict latency requirements, decoding latency cannot be neglected in complexity constrained receivers. Next, based on the proposed model, several optimization problems, relevant to the design of URLLC systems, are introduced and solved. It is shown that the decoding time has a drastic effect on the design of URLLC systems when constraints on decoding complexity are considered. Finally, it is also illustrated that the proposed model can closely describe the performance versus complexity trade-off for other candidate coding solutions for URLLC such as tail-biting convolutional codes, polar codes, and low-density parity-check codes.
  •  
7.
  • Celebi, Hasan Basri, et al. (författare)
  • Low-latency communication with computational complexity constraints
  • 2019
  • Ingår i: Proceedings of the International Symposium on Wireless Communication Systems. - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 384-388
  • Konferensbidrag (refereegranskat)abstract
    • Low-latency communication is one of the most important application scenarios in next-generation wireless networks. Often in communication-theoretic studies latency is defined as the time required for the transmission of a packet over a channel. However, with very stringent latency requirements and complexity constrained receivers, the time required for the decoding of the packet cannot be ignored and must be included in the total latency analysis through accurate modeling. In this paper, we first present a way to calculate decoding time using per bit complexity metric and introduce an empirical model that accurately describes the trade-off between the decoding complexity versus the performance of state-of-the-art codes. By considering various communication parameters, we show that including the decoding time in latency analyses has a significant effect on the optimum selection of parameters.
  •  
8.
  • Celebi, Hasan Basri, et al. (författare)
  • Noise and channel statistics of indoor power line networks
  • 2011
  • Ingår i: 2011 18th International Conference on Telecommunications. - : IEEE conference proceedings. ; , s. 523-527
  • Konferensbidrag (refereegranskat)abstract
    • Power line communication (PLC) channels may have entirely different physical characteristics. In order to establish reliable communication systems operating in power line networks (PLNs), characteristics of power line channel have to be investigated very carefully. In this paper, noise and multipath characteristics of PLC channels are examined. A unique experimental setup is established for noise measurements and a simulation environment is prepared for multipath analysis for indoor PLNs. Results of the measurements and simulations are presented. Besides the investigation of some specific PLNs, impact of the physical characteristics of different PLC networks on the channel delay spread parameter, namely root-mean-squared (RMS) delay spread, are studied statistically.
  •  
9.
  • Celebi, Hasan Basri, et al. (författare)
  • Spectrum sensing with periodic non-uniform sampling
  • 2015
  • Konferensbidrag (refereegranskat)abstract
    • New wireless communication technologies increase the demand for spectrum sensing. However due to the limitations of analogue-to-digital converters, sampling a wide spectrum still remains as a major problem. In this paper, a method for estimating the power spectrum density (PSD) from multi-coset (MC) samples, which is a special sub-Nyquist sampling method, is explained. In order to see the feasibility of the method, wide sense spectrum measurements are taken from a vector signal analyzer and each measurement is MC sampled. Then the PSD estimation is compared with the original PSD of the signal. False alarm rates for different variations are analyzed.
  •  
10.
  • Celebi, Hasan Basri, et al. (författare)
  • Training-Assisted Channel Estimation for Low-Complexity Squared-Envelope Receivers
  • 2018
  • Ingår i: IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC. - : Institute of Electrical and Electronics Engineers Inc.. - 9781538635124 ; , s. 196-200
  • Konferensbidrag (refereegranskat)abstract
    • Squared-envelope receivers, also known as energy detectors, are, due to their simplified circuitry, low-cost and low-complexity receivers. Hence they are attractive implementation structures for future Internet-of-Things (IoT) applications. Even though there is considerable work on the wider research area of squared-envelope receivers, a comprehensive comparison and statistical characterization of training-assisted channel estimators for squared-envelope receivers appear to be absent from the literature. A detailed description of practical channel estimation schemes is necessary for the optimal training design of latency-constrained IoT applications. In this paper, various channel estimators are derived, their bias and variance are studied, and their performance is numerically compared against the Cramer-Rao lower bound.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 20

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