Mühendislik Fakültesi

Permanent URI for this communityhttps://hdl.handle.net/20.500.12416/2

Browse

Now showing 1 - 20 of 33

Citation Count: Gazi, Orhan. "A New Companding Technique for Papr Reduction in Ofdm Communication Systems", International Congress On Ultra Modern Telecommunications and Control Systems And Workshops, (2011).
A New Companding Technique for Papr Reduction in Ofdm Communication Systems
(2011) Gazi, Orhan; 102896
One of the major disadvantages of OFDM communication systems is their high peak-to-average power ratio (PAPR) which degrades system performance when nonlinear power amplifiers are employed. Among the proposed PAPR techniques companding is favorable due to its simplicity and easy of implementation. In this article, using the arctangent function we propose a new compading technique for PAPR reduction. We compare the proposed technique to the previously suggested exponential companding, and μ-law companding methods. Via computer simulations it is verified that the proposed technique is better than exponential and μ-law companding methods for PAPR reduction.
Citation Count: Abdulkhaleq, Nadhir Ibrahim; Gazi, Orhan, "A sequential coding approach for short length lt codes over awgn channel", 2017 4th International Conference On Electrical And Electronic Engineering (ICEEE 2017), pp. 267-271, (2017).
A sequential coding approach for short length lt codes over awgn channel
(IEEE, 2017) Abdulkhaleq, Nadhir Ibrahim; Gazi, Orhan; 102896
Luby 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 (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.
Citation Count: Gazi, Orhan. "A Tutorial Introduction to VHDL Programming", Singapore: Springer, pp. 1-251, 2019.
A Tutorial Introduction to VHDL Programming
(Springer, 2019) Gazi, Orhan; 102896
This book helps readers create good VHDL descriptions and simulate VHDL designs. It teaches VHDL using selected sample problems, which are solved step by step and with precise explanations, so that readers get a clear idea of what a good VHDL code should look like. The book is divided into eight chapters, covering aspects ranging from the very basics of VHDL syntax and the module concept, to VHDL logic circuit implementations. In the first chapter, the entity and architecture parts of a VHDL program are explained in detail. The second chapter explains the implementations of combinational logic circuits in VHDL language, while the following chapters offer information on the simulation of VHDL programs and demonstrate how to define data types other than the standard ones available in VHDL libraries. In turn, the fifth chapter explains the implementation of clocked sequential logic circuits, and the sixth shows the implementation of registers and counter packages. The book’s last two chapters detail how components, functions and procedures, as well as floating-point numbers, are implemented in VHDL. The book offers extensive exercises at the end of each chapter, inviting readers to learn VHDL by doing it and writing good code.
Citation Count: Gazi, O. (2012). Analysis of parallel decodable turbo codes. IEICE Transactions On Communications, E95B(5), 1584-1591. http://dx.doi.org/10.1587/transcom.E95.B.1584
Analysis of parallel decodable turbo codes
(IEICE-INTS Electronics Information Communications Eng, 2012) Gazi, Orhan; 102896
Turbo codes suffer from high decoding latency which hinders their utilization in many communication systems. Parallel decodable turbo codes (PDTCs) are suitable for parallel decoding and hence have low latency. In this article, we analyze the worst case minimum distance of parallel decodable turbo codes with both S-random interleaver and memory collision free Row-Column S-random interleaver. The effect of minimum distance on code performance is determined through computer simulations
Citation Count: Kim, Sung W...et al., "Applications of Cognitive Radio Networks: Recent Advances and Future Directions", International Journal of Distributed Sensor Networks, (2016).
Applications of Cognitive Radio Networks: Recent Advances and Future Directions
(Sage Publications LTD, 2016) Kim, Sung W.; Pan, Miao; Joshi, Gyanendra Prasad; Gazi, Orhan; He, Jianhua; Coupechoux, Marceau; 102896
Citation Count: Gazi, O. (2011). Bounds for generalized gamma distributed fading channels. IEEE Communications Letters, 15(12), 1347-1349. http://dx.doi.org/ 10.1109/LCOMM.2011.102911.111697
Bounds for generalized gamma distributed fading channels
(IEEE-Inst Electrical Electronics Engineers Inc, 2011) Gazi, Orhan; 102896
In this article, upper bounds for the outage probability and moment generating functions of the fading channels with alpha - mu distribution are derived. The proposed upper bound for the moment generating function is used in the performance evaluation of M - PSK communication systems. The derived expressions are simple to use and do not require complex software tools to evaluate. We verified the proposed expressions via numerical computations
Citation Count: Gazi, O.,"Channel Coding Theorem",Signals and Communication Technology, pp. 235-271, (2018).
Channel Coding Theorem
(Springer, 2018) Gazi, Orhan; 102896
In this chapter, we will discuss the channel coding theorem in details. Channel coding theorem can be accepted as a milestone in electronic communication field. For this reason, it is very critical for a communication engineer to comprehend the channel coding theorem very well. In many information theory books, or in many lecture notes delivered in classes about information theory, channel coding theorem is very briefly summarized, for this reason, many readers fail to comprehend the details behind the theorem.
Citation Count: Gazi, Orhan; Yilmaz, A. Ozguer, "Collision free row column s-random interleaver", IEEE Communications Letters, Vol.13, No.4, pp.257-259, (2009).
Collision free row column s-random interleaver
(IEEE-INST Electrical Electronics Engineers INC, 2009) Gazi, Orhan; Yılmaz, A. Özgüer; 102896
Parallel 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.
Citation Count: Gazi, O.,"Concept of Information, Discrete Entropy and Mutual Information",Signals and Communication Technology, pp. 1-95, (2018).
Concept of Information, Discrete Entropy and Mutual Information
(Springer, 2018) Gazi, Orhan; 102896
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.
Citation Count: Abdulkhaleq, N.I., Gazi, O. (2016). Decoding of LT-like codes in the absence of degree-one code symbols. Etri Journal, 38(5), 896-902. http://dx.doi.org/10.4218/etrij.16.0116.0107
Decoding of LT-like codes in the absence of degree-one code symbols
(Electronics Communications Research Inst., 2016) Abdulkhaleq, Nadhir Ibrahim; Gazi, Orhan; 102896
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
Citation Count: Gazi, Orhan (2018). "Entropy for Continuous Random Variables Discrete Channel Capacity, Continuous Channel Capacity", Signals and Communication Technology, pp. 97-173.
Entropy for Continuous Random Variables Discrete Channel Capacity, Continuous Channel Capacity
(2018) Gazi, Orhan; 102896
In this chapter, we will study the entropy concept for continuous random variables. The capacity of both continuous and discrete channels will be inspected in details. The capacity formula for additive white Gaussian channel is to be derived and the factors that affects the capacity of the additive white Gaussian channel will be elaborated. © 2018, Springer Nature Singapore Pte Ltd.
Citation Count: Gazi, O., Yılmaz, A.Ö. (2007). Fast decodable turbo codes. IEEE Communications Letters, 11(2), 173-175. http://dx.doi.org/10.1109/LCOMM.2007.061528
Fast decodable turbo codes
(IEEE-Inst Electrical Electronics Engineers Inc, 2007) Gazi, Orhan; Yılmaz, Ali Özgür; 102896; 111575
Decoding delay is an important consideration for the use of turbo codes in practical applications. We propose a new structure for turbo codes which is very suitable for parallel decoding. It is shown by union bound analysis and simulation results that the proposed system performance is comparable to that of the classical turbo codes
Citation Count: Andi, Alia A.; Gazi, Orhan, "Fast decoding of polar codes using tree structure", IET Communication, Vol. 13, No. 14, pp. 2063-2068, (2019).
Fast decoding of polar codes using tree structure
(Inst Engineering Technology-IET, 2019) Andi, Alia A.; Gazi, Orhan; 102896
In this study, the authors first propose a tree structure for the successive cancelation (SC) decoding of polar codes. The proposed structure is easy to implement in hardware and suitable for parallel processing operations. Next, using the proposed tree structure, they propose a technique for the fast decoding of polar codes. With the proposed method, it is possible to decode all the information bits simultaneously at the same time, i.e. in parallel. Lastly, they introduce an improved version of the proposed high-speed decoding algorithm. The proposed high-speed decoding approach and its improved version are simulated on the computer environment and their bit error rate performances are compared to the performance of the classical SC method.
Citation Count: Gazi, Orhan. "Forward Error Correction via Channel Coding", Switzerland: Springer, p. 319, 2019.
Forward Error Correction via Channel Coding
(Springer, 2019) Gazi, Orhan; 102896
This book provides a comprehensive explanation of forward error correction, which is a vital part of communication systems. The book is written in such a way to make the subject easy and understandable for the reader. The book starts with a review of linear algebra to provide a basis for the text. The author then goes on to cover linear block codes, syndrome error correction, cyclic codes, Galois fields, BCH codes, Reed Solomon codes, and convolutional codes. Examples are provided throughout the text.
Citation Count: Gazi, Orhan (2018). "Information theory for electrical engineers", Signals and Communication Technology, Springer Science and Business Media Deutschland GmbH, pp. 1-273.
Information theory for electrical engineers
(Springer Science and Business Media Deutschland GmbH, 2018) Gazi, Orhan; 102896
Citation Count: Gazi, Orhan (2019). "Information theory perspective of polar codes and polar encoding", Springer Topics in Signal Processing, Vol. 15, pp. 1-25.
Information theory perspective of polar codes and polar encoding
(2019) Gazi, Orhan; 102896
Polar 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.
Citation Count: Gazi, Orhan. "Karar Yayılım Algoritması ile Kutup Kodlarının Çözümlenmesi", ELECO 2018, 2018.
Karar Yayılım Algoritması ile Kutup Kodlarının Çözümlenmesi
(2018) Arlı, A. Çağrı; Gazi, Orhan; 102896
Citation Count: Gazi, O. (2017). Low latency hybrid structures ınvolving convolutional product like codes and space time codes. Wireless Personal Communications, 94(3), 745-754. http://dx.doi.org/ 10.1007/s11277-016-3648-3
Low latency hybrid structures ınvolving convolutional product like codes and space time codes
(Springer, 2017) Gazi, Orhan; Al-Kattan, Ahmed, A. S.; 102896
In 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.
Citation Count: Arlı, A. Çağrı; Gazi, Orhan (2018). "Mathematical modeling of stochastic resonance systems", 26th IEEE Signal Processing and Communications Applications Conference, SIU 2018, İzmir, 2 May 2018 through 5 May 2018, pp. 1-4.
Mathematical modeling of stochastic resonance systems
(2018) Arlı, A. Çağrı; Gazi, Orhan; 102896
Knowledge of at which condition in a nonlinear threshold system stochastic resonance phenomena occurs, can be important in noise introduced threshold systems. A new method for mathematical modeling of stochastic resonance systems is introduced. The proposed approach can be used for the modeling of many other phenomenons. It's shown that using the mathematical model developed for stochastic resonance systems it's possible to estimate the optimum noise variances necessary for the occurrence of the stochastic resonance. The accuracy of the estimated noise variances are verified by the simulation results. © 2018 IEEE.
Citation Count: Orhan, Gazi (2019). "Mathematical modelling of polar codes, channel combining and splitting", Springer Topics in Signal Processing, Vol. 15, pp. 91-134.
Mathematical modelling of polar codes, channel combining and splitting
(2019) Orhan, Gazi; 102896
In Chap. 2, we explained the decoding of polar codes in a clear and trivial manner. However, in most of the engineering sciences, it is critical to mathematically formulate the theories or techniques invented. © Springer Nature Singapore Pte Ltd. 2019.

Browse

Browsing Mühendislik Fakültesi by Author "102896"