1,302 research outputs found

    Examples of minimal-memory, non-catastrophic quantum convolutional encoders

    Get PDF
    One of the most important open questions in the theory of quantum convolutional coding is to determine a minimal-memory, non-catastrophic, polynomial-depth convolutional encoder for an arbitrary quantum convolutional code. Here, we present a technique that finds quantum convolutional encoders with such desirable properties for several example quantum convolutional codes (an exposition of our technique in full generality will appear elsewhere). We first show how to encode the well-studied Forney-Grassl-Guha (FGG) code with an encoder that exploits just one memory qubit (the former Grassl-Roetteler encoder requires 15 memory qubits). We then show how our technique can find an online decoder corresponding to this encoder, and we also detail the operation of our technique on a different example of a quantum convolutional code. Finally, the reduction in memory for the FGG encoder makes it feasible to simulate the performance of a quantum turbo code employing it, and we present the results of such simulations.Comment: 5 pages, 2 figures, Accepted for the International Symposium on Information Theory 2011 (ISIT 2011), St. Petersburg, Russia; v2 has minor change

    ANALISIS TINGKAT KEBISINGAN KENDARAAN DI LAMPU LALU LINTAS PADA SIMPANG TIGA JALAN RAYA PRAMBON SIDOARJO MENGGUNAKAN SOUND LEVEL METER BERBASIS ARDUINO UNO

    Get PDF
    Abstrak Lampu lalu lintas di jalan raya Prambon, kecamatan Prambon, kabupaten Sidoarjo ini merupakan lampu lalu lintas yang ada pada jalan kelas provinsi yang berjarak sekitar 25 meter dengan puskesmas kecamatan Prambon tentunya kebisingan merupakan hal yang perlu diperhatikan agar pasien yang dirawat merasa nyaman. Tujuan dilakukannya penelitian ini yaitu untuk mengetahui tingkat kebisingan yang diakibatkan kendaraan di lampu lalu lintas pada simpang tiga jalan raya Prambon. Selanjutnya menganalisis hasil kebisingan yang ditimbulkan oleh kendaraan saat berhenti di lampu lalu lintas dengan memperhatikan Surat Keputusan Menteri Lingkungan Hidup Tahun 1996 No. KEP-48/MENLH/11/1996 dengan menggunakan Sound Level Meter yang telah dirancang peneliti serta telah di uji keakuratannya. Penelitian dilakukan menggunakan metode kuantitatif serta metode purposive sampling dengan menentukan sendiri lokasi dan pengambilan data penelitian. Pengambilan data dilakukan pada hari Senin tanggal 5 Desember 2022 selama 10 jam, pada selang waktu pukul 07.00 – 17.00 (WIB). dari penelitian tersebut dihasilkan nilai rentang kebisingan sebesar 61,90 dB – 88,09 dB, dimana kebisingan yang dihasilkan melebihi dari nilai maksimum pada rumah sakit atau sejenisnya yang sebesar 55 dB. Artinya lebih besar 12,54% - 60,16% dari nilai maksimumnya. Dari hasil uji yang telah dilakukan Sound Level Meter (SLM) rancangan peneliti cukup efektif serta terdapat beberapa kelebihan dari Sound Level Meter (SLM) rancangan peneliti yaitu perancangannya yang lebih sederhana dan cukup mudah untuk dibawa kemanapun. Kata Kunci: Lampu Lalu Lintas, Kebisingan, Sound Level Meter Abstract The traffic light on the Prambon highway, Prambon sub-district, and Sidoarjo district is a traffic light on a provincial-class road that is about 25 meters from the Prambon sub-district health center. Of course, noise is something that needs attention so that the patients being treated feel comfortable. The purpose of conducting this research is to determine the level of noise caused by vehicles at traffic lights at the Prambon Highway intersection. Then analyze the results of the noise generated by vehicles when stopping at traffic lights, taking into account the Decree of the Minister of Environment of 1996, No. KEP-48/MENLH/11/1996, using a sound level meter that has been designed by researchers and has been tested for accuracy. The research was conducted using quantitative methods and purposive sampling methods by determining the location and collecting research data. Data collection was carried out on Monday, December 5 2022, for 10 hours at an interval of 07.00 - 17.00 (WIB). From this study, a noise range value of 61.90 Db - 88.09 dB was produced, where the resulting noise exceeded the maximum value in a hospital or the like, which was 55 dB. This means that it is 12.54% - 60.16% greater than the maximum value. From the test results that have been carried out, the sound level meter (SLM) designed by the researchers is quite effective, and there are several advantages over the sound level meter (SLM) designed by the researchers, namely the design being simpler and quite easy to carry anywhere. Keywords: Traffic light, Noise, Sound Level Mete

    Remote Sensing Data Visualization, Fusion and Analysis via Giovanni

    Get PDF
    We describe Giovanni, the NASA Goddard developed online visualization and analysis tool that allows users explore various phenomena without learning remote sensing data formats and downloading voluminous data. Using MODIS aerosol data as an example, we formulate an approach to the data fusion for Giovanni to further enrich online multi-sensor remote sensing data comparison and analysis

    Minimal-memory requirements for pearl-necklace encoders of quantum convolutional codes

    Get PDF
    One of the major goals in quantum information processing is to reduce the overhead associated with the practical implementation of quantum protocols, and often, routines for quantum error correction account for most of this overhead. A particular technique for quantum error correction that may be useful for protecting a stream of quantum information is quantum convolutional coding. The encoder for a quantum convolutional code has a representation as a convolutional encoder or as a pearl-necklace encoder. In the pearl-necklace representation, it has not been particularly clear in the research literature how much quantum memory such an encoder would require for implementation. Here, we offer an algorithm that answers this question. The algorithm first constructs a weighted, directed acyclic graph where each vertex of the graph corresponds to a gate string in the pearl-necklace encoder, and each path through the graph represents a path through noncommuting gates in the encoder. We show that the weight of the longest path through the graph is equal to the minimal amount of memory needed to implement the encoder. A dynamic programming search through this graph determines the longest path. The running time for the construction of the graph and search through it is quadratic in the number of gate strings in the pearl-necklace encoder. © 2012 IEEE

    Robust Multivariable Microgrid Control Synthesis and Analysis

    Get PDF
    AbstractIn this paper, an islanded microgrid is modelled as a linear multivariable dynamic system. Then, the multivariable analysis tools are employed. The generalized Nyquist diagram and the relative gain array are used respectively for the stability assessment and solving the paring problem among the inputs and outputs. Droop control dependency on the X/R ratio of the microgrid DERs is recognized and its type is proposed using the relative gain array concept. Robust stability, nominal performance and robust performance requirements are evaluated in order to a better understanding of the system dynamics. Finally, three different controllers including H∞, H2 and sequential proportional-integral-derivative controls are designed and compared

    Minimal-memory, noncatastrophic, polynomial-depth quantum convolutional encoders

    Get PDF
    Quantum convolutional coding is a technique for encoding a stream of quantum information before transmitting it over a noisy quantum channel. Two important goals in the design of quantum convolutional encoders are to minimize the memory required by them and to avoid the catastrophic propagation of errors. In a previous paper, we determined minimal-memory, noncatastrophic, polynomial-depth encoders for a few exemplary quantum convolutional codes. In this paper, we elucidate a general technique for finding an encoder of an arbitrary quantum convolutional code such that the encoder possesses these desirable properties. We also provide an elementary proof that these encoders are nonrecursive. Finally, we apply our technique to many quantum convolutional codes from the literature. © 1963-2012 IEEE

    Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes

    Full text link
    Quantum convolutional codes, like their classical counterparts, promise to offer higher error correction performance than block codes of equivalent encoding complexity, and are expected to find important applications in reliable quantum communication where a continuous stream of qubits is transmitted. Grassl and Roetteler devised an algorithm to encode a quantum convolutional code with a "pearl-necklace encoder." Despite their theoretical significance as a neat way of representing quantum convolutional codes, they are not well-suited to practical realization. In fact, there is no straightforward way to implement any given pearl-necklace structure. This paper closes the gap between theoretical representation and practical implementation. In our previous work, we presented an efficient algorithm for finding a minimal-memory realization of a pearl-necklace encoder for Calderbank-Shor-Steane (CSS) convolutional codes. This work extends our previous work and presents an algorithm for turning a pearl-necklace encoder for a general (non-CSS) quantum convolutional code into a realizable quantum convolutional encoder. We show that a minimal-memory realization depends on the commutativity relations between the gate strings in the pearl-necklace encoder. We find a realization by means of a weighted graph which details the non-commutative paths through the pearl-necklace. The weight of the longest path in this graph is equal to the minimal amount of memory needed to implement the encoder. The algorithm has a polynomial-time complexity in the number of gate strings in the pearl-necklace encoder.Comment: 16 pages, 5 figures; extends paper arXiv:1004.5179v

    Exploring Sheraoh Island at South-Eastern Qatar: First Distributional Records of Some Inland and Offshore Biota with Annotated Checklist

    Get PDF
    Sheraoh island is the most remote among Qatari islands, nearly 73.5 km south-eastern of the mainland of the peninsula. In March 2010, a preliminary general survey of the species was conducted. Observations were made partly by wading and snorkeling in the intertidal zone and partly by surveying the inland habitats. In total the 31 species were recorded, 4 species of halophyte plants: Halopeplis perfoliata, Suaeda vermiculata, Salsola baryosoma and Zygophyllum qatarense, one unexpected terrestrial mammal: the cape hare Lepus capensis, 2 species of visiting birds: Motacilla flava and Anthus campestus and one species of sea bird. Phalacrocorax nigrogularis, one dolphin species: Sousa chinensis. The largest richness was found in the marine habitats, 3 species of sea weeds: Colpomenia sinusa, Padina boergesenii and Sargassum boveanum, 3 species of corals: Anomastraea irregularis, Platygyra lamellina and Porites harrisoni, 2 species of nudibranchs: Chromodoris cazae and Chromodoris sp. (unidentified)., 4 crab species: Hermit crab (unidentified), Etisus laevimanus, Grapsus albolineatus and Lambrus prensor, 4 species of echinoderms: Pentacentral mammillatus, Ophiothela venusta, Diadema setosum and Echinometra mathaei, 5 species of bony fish: Doryrhamphus sp. (larva), Cypserulus oligolepis, Lethrinus nebulosus, Cephalopholis miniatus and Hemiramphus marginatus, one species of sea snakes: Hydrophis sp. The most striking result is to collect an unknown nudibranch species and to report the cape hare which is unexpected inhabitant. All figures of this study are published for the first time in Qatar.Qatar Universit
    • …
    corecore