19,694 research outputs found

    Time-Hopping Multicarrier Code-Division Multiple-Access

    No full text
    A time-hopping multicarrier code-division multiple-access (TH/MC-CDMA) scheme is proposed and investigated. In the proposed TH/MC-CDMA each information symbol is transmitted by a number of time-domain pulses with each time-domain pulse modulating a subcarrier. The transmitted information at the receiver is extracted from one of the, say MM, possible time-slot positions, i.e., assuming that MM-ary pulse position modulation is employed. Specifically, in this contribution we concentrate on the scenarios such as system design, power spectral density (PSD) and single-user based signal detection. The error performance of the TH/MC-CDMA system is investigated, when each subcarrier signal experiences flat Nakagami-mm fading in addition to additive white Gaussian noise (AWGN). According to our analysis and results, it can be shown that the TH/MC-CDMA signal is capable of providing a near ideal PSD, which is flat over the system bandwidth available, while decreases rapidly beyond that bandwidth. Explicitly, signals having this type of PSD is beneficial to both broadband and ultra-wide bandwidth (UWB) communications. Furthermore, our results show that, when optimum user address codes are employed, the single-user detector considered is near-far resistant, provided that the number of users supported by the system is lower than the number of subcarriers used for conveying an information symbol

    Analytical Studies of Fragmented-Spectrum Multi-Level OFDM-CDMA Technique in Cognitive Radio Networks

    Full text link
    In this paper, we present a multi-user resource allocation framework using fragmented-spectrum synchronous OFDM-CDMA modulation over a frequency-selective fading channel. In particular, given pre-existing communications in the spectrum where the system is operating, a channel sensing and estimation method is used to obtain information of subcarrier availability. Given this information, some real-valued multi-level orthogonal codes, which are orthogonal codes with values of {±1,±2,±3,±4,...}\{\pm1,\pm2,\pm3,\pm4, ... \}, are provided for emerging new users, i.e., cognitive radio users. Additionally, we have obtained a closed form expression for bit error rate of cognitive radio receivers in terms of detection probability of primary users, CR users' sensing time and CR users' signal to noise ratio. Moreover, simulation results obtained in this paper indicate the precision with which the analytical results have been obtained in modeling the aforementioned system.Comment: 6 pages and 3 figure

    Coordinating Complementary Waveforms for Sidelobe Suppression

    Full text link
    We present a general method for constructing radar transmit pulse trains and receive filters for which the radar point-spread function in delay and Doppler, given by the cross-ambiguity function of the transmit pulse train and the pulse train used in the receive filter, is essentially free of range sidelobes inside a Doppler interval around the zero-Doppler axis. The transmit pulse train is constructed by coordinating the transmission of a pair of Golay complementary waveforms across time according to zeros and ones in a binary sequence P. The pulse train used to filter the received signal is constructed in a similar way, in terms of sequencing the Golay waveforms, but each waveform in the pulse train is weighted by an element from another sequence Q. We show that a spectrum jointly determined by P and Q sequences controls the size of the range sidelobes of the cross-ambiguity function and by properly choosing P and Q we can clear out the range sidelobes inside a Doppler interval around the zero- Doppler axis. The joint design of P and Q enables a tradeoff between the order of the spectral null for range sidelobe suppression and the signal-to-noise ratio at the receiver output. We establish this trade-off and derive a necessary and sufficient condition for the construction of P and Q sequences that produce a null of a desired order

    The Current Status of Binary Black Hole Simulations in Numerical Relativity

    Full text link
    Since the breakthroughs in 2005 which have led to long term stable solutions of the binary black hole problem in numerical relativity, much progress has been made. I present here a short summary of the state of the field, including the capabilities of numerical relativity codes, recent physical results obtained from simulations, and improvements to the methods used to evolve and analyse binary black hole spacetimes.Comment: 14 pages; minor changes and corrections in response to referee

    DATAMAP upgrade version 4.0

    Get PDF
    The changes made on the data analysis and management program DATAMAP (Data from Aeromechanics Test and Analytics - Management and Analysis Package) are detailed. These changes are made to Version 3.07 (released February, 1981) and are called Version 4.0. Version 4.0 improvements were performed by Sterling Software under contract to NASA Ames Research Center. The increased capabilities instituted in this version include the breakout of the source code into modules for ease of modification, addition of a more accurate curve fit routine, ability to handle higher frequency data, additional data analysis features, and improvements in the functionality of existing features. These modification will allow DATAMAP to be used on more data sets and will make future modifications and additions easier to implement

    Resource Allocation for Secure Gaussian Parallel Relay Channels with Finite-Length Coding and Discrete Constellations

    Full text link
    We investigate the transmission of a secret message from Alice to Bob in the presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes. Each link comprises a set of parallel channels, modeling for example an orthogonal frequency division multiplexing transmission. We consider the impact of discrete constellations and finite-length coding, defining an achievable secrecy rate under a constraint on the equivocation rate at Eve. Then we propose a power and channel allocation algorithm that maximizes the achievable secrecy rate by resorting to two coupled Gale-Shapley algorithms for stable matching problem. We consider the scenarios of both full and partial channel state information at Alice. In the latter case, we only guarantee an outage secrecy rate, i.e., the rate of a message that remains secret with a given probability. Numerical results are provided for Rayleigh fading channels in terms of average outage secrecy rate, showing that practical schemes achieve a performance quite close to that of ideal ones

    Characteristic Evolution and Matching

    Get PDF
    I review the development of numerical evolution codes for general relativity based upon the characteristic initial value problem. Progress in characteristic evolution is traced from the early stage of 1D feasibility studies to 2D axisymmetric codes that accurately simulate the oscillations and gravitational collapse of relativistic stars and to current 3D codes that provide pieces of a binary black hole spacetime. Cauchy codes have now been successful at simulating all aspects of the binary black hole problem inside an artificially constructed outer boundary. A prime application of characteristic evolution is to extend such simulations to null infinity where the waveform from the binary inspiral and merger can be unambiguously computed. This has now been accomplished by Cauchy-characteristic extraction, where data for the characteristic evolution is supplied by Cauchy data on an extraction worldtube inside the artificial outer boundary. The ultimate application of characteristic evolution is to eliminate the role of this outer boundary by constructing a global solution via Cauchy-characteristic matching. Progress in this direction is discussed.Comment: New version to appear in Living Reviews 2012. arXiv admin note: updated version of arXiv:gr-qc/050809

    Space-time coding techniques with bit-interleaved coded modulations for MIMO block-fading channels

    Full text link
    The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving conditions, which enables a global optimization taking into account channel coding. Thanks to a diversity upperbound derived from the Singleton bound, an appropriate choice of the time dimension of the space-time coding is possible, which maximizes diversity while minimizing complexity. Based on the analysis, an optimized interleaver and a set of linear precoders, called dispersive nucleo algebraic (DNA) precoders are proposed. The proposed precoders have good performance with respect to the state of the art and exist for any number of transmit antennas and any time dimension. With turbo codes, they exhibit a frame error rate which does not increase with frame length.Comment: Submitted to IEEE Trans. on Information Theory, Submission: January 2006 - First review: June 200

    Search for Discrete Refractive Scattering Events

    Get PDF
    We have searched for discrete refractive scattering events (including effects due to possible non-multiple diffractive scattering) at meter wavelengths in the direction of two close by pulsars B0950+08 and B1929+10, where we looked for spectral signatures associated with the multiple imaging of pulsars due to scattering in the interstellar medium. We do not find any signatures of such events in the direction of either source over a spectral periodicity range of 50 KHz to 5 MHz. Our analysis puts strong upper limits on the column density contrast associated with a range of spatial scales of the interstellar electron density irregularities along these lines of sight.Comment: Accepted for publication in Astronomy & Astrophysic
    corecore