667,532 research outputs found

    Throughput analysis of ALOHA with cooperative diversity

    Get PDF
    Cooperative transmissions emulate multi-antenna systems and can improve the quality of signal reception. In this paper, we propose and analyze a cross layer random access scheme, C-ALOHA, that enables cooperative transmissions in the context of ALOHA system. Our analysis shows that over a fading channel C-ALOHA can improve the throughput by 30%, as compared to standard ALOHA protocol

    Throughput analysis for a high-performance FPGA-accelerated real-time search application

    Get PDF
    We propose an FPGA design for the relevancy computation part of a high-throughput real-time search application. The application matches terms in a stream of documents against a static profile, held in off-chip memory. We present a mathematical analysis of the throughput of the application and apply it to the problem of scaling the Bloom filter used to discard nonmatches

    Effects of Transport Delays of Manual Control System Performance

    Get PDF
    Throughput or transport delays in manual control systems can cause degraded performance and lead to potentially unstable operation. With the expanding use of digital processors, throughput delays can occur in manual control systems in a variety of ways such as in digital flight control systems in real aircraft, and in equation of motion computers and computer generated images in simulators. Research has shown the degrading effect of throughput delays on subjective opinion and system performance and dynamic response. A generic manual control system model is used to provide a relatively simple analysis of and explanation for the effects of various types of delays. The consequence of throughput delays of some simple system architectures is also discussed

    Throughput Analysis of Buffer-Constrained Wireless Systems in the Finite Blocklength Regime

    Get PDF
    In this paper, wireless systems operating under queueing constraints in the form of limitations on the buffer violation probabilities are considered. The throughput under such constraints is captured by the effective capacity formulation. It is assumed that finite blocklength codes are employed for transmission. Under this assumption, a recent result on the channel coding rate in the finite blocklength regime is incorporated into the analysis and the throughput achieved with such codes in the presence of queueing constraints and decoding errors is identified. Performance of different transmission strategies (e.g., variable-rate, variable-power, and fixed-rate transmissions) is studied. Interactions between the throughput, queueing constraints, coding blocklength, decoding error probabilities, and signal-to-noise ratio are investigated and several conclusions with important practical implications are drawn

    ALOHA With Collision Resolution(ALOHA-CR): Theory and Software Defined Radio Implementation

    Full text link
    A cross-layer scheme, namely ALOHA With Collision Resolution (ALOHA-CR), is proposed for high throughput wireless communications in a cellular scenario. Transmissions occur in a time-slotted ALOHA-type fashion but with an important difference: simultaneous transmissions of two users can be successful. If more than two users transmit in the same slot the collision cannot be resolved and retransmission is required. If only one user transmits, the transmitted packet is recovered with some probability, depending on the state of the channel. If two users transmit the collision is resolved and the packets are recovered by first over-sampling the collision signal and then exploiting independent information about the two users that is contained in the signal polyphase components. The ALOHA-CR throughput is derived under the infinite backlog assumption and also under the assumption of finite backlog. The contention probability is determined under these two assumptions in order to maximize the network throughput and maintain stability. Queuing delay analysis for network users is also conducted. The performance of ALOHA-CR is demonstrated on the Wireless Open Access Research Platform (WARP) test-bed containing five software defined radio nodes. Analysis and test-bed results indicate that ALOHA-CR leads to significant increase in throughput and reduction of service delays

    A High-Throughput Method for Illumina RNA-Seq Library Preparation.

    Get PDF
    With the introduction of cost effective, rapid, and superior quality next generation sequencing techniques, gene expression analysis has become viable for labs conducting small projects as well as large-scale gene expression analysis experiments. However, the available protocols for construction of RNA-sequencing (RNA-Seq) libraries are expensive and/or difficult to scale for high-throughput applications. Also, most protocols require isolated total RNA as a starting point. We provide a cost-effective RNA-Seq library synthesis protocol that is fast, starts with tissue, and is high-throughput from tissue to synthesized library. We have also designed and report a set of 96 unique barcodes for library adapters that are amenable to high-throughput sequencing by a large combination of multiplexing strategies. Our developed protocol has more power to detect differentially expressed genes when compared to the standard Illumina protocol, probably owing to less technical variation amongst replicates. We also address the problem of gene-length biases affecting differential gene expression calls and demonstrate that such biases can be efficiently minimized during mRNA isolation for library preparation

    On the Delay-Throughput Tradeoff in Distributed Wireless Networks

    Full text link
    This paper deals with the delay-throughput analysis of a single-hop wireless network with nn transmitter/receiver pairs. All channels are assumed to be block Rayleigh fading with shadowing, described by parameters (α,ϖ)(\alpha,\varpi), where α\alpha denotes the probability of shadowing and ϖ\varpi represents the average cross-link gains. The analysis relies on the distributed on-off power allocation strategy (i.e., links with a direct channel gain above a certain threshold transmit at full power and the rest remain silent) for the deterministic and stochastic packet arrival processes. It is also assumed that each transmitter has a buffer size of one packet and dropping occurs once a packet arrives in the buffer while the previous packet has not been served. In the first part of the paper, we define a new notion of performance in the network, called effective throughput, which captures the effect of arrival process in the network throughput, and maximize it for different cases of packet arrival process. It is proved that the effective throughput of the network asymptotically scales as lognα^\frac{\log n}{\hat{\alpha}}, with α^αϖ\hat{\alpha} \triangleq \alpha \varpi, regardless of the packet arrival process. In the second part of the paper, we present the delay characteristics of the underlying network in terms of the packet dropping probability. We derive the sufficient conditions in the asymptotic case of nn \to \infty such that the packet dropping probability tend to zero, while achieving the maximum effective throughput of the network. Finally, we study the trade-off between the effective throughput, delay, and packet dropping probability of the network for different packet arrival processes.Comment: Submitted to IEEE Transactions on Information Theory (34 pages
    corecore