Fast decodable turbo codes

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.
IEEE Communications Letters


Zero state doped turbo equalizer
Gazi, Orhan; Yılmaz, Ali Özgür (Institute of Electrical and Electronics Engineers (IEEE), 2007-02-01)
Although iterative equalizers perform well at low signal to noise ratios, high latency is a major disadvantage for their use in practical communication systems. In this article we propose zero state doped turbo equalizers (ZSDTEs) which can be processed in parallel and have significantly reduced processing delays. The proposed technique shows better performance when compared to the sliding window method.
A hybrid single-source shortest path algorithm
Arslan, Hilal; Manguoğlu, Murat (The Scientific and Technological Research Council of Turkey, 2019-01-01)
The single-source shortest path problem arises in many applications, such as roads, social applications, and computer networks. Finding the shortest path is challenging, especially for graphs that contain a large number of vertices and edges. In this work, we propose a novel hybrid method that first sparsifies a given graph by removing most edges that cannot form the shortest path tree and then applies a classical shortest path algorithm to the sparser graph. Removing all the edges that cannot form the shor...
Robust Priority Assignments for Extending Existing Controller Area Network Applications
Schmidt, Klaus Verner (Institute of Electrical and Electronics Engineers (IEEE), 2014-02-01)
The usage of the controller area network (CAN) as an in-vehicle communication bus requires finding feasible and robust priority orders such that each message transmitted on the bus meets its specified deadline and tolerates potential transmission errors. Although such priority orders can be determined by available algorithms whenever they exist, it is always assumed that a CAN priority order is computed from scratch. In practical applications, it is frequently necessary to extend an existing message set by ...
Adaptive mean-shift for automated multi object tracking
Beyan, C.; Temizel, Alptekin (2012-01-01)
Mean-shift tracking plays an important role in computer vision applications because of its robustness, ease of implementation and computational efficiency. In this study, a fully automatic multiple-object tracker based on mean-shift algorithm is presented. Foreground is extracted using a mixture of Gaussian followed by shadow and noise removal to initialise the object trackers and also used as a kernel mask to make the system more efficient by decreasing the search area and the number of iterations to conve...
Simple derivative-free nonlinear state observer for sensorless AC drives
Akin, Bilal; Orguner, Umut; Ersak, Aydin; Ehsani, Mehrdad (Institute of Electrical and Electronics Engineers (IEEE), 2006-10-01)
In this paper, a new Kalman filtering technique, unscented Kalman filter (UKF), is utilized both experimentally and theoretically as a state estimation tool in field-oriented control (FOC) of sensorless ac drives. Using the advantages of this recent derivative-free nonlinear estimation tool, rotor speed and dq-axis fluxes of an induction motor are estimated only with the sensed stator currents and voltages information. In order to compare the estimation performances of the extended Kalman filter (EKF) and U...
Citation Formats
O. Gazi and A. Ö. Yılmaz, “Fast decodable turbo codes,” IEEE Communications Letters, pp. 173–175, 2007, Accessed: 00, 2020. [Online]. Available: