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.

Scholarly Output
56
Articles
18
Views / Downloads
4169/532
Supervised MSc Theses
0
Supervised PhD Theses
0
WoS Citation Count
104
Scopus Citation Count
174
WoS h-index
6
Scopus h-index
8
Patents
0
Projects
0
WoS Citations per Publication
1.86
Scopus Citations per Publication
3.11
Open Access Source
8
Supervised Theses
0
Google Analytics Visitor Traffic
| Journal | Count |
|---|---|
| Springer Topics in Signal Processing | 10 |
| Signals and Communication Technology | 5 |
| IEEE Communications Letters | 5 |
| Wireless Personal Communications | 3 |
| ETRI Journal | 2 |
Current Page: 1 / 7
Scopus Quartile Distribution
Competency Cloud

56 results
Scholarly Output Search Results
Now showing 1 - 10 of 56
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 Citation - WoS: 2Citation - Scopus: 6A Sequential Coding Approach for Short Length Lt Codes Over Awgn Channel(Institute of Electrical and Electronics Engineers Inc., 2017) Abdulkhaleq, N.I.; Gazi, O.Luby Transform (LT) codes which can be considered as one of the first type of rateless 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 (AWGN) 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 memory-based-RSD (MBRSD) even when supported by belief propagation-pattern recognition (BP-PR) technique. © 2017 IEEE.Article Low Latency Hybrid Structures Involving Convolutional Product Like Codes and Space Time Codes(Springer, 2017) Al-Kattan, Ahmed A. S.; Gazi, OrhanIn this paper, we propose new joint serially concatenated communication structures constructed from convolutional product codes and space time codes. The proposed structures are suitable for parallel processing operations and they have very low decoding latencies compared to their classical counterparts. Use of multi-antennas increases the spectral efficiency of the joint structures.Book Part Typical Sequences and Data Compression(Springer Science and Business Media Deutschland GmbH, 2018) Gazi, O.In this chapter, we will first provide information about typical sequences the introduce the data compression subject. In fact, the data compression subject is a direct consequence of the typical sequences. For this reason, it is very important to comprehend the concept of typical sequences to understand the data compression phenomenon. © 2018, Springer Nature Singapore Pte Ltd.Book Citation - Scopus: 12Understanding digital signal processing(Springer Science and Business Media B.V., 2018) Gazi, O.Article Citation - WoS: 12Citation - Scopus: 19A Survey on Belief Propagation Decoding of Polar Codes(Editorial Board of Journal on Communications, 2021) Gazi, O.; Arli, A.C.The increasing data traffic rate of wireless communication systems forces the development of new technologies mandatory. Providing high data rate, extremely low latency and improvement on quality of service are the main subjects of next generation 5G wireless communication systems which will be in the people's life in the years of 2020. As the newest and first mathematically proven forward error correction code, polar code is one of the best candidates among error correction methods that can be employed for 5G wireless networks. The aim of this tutorial is to show that belief propagation decoding of polar codes can be a promising forward error correction technique in upcoming 5G frameworks. First, we survey the novel approaches to the belief propagation based decoding of polar codes and continue with the studies about the simplification of these decoders. Moreover, early detection and termination methods and concept of scheduling are going to be presented throughout themanuscript. Finally, polar construction algorithms, error types in belief propagation based decoders and hardware implementations are going to be mentioned. Overall, this tutorial proves that the BP based decoding of polar codes has a great potential to be a part of communication standards. © 2013 China Institute of Communications.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 - WoS: 2Citation - Scopus: 3New Early Termination Methos for Turbo Decoders(Ieee, 2014) Gazi, OrhanTurbo codes have large latency due to iterative decoding steps and complex decoding algorithms To decrease the decoding delay it is essential to terminate the decoding operation as soon as there is sufficient information for data bits. Early termination can be achieved by defining stopping criteria beyond which negligible achievement is observed. In this article, we investigate some efficient stopping criteria based on the variance of extrinsic information and population of the bits below a predetermined threshold. We show that variance based method is better than its previously suggested counterparts, and threshold based method is the least complex one considering the available methods.Book Part Citation - Scopus: 2Multirate Signal Processing(Springer Science and Business Media B.V., 2018) Gazi, O.Digital signals are obtained from continuous time signals via sampling operation. Continuous time signals can be considered as digital signals having infinite number of samples. Sampling is nothing but selecting some of these samples and forming a mathematical sequence called digital signal. And these digital signals can be in periodic or non-periodic forms. © Springer Nature Singapore Pte Ltd. 2018.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.

