Browsing by Subject "IEEE 802.16 (Standard)"

Now showing 1 - 3 of 3

Open Access
Double binary turbo codes analysis and decoder implementation
(2008) Yılmaz, Özlem
Classical Turbo Code presented in 1993 by Berrau et al. received great attention due to its near Shannon Limit decoding performance. Double Binary Circular Turbo Code is an improvement on Classical Turbo Code and widely used in today’s communication standards, such as IEEE 802.16 (WIMAX) and DVBRSC. Compared to Classical Turbo Codes, DB-CTC has better error-correcting capability but more computational complexity for the decoder scheme. In this work, various methods, offered to decrease the computational complexity and memory requirements of DB-CTC decoder in the literature, are analyzed to find the optimum solution for the FPGA implementation of the decoder. IEEE 802.16 standard is taken into account for all simulations presented in this work and different simulations are performed according to the specifications given in the standard. An efficient DB-CTC decoder is implemented on an FPGA board and compared with other implementations in the literature.
Open Access
A system level simulation study of WiMAX
(2010) Başçiftçi, Yüksel Ozan
In this thesis, we implement a WiMAX system level simulator compliant with the evaluation methodology document published by the IEEE 802.16m Task Group. We study the PHY abstraction of polar codes and integrate polar codes into the simulator. We compare the system level performances of polar code and convolutional turbo code (CTC) and observe that CTC outperforms polar code. On the simulator, we study the downlink (DL) performance of WiMAX under various configurations such as scheduling methods, subchannelization methods, and frequency reuse models. We study there types of scheduling methods, namely round robin (RR) scheduling, proportional fair (PF) scheduling, and maximum sum rate (MSR) scheduling. We observe that MSR scheduling has the best throughput performance but does not support the users far from the base station. We study three frequency reuse models, namely 1×3×1, 1×3×3, and 3×3×1. We observe that 1 ×3×1 reuse model has the best throughput performance and maximum spectral efficiency is obtained in 1 × 3 × 3 reuse model. We study two subchannelization methods, namely PUSC and band AMC. We observe that in low mobility cases, band AMC outperforms PUSC and in high mobility cases, PUSC is better than band AMC.
Open Access
Uplink scheduling algorithms for the rtPS traffic class for IEEE 80216 networks
(2008) Ertürk, Mustafa Cenk
IEEE 802.16 MAC provides extensive bandwidth allocation and QoS mechanisms for various types of applications. However, the scheduling mechanisms for the uplink and downlink are unspecified by the IEEE 802.16 standard and are thus left open for vendors’ own implementations. Ensuring QoS requirements at the MAC level for different users with different QoS requirements and traffic profiles is also another challenging problem in the area. The standard defines five different scheduling services one of them being the real-time Polling Service (rtPS). In this thesis, we propose an uplink scheduler to be implemented on the WiMAX Base Station (BS) for rtPS type connections. We propose that the base station maintains a leaky bucket for each rtPS connection to police and schedule rtPS traffic for uplink traffic management. There are two scheduling algorithms defined in this study: one is based on a simpler round robin scheme using leaky buckets for QoS management, whereas the other one uses again leaky buckets for QoS management but also a proportional fair scheme for potential throughput improvement in case of varying channel conditions. The proposed two schedulers are studied via simulations using MATLAB to demonstrate their performance in terms of throughput, fairness and delay. We show that the leaky bucket based scheduler ensures the QoS commitments of each user in terms of a minimum bandwidth guarantee whereas the proportional fair algorithm is shown to opportunistically take advantage of varying channel conditions.