19 research outputs found

    The Construction and Performance of a Novel Intergroup Complementary Code

    Get PDF
     On the basis of the analyses for intergroup complementary (IGC) code and zero correlation zone complementary code, a novel IGC code has been proposed to adapt M-ary orthogonal code spreading spectrum system or quasi-synchronous CDMA system. The definition and construction methods of the new IGC codes are presented and an applied example is given in this paper. Theoretical research and simulation results show that the main advantages of the novel IGC code are as following: The code sets of the novel IGC code is more than IGC code under the same code length. The zero correlation zone length is longer than the intergroup IGC code, but shorter than the intergroup IGC code. Under the same code length, the auto-correlation performance of the novel IGC code is better than that of the IGC code, and both are of similar cross-correlation performance

    Single and multi-antenna MC-DS-CDMA with joint detection for broadband block-fading channels

    Get PDF
    In the context of broadband wireless communications using code division multiple access (CDMA), the main multiple access (MA) options include single-carrier direct sequence CDMA (SC-DS-CDMA) using time-domain direct sequence spreading [1, p. 728], multicarrier CDMA (MC-CDMA) using frequency-domain spreading [2, 3] and multicarrier DS-CDMA (MC-DS-CDMA) using time-domain direct sequence spreading of the individual sub-carrier signals [4, 5]. It was shown in [6] that MC-DS-CDMA has the highest degrees of freedom in the family of CDMA schemes that can be beneficially exploited during the system design and reconfiguration procedures. An amalgam of MC-CDMA and MC-DS-CDMA known as time and frequency domain spreading (TF-domain spreading) MC-DS-CDMA was proposed in [6]. TF-domain spreading MC-DS-CDMA has several benefits over conventional MC-DS-CDMA with regard to both capacity and performance [7]. However, in contrast to conventional MC-DS-CDMA, TF-domain spreading MC-DS-CDMA introduces MUI, which necessitates the use of joint detection at the receiver. Recently, multiple input multiple output (MIMO) or multi-antenna TF-domain spreading MC-DS-CDMA schemes have been proposed in the literature that e ciently exploit both the spatial and frequency diversity available in MIMO frequency-selective channels [8, 9]. Although an extensive amount of research has been done on single and multi-antenna TF-domain spreading MC-DS-CDMA schemes that achieve both spatial and frequency diversity in frequency-selective slow fading channels [6–9], very little research considers the time-selectivity of the wireless channels encountered. Thus, the above-mentioned schemes may not be su ciently e cient, when communicating over wireless channels exhibiting both frequency-selective and time-selective fading. There are very few MC-DS-CDMA schemes in the literature that consider the time-selectivity of the wireless channels encountered. This study considers the design of single and multi-antenna TF-domain spreading MC-DS-CDMA, for frequency-selective block-fading channels, which are capable of exploiting the full diversity available in the channel (i.e. spatial, frequency and temporal diversity), using various methods of joint detection at the receiver. It has been shown that the diversity gain in block-fading channels can be improved by coding across multiple fading blocks [10–12]. Single-antenna TF-domain spreading MC-DS-CDMA is considered for the quasi-synchronous uplink channel, and multi-antenna TF-domain spreading MC-DS-CDMA is considered for the synchronous downlink channel. Numerous simulated bit error rate (BER) performance curves, obtained using a triply selective MIMO channel platform, are presented in this study using optimal and sub-optimal joint detection algorithms at the receiver. In addition, this study investigates the impact of spatial correlation on the BER performance of the MC-DS-CDMA schemes considered. From these simulated results, one is able to conclude that TF-domain spreading MC-DS-CDMA designed for frequency-selective block-fading channels performs better than previously proposed schemes designed for frequency-selective slow fading channels, owing to the additional temporal diversity exploited under the block-fading assumption. AFRIKAANS : In die konteks van bre¨eband- draadlose kommunikasie deur die gebruik van kodeverdelingveelvuldige toegang (KVVT) behels die belangrikste veelvuldigetoegang- (VT) opsies enkel-draer direkte-sekwensie KVVT (ED-DS-KVVT), deur die gebruik van tyd-domein direkte sekwensie-verspreiding [1, p. 728], veelvuldigedraer-KVVT (VD-KVVT) deur die gebruik van frekwensiedomein-verspreiding [2, 3] en VD-DS- KVVT deur die gebruik van tyd-domein direkte sekwensie-verspreiding van die individuele sub-draerseine [4, 5]. Daar is in [6] aangetoon dat VD-DS-KVVT die hoogste vlakke van vryheid in die familie KVVT-skemas het wat voordelig benut kan word gedurende sisteemontwerp en rekonfigurasieprosedures. ’n Amalgaam van VD-KVVT en VD-DS-KVVT bekend as tyd-en-frekwensiedomeinverspreiding (TF-domeinverspreiding) VD-DS-KVVT is voorgestel in [6]. TF-domeinverspreiding VD-DS-KVVT het verskeie voordele bo konvensionele VD-DS-KVVT wat sowel kapasiteit as werkverrigting betref [7]. In teenstelling met konvensionele VD-DS-KVVT benut TF-domeinverspreiding VD-DS-KVVT multi-gebruiker-interferensie, wat die gebruik van gesamentlike opsporing by die ontvanger noodsaak. In die onlangse verlede is in die literatuur veelvuldige-inset-veelvuldige-uitset- (VIVU) of veelvuldige-antenna TF-omeinverspreiding VD-DS-KVVT-skemas voorgestel wat sowel die ruimtelike as frekwensiediversiteit wat in VIVU frekwensie-selektiewe kanale beskikbaar is, e ektief gebruik [8, 9]. Hoewel uitgebreide navorsing onderneem is oor enkel- en multi-antenna TF-domeinverspreiding VD-DS-KVVT-skemas wat sowel ruimtelike as frekwensie diversiteit in frekwensie-selektiewe stadig deinende kanale bereik [6–9], oorweeg baie min navorsing die tyd-selektiwiteit van die draadlose kanale wat betrokke is. Bogenoemde skemas mag dus nie e ektief genoeg wees nie wanneer kommunikasie plaasvind oor draadlose kanale wat sowel frekwensie-selektiewe as tyd-selektiewe wegsterwing toon. Baie min VD-DS-KVVT-skemas in die literatuur skenk aandag aan die tyd-selektiwiteit van die betrokke draadlose kanale. Die studie ondersoek die ontwerp van enkel- en multi-antenna TF-domeinverspreiding VD-DS-KVVT vir frekwensie-selektiewe blokwegsterwingkanale, wat in staat is om die volle diversiteit wat in die kanaal beskikbaar is, te benut (i.e. ruimtelike, frekwensie- en tyddiversiteit), deur die gebruik van verskeie metodes van gesamentlike opsporing by die ontvanger. Daar is aangetoon dat die diversiteitwins in blokwegsterwingkanale verbeter kan word deur kodering oor veelvuldige deinende blokke [10–12]. Enkel-antenna TF-domeinverspreiding VD-DS-KVVT word oorweeg vir die kwasi-sinchroniese opverbinding-kanaal, en multi-antenna TF-domeinverspreiding VD-DS-KVVT vir die sinchroniese afverbinding-kanaal. Talryke gesimuleerde bisfouttempo (BFT) werkverrigtingkurwes wat verkry is deur die gebruik van ’n drie-voudige selektiewe VIVU-kanaalplatform, word in hierdie studie aangebied, deur die gebruik van optimale en sub-optimale gesamentlike opsporingsalgoritmes by die ontvanger. Daarbenewens ondersoek hierdie studie die impak van ruimtelike korrelasie op die BFT-werkverrigring van die VD-DS-KVVT-skemas wat oorweeg word. Uit hierdie gesimuleerde resultate is dit moontlik om tot die gevolgtrekking te kom dat TF-domeinverspreiding VD-DS-KVVT wat ontwerp is vir frekwensie-selektiese blokwegsterwingkanale beter werkverrigting toon as vroe¨er voorgestelde skemas wat ontwerp is vir frekwensie-selektiewe stadig deinende kanale, te danke aan die ekstra tyddiversiteit wat deur die blokwegsterwing-aanname benut word. CopyrightDissertation (MEng)--University of Pretoria, 2010.Electrical, Electronic and Computer Engineeringunrestricte

    Efficient complementary sequences-based architectures and their application to ranging measurements

    Get PDF
    Premio Extraordinario de Doctorado de la UAH en 2015En las últimas décadas, los sistemas de medición de distancias se han beneficiado de los avances en el área de las comunicaciones inalámbricas. En los sistemas basados en CDMA (Code-Division Multiple-Access), las propiedades de correlación de las secuencias empleadas juegan un papel fundamental en el desarrollo de dispositivos de medición de altas prestaciones. Debido a las sumas ideales de correlaciones aperiódicas, los conjuntos de secuencias complementarias, CSS (Complementary Sets of Sequences), son ampliamente utilizados en sistemas CDMA. En ellos, es deseable el uso de arquitecturas eficientes que permitan generar y correlar CSS del mayor número de secuencias y longitudes posibles. Por el término eficiente se hace referencia a aquellas arquitecturas que requieren menos operaciones por muestra de entrada que con una arquitectura directa. Esta tesis contribuye al desarrollo de arquitecturas eficientes de generación/correlación de CSS y derivadas, como son las secuencias LS (Loosely Synchronized) y GPC (Generalized Pairwise Complementary), que permitan aumentar el número de longitudes y/o de secuencias disponibles. Las contribuciones de la tesis pueden dividirse en dos bloques: En primer lugar, las arquitecturas eficientes de generación/correlación para CSS binarios, derivadas en trabajos previos, son generalizadas al alfabeto multinivel (secuencias con valores reales) mediante el uso de matrices de Hadamard multinivel. Este planteamiento tiene dos ventajas: por un lado el aumento del número de longitudes que pueden generarse/correlarse y la eliminación de las limitaciones de las arquitecturas previas en el número de secuencias en el conjunto. Por otro lado, bajo ciertas condiciones, los parámetros de las arquitecturas generalizadas pueden ajustarse para generar/correlar eficientemente CSS binarios de mayor número de longitudes que con las arquitecturas eficientes previas. En segundo lugar, las arquitecturas propuestas son usadas para el desarrollo de nuevos algoritmos de generación/correlación de secuencias derivadas de CSS que reducen el número de operaciones por muestra de entrada. Finalmente, se presenta la aplicación de las secuencias estudiadas en un nuevo sistema de posicionamiento local basado en Ultra-Wideband y en un sistema de posicionamiento local basado en ultrasonidos

    Design and performance of CDMA codes for multiuser communications

    Get PDF
    Walsh and Gold sequences are fixed power codes and are widely used in multiuser CDMA communications. Their popularity is due to the ease of implementation. Availability of these code sets is limited because of their generating kernels. Emerging radio applications like sensor networks or multiple service types in mobile and peer-to-peer communications networks might benefit from flexibilities in code lengths and possible allocation methodologies provided by large set of code libraries. Walsh codes are linear phase and zero mean with unique number of zero crossings for each sequence within the set. DC sequence is part of the Walsh code set. Although these features are quite beneficial for source coding applications, they are not essential for spread spectrum communications. By relaxing these unnecessary constraints, new sets of orthogonal binary user codes (Walsh-like) for different lengths are obtained with comparable BER performance to standard code sets in all channel conditions. Although fixed power codes are easier to implement, mathematically speaking, varying power codes offer lower inter- and intra-code correlations. With recent advances in RF power amplifier design, it might be possible to implement multiple level orthogonal spread spectrum codes for an efficient direct sequence CDMA system. A number of multiple level integer codes have been generated by brute force search method for different lengths to highlight possible BER performance improvement over binary codes. An analytical design method has been developed for multiple level (variable power) spread spectrum codes using Karhunen-Loeve Transform (KLT) technique. Eigen decomposition technique is used to generate spread spectrum basis functions that are jointly spread in time and frequency domains for a given covariance matrix or power spectral density function. Since this is a closed form solution for orthogonal code set design, many options are possible for different code lengths. Design examples and performance simulations showed that spread spectrum KLT codes outperform or closely match with the standard codes employed in present CDMA systems. Hybrid (Kronecker) codes are generated by taking Kronecker product of two spreading code families in a two-stage orthogonal transmultiplexer structure and are judiciously allocated to users such that their inter-code correlations are minimized. It is shown that, BER performance of hybrid codes with a code selection and allocation algorithm is better than the performance of standard Walsh or Gold code sets for asynchronous CDMA communications. A redundant spreading code technique is proposed utilizing multiple stage orthogonal transmultiplexer structure where each user has its own pre-multiplexer. Each data bit is redundantly spread in the pre-multiplexer stage of a user with odd number of redundancy, and at the receiver, majority logic decision is employed on the detected redundant bits to obtain overall performance improvement. Simulation results showed that redundant spreading method improves BER performance significantly at low SNR channel conditions

    Anyons in an exactly solved model and beyond

    Get PDF
    A spin 1/2 system on a honeycomb lattice is studied. The interactions between nearest neighbors are of XX, YY or ZZ type, depending on the direction of the link; different types of interactions may differ in strength. The model is solved exactly by a reduction to free fermions in a static Z2\mathbb{Z}_{2} gauge field. A phase diagram in the parameter space is obtained. One of the phases has an energy gap and carries excitations that are Abelian anyons. The other phase is gapless, but acquires a gap in the presence of magnetic field. In the latter case excitations are non-Abelian anyons whose braiding rules coincide with those of conformal blocks for the Ising model. We also consider a general theory of free fermions with a gapped spectrum, which is characterized by a spectral Chern number ν\nu. The Abelian and non-Abelian phases of the original model correspond to ν=0\nu=0 and ν=±1\nu=\pm 1, respectively. The anyonic properties of excitation depend on ν mod 16\nu\bmod 16, whereas ν\nu itself governs edge thermal transport. The paper also provides mathematical background on anyons as well as an elementary theory of Chern number for quasidiagonal matrices.Comment: 113 pages. LaTeX + 299 .eps files (see comments in hexagon.tex for known-good compilation environment). VERSION 3: some typos fixed, one reference adde

    Nowe metody przetwarzania losowo prĂłbkowanych wielowymiarowych eksperymentĂłw NMR

    Get PDF
    The topic of this dissertation is a new algorithm for processing of sparsely sampled data sets from multidimensional nuclear magnetic resonance (NMR) experiments. NMR remains one of the major experimental technique for studying biological macromolecules. However, increasing size of investigated objects poses a challenge for NMR due to rapidly decreasing sensitivity and increasing signal crowding. The first chapter focuses on recent advances in sensitivity enhancements and summarises a few solutions for resolution of spectral overlap. Subsequently, one describes the crucial and limiting problem of signal sampling in multidimensional NMR, which, up to recently, has impeded the widespread use of high-dimensional NMR methods. Major fast acquisition and non-uniform sampling (NUS) approaches are presented. The particular emphasis was put on detailed discussion of competetive approaches to processing of data from NUS experiments. In chapter 3 the new iterative algorithm is proposed for artefact suppression in high-resolution NMR spectra. The detailed description of its design and implementation is given, and followed by comparison with selected processing methods. The efficacy of the algorithm is demonstrated on model synthetic and experimental data. The last chapter of the thesis shows various applications of the proposed method to existing and new four- and five-dimensional NMR experiments. The algorithm is proven most beneficial in challenging applications including spectra for assignment of sidechain resonances in protein and nucleic acids, NOESY spectra for structural analysis, and cross-correlated relaxation measurements for proteins. // Niniejsza praca jest poświecona nowej metodzie przetwarzania danych pochodzących z oszczędnie próbkowanych wielowymiarowych eksperymentów jądrowego rezonansu magnetycznego (ang. Nuclear Magnetic Resonance, NMR). Technika ta jest, obok krystalografii rentgenowskiej, główną eksperymentalną metodą badawczą pozwalającą na określenie struktury i dynamiki makromolekuł o znaczeniu biologicznym. Jednakże NMR napotyka dwie istotne przeszkody w odniesieniu do dużych biomolekuł, a mianowicie gwałtownie pogarszającą się czułość oraz krytyczne zatłoczenie sygnałów w widmach. W rozdziale pierwszym przedstawiono ostatnie osiagnięcia w poprawie czułości technik NMR oraz rozwiązania służące podniesieniu rozdzielczości widm. Następnie opisano kluczowy problem próbkowania wielowymiarowych sygnałów NMR, który do niedawna uniemożliwiał wykorzystanie pełnego potencjału tych technik do rozdzielenia sygnałów. Omówiono pokrótce współczesne podejścia do szybkiej akwizycji i oszczędnego próbkowania sygnałów NMR (ang. non-uniform sampling, NUS). Szczególny nacisk położono na porównanie i dyskusje wad i zalet stosowanych obecnie metod przetwarzania sygnałów niejednorodnie próbkowanych. W rozdziale 3-cim opisano nowy iteracyjny algorytm oparty o transformacje Fouriera, usuwający artefakty oszczędnego próbkowania w wysokorozdzielczych widmach NMR. Szczegółowo omówiono schemat algorytmu oraz jego programową implementację. Rozdział uzupełnia porównanie wyników algorytmu oraz wybranych metod przetwarzania na wysymulowanych oraz modelowych danych eksperymentalnych. W ostatnim rozdziale pracy zademonstrowano użyteczność nowej metody do literaturowych oraz nowych cztero- i pieciowymiarowych eksperymentów NMR. Wśród proponowanych zastosowań wymienić można widma do przypisania sygnałów w łańcuchach bocznych aminokwasów (w białkach) i pierścieniach rybozy (w kwasach rybonukleinowych), widma NOESY służące określeniu struktury trójwymiarowej biomolekuł, oraz pomiary szybkości relaksacji skorelowanej w łańcuchach głównych białek

    Sample Path Analysis of Integrate-and-Fire Neurons

    Get PDF
    Computational neuroscience is concerned with answering two intertwined questions that are based on the assumption that spatio-temporal patterns of spikes form the universal language of the nervous system. First, what function does a specific neural circuitry perform in the elaboration of a behavior? Second, how do neural circuits process behaviorally-relevant information? Non-linear system analysis has proven instrumental in understanding the coding strategies of early neural processing in various sensory modalities. Yet, at higher levels of integration, it fails to help in deciphering the response of assemblies of neurons to complex naturalistic stimuli. If neural activity can be assumed to be primarily driven by the stimulus at early stages of processing, the intrinsic activity of neural circuits interacts with their high-dimensional input to transform it in a stochastic non-linear fashion at the cortical level. As a consequence, any attempt to fully understand the brain through a system analysis approach becomes illusory. However, it is increasingly advocated that neural noise plays a constructive role in neural processing, facilitating information transmission. This prompts to gain insight into the neural code by studying the stochasticity of neuronal activity, which is viewed as biologically relevant. Such an endeavor requires the design of guiding theoretical principles to assess the potential benefits of neural noise. In this context, meeting the requirements of biological relevance and computational tractability, while providing a stochastic description of neural activity, prescribes the adoption of the integrate-and-fire model. In this thesis, founding ourselves on the path-wise description of neuronal activity, we propose to further the stochastic analysis of the integrate-and fire model through a combination of numerical and theoretical techniques. To begin, we expand upon the path-wise construction of linear diffusions, which offers a natural setting to describe leaky integrate-and-fire neurons, as inhomogeneous Markov chains. Based on the theoretical analysis of the first-passage problem, we then explore the interplay between the internal neuronal noise and the statistics of injected perturbations at the single unit level, and examine its implications on the neural coding. At the population level, we also develop an exact event-driven implementation of a Markov network of perfect integrate-and-fire neurons with both time delayed instantaneous interactions and arbitrary topology. We hope our approach will provide new paradigms to understand how sensory inputs perturb neural intrinsic activity and accomplish the goal of developing a new technique for identifying relevant patterns of population activity. From a perturbative perspective, our study shows how injecting frozen noise in different flavors can help characterize internal neuronal noise, which is presumably functionally relevant to information processing. From a simulation perspective, our event-driven framework is amenable to scrutinize the stochastic behavior of simple recurrent motifs as well as temporal dynamics of large scale networks under spike-timing-dependent plasticity
    corecore