Dissertations / Theses on the topic 'Low-complexity'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Low-complexity.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Cooper, D. "Classes of low complexity." Thesis, University of Oxford, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.375251.
Full textWilliams, Richard G. C. "Low complexity block coded modulation." Thesis, University of Manchester, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.329600.
Full textKhattak, Shadan. "Low complexity multiview video coding." Thesis, De Montfort University, 2014. http://hdl.handle.net/2086/10511.
Full textJohansson, Kenny. "Low Complexity and Low Power Bit-Serial Multipliers." Thesis, Linköping University, Department of Electrical Engineering, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1751.
Full textBit-serial multiplication with a fixed coefficient is commonly used in integrated circuits, such as digital filters and FFTs. These multiplications can be implemented using basic components such as adders, subtractors and D flip-flops. Multiplication with the same coefficient can be implemented in many ways, using different structures. Other studies in this area have focused on how to minimize the number of adders/subtractors, and often assumed that the cost for D flip-flops is neglectable. That simplification has been proved to be far too great, and further not at all necessary. In digital devices low power consumption is always desirable. How to attain this in bit-serial multipliers is a complex problem.
The aim of this thesis was to find a strategy on how to implement bit-serial multipliers with as low cost as possible. An important step was achieved by deriving formulas that can be used to calculate the carry switch probability in the adders/subtractors. It has also been established that it is possible to design a power model that can be applied to all possible structures of bit- serial multipliers.
McKay, Thomas Gregory. "Soft, low complexity dielectric elastomer generators." Thesis, University of Auckland, 2010. http://hdl.handle.net/2292/7661.
Full textGustafsson, Oscar. "Contributions to low-complexity digital filters /." Linköping : Univ, 2003. http://www.bibl.liu.se/liupubl/disp/disp2003/tek837s.pdf.
Full textHarsha, Prahladh 1976. "Small PCPs with low query complexity." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86448.
Full textHo, Hai Pang. "Low complexity decoding of cyclic codes." Thesis, University of Surrey, 1998. http://epubs.surrey.ac.uk/844222/.
Full textSridharan, Arun. "Low Complexity Scheduling in Wireless Networks." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1366072589.
Full textDetert, Thorben. "Low complexity co-channel interference cancellation." Göttingen Sierke, 2008. http://d-nb.info/991223314/04.
Full textNæss, Hallvard. "A programmable DSP for low-power, low-complexity baseband processing." Thesis, Norwegian University of Science and Technology, Department of Electronics and Telecommunications, 2006. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9439.
Full textSoftware defined radio (SDR) is an emerging trend of radio technology. The idea is basically to move software as close to the antenna of a radio system as possible, to improve flexibility, adaptability and time-to-market. This thesis covers the description of a DSP architecture especially optimized for modulation / demodulation algorithms of low-complexity, low-power radio standards. The DSP allows software processing of these algorithms, making SDR possible. To make the DSP competitive to traditional ASIC modems, tough constraints are given for area and power consumption. Estimates done to indicate the power consumption, area and computational power of the DSP, shows that a software implementation of the studied physical layer should be possible within the given constraints.
Johansson, Kenny. "Low Power and Low complexity Constant Multiplication using Serial Arithmetic." Licentiate thesis, Linköping : Department of Electrical Engineering, Linköpings universitet, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-7965.
Full textAltrabalsi, Hana. "Low-complexity low-rate residential non-intrusive appliance load monitoring." Thesis, University of Strathclyde, 2017. http://digitool.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=28506.
Full textHost, Nicholas K. "Realization of a Low Cost Low Complexity Traveling Wave Antenna." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1420038529.
Full textJohansson, Kenny. "Low Power and Low Complexity Shift-and-Add Based Computations." Doctoral thesis, Linköping : Department of Electrical Engineering, Linköping University, 2008. http://www.bibl.liu.se/liupubl/disp/disp2008/tek1201s.pdf.
Full textZeffer, Håkan. "Towards Low-Complexity Scalable Shared-Memory Architectures." Doctoral thesis, Uppsala University, Department of Information Technology, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-7135.
Full textPlentiful research has addressed low-complexity software-based shared-memory systems since the idea was first introduced more than two decades ago. However, software-coherent systems have not been very successful in the commercial marketplace. We believe there are two main reasons for this: lack of performance and/or lack of binary compatibility.
This thesis studies multiple aspects of how to design future binary-compatible high-performance scalable shared-memory servers while keeping the hardware complexity at a minimum. It starts with a software-based distributed shared-memory system relying on no specific hardware support and gradually moves towards architectures with simple hardware support.
The evaluation is made in a modern chip-multiprocessor environment with both high-performance compute workloads and commercial applications. It shows that implementing the coherence-violation detection in hardware while solving the interchip coherence in software allows for high-performing binary-compatible systems with very low hardware complexity. Our second-generation hardware-software hybrid performs on par with, and often better than, traditional hardware-only designs.
Based on our results, we conclude that it is not only possible to design simple systems while maintaining performance and the binary-compatibility envelope, it is often possible to get better performance than in traditional and more complex designs.
We also explore two new techniques for evaluating a new shared-memory design throughout this work: adjustable simulation fidelity and statistical multiprocessor cache modeling.
List, Nancy Brown. "Low-Complexity Interleaver Design for Turbo Codes." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/5096.
Full textRabbachin, A. (Alberto). "Low complexity UWB receivers with ranging capabilities." Doctoral thesis, University of Oulu, 2008. http://urn.fi/urn:isbn:9789514288005.
Full textFerdinand, N. S. (Nuwan Suresh). "Low complexity lattice codes for communication networks." Doctoral thesis, Oulun yliopisto, 2016. http://urn.fi/urn:isbn:9789526210964.
Full textTiivistelmä Hilakoodit saavuttavat AWGN kapasiteetin ja sopivat luonnollisesti moniin monen päätelaitteen verkkoihin niihin sisältyvän rakenteen vuoksi. Vaikka lukuisat informaatioteoreettiset tutkimustyöt todistavat hilakoodien tärkeyden näille verkoille, käytännössä alhaisen kompleksisuuden hilajärjestelmiä on vielä vähän. Näin ollen tämän tutkielman tarkoitus on kehittää useita metodeja, jotta hilakoodeista saadaan käytännöllisiä viestintäverkkoihin. Aluksi, ehdotamme tehokkaan hilakoodausjärjestelmän reaaliarvoisille, full duplexisille yksi- ja kaksisuuntaisille välittäjäkanaville. Käytämme hilan hajottamista, superpositiota ja lohko-Markov -koodausta ehdottaessamme yksinkertaiset ja siltikin kapasiteetin saavuttavat koodaus- ja dekoodausjärjestelmät näihin välityskanaviin. Käyttämällä informaatioteoreettisia työkaluja, osoitamme näiden järjestelmien saavutettavat nopeudet, jotka ovat yhtä suuret kuin parhaimmat tunnetut nopeudet. Sitten rakennamme käytännölliset ja alhaisen monimutkaisuuden toteutukset ehdotetuille välitysjärjestelmille käyttäen alhaisen tiheyden hilakoodeja. Esitämme näille järjestelmille numeeriset arvioinnit, jotka näyttävät että nämä toteutukset saavuttavat tehokkuuden, joka on 2.5dB:n päässä teoreettisista rajoista. Tutkimme muotoilu- ja koodaushäviön vaikutusta välityskanavien tehokkuuteen. Sitten, ehdotamme alhaisen monimutkaisuuden hilakoodirakenteen, joka tarjoaa korkean muotoilu- ja koodausvahvistuksen. Ensin, kokonaislukuinformaatio on koodattu muotoiltuihin kokonaislukuihin. Esitämme kaksi metodia tähän tehtävään; 'Voronoi kokonaisluvut' ja 'ei yhtenäiset kokonaisluvut'. Näillä muotoilluilla kokonaisluvuilla on muotoiluvahvistusta kokonaislukuhilalle. Toisena askeleena, esitämme yleiset puitteet systemaattiseen kokonaislukujen koodaukseen käyttäen korkeaulotteisia hiloja alhaisen kolmiogeneraattori- tai pariteettivarmistusmatriiseja, jotka säilyttävät samalla muotoiluvahvistuksen. Ehdotettua järjestelmää voidaan käyttää muotoilemaan korkeaulotteisia hiloja kuten alhaisen tiheyden hilakoodeja, LDA-hiloja, jne. Esitämme kattavan analyysin käyttäen alhaisen tiheyden hilakoodeja. Käyttämällä muotoiluhiloina E8aa ja BW16a, näytämme numeerisesti 'Voronoi kokonaislukujen' käyttämisen seurauksena saavutettavat hilojen muotoiluvahvistukset, jotka ovat jopa 0.65dB ja 0.86dB. Näytämme myös numeerisesti että 'ei yhtenäisillä kokonaisluvuilla' on muotoiluvahvistusta jopa 1.25dB. Nämä muotoiluoperaatiot voidaan toteuttaa alhaisemmalla monimutkaisuudella kuin aikaisemmat 'alhaisen tiheyden hilakoodien muotoilumenetelmät' ja muotoiluvahvistukset ovat suuremmat kuin aikaisemmin raportoidut tapaukset, jotka ovat suuruusluokaltaan 0.4dB. Viimeiseksi, ehdotamme käytännöllisen koodikonstruktion alhaisella monimutkaisuudella 'laske ja lähetä' -menetelmään. Kehitämme uuden koodikonstruktion, jota kutsumme 'sekoitetuksi sisäkkäiseksi hilakoodikonstruktioksi'. Tämä koodikonstruktio käyttää kahta eroteltavissa olevaa sisäkkäistä hilaa koodaamaan kokonaisluvut siellä, missä muotoilu tehdään pienen ulottuvuuden hiloilla korkean muotoiluvahvistuksella ja koodaus toteutetaan käyttäen korkean koodausvahvistuksen omaavaa korkeaulottuvuuksista hilaa. Tämä konstruktio säilyttää muotoilu- ja koodausvahvistukset kullekin muotoilu- ja koodaushilalle. Lisäksi, todistamme isomorfismin olemassaolon tässä konstruktiossa siten, että lineaarisen hilakoodien kombinaatio voidaan kuvata lineaarisena kokonaislukujen kombinaationa äärellisessä kunnassa. Näin ollen tätä konstruktiota voidaan helposti käyttää missä tahansa 'laske ja lähetä' -sovelluksessa. Esitämme muokatun LDLC dekooderin lineaarisen viestikombinaation estimointiin. Arvioimme tehon numeerisesti
Hung, Kevin Chun-Yeung. "A novel low-complexity IF-sampling receiver." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq20872.pdf.
Full textZeffer, Håkan. "Towards low-complexity scalable shared-memory architectures /." Uppsala : Acta Universitatis Upsaliensis, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-7135.
Full textDempster, Andrew. "Digital filter design for low-complexity implementation." Thesis, University of Cambridge, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362967.
Full textPerry, Russell. "Low complexity adaptive equalisation for wireless applications." Thesis, University of Bristol, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.389138.
Full textColeman, Todd P. (Todd Prentice) 1977. "Low-complexity approaches to distributed data dissemination." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/35286.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 145-153).
In this thesis we consider practical ways of disseminating information from multiple senders to multiple receivers in an optimal or provably close-to-optimal fashion. The basis for our discussion of optimal transmission of information is mostly information theoretic - but the methods that we apply to do so in a low-complexity fashion draw from a number of different engineering disciplines. The three canonical multiple-input, multiple-output problems we focus our attention upon are: * The Slepian-Wolf problem where multiple correlated sources must be distributedly compressed and recovered with a common receiver. * The discrete memoryless multiple access problem where multiple senders communicate across a common channel to a single receiver. * The deterministic broadcast channel problem where multiple messages are sent from a common sender to multiple receivers through a deterministic medium. Chapter 1 serves as an introduction and provides models, definitions, and a discussion of barriers between theory and practice for the three canonical data dissemination problems we will discuss. Here we also discuss how these three problems are all in different senses 'dual' to each other, and use this as a motivating force to attack them with unifying themes.
(cont.) Chapter 2 discusses the Slepian-Wolf problem of distributed near-lossless compression of correlated sources. Here we consider embedding any achievable rate in an M-source problem to a corner point in a 2M - 1-source problem. This allows us to employ practical iterative decoding techniques and achieve rates near the boundary with legitimate empirical performance. Both synthetic data and real correlated data from sensors at the International Space Station are used to successfully test our approach. Chapter 3 generalizes the investigation of practical and provably good decoding algorithms for multiterminal systems to the case where the statistical distribution of the memoryless system is unknown. It has been well-established in the theoretical literature that such 'universal' decoders exist and do not suffer a performance penalty, but their proposed structure is highly nonlinear and therefore believed to be complex. For this reason, most discussion of such decoders has been limited to the realm of ontology and proof of existence. By exploiting recently derived results in other engineering disciplines (i.e. expander graphs, linear programming relaxations, etc), we discuss a code construction and two decoding algorithms that have polynomial complexity and admit provably good performance (exponential error probability decay).
(cont.) Because there is no need for a priori statistical knowledge in decoding (which in many settings - for instance a sensor network - might be difficult to repeatedly acquire without significant cost), this approach has very attractive robustness, energy efficiency, and stand-alone practical implications. Finally, Chapter 4 walks away from the multiple-sender, single-receiver setting and steps into the single-sender-multiple receiver setting. We focus our attention here on the deterministic broadcast channel, which is dual to the Slepian-Wolf and multiple access problems in a number of ways - including how the difficulty of practical implementation lies in the encoding rather than decoding. Here we illustrate how again a splitting approach can be applied, and how the same properties from the Slepian-Wolf and multiple access splitting settings remain. We also discuss practical coding strategies for some problems motivated by wireless, and show how by properly 'dualizing' provably good decoding strategies for some channel coding problems, we admit provably good encoding for this setting.
by Todd Prentice Coleman.
Ph.D.
Lombardi, Alex (Alex John). "Low complexity pseudorandom generators and indistinguishability obfuscation." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/118056.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 61-64).
In the study of cryptography in NCO, it was previously known that Goldreich's candidate pseudorandom generator (PRG) is insecure when instantiated with a predicate P in 4 or fewer variables, if one wants to achieve polynomial stretch. On the other hand, there is a standard candidate PRG with locality 5 based on the "tri-sum-and" predicate ... However, locality is only one complexity measure of a PRG that one could hope to minimize. In this work, we consider the problem of minimizing three other complexity measures of a (local) PRG: decision tree (DT-)complexity, Q-degree (i.e., the degree of P as a polynomial over Q), and the recent notion of blockwise locality (due to Lin and Tessaro). These three complexity measures are all of interest for their possible applications to constructing indistinguishability obfuscation (IO) schemes based on low-degree multilinear maps. Indeed, Lin and Tessaro recently proposed an intriguing candidate IO scheme based on bilinear maps and a non-standard assumption on "Goldreich-like" pseudorandom generators. We obtain both positive and negative results on the existence of low complexity PRGs. First, we give a candidate predicate for Goldreich's PRG with DT-complexity 4 and Q-degree 3. We also show that all predicates with either DT-complexity less than 4 or Q-degree less than 3 yield insecure PRGs, so our candidate predicate simultaneously achieves the best possible locality, DT-complexity, Q-degree, and F2-degree according to all known attacks. Finally, we show polynomial-time attacks on the blockwise 2-local PRGs required in the Lin-Tessaro work, invalidating the security of their IO and FE candidates based on bilinear maps. Our attack uses tools from the literature on two-source extractors (Chor and Goldreich, SICOMP 1988) and efficient refutation of random 2-XOR instances (Charikar and Wirth, FOCS 2004).
by Alex Lombardi.
S.M. in Computer Science and Engineering
Joshi, Yetish. "Low complexity in-loop perceptual video coding." Thesis, Middlesex University, 2016. http://eprints.mdx.ac.uk/21278/.
Full textBontu, Chandra Sekhar Carleton University Dissertation Engineering Systems and Computer. "Low complexity equalization for indoor wireless communications." Ottawa, 1996.
Find full textTang, Xiangguo. "Low complexity equalization approaches in wireless communications /." For electronic version search Digital dissertations database. Restricted to UC campuses. Access is free to UC campus dissertations, 2002. http://uclibs.org/PID/11984.
Full textMercat, Alexandre. "Complexity Control for Low-Power HEVC Encoding." Thesis, Rennes, INSA, 2018. http://www.theses.fr/2018ISAR0035/document.
Full textThe Internet of Things (loT) is now a reality. Forthcoming applications will boost mobile video demand to an unprecedented level. The induced increase in computational complexity is a challenge when executing in real-time new video coding standards on embedded platforms, limited in computing, memory, and energy. New 4K UHD and 360-degree video contents coming with high spatial (SK, 16K) and temporal (120fp resolutions further complicate the problem. In this context, codecs such as HEVC (High Efficiency Vide Coding) must be worked on to reduce their complexity while preserving the bitrate and image quality. Th bounded energy density of embedded system's batteries requires designers to propose new methods scaling and controlling the complexity and energy consumption of HEVC codecs. This document presents a set of studies aiming at scaling and controlling the complexity, and therefore the energy consumption, of HEVC Intra encoding. Two methods of quad-tree partitioning prediction in "one-shot are proposed: one based on variance-aware statistic approach and one based on Machine Learning using data-mining classifiers. From the obtained prediction, a generic tunable complexity scheme of HEVC encoding is introduced. It expands the search space around the original partitioning prediction and allocates complexit in a frame while minimizing performance loss in terms of bitrate and visual quality. Finally, a real-time contr system is created that dynamically manages the encoding process to keep the encoding complexity under specific tarjet. It demonstrates the a licability of the mayor contributions of this document
Planjery, Shiva Kumar. "Low-Complexity Finite Precision Decoders for Low-Density Parity-Check Codes." International Foundation for Telemetering, 2010. http://hdl.handle.net/10150/605947.
Full textWe present a new class of finite-precision decoders for low-density parity-check (LDPC) codes. These decoders are much lower in complexity compared to conventional floating-point decoders such as the belief propagation (BP) decoder, but they have the potential to outperform BP. The messages utilized by the decoders assume values (or levels) from a finite discrete set. We discuss the implementation aspects as well as describe the underlying philosophy in designing these decoders. We also provide results to show that in some cases, only 3 bits are required in the proposed decoders to outperform floating-point BP.
Huhn, Alexander. "Low-complexity multiple-antenna systems for low-rate wireless personal area networks." Thesis, University of Reading, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.558802.
Full textOsman, Ammar. "Low-complexity OFDM transceiver design for UMTS-LTE." Thesis, Blekinge Tekniska Högskola, Avdelningen för signalbehandling, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3716.
Full textTel: +46-704469795 Email: osman@ftw.at,amos04@student.bth.se, ammarmao@gmail.com
Morawski, Robert. "Low-complexity structures for digital symbol timing recovery." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0017/MQ47829.pdf.
Full textWong, Wai William. "Low complexity IF-sampling receiver for DS/SS." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0019/MQ49693.pdf.
Full textWeisenhorn, Martin. "Low-complexity techniques for ultra-wideband communication systems." kostenfrei, 2007. http://mediatum2.ub.tum.de/doc/625801/document.pdf.
Full textIsmail, Amr. "Low Complexity Space-Time coding for MIMO systems." Phd thesis, Supélec, 2011. http://tel.archives-ouvertes.fr/tel-00771982.
Full textCoria, Mendoza Lino Evgueni. "Low-complexity methods for image and video watermarking." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/571.
Full textNava, Alain Coletta. "Characterisation of low-complexity regions in protein sequences." Thesis, University of Manchester, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.493949.
Full textPandya, Nishit. "Switchable-rate LDPC Codes with Low Complexity Decoding." Thesis, Lancaster University, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.518140.
Full textNelson, Christopher J. "Low complexity capacity-approaching codes for data transmission." Thesis, Lancaster University, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.556663.
Full textSellars, Malcolm Paul. "Low complexity equalization techniques for broadband indoor radio." Thesis, University of Cambridge, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.621727.
Full textDanjean, Ludovic. "Low-Complexity Iterative Reconstruction Algorithms in Compressed Sensing." International Foundation for Telemetering, 2013. http://hdl.handle.net/10150/579661.
Full textIn this paper we focus on two low-complexity iterative reconstruction algorithms in compressed sensing. These algorithms, called the approximate message-passing algorithm and the interval-passing algorithm, are suitable to recover sparse signals from a small set of measurements. Depending on the type of measurement matrix (sparse or random) used to acquire the samples of the signal, one or the other reconstruction algorithm can be used. We present the reconstruction results of these two reconstruction algorithms in terms of proportion of correct reconstructions in the noise free case. We also report in this paper possible practical applications of compressed sensing where the choice of the measurement matrix and the reconstruction algorithm are often governed by the constraint of the considered application.
Oh, Han, and Yookyung Kim. "Low-Complexity Perceptual JPEG2000 Encoder for Aerial Images." International Foundation for Telemetering, 2011. http://hdl.handle.net/10150/595684.
Full textA highly compressed image inevitably has visible compression artifacts. To minimize these artifacts, many compression algorithms exploit the varying sensitivity of the human visual system (HVS) to different frequencies. However, this sensitivity has typically been measured at the near-threshold level where distortion is just noticeable. Thus, it is unclear that the same sensitivity applies at the supra-threshold level where distortion is highly visible. In this paper, we measure the sensitivity of the HVS for several supra-threshold distortion levels based on our JPEG2000 distortion model. Then, a low-complexity JPEG2000 encoder using the measured sensitivity is described. For aerial images, the proposed encoder significantly reduces encoding time while maintaining superior visual quality compared with a conventional JPEG2000 encoder.
Vorhies, John T. "Low-complexity Algorithms for Light Field Image Processing." University of Akron / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=akron1590771210097321.
Full textSalman, Naveed. "Optimised low complexity localisation in wireless sensor networks." Thesis, University of Leeds, 2013. http://etheses.whiterose.ac.uk/5823/.
Full textDrummond, Blair. "Limits of Rauzy Graphs of Low-Complexity Words." Thesis, Université d'Ottawa / University of Ottawa, 2019. http://hdl.handle.net/10393/39594.
Full textKong, Jia Hao. "Low-complexity, low-area computer architectures for cryptographic application in resource constrained environments." Thesis, University of Nottingham, 2018. http://eprints.nottingham.ac.uk/45394/.
Full textLin, Chien-Kuang, and 林建光. "Low-Complexity CodeBook Searching." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/12850529071114363385.
Full text國立交通大學
電信工程系
90
With the increasing demand for packet-voice transmission, low bit-rate speech coders gradually become a research trend. In February 1991, General Services Administration published Federal Standard 1016 (FS1016) which specifies the requirements for the conversion of analog voice to digital data by a method of 4.8 Kbps CELP. However, the major obstacle for applying it to real-time applications is the mass computational complexity in codebook search. In this thesis, we improve the FS1016 complexity by presenting a new codebook searching algorithm. The improvement of our new algorithm over the original one is not only illustrated by the reduction of the number of computations required in principle, but also demonstrated through a so-implemented FS1016 ACM driver under Windows Operating System. To conclude the research on the area of packet-voice transmission in our lab, a combined ACM driver with our fast searching algorithm, and a packet-loss recovery scheme developed previously has also been implemented.
方耀諄. "Low Complexity Lossless Video Compression." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/dtv85n.
Full text國立交通大學
電子工程系所
92
We present a line-based adaptive lossless video compression (LALVC) algorithm for interactive multimedia applications that demand low complexity and low latency. Communications between high-resolution display and storage devices require high bandwidth for exchanging raw data. To reduce the cost of video transmission without losing data accuracy, a lossless video compression is necessary. Considering low complexity and low delay, the proposed LALVC adopts a simple and yet efficient architecture that consists of one-pass, raster-scan, transform-free coding process with a simple predictor. For low latency, zero-motion prediction and single frame buffer are used to reduce temporal redundancy. In addition, to maximize the coding efficiency for both natural and computer-generated video sequences, LALVC adaptively selects the best coding mode for each line in a frame. The entropy coding of each line is based on Golomb code to enhance coding efficiency with less computation load and is easy for hardware realization. The simulation results show that temporal preprocessing and line-based mode decision of LALVC can increase compression ratio with properly increased complexity as compared to that of JPEG-LS. In addition, to demonstrate easy hardware realization and real-time video compression, we realize hardware architecture of LALVC for ASIC design.
Chu, Che-yi, and 朱哲毅. "Low complexity tone detection method." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/38376136075098911857.
Full text國立高雄第一科技大學
電腦與通訊工程研究所
101
Audio analysis has been widely used in various fields, such as speech recognition, carrier detect dial tone detection, tone detection for audio analysis is an important part of the need to use either voice recognition or carrier detect tone detection technology. The traditional analysis of the frequency dimension of the most commonly used method for the fast Fourier transform, the advantages of the fast Fourier transform is the strength of a plurality of frequencies can be analyzed simultaneously, the drawback is the need of large amounts of memory and computing resources. If you are using the Embedded System to tone detection and tone detection limit the number of tones, using the fast Fourier transform to do tone analysis cost is too high. In this paper, we propose a low complexity algorithm to do the tone detection, the hardware implementation of the method of low complexity, low computational complexity, low memory usage, it is suitable for most embedded systems. Tone detection methods used in this thesis is a variation of the autocorrelation function, and therefore have low computational complexity and low memory usage characteristics, however, do tone detection in frequency the closer the sampling autocorrelation function detection frequency the worse the problem. The method of this paper introduces a concept known as the "multiplier" in the text, because the concept of "multiplier" to improve the frequency gets closer to the sampling frequency detecting the worse the problem, there is an increased frequency of measurable range. Another problem is the self-correlation function to do the tone detection harmonic interference problems, the paper can be the harmonics caused by the interference eliminated, thus improving the problems caused by harmonic interference.