Gazi, Orhan
Loading...
Profile URL
Name Variants
Gazi, O.
Job Title
Doç. Dr.
Email Address
Main Affiliation
Elektronik ve Haberleşme Mühendisliği
Status
Former Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
Sustainable Development Goals
SDG data is not available
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
No records found in other affiliations.
Scholarly Output
57
Articles
18
Views / Downloads
4203/598
Supervised MSc Theses
0
Supervised PhD Theses
0
WoS Citation Count
106
Scopus Citation Count
174
Patents
0
Projects
0
WoS Citations per Publication
1.86
Scopus Citations per Publication
3.05
Open Access Source
8
Supervised Theses
0
| Journal | Count |
|---|---|
| Springer Topics in Signal Processing | 10 |
| IEEE Communications Letters | 5 |
| Signals and Communication Technology | 5 |
| Wireless Personal Communications | 3 |
| Çankaya University Journal of Science and Engineering | 2 |
Current Page: 1 / 7
Scopus Quartile Distribution
Competency Cloud
57 results
Scholarly Output Search Results
Now showing 1 - 10 of 57
Article Citation - WoS: 7Citation - Scopus: 8Collision Free Row Column S-Random Interleaver(Ieee-inst Electrical Electronics Engineers inc, 2009) Yilmaz, A. Oezguer; Gazi, OrhanParallel decodable turbo codes (PDTCs) are suitable for concurrent decoding and hence have low latency. Memory collision issue is an important problem met during parallel processing. In this article, we propose a collision free interleaver for parallel processing operations. The performance of PDTCs is analyzed with the proposed random interleaver preventing the memory collision problem. Distance spectra of PDTCs with the proposed interleaves are computed and compared to those with S-random interleaver.Article Citation - WoS: 3Citation - Scopus: 6Decoding of Lt-Like Codes in the Absence of Degree-One Code Symbols(Electronics Telecommunications Research inst, 2016) Gazi, Orhan; Abdulkhaleq, Nadhir I.Luby transform (LT) codes were the first practical rateless erasure codes proposed in the literature. The performances of these codes, which are iteratively decoded using belief propagation algorithms, depend on the degree distribution used to generate the coded symbols. The existence of degree-one coded symbols is essential for the starting and continuation of the decoding process. The absence of a degree-one coded symbol at any instant of an iterative decoding operation results in decoding failure. To alleviate this problem, we proposed a method used in the absence of a degree-one code symbol to overcome a stuck decoding operation and its continuation. The simulation results show that the proposed approach provides a better performance than a conventional LT code and memory-based robust soliton distributed LT code, as well as that of a Gaussian elimination assisted LT code, particularly for short data lengths.Conference Object A Sequential Coding Approach for Short Length LT Codes over A WGN Channel(IEEE, 2017) Abdulkhaleq, Nadhir Ibrahim; Gazi, OrhanLuby Transform (LT) codes which can be considered as one of the first type of rate less codes are introduced to be an efficient erasure code. In such codes a fountain of encoded symbols is continuously transmitted until the successfully delivery of all the data packets. Whenever the receiver collects N noisy encoded symbols the decoding operation starts. Usually belief propagation (BP) algorithm is used to decipher the code and extract the k data symbols. In this paper, short length LT codes are generated using efficient sequential encoding approach (SEA) and performance measurements have been done over additive white Gaussian (A WGN) channel. This coding technique generates its degree in a repeated sequential manner which yields a mutual relation between adjacent codes that will be used in the decoding part. The decoding complexity of the proposed structure is similar to that of the Raptor codes. The simulation results show that the proposed approach has better performance in terms of error floor and successful decoding ratio when compared to LT codes using robust soliton distribution (RSD) and memorybased-RSD (MBRSD) even when supported by belief propagation-pattern recognition (BP-PR) technique.Book Part Citation - Scopus: 1Information theory perspective of polar codes and polar encoding(Springer Science and Business Media B.V., 2019) Gazi, OrhanPolar codes are one of the recently discovered capacity achieving channel codes. What makes the polar codes different from other channel codes is that polar codes are designed mathematically and their performance are mathematically proven. © Springer Nature Singapore Pte Ltd. 2019.Book Part Analog and Digital Filter Design(Springer Science and Business Media B.V., 2018) Gazi, O.In this chapter, we will study analog and digital filter design techniques. A filter is nothing but a linear time invariant (LTI) system. Any LTI system can be described using its impulse response. If the impulse response of a LTI system is known, then for any arbitrary input the system output can be calculated by taking the convolution of the impulse response and arbitrary input. This also means that filtering operation is nothing but a convolution operation. And filter design is nothing but finding the impulse response of a linear time invariant system. For this purpose, we can work either in time domain or frequency domain. © Springer Nature Singapore Pte Ltd. 2018.Editorial Citation - WoS: 6Citation - Scopus: 6Applications of Cognitive Radio Networks: Recent Advances and Future Directions(Sage Publications inc, 2016) Pan, Miao; Joshi, Gyanendra Prasad; Gazi, Orhan; He, Jianhua; Coupechoux, Marceau; Kim, Sung W.Conference Object Citation - Scopus: 1Successive Papr Reduction of Ofdm Systems Via Rotation of Optimally Selected Information Symbols(Ieee, 2018) Arli, A. Cagri; Gazi, OrhanHigh peak-to-average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems is one of the vital degrading factors for the performance of communication systems. In this paper, a new PAPR reduction technique called successive reduction of PAPR (SRP) is introduced. It uses a novel approach that high PAPR may be caused by the characteristics of inverse fast Fourier transform operation. Performance and complexity analysis of the SRP method is also investigated.Conference Object New Upper Bounds for the Computation of Complementary Error Function(2012) Gazi, OrhanIn this article we provide tighter upper bounds for complementary error function which is a monotonically decreasing function widely used in communication theory. The provided bounds approach the exact value in the limiting case. The derivation of the bounds are based on the monotonically increasing property of exponential function used in complementary error function.Conference Object The Implementation of a Successive Cancellation Polar Decoder on Xilinx System Generator(Ieee, 2017) Colak, Ayse; Gazi, Orhan; Arli, A. CagriPolar coding is the first kind of the capacity achieving codes which are defined for binary-input discrete memoryless channels initially. Parallel processing property of the FPGA allows to decode faster with a margin of complexity. Xilinx System Generator as a practical tool to construct decoding designs in shorter time is a fact. In this study, FPGA implementation of decoding polar codes through Xilinx System Generator is shown.Book Part Concept of Information, Discrete Entropy and Mutual Information(Springer Science and Business Media Deutschland GmbH, 2018) Gazi, O.In this chapter, we will try to explain the concept of information, discrete entropy and mutual information in details. To master on the information theory subjects, the reader should have a knowledge of probability and random variables. For this reason, we suggest to the reader to review the probability and random variables topics before studying the information theory subjects. Continuous entropy and continuous mutual information are very closely related to discrete entropy and discrete mutual information. For this reason, the reader should try to understand very well the fundamental concepts explained in this chapter, then proceed with the other chapters of the book. © 2018, Springer Nature Singapore Pte Ltd.