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

Qiqi Zhao - One of the best experts on this subject based on the ideXlab platform.

  • The combining of two methods for cycle slips detection and repair of BDS triple-frequency Data
    2016 Chinese Control and Decision Conference (CCDC), 2016
    Co-Authors: Qiqi Zhao
    Abstract:

    This paper is aiming for cycle slips detection and correction by combining code-phase combination method with Geometry-free phase combination method. Firstly, taking the advantage of the Geometry-free method which is good at detecting small cycle slips to elect two combinations to construct the first two detectable amounts; Secondly, using the triple-frequency code-phase method to construct cycle slips detectable amounts, at the same time, selecting one optimal combination of cycle slips as the third detectable amount. Finally, combining with three cycle slips detectable amounts to construct a Linearly Independent Equation, after that, solving the Equation to repair the cycle slips. Simulation results showed that the method can effectively detect both large and small cycle slips, it can also repair cycle slips quickly.

Muriel M´edard - One of the best experts on this subject based on the ideXlab platform.

  • Collision Helps! An Analytical Study of ZigZag Decoding
    2009
    Co-Authors: Ali Parandeh Gheibi, Jay Kumar Sundararajan, Muriel M´edard
    Abstract:

    The nature of the wireless network is intrinsically different from the wired network because of the shared medium among several transmitters. Such a restriction requires a form of scheduling algorithm to coordinate access to the medium, usually in a distributed manner. The conventional approach to the Medium Access Control (MAC) problem is contention-based protocols in which multiple transmitters simultaneously attempt to access the wireless medium and operate under some rules that provide enough opportunities for the others to transmit. Examples of such protocols in packet radio networks include ALOHA, MACAW, CSMA/CA, etc. However, in many of contention-based protocols it is possible that two or more transmitters transmit their packet simultaneously, resulting in a collision. The collided packets are considered lost in the conventional approaches, but Gollakota and Katabi [2] show how to recover multiple collided packets in a 802.11 system using ZigZag decoding when there are enough transmissions involving those packets. In fact, they suggest that each collision can be treated as a Linearly Independent Equation of the packets involved. Therefore, the packets are recoverable only if the system of Equations is full rank. ZigZag decoding provides a fundamentally new approach to handle collisions in a wireless setting without using any central scheduler, or knowledge about the network topology such as number of neighbors, etc. In this project, we wish to understand the effects of this new approach to interference management, in terms of the achievable throughput and delay for the multiple access communication. We provide an abstraction of the multiple-access channel when ZigZag decoding is used at the receiver. We use this abstract model to analyze the delay and throughput performance of the system in various scenarios. First, we analyze the scenario when each user has one packet to send. We characterize upper and lower bounds on the expected time to deliver

Ali Parandeh Gheibi - One of the best experts on this subject based on the ideXlab platform.

  • Collision Helps! An Analytical Study of ZigZag Decoding
    2009
    Co-Authors: Ali Parandeh Gheibi, Jay Kumar Sundararajan, Muriel M´edard
    Abstract:

    The nature of the wireless network is intrinsically different from the wired network because of the shared medium among several transmitters. Such a restriction requires a form of scheduling algorithm to coordinate access to the medium, usually in a distributed manner. The conventional approach to the Medium Access Control (MAC) problem is contention-based protocols in which multiple transmitters simultaneously attempt to access the wireless medium and operate under some rules that provide enough opportunities for the others to transmit. Examples of such protocols in packet radio networks include ALOHA, MACAW, CSMA/CA, etc. However, in many of contention-based protocols it is possible that two or more transmitters transmit their packet simultaneously, resulting in a collision. The collided packets are considered lost in the conventional approaches, but Gollakota and Katabi [2] show how to recover multiple collided packets in a 802.11 system using ZigZag decoding when there are enough transmissions involving those packets. In fact, they suggest that each collision can be treated as a Linearly Independent Equation of the packets involved. Therefore, the packets are recoverable only if the system of Equations is full rank. ZigZag decoding provides a fundamentally new approach to handle collisions in a wireless setting without using any central scheduler, or knowledge about the network topology such as number of neighbors, etc. In this project, we wish to understand the effects of this new approach to interference management, in terms of the achievable throughput and delay for the multiple access communication. We provide an abstraction of the multiple-access channel when ZigZag decoding is used at the receiver. We use this abstract model to analyze the delay and throughput performance of the system in various scenarios. First, we analyze the scenario when each user has one packet to send. We characterize upper and lower bounds on the expected time to deliver

Jay Kumar Sundararajan - One of the best experts on this subject based on the ideXlab platform.

  • Collision Helps! An Analytical Study of ZigZag Decoding
    2009
    Co-Authors: Ali Parandeh Gheibi, Jay Kumar Sundararajan, Muriel M´edard
    Abstract:

    The nature of the wireless network is intrinsically different from the wired network because of the shared medium among several transmitters. Such a restriction requires a form of scheduling algorithm to coordinate access to the medium, usually in a distributed manner. The conventional approach to the Medium Access Control (MAC) problem is contention-based protocols in which multiple transmitters simultaneously attempt to access the wireless medium and operate under some rules that provide enough opportunities for the others to transmit. Examples of such protocols in packet radio networks include ALOHA, MACAW, CSMA/CA, etc. However, in many of contention-based protocols it is possible that two or more transmitters transmit their packet simultaneously, resulting in a collision. The collided packets are considered lost in the conventional approaches, but Gollakota and Katabi [2] show how to recover multiple collided packets in a 802.11 system using ZigZag decoding when there are enough transmissions involving those packets. In fact, they suggest that each collision can be treated as a Linearly Independent Equation of the packets involved. Therefore, the packets are recoverable only if the system of Equations is full rank. ZigZag decoding provides a fundamentally new approach to handle collisions in a wireless setting without using any central scheduler, or knowledge about the network topology such as number of neighbors, etc. In this project, we wish to understand the effects of this new approach to interference management, in terms of the achievable throughput and delay for the multiple access communication. We provide an abstraction of the multiple-access channel when ZigZag decoding is used at the receiver. We use this abstract model to analyze the delay and throughput performance of the system in various scenarios. First, we analyze the scenario when each user has one packet to send. We characterize upper and lower bounds on the expected time to deliver