On the use of a Modified Latin Hypercube Sampling (MLHS) approach in the estimation of a Mixed Logit model for vehicle choice

Quasi-random number sequences have been used extensively for many years in the simulation of integrals that do not have a closed-form expression, such as Mixed Logit and Multinomial Probit choice probabilities. Halton sequences are one example of such quasi-random number sequences, and various types of Halton sequences, including standard, scrambled, and shuffled versions, have been proposed and tested in the context of travel demand modeling. In this paper, we propose an alternative to Halton sequences, based on an adapted version of Latin Hypercube Sampling. These alternative sequences, like scrambled and shuffled Halton sequences, avoid the undesirable correlation patterns that arise in standard Halton sequences. However, they are easier to create than scrambled or shuffled Halton sequences. They also provide more uniform coverage in each dimension than any of the Halton sequences. A detailed analysis, using a 16-dimensional Mixed Logit model for choice between alternative-fuelled vehicles in California, was conducted to compare the performance of the different types of draws. The analysis shows that, in this application, the Modified Latin Hypercube Sampling (MLHS) outperforms each type of Halton sequence. This greater accuracy combined with the greater simplicity make the MLHS method an appealing approach for simulation of travel demand models and simulation-based models in general

Precise BER Formulas for Asynchronous QPSK-Modulated DS-CDMA Systems Using Random Quaternary Spreading Over Rayleigh Channels

Precise bit-error-ratio (BER) analysis of an asynchronous QPSK-modulated direct-sequence code-division multiple-access system using random quaternary spreading sequences for transmission over Rayleigh channels is performed based on the characteristic-function approach. Its accuracy is verified by our numerical simulation results and also compared with those of the Gaussian approximation. Index Terms—Asynchronous direct-sequence code-division multiple-access (DS-CDMA), bit-error-ratio (BER), precise, QPSK, quarternary spreading, Rayleigh

New Constructions of Zero-Correlation Zone Sequences

In this paper, we propose three classes of systematic approaches for constructing zero correlation zone (ZCZ) sequence families. In most cases, these approaches are capable of generating sequence families that achieve the upper bounds on the family size ($K$) and the ZCZ width ($T$) for a given sequence period ($N$). Our approaches can produce various binary and polyphase ZCZ families with desired parameters $(N,K,T)$ and alphabet size. They also provide additional tradeoffs amongst the above four system parameters and are less constrained by the alphabet size. Furthermore, the constructed families have nested-like property that can be either decomposed or combined to constitute smaller or larger ZCZ sequence sets. We make detailed comparisons with related works and present some extended properties. For each approach, we provide examples to numerically illustrate the proposed construction procedure.Comment: 37 pages, submitted to IEEE Transactions on Information Theor

Geometric Capacity Studies for DTV Transmitter Identification By Using Kasami Sequences

The transmitter identification of the DTV systems becomes crucial nowadays. Transmitter identification (TxID, or transmitter fingerprinting) technique is used to detect, diagnose and classify the operating status of any radio transmitter of interest. A pseudo random sequence was proposed to be embedded into the DTV signal before transmission. Thus, the transmitter identification can be realized by invoking the cross-correlation functions between the received signal and the possible candidates of the pseudo random sequences. Gold sequences and Kasami sequences are two excellent candidates for the transmitter ID sequences as they provide a large family of nearly-orthogonal codes. In order to investigate the sensitivity of the transmitter identification in different topologies and Kasami sequences with different length, we present the analysis here for four different geometric layouts, namely circular distribution, doubly concentric and circular distribution, square array and hexagonal tessellation. The covered area and the lowest received signal-to-interference ratio are considered as two essential parameters for the multiple-transmitter identification. It turns out to be that the larger the Kasami sequence length, the larger the received signal-to-interference ratio. Our new analysis can be used to determine the required Kasami sequence length for a specific broadcasting coverage