37,008 research outputs found

    A Simplified Scheme of Estimation and Cancellation of Companding Noise for Companded Multicarrier Transmission Systems

    Get PDF
    Nonlinear companding transform is an efficient method to reduce the high peak-to-average power ratio (PAPR) of multicarrier transmission systems. However, the introduced companding noise greatly degrades the bit-error-rate (BER) performance of the companded multicarrier systems. In this paper, a simplified but effective scheme of estimation and cancellation of companding noise for the companded multicarrier transmission system is proposed. By expressing the companded signals as the summation of original signals added with a companding noise component, and subtracting this estimated companding noise from the received signals, the BER performance of the overall system can be significantly improved. Simulation results well confirm the great advantages of the proposed scheme over other conventional decompanding or no decompanding schemes under various situations

    Preamble design using embedded signalling for OFDM broadcast systems based on reduced-complexity distance detection

    No full text
    The second generation digital terrestrial television broadcasting standard (DVB-T2) adopts the so-called P1 symbol as the preamble for initial synchronization. The P1 symbol also carries a number of basic transmission parameters, including the fast Fourier transform size and the single-input/single-output as well as multiple-input/single-output mode, in order to appropriately configure the receiver for carrying out the subsequent processing. In this contribution, an improved preamble design is proposed, where a pair of training sequences is inserted in the frequency domain and their distance is used for transmission parameter signalling. At the receiver, only a low-complexity correlator is required for the detection of the signalling. Both the coarse carrier frequency offset and the signalling can be simultaneously estimated by detecting the above-mentioned correlation. Compared to the standardised P1 symbol, the proposed preamble design significantly reduces the complexity of the receiver while retaining high robustness in frequency-selective fading channels. Furthermore, we demonstrate that the proposed preamble design achieves a better signalling performance than the standardised P1 symbol, despite reducing the numbers of multiplications and additions by about 40% and 20%, respectively

    Near-Instantaneously Adaptive HSDPA-Style OFDM Versus MC-CDMA Transceivers for WIFI, WIMAX, and Next-Generation Cellular Systems

    No full text
    Burts-by-burst (BbB) adaptive high-speed downlink packet access (HSDPA) style multicarrier systems are reviewed, identifying their most critical design aspects. These systems exhibit numerous attractive features, rendering them eminently eligible for employment in next-generation wireless systems. It is argued that BbB-adaptive or symbol-by-symbol adaptive orthogonal frequency division multiplex (OFDM) modems counteract the near instantaneous channel quality variations and hence attain an increased throughput or robustness in comparison to their fixed-mode counterparts. Although they act quite differently, various diversity techniques, such as Rake receivers and space-time block coding (STBC) are also capable of mitigating the channel quality variations in their effort to reduce the bit error ratio (BER), provided that the individual antenna elements experience independent fading. By contrast, in the presence of correlated fading imposed by shadowing or time-variant multiuser interference, the benefits of space-time coding erode and it is unrealistic to expect that a fixed-mode space-time coded system remains capable of maintaining a near-constant BER

    Parameterized Verification of Safety Properties in Ad Hoc Network Protocols

    Full text link
    We summarize the main results proved in recent work on the parameterized verification of safety properties for ad hoc network protocols. We consider a model in which the communication topology of a network is represented as a graph. Nodes represent states of individual processes. Adjacent nodes represent single-hop neighbors. Processes are finite state automata that communicate via selective broadcast messages. Reception of a broadcast is restricted to single-hop neighbors. For this model we consider a decision problem that can be expressed as the verification of the existence of an initial topology in which the execution of the protocol can lead to a configuration with at least one node in a certain state. The decision problem is parametric both on the size and on the form of the communication topology of the initial configurations. We draw a complete picture of the decidability and complexity boundaries of this problem according to various assumptions on the possible topologies.Comment: In Proceedings PACO 2011, arXiv:1108.145
    corecore