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

J R Barry - One of the best experts on this subject based on the ideXlab platform.

  • a single symbol decodable space time block code with full rate and low peak to average power ratio
    IEEE Transactions on Wireless Communications, 2009
    Co-Authors: Mutasem Omar Sinnokrot, J R Barry
    Abstract:

    Three Desirable properties of a four-antenna spacetime block code are full rate, full diversity, and single-symbol decodability. Previously reported space-time codes that achieve all three properties do so at the expense of the peak-to-average power ratio (PAPR). A fourth Desirable Property of a space-time block code is that its PAPR be the same as that of the underlying quadrature-amplitude modulation alphabet. In this letter we introduce space-time codes for three and four transmit antennas that achieve all four properties; these codes use a diversity technique based on constellation stretching. Numerical results for quasistatic Rayleigh-fading channels show that, despite their low PAPR, the proposed codes are comparable in SNR performance to the best-performing single-symbol decodable space-time codes for three and four transmit antennas.

  • a single symbol decodable space time block code with full rate and low peak to average power ratio
    Personal Indoor and Mobile Radio Communications, 2008
    Co-Authors: Mutasem Omar Sinnokrot, J R Barry
    Abstract:

    Three Desirable properties of a four-antenna space-time block code are full rate, full diversity, and single-symbol decodability. Previously reported space-time codes that achieve all three properties do so at the expense of the peak-to-average power ratio (PAPR). A fourth Desirable Property of a space-time block code is that its PAPR be the same as that of the underlying quadrature-amplitude modulation alphabet. In this paper we introduce space-time codes for three and four transmit antennas that achieve all four properties; these codes use a diversity technique based on constellation stretching. Numerical results for quasistatic Rayleigh-fading channels show that the proposed codes are comparable in SNR performance to the best-performing single-symbol decodable space-time codes for three and four transmit antennas.

Mutasem Omar Sinnokrot - One of the best experts on this subject based on the ideXlab platform.

  • a single symbol decodable space time block code with full rate and low peak to average power ratio
    IEEE Transactions on Wireless Communications, 2009
    Co-Authors: Mutasem Omar Sinnokrot, J R Barry
    Abstract:

    Three Desirable properties of a four-antenna spacetime block code are full rate, full diversity, and single-symbol decodability. Previously reported space-time codes that achieve all three properties do so at the expense of the peak-to-average power ratio (PAPR). A fourth Desirable Property of a space-time block code is that its PAPR be the same as that of the underlying quadrature-amplitude modulation alphabet. In this letter we introduce space-time codes for three and four transmit antennas that achieve all four properties; these codes use a diversity technique based on constellation stretching. Numerical results for quasistatic Rayleigh-fading channels show that, despite their low PAPR, the proposed codes are comparable in SNR performance to the best-performing single-symbol decodable space-time codes for three and four transmit antennas.

  • a single symbol decodable space time block code with full rate and low peak to average power ratio
    Personal Indoor and Mobile Radio Communications, 2008
    Co-Authors: Mutasem Omar Sinnokrot, J R Barry
    Abstract:

    Three Desirable properties of a four-antenna space-time block code are full rate, full diversity, and single-symbol decodability. Previously reported space-time codes that achieve all three properties do so at the expense of the peak-to-average power ratio (PAPR). A fourth Desirable Property of a space-time block code is that its PAPR be the same as that of the underlying quadrature-amplitude modulation alphabet. In this paper we introduce space-time codes for three and four transmit antennas that achieve all four properties; these codes use a diversity technique based on constellation stretching. Numerical results for quasistatic Rayleigh-fading channels show that the proposed codes are comparable in SNR performance to the best-performing single-symbol decodable space-time codes for three and four transmit antennas.

Ben Shepherd - One of the best experts on this subject based on the ideXlab platform.

Sachin S Sapatnekar - One of the best experts on this subject based on the ideXlab platform.

  • power grid analysis using random walks
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2005
    Co-Authors: Haifeng Qian, Sani R Nassif, Sachin S Sapatnekar
    Abstract:

    This paper presents a class of power grid analyzers based on a random-walk technique. A generic algorithm is first demonstrated for dc analysis, with linear runtime and the Desirable Property of localizing computation. Next, by combining this generic analyzer with a divide-and-conquer strategy, a single-level hierarchical method is built and extended to multilevel and "virtual-layer" hierarchy. Experimental results show that these algorithms not only achieve speedups over the generic random-walk method, but also are more robust in solving various types of industrial circuits. Finally, capacitors and inductors are incorporated into the framework, and it is shown that transient analysis can be carried out efficiently. For example, dc analysis of a 71 K-node power grid with C4 pads takes 4.16 s; a 348 K-node wire-bond dc power grid is solved in 93.64 s; transient analysis of a 642 K-node power grid takes 2.1 s per timestep.

  • random walks in a supply network
    Design Automation Conference, 2003
    Co-Authors: Haifeng Qian, Sani R Nassif, Sachin S Sapatnekar
    Abstract:

    This paper presents a power grid analyzer based on a random walk technique. A linear-time algorithm is first demonstrated for DC analysis, and is then extended to perform transient analysis. The method has the Desirable Property of localizing computation, so that it shows massive benefits over conventional methods when only a small part of the grid is to be analyzed (for example, when the effects of small changes to the grid are to be examined). Even for the full analysis of the grid, experimental results show that the method is faster than existing approaches and has an acceptable error margin. This method has been applied to test circuits of up to 2.3M nodes. For example, for a circuit with 70K nodes, the solution time for a single node was 0.42 sec and the complete solution was obtained in 17.6 sec.

Jeanfrancois Arvis - One of the best experts on this subject based on the ideXlab platform.