The Experts below are selected from a list of 948 Experts worldwide ranked by ideXlab platform

Ranjith Liyana-pathirana - One of the best experts on this subject based on the ideXlab platform.

  • Optimization of Sliding Window Algorithm for space-time turbo trellis codes
    2007 International Symposium on Communications and Information Technologies, 2007
    Co-Authors: Kim Chi Nguyen, Upul Gunawardana, Ranjith Liyana-pathirana
    Abstract:

    The design of space-time turbo trellis codes (ST Turbo TC) for improving the bandwidth efficiency and the reliability of wireless data networks, which is based on the turbo structure, has been proposed in the literature. However, like other turbo based coding schemes, the fundamental problems with the ST Turbo TC decoder are its complexity and decoding delay. In some cases the decoding delay may be so long that the use of ST Turbo TC system is unattractive for time sensitive applications. The aim of this paper is to propose a simplified ST Turbo TC decoder using the Sliding Window technique in order to achieve memory savings and reduce decoding delay. In particular, we consider the performance of QPSK ST Turbo TC schemes on fast fading channels for various system parameters. Different Window sizes are employed and investigated. Through computer simulation, the optimum Window sizes are defined for different system parameters.

  • Fixed-point performance of space-time turbo trellis codes on fast fading channels
    2007 International Symposium on Communications and Information Technologies, 2007
    Co-Authors: Kim Chi Nguyen, Upul Gunawardana, Ranjith Liyana-pathirana
    Abstract:

    To improve the performance of wireless communication systems, bandwidth efficient space-time turbo trellis codes (ST turbo TC), which is based on the turbo structure, has been proposed in the literature. In this paper, we analyze the performance of a fixed-point ST Turbo TC decoder using Sliding Window Algorithm. In particular, we present the investigation of bit-width optimization for a 4-state QPSK ST Turbo TC decoder based on the symbol-by-symbol (SBS) logarithm-maximum a posteriori (Log-MAP) Algorithm on fast fading channels. The decoder structure utilizes a Sliding Window Algorithm for reducing memory requirements and decoding delay. We show that ST Turbo TC is feasible for finite word length representation without significant degradation in the frame error rate (FER) performance. Through computer simulation, the optimum word length configurations are determined for all quantities external and internal to the ST Turbo TC decoder.

  • Sliding Window Algorithm for Space-Time Turbo Trellis Coded Modulation
    TENCON 2006 - 2006 IEEE Region 10 Conference, 2006
    Co-Authors: Kim Chi Nguyen, Upul Gunawardana, Ranjith Liyana-pathirana
    Abstract:

    Motivated by the remarkable performance of turbo codes, the design of space-time turbo trellis coded modulation (ST turbo TCM), which is based on the turbo structure, has been proposed in the literature. However, like other turbo based coding schemes, its complexity and decoding latency are drawbacks making them unattractive for time sensitive applications. To achieve memory savings and reduce decoding latency, we propose a simplified ST turbo TCM decoder using Sliding Window technique. In particular, the performance of QPSK ST turbo TCM schemes on slow flat Rayleigh fading channels for various system parameters are considered. Based on simulation results, optimum Sliding Window sizes will be given for different configurations

Kim Chi Nguyen - One of the best experts on this subject based on the ideXlab platform.

  • Optimization of Sliding Window Algorithm for space-time turbo trellis codes
    2007 International Symposium on Communications and Information Technologies, 2007
    Co-Authors: Kim Chi Nguyen, Upul Gunawardana, Ranjith Liyana-pathirana
    Abstract:

    The design of space-time turbo trellis codes (ST Turbo TC) for improving the bandwidth efficiency and the reliability of wireless data networks, which is based on the turbo structure, has been proposed in the literature. However, like other turbo based coding schemes, the fundamental problems with the ST Turbo TC decoder are its complexity and decoding delay. In some cases the decoding delay may be so long that the use of ST Turbo TC system is unattractive for time sensitive applications. The aim of this paper is to propose a simplified ST Turbo TC decoder using the Sliding Window technique in order to achieve memory savings and reduce decoding delay. In particular, we consider the performance of QPSK ST Turbo TC schemes on fast fading channels for various system parameters. Different Window sizes are employed and investigated. Through computer simulation, the optimum Window sizes are defined for different system parameters.

  • Fixed-point performance of space-time turbo trellis codes on fast fading channels
    2007 International Symposium on Communications and Information Technologies, 2007
    Co-Authors: Kim Chi Nguyen, Upul Gunawardana, Ranjith Liyana-pathirana
    Abstract:

    To improve the performance of wireless communication systems, bandwidth efficient space-time turbo trellis codes (ST turbo TC), which is based on the turbo structure, has been proposed in the literature. In this paper, we analyze the performance of a fixed-point ST Turbo TC decoder using Sliding Window Algorithm. In particular, we present the investigation of bit-width optimization for a 4-state QPSK ST Turbo TC decoder based on the symbol-by-symbol (SBS) logarithm-maximum a posteriori (Log-MAP) Algorithm on fast fading channels. The decoder structure utilizes a Sliding Window Algorithm for reducing memory requirements and decoding delay. We show that ST Turbo TC is feasible for finite word length representation without significant degradation in the frame error rate (FER) performance. Through computer simulation, the optimum word length configurations are determined for all quantities external and internal to the ST Turbo TC decoder.

  • Sliding Window Algorithm for Space-Time Turbo Trellis Coded Modulation
    TENCON 2006 - 2006 IEEE Region 10 Conference, 2006
    Co-Authors: Kim Chi Nguyen, Upul Gunawardana, Ranjith Liyana-pathirana
    Abstract:

    Motivated by the remarkable performance of turbo codes, the design of space-time turbo trellis coded modulation (ST turbo TCM), which is based on the turbo structure, has been proposed in the literature. However, like other turbo based coding schemes, its complexity and decoding latency are drawbacks making them unattractive for time sensitive applications. To achieve memory savings and reduce decoding latency, we propose a simplified ST turbo TCM decoder using Sliding Window technique. In particular, the performance of QPSK ST turbo TCM schemes on slow flat Rayleigh fading channels for various system parameters are considered. Based on simulation results, optimum Sliding Window sizes will be given for different configurations

Mannava Muniratnam Naidu - One of the best experts on this subject based on the ideXlab platform.

  • Integrating Sliding Window Algorithm with a Multiple Server Finite Queuing Model
    Sliding Window Algorithm for Mobile Communication Networks, 2020
    Co-Authors: Mannava Muniratnam Naidu
    Abstract:

    A MSC provides call setup services in response to a call setup request from a mobile subscriber provided its profile is available in VLR. The mobile subscribers roam randomly among the service areas of GSM network area. One naive policy is to delete immediately the profile of a mobile subscriber from VLR whenever it exits the MSC service area and fetch the same from HLR when it reenters in quick succession of exit and makes the first instance of call setup request. This policy increases the load on the network traffic; delays call setup time, and reduce the throughput of MSC. An alternative policy is deferring deletion of the profile of a mobile subscriber even though it exits the MSC service area expecting its reentry in quick succession. However, the optimal period of deferring deletion or retention shall be determined for which the average call setup time is minimum or conversely the throughput of MSC is maximum. Nuka and Naidu [23] proposed a Sliding Window Algorithm that minimizes the average time for call setup or conversely maximizes throughput of the MSC. However, they have not considered the waiting time of call setup requests in queue at MSC when it is found busy. This chapter presents, a model for realistic measurement of throughput of a MSC considering the waiting time of call setup requests in queue integrating Sliding Window Algorithm with a single server finite queuing model.

  • Performance Measurement of Sliding Window Algorithm
    Sliding Window Algorithm for Mobile Communication Networks, 2020
    Co-Authors: Mannava Muniratnam Naidu
    Abstract:

    In this chapter, a simulation model is developed for evaluating the performance of FBSD and SWSSD Algorithms. Performance metrics, simulation model, input parameters, data assumptions, experimentation, and simulation output analyses are presented in the following sections.

  • Sliding Window Algorithm
    Sliding Window Algorithm for Mobile Communication Networks, 2020
    Co-Authors: Mannava Muniratnam Naidu
    Abstract:

    Mobile subscribers move randomly in the area of a GSM network. The location identity of roaming mobile subscribers is required to offer essential services to the subscriber call setup requests. In a network, subscriber information is maintained by databases, referred to as home location register (HLR) and visitor location register (VLR). The HLR is a centralized database which is located at Gateway Mobile Switching Center (GMSC) to maintain and keep switching profiles of all mobile subscribers and also to their current location data. VLR is distributed database in MSC to keep switching replications of subscriber profiles that are currently in its jurisdiction.

  • Measurement of Mobile Switching Centres Throughput in GSM Network Integrating Sliding Window Algorithm with a Single Server Finite Queuing Model
    Journal of Computer Networks and Communications, 2016
    Co-Authors: Dinaker Babu Bollini, Mannava Muniratnam Naidu, Mallikharjuna Rao Nuka
    Abstract:

    The Sliding Window Algorithm proposed for determining an optimal Sliding Window does not consider the waiting times of call setup requests of a mobile station in queue at a Mobile Switching Centre MSC in the Global System for Mobile GSM Communication Network. This study proposes a model integrating the Sliding Window Algorithm with a single server finite queuing model, referred to as integrated model for measurement of realistic throughput of a MSC considering the waiting times of call setup requests. It assumes that a MSC can process one call setup request at a time. It is useful in determining an optimal Sliding Window size that maximizes the realistic throughput of a MSC. Though the model assumes that a MSC can process one call setup request at a time, its scope can be extended for measuring the realistic throughput of a MSC that can process multiple call setup requests at a time.

Upul Gunawardana - One of the best experts on this subject based on the ideXlab platform.

  • Optimization of Sliding Window Algorithm for space-time turbo trellis codes
    2007 International Symposium on Communications and Information Technologies, 2007
    Co-Authors: Kim Chi Nguyen, Upul Gunawardana, Ranjith Liyana-pathirana
    Abstract:

    The design of space-time turbo trellis codes (ST Turbo TC) for improving the bandwidth efficiency and the reliability of wireless data networks, which is based on the turbo structure, has been proposed in the literature. However, like other turbo based coding schemes, the fundamental problems with the ST Turbo TC decoder are its complexity and decoding delay. In some cases the decoding delay may be so long that the use of ST Turbo TC system is unattractive for time sensitive applications. The aim of this paper is to propose a simplified ST Turbo TC decoder using the Sliding Window technique in order to achieve memory savings and reduce decoding delay. In particular, we consider the performance of QPSK ST Turbo TC schemes on fast fading channels for various system parameters. Different Window sizes are employed and investigated. Through computer simulation, the optimum Window sizes are defined for different system parameters.

  • Fixed-point performance of space-time turbo trellis codes on fast fading channels
    2007 International Symposium on Communications and Information Technologies, 2007
    Co-Authors: Kim Chi Nguyen, Upul Gunawardana, Ranjith Liyana-pathirana
    Abstract:

    To improve the performance of wireless communication systems, bandwidth efficient space-time turbo trellis codes (ST turbo TC), which is based on the turbo structure, has been proposed in the literature. In this paper, we analyze the performance of a fixed-point ST Turbo TC decoder using Sliding Window Algorithm. In particular, we present the investigation of bit-width optimization for a 4-state QPSK ST Turbo TC decoder based on the symbol-by-symbol (SBS) logarithm-maximum a posteriori (Log-MAP) Algorithm on fast fading channels. The decoder structure utilizes a Sliding Window Algorithm for reducing memory requirements and decoding delay. We show that ST Turbo TC is feasible for finite word length representation without significant degradation in the frame error rate (FER) performance. Through computer simulation, the optimum word length configurations are determined for all quantities external and internal to the ST Turbo TC decoder.

  • Sliding Window Algorithm for Space-Time Turbo Trellis Coded Modulation
    TENCON 2006 - 2006 IEEE Region 10 Conference, 2006
    Co-Authors: Kim Chi Nguyen, Upul Gunawardana, Ranjith Liyana-pathirana
    Abstract:

    Motivated by the remarkable performance of turbo codes, the design of space-time turbo trellis coded modulation (ST turbo TCM), which is based on the turbo structure, has been proposed in the literature. However, like other turbo based coding schemes, its complexity and decoding latency are drawbacks making them unattractive for time sensitive applications. To achieve memory savings and reduce decoding latency, we propose a simplified ST turbo TCM decoder using Sliding Window technique. In particular, the performance of QPSK ST turbo TCM schemes on slow flat Rayleigh fading channels for various system parameters are considered. Based on simulation results, optimum Sliding Window sizes will be given for different configurations

Donato Malerba - One of the best experts on this subject based on the ideXlab platform.

  • Discovery Science - A Sliding Window Algorithm for Relational Frequent Patterns Mining from Data Streams
    Discovery Science, 2009
    Co-Authors: Fabio Fumarola, Anna Ciampi, Annalisa Appice, Donato Malerba
    Abstract:

    Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered: data streams describe complex objects modeled by multiple database relations. A multi-relational data mining Algorithm is proposed to efficiently discover approximate relational frequent patterns over a Sliding time Window of a complex data stream. The effectiveness of the method is proved on application to the Internet packet stream.

  • a Sliding Window Algorithm for relational frequent patterns mining from data streams
    Discovery Science, 2009
    Co-Authors: Fabio Fumarola, Anna Ciampi, Annalisa Appice, Donato Malerba
    Abstract:

    Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered: data streams describe complex objects modeled by multiple database relations. A multi-relational data mining Algorithm is proposed to efficiently discover approximate relational frequent patterns over a Sliding time Window of a complex data stream. The effectiveness of the method is proved on application to the Internet packet stream.

  • A Sliding Window Algorithm for relational frequent patterns mining from data streams
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009
    Co-Authors: Fabio Fumarola, Anna Ciampi, Annalisa Appice, Donato Malerba
    Abstract:

    Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered: data streams describe complex objects modeled by multiple database relations. A multi-relational data mining Algorithm is proposed to efficiently discover approximate relational frequent patterns over a Sliding time Window of a complex data stream. The effectiveness of the method is proved on application to the Internet packet stream. © 2009 Springer Berlin Heidelberg.