To see the other types of publications on this topic, follow the link: Reduced complexity.

Dissertations / Theses on the topic 'Reduced complexity'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Reduced 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.

1

Xu, Chao. "Reduced-complexity communications system design." Thesis, University of Southampton, 2015. https://eprints.soton.ac.uk/381515/.

Full text
Abstract:
The technical breakthrough of Turbo Codes (TCs) initiated two decades of exciting developments leading to a suite of near-capacity techniques. It has been widely recognized that exchanging extrinsic information between the channel decoders and the modulated signal detectors assists communications systems in approaching their best possible performance potential that is predicted by the channel capacity. Nonetheless, in line with Moor’s Law, as researchers inch closer and closer to the channel capacity, the complexity of the resultant communications systems is also significantly increased. In fa
APA, Harvard, Vancouver, ISO, and other styles
2

Chow, N. H. "Reduced-complexity equalization for EDGE." Thesis, University of Surrey, 2003. http://epubs.surrey.ac.uk/843777/.

Full text
Abstract:
Enhanced Data Rates for GSM Evolution (EDGE) is currently being standardized as the evolution path for GSM. EDGE improves the spectral efficiency by employing an 8PSK modulation scheme with 3pi/8 rotation between symbols, which triples the GSM data rate. A Linearized-GMSK pulse shaping filter is employed to remain within the 200kHz bandwidth of GSM. In order to facilitate the ease of transition from GSM to EDGE, system parameters such as symbol rate and time slot structure remain unchanged. As a result, a network capable of EDGE can be deployed with limited investment and within a short time f
APA, Harvard, Vancouver, ISO, and other styles
3

Hu, Ketai. "Reduced-complexity decoding of fountain codes." Thesis, University of Ottawa (Canada), 2006. http://hdl.handle.net/10393/27254.

Full text
Abstract:
Fountain codes are a universal class of rateless codes originally designed for erasure channels. Naturally adapting to channel states without channel knowledge at the transmitter, Fountain codes have recently been demonstrated also as an appealing solution for communication over fading channels. However, their relatively high decoding complexity limits their practical use in a wireless setting. In this thesis, we present a new decoding algorithm for Raptor codes---a type of Fountain codes---over fading channels, where the complexity is significantly reduced without sacrifice of performance.
APA, Harvard, Vancouver, ISO, and other styles
4

McGinty, Nigel, and nigel mcginty@defence gov au. "Reduced Complexity Equalization for Data Communication." The Australian National University. Research School of Information Sciences and Engineering, 1998. http://thesis.anu.edu.au./public/adt-ANU20050602.122741.

Full text
Abstract:
Optimal decision directed equalization techniques for time dispersive communication channels are often too complex to implement. This thesis considers reduced complexity decision directed equalization that lowers complexity demands yet retains close to optimal performance. The first part of this dissertation consists of three reduced complexity algorithms based on the Viterbi Algorithm (VA) which are: the Parallel Trellis VA (PTVA); Time Reverse Reduced State Sequence Estimation (TR-RSSE); and Forward-Backward State Sequence Detection (FBSSD). The second part of the thesis considers structu
APA, Harvard, Vancouver, ISO, and other styles
5

Brown, Colin. "Reduced complexity equalisation for fading channels." Thesis, University of York, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.251806.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Houhao. "Reduced-complexity noncoherent receiver for GMSK signals." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ63034.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bull, David R. "Signal processing techniques with reduced computational complexity." Thesis, Cardiff University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.388006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Nelson, Tom. "REDUCED COMPLEXITY TRELLIS DETECTION OF SOQPSK-TG." International Foundation for Telemetering, 2006. http://hdl.handle.net/10150/604055.

Full text
Abstract:
ITC/USA 2006 Conference Proceedings / The Forty-Second Annual International Telemetering Conference and Technical Exhibition / October 23-26, 2006 / Town and Country Resort & Convention Center, San Diego, California<br>The optimum detector for shaped offset QPSK (SOQPSK) is a trellis detector which has high complexity (as measured by the number of detection filters and trellis states) due to the memory inherent in this modulation. In this paper we exploit the cross-correlated, trellis-coded, quadrature modulation (XTCQM) representation of SOQPSK-TG to formulate a reduced complexity detector. W
APA, Harvard, Vancouver, ISO, and other styles
9

Sen, Indranil. "Bandwidth Efficient Reduced-Complexity MT-DS-SS via Reduced Subcarrier Frequency Spacing." Ohio University / OhioLINK, 2004. http://www.ohiolink.edu/etd/view.cgi?ohiou1091107331.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Perrins, Erik Samuel. "Reduced Complexity Detection Methods for Continuous Phase Modulation." Diss., CLICK HERE for online access, 2005. http://contentdm.lib.byu.edu/ETD/image/etd969.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Chen, Li-Wei. "Reduced-complexity coded GMSK systems using iterative decoding." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0018/MQ53427.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Bergeron-Burns, Philippe. "Reduced complexity decoding for multiple antenna wireless communications." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=82467.

Full text
Abstract:
One way to achieve high data rate and bandwidth efficient wireless communications is to employ multiple transmit and receive antennas creating a Multiple-Input Multiple-Output (MIMO) system, combined with Linear Dispersion (LD) codes. Sphere Decoder (SD) is a low complexity Maximum Likelihood (ML) method of decoding LD codes.<br>Using Subspace Matched Filtering principles, two complexity reducing front-ends to any variant of the SD, are developed. These two-stage decoders are designed to only have marginally worse performance than SD.<br>Computer simulations confirm the lower complexity
APA, Harvard, Vancouver, ISO, and other styles
13

Stefer, Markus [Verfasser]. "DoA Estimation With Reduced Hardware Complexity / Markus Stefer." München : Verlag Dr. Hut, 2016. http://d-nb.info/1100969071/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Ozgur, Soner. "Reduced Complexity Sequential Monte Carlo Algorithms for Blind Receivers." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/10518.

Full text
Abstract:
Monte Carlo algorithms can be used to estimate the state of a system given relative observations. In this dissertation, these algorithms are applied to physical layer communications system models to estimate channel state information, to obtain soft information about transmitted symbols or multiple access interference, or to obtain estimates of all of these by joint estimation. Initially, we develop and analyze a multiple access technique utilizing mutually orthogonal complementary sets (MOCS) of sequences. These codes deliberately introduce inter-chip interference, which is naturally eliminat
APA, Harvard, Vancouver, ISO, and other styles
15

Jaszczur, Chris Michael. "Reduced complexity Volterra-type filters for non-linear modelling." Thesis, University of Ottawa (Canada), 2002. http://hdl.handle.net/10393/6054.

Full text
Abstract:
Volterra filters are a popular choice for modelling many nonlinear systems, in part due to their generality and simplicity in implementation and adaptation. This thesis addresses one often cited problem with this class of filters: the large increase in the number of terms in the filter for small increases in order or memory. Adaptive algorithms are presented which allow much smaller filters to perform near the performance (in terms of residual error) of the full Volterra filters. The complexity is maintained at reasonable levels by only representing the terms that are critical in reducing the
APA, Harvard, Vancouver, ISO, and other styles
16

Leong, Chi Wa. "Reduced complexity decoding and relative performance of turbo codes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/mq23379.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Hassan, Najeeb ul, Ali E. Pusane, Michael Lentmaier, Gerhard P. Fettweis, and Daniel J. Costello. "Reduced Complexity Window Decoding Schedules for Coupled LDPC Codes." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-105936.

Full text
Abstract:
Window decoding schedules are very attractive for message passing decoding of spatially coupled LDPC codes. They take advantage of the inherent convolutional code structure and allow continuous transmission with low decoding latency and complexity. In this paper we show that the decoding complexity can be further reduced if suitable message passing schedules are applied within the decoding window. An improvement based schedule is presented that easily adapts to different ensemble structures, window sizes, and channel parameters. Its combination with a serial (on-demand) schedule is also consid
APA, Harvard, Vancouver, ISO, and other styles
18

Tasneem, Khawaja Tauseef. "Reduced Complexity Detection Techniques for Multi-Antenna Communication Systems." Thesis, University of Canterbury. Electrical and Computer Engineering, 2013. http://hdl.handle.net/10092/8611.

Full text
Abstract:
In a multiuser system, several signals are transmitted simultaneously within the same frequency band. This can result in significant improvements both in spectral efficiency and system capacity. However, a detrimental effect of the shared transmissions (both in time and bandwidth), is that the signal received at the base station (BS) or access point (AP) suffers from cochannel interference (CCI) and inter-symbol interference (ISI). This situation presents challenges to receiver design. To combat the destructive nature of multipath fading, a receiver often employs multiple antennas to collect
APA, Harvard, Vancouver, ISO, and other styles
19

Goertz, Michael Brian 1978. "A reduced complexity adaptive filtering system for directional listening." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/86712.

Full text
Abstract:
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.<br>Includes bibliographical references (leaves 71-72).<br>by Michael Brian Goertz.<br>M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
20

Hassan, Najeeb ul, Ali E. Pusane, Michael Lentmaier, Gerhard P. Fettweis, and Daniel J. Costello. "Reduced Complexity Window Decoding Schedules for Coupled LDPC Codes." Technische Universität Dresden, 2012. https://tud.qucosa.de/id/qucosa%3A26634.

Full text
Abstract:
Window decoding schedules are very attractive for message passing decoding of spatially coupled LDPC codes. They take advantage of the inherent convolutional code structure and allow continuous transmission with low decoding latency and complexity. In this paper we show that the decoding complexity can be further reduced if suitable message passing schedules are applied within the decoding window. An improvement based schedule is presented that easily adapts to different ensemble structures, window sizes, and channel parameters. Its combination with a serial (on-demand) schedule is also consid
APA, Harvard, Vancouver, ISO, and other styles
21

Vithanage, Cheran Malsri. "Graphical models and approximate inference for reduced-complexity digital communications." Thesis, University of Bristol, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.440018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Kannappa, Sandeep Mavuduru. "Reduced Complexity Viterbi Decoders for SOQPSK Signals over Multipath Channels." International Foundation for Telemetering, 2010. http://hdl.handle.net/10150/604300.

Full text
Abstract:
ITC/USA 2010 Conference Proceedings / The Forty-Sixth Annual International Telemetering Conference and Technical Exhibition / October 25-28, 2010 / Town and Country Resort & Convention Center, San Diego, California<br>High data rate communication between airborne vehicles and ground stations over the bandwidth constrained Aeronautical Telemetry channel is attributed to the development of bandwidth efficient Advanced Range Telemetry (ARTM) waveforms. This communication takes place over a multipath channel consisting of two components - a line of sight and one or more ground reflected paths whic
APA, Harvard, Vancouver, ISO, and other styles
23

Ramirez, Jorge Alberto. "A novel reduced-complexity approach for modelling ebullition in peatlands." Thesis, University of Leeds, 2013. http://etheses.whiterose.ac.uk/5904/.

Full text
Abstract:
Methane (CH4) is a greenhouse gas with a global warming potential much greater than carbon dioxide, and one of the major sources of naturally occurring CH4 are peatlands. Large amounts of CH4 can be transported from peat to the atmosphere through bubbles (ebullition). The exact controls of ebullition remain uncertain, but evidence suggests that physical processes related to gas transport and storage within the peat structure is important. Although these processes are key to replicating ebullition, no computer models of ebullition contain a detailed spatial representation of the peat structure.
APA, Harvard, Vancouver, ISO, and other styles
24

Al-Askery, Ali Jaber Abdulwahab. "Reduced complexity detection for massive MIMO-OFDM wireless communication systems." Thesis, University of Newcastle upon Tyne, 2017. http://hdl.handle.net/10443/3880.

Full text
Abstract:
The aim of this thesis is to analyze the uplink massive multiple-input multipleoutput with orthogonal frequency-division multiplexing (MIMO-OFDM) communication systems and to design a receiver that has improved performance with reduced complexity. First, a novel receiver is proposed for coded massive MIMO-OFDM systems utilizing log-likelihood ratios (LLRs) derived from complex ratio distributions to model the approximate effective noise (AEN) probability density function (PDF) at the output of a zero-forcing equalizer (ZFE). These LLRs are subsequently used to improve the performance of the de
APA, Harvard, Vancouver, ISO, and other styles
25

Knopp, Raymond. "Module-phase-codes with non-coherent detection and reduced-complexity decoding." Thesis, McGill University, 1993. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=68034.

Full text
Abstract:
This thesis considers M-ary phase coding for the non-coherent AWGN channel. More precisely, we develop block-coded MPSK modulation schemes specifically for non-coherent block detection which significantly surpass the performance of ideal uncoded coherent MPSK. A class of block codes which are well-matched to MPSK modulation, called module-phase codes, is presented. The algebraic framework used for defining these codes relies on elements of module theory which are discussed along with a method for constructing such codes for non-coherent detection. It is shown that differential encoding, when c
APA, Harvard, Vancouver, ISO, and other styles
26

Skelton, Benjamin C. "Reduced complexity asynchronous multi-user receivers for spread spectrum multiple access." Thesis, University of Canterbury. Electrical and Electronic Engineering, 2000. http://hdl.handle.net/10092/5743.

Full text
Abstract:
One of the major problems facing the implementation of multi-user detectors in a mobile radio multiple access environment is the complexity of the receiver structure. This thesis addresses this problem and develops three related receiver structures based on the maximum likelihood multi-user detector. They allow a degradation in performance to be traded for a reduction in the complexity of the receiver. The first family of reduced complexity receivers is derived considering a serial partitioning of the maximum likelihood trellis. A receiver with two degrees of freedom is developed by the applic
APA, Harvard, Vancouver, ISO, and other styles
27

Sazali, Mohd. "Approximated transform and quantisation for complexity-reduced high efficiency video coding." Thesis, Brunel University, 2017. http://bura.brunel.ac.uk/handle/2438/14724.

Full text
Abstract:
The transform-quantisation stage is one of the most complex operations in the state-of-the-art High Efficiency Video Coding (HEVC) standard, accounting for 11–41% share of the encoding complexity. This study aims to reduce its complexity, making it suitable for dedicated hardware accelerated architectures. Adopted methods include multiplier-free approach, Multiple-Constant Multiplication architectural designs, and exploiting useful properties of the well-known Discrete Cosine Transform. Besides, an approximation scheme was introduced to represent the original HEVC transform and quantisation ma
APA, Harvard, Vancouver, ISO, and other styles
28

Deepak, Virat. "Partitioned Reduced Complexity Multiuser Detectors For Code Division Multiple Access Systems." Ohio University / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1127143401.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Page, Kevin J. "Reduced complexity interconnection and computation for digital signal processing in communications /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1997. http://wwwlib.umi.com/cr/ucsd/fullcit?p9804035.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Baumgartner, Dustin. "Global-Local Hybrid Classification Ensembles: Robust Performance with a Reduced Complexity." Connect to full text in OhioLINK ETD Center, 2009. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=toledo1241034194.

Full text
Abstract:
Thesis (M.S.)--University of Toledo, 2009.<br>Typescript. "Submitted as partial fulfillment of the requirements for The Master of Science in Engineering." "A thesis entitled"--at head of title. Bibliography: leaves 158-164.
APA, Harvard, Vancouver, ISO, and other styles
31

Cetinsel, Sevket. "Low power, reduced complexity filtering and improved tracking accuracy for GNSS." Thesis, University of Westminster, 2014. https://westminsterresearch.westminster.ac.uk/item/970w5/low-power-reduced-complexity-filtering-and-improved-tracking-accuracy-for-gnss.

Full text
Abstract:
This thesis addresses the power consumption problems resulting from the advent of multiple GNSS satellite systems which create the need for receivers supporting multi-frequency, multi-constellation GNSS systems. Such a multi-mode receiver requires a substantial amount of signal processing power which translates to increased hardware complexity and higher power dissipation which reduces the battery life of a mobile platform. During the course of the work undertaken, a power analysis tool was developed in order to be able to estimate the hardware utilisation as well as the power consumption of a
APA, Harvard, Vancouver, ISO, and other styles
32

Jia, Yugang. "Stochastic approximations for reduced complexity signal processing algorithms in MIMO wireless communications." Thesis, University of Bristol, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435729.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Abou, Faycal Ibrahim C. (Ibrahim Chafik). "An information theoretic study of reduced-complexity receivers for intersymbol interference channels." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/8922.

Full text
Abstract:
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.<br>Includes bibliographical references (leaves 105-108).<br>The complexity of the optimal receiver for communications over a discrete-time additive Gaussian intersymbol interference channel typically grows exponentially with the duration of the channel impulse response. Consequently, practical sub-optimal receivers are often designed as though the channel impulse response were shorter than it is. While previous studies on the performance of such receivers have mainly focused on bi
APA, Harvard, Vancouver, ISO, and other styles
34

Chen, Jinghu. "Reduced complexity decoding algorithms for low-density parity check codes and turbo codes." Thesis, University of Hawaii at Manoa, 2003. http://hdl.handle.net/10125/6885.

Full text
Abstract:
Iterative decoding techniques have been receiving more and more attentions with the invention of turbo codes and the rediscovery of low-density parity-check (LDPC) codes. An important aspect in the study of iterative decoding is the tradeoff between decoding performance and complexities. For both LDPC codes and turbo codes, optimum decoding algorithms can provide very good performance. However, complicated operations are involved in the optimum decoding, and prohibit the wide applications of LDPC codes and turbo codes in the next generation digital communication and storage systems. Although t
APA, Harvard, Vancouver, ISO, and other styles
35

Castura, Jeff. "Performance analysis and optimization of reduced complexity Low Density Parity Check decoding algorithms." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0017/MQ53426.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Xu, Chong. "Reduced-complexity near-optimal Ant-Colony-aided multi-user detection for CDMA systems." Thesis, University of Southampton, 2009. https://eprints.soton.ac.uk/206015/.

Full text
Abstract:
Reduced-complexity near-maximum-likelihood Ant-Colony Optimization (ACO) assisted Multi-User Detectors (MUDs) are proposed and investigated. The exhaustive search complexity of the optimal detection algorithm may be deemed excessive for practical applications. For example, a Space-Time Block Coded (STBC) two transmit assisted K = 32-user system has to search through the candidate-space for finding the final detection output during 264 times per symbol duration by invoking the Euclidean-distance-calculation of a 64-element complex-valued vector. Hence, a nearoptimal or near-ML MUDs are required
APA, Harvard, Vancouver, ISO, and other styles
37

Dang, Philip P. "Reduced complexity VLSI implementation of discrete wavelet transform for image and video compression /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2002. http://wwwlib.umi.com/cr/ucsd/fullcit?p3081063.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Drumright, Thomas Alexander. "Monte Carlo and reduced complexity methods for signal detection in wireless communication systems /." For electronic version search Digital dissertations database. Restricted to UC campuses. Access is free to UC campus dissertations, 2004. http://uclibs.org/PID/11984.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Zhu, Ying. "Signal detection on two-dimensional intersymbol interference channels correlated sources and reduced complexity algorithms /." [Pullman, Wash.] : Washington State University, 2008. http://www.dissertations.wsu.edu/Dissertations/Fall2008/y_zhu_081408.pdf.

Full text
Abstract:
Thesis (Ph. D.)--Washington State University, December 2008.<br>Title from PDF title page (viewed on Sept. 23, 2008) "School of Electrical Engineering and Computer Science." Includes bibliographical references (p. 83-90).
APA, Harvard, Vancouver, ISO, and other styles
40

Zarifeh, Nidal [Verfasser], and Thomas [Akademischer Betreuer] Kaiser. "Full-Duplex Multi-Antenna Base-Stations with Reduced Complexity / Nidal Zarifeh ; Betreuer: Thomas Kaiser." Duisburg, 2020. http://d-nb.info/1208316923/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Belschner, Jakob. "Scheduling heuristic for reduced complexity of coordinated beamforming in large multi-carrier heterogeneous wireless networks." Thesis, City, University of London, 2018. http://openaccess.city.ac.uk/21606/.

Full text
Abstract:
The research and development of wireless communication systems is often based on relatively simple models of the network topology, the radio channel and the radio propagation. This is considered to be mostly appropriate, as only under these conditions the complex technical problems in this field can be fully solved to their theoretical boundaries. However, it can also be the case that algorithms or concepts created under simplified assumptions perform in a significantly different way, when they are applied in more realistic scenarios. This Thesis presents research work which can be seen as a s
APA, Harvard, Vancouver, ISO, and other styles
42

Kumaraswamy, Dileep. "ON REDUCED COMPLEXITY TECHNIQUES FOR BANDWIDTH EFFICIENT CONTINUOUS PHASE MODULATIONS IN SERIALLY CONCATENATED CODED SYSTEMS." International Foundation for Telemetering, 2007. http://hdl.handle.net/10150/604543.

Full text
Abstract:
ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, Nevada<br>Serially concatenated coded (SCC) systems with continuous phase modulations (CPMs) as recursive inner codes have been known to give very high coding gains at low operative signal to noise ratios (SNRs). Moreover, concatenated coded systems with iterative decoding approach the bit error rate (BER) bounds given by the maximum likelihood (ML) criterion. Although SCC systems by themselves are redu
APA, Harvard, Vancouver, ISO, and other styles
43

López, Moreira Mazacotte Gregorio Alejandro. "Ecological Modelling of Lake Ecosystems: Integrating hydro-thermodynamics and biogeochemistry in a reduced complexity framework." Doctoral thesis, Università degli studi di Trento, 2019. http://hdl.handle.net/11572/252545.

Full text
Abstract:
Freshwater lakes are among the most important ecosystems for both human and other biological communities. They account for about 87% of surface freshwater in the planet, thus constituting a major source of drinking water. They also provide a wide range of ecosystem services that go from the sustenance of a rich biodiversity to the regulation of hydrological extremes; from the provision of a means for recreation to the support of local economies, e.g., through tourism and fisheries, just to cite a few. Lakes are now also widely recognised as natural early warning systems, their responses potent
APA, Harvard, Vancouver, ISO, and other styles
44

López, Moreira Mazacotte Gregorio Alejandro. "Ecological Modelling of Lake Ecosystems: Integrating hydro-thermodynamics and biogeochemistry in a reduced complexity framework." Doctoral thesis, Università degli studi di Trento, 2019. http://hdl.handle.net/11572/252545.

Full text
Abstract:
Freshwater lakes are among the most important ecosystems for both human and other biological communities. They account for about 87% of surface freshwater in the planet, thus constituting a major source of drinking water. They also provide a wide range of ecosystem services that go from the sustenance of a rich biodiversity to the regulation of hydrological extremes; from the provision of a means for recreation to the support of local economies, e.g., through tourism and fisheries, just to cite a few. Lakes are now also widely recognised as natural early warning systems, their responses potent
APA, Harvard, Vancouver, ISO, and other styles
45

Tamma, Raja Venkatesh. "Iterative equalization and decoding using reduced-state sequence estimation based soft-output algorithms." Texas A&M University, 2004. http://hdl.handle.net/1969.1/283.

Full text
Abstract:
We study and analyze the performance of iterative equalization and decoding (IED) using an M-BCJR equalizer. We use bit error rate (BER), frame error rate simulations and extrinsic information transfer (EXIT) charts to study and compare the performances of M-BCJR and BCJR equalizers on precoded and non-precoded channels. Using EXIT charts, the achievable channel capacities with IED using the BCJR, M-BCJR and MMSE LE equalizers are also compared. We predict the BER performance of IED using the M-BCJR equalizer from EXIT charts and explain the discrepancy between the observed and predicted perf
APA, Harvard, Vancouver, ISO, and other styles
46

Butnaru, Daniel [Verfasser], Hans-Joachim [Akademischer Betreuer] Bungartz, and Ernst [Akademischer Betreuer] Rank. "Computational Steering with Reduced Complexity / Daniel Butnaru. Gutachter: Hans-Joachim Bungartz ; Ernst Rank. Betreuer: Hans-Joachim Bungartz." München : Universitätsbibliothek der TU München, 2013. http://d-nb.info/103782069X/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Butnaru, Daniel Verfasser], Hans-Joachim [Akademischer Betreuer] [Bungartz, and Ernst [Akademischer Betreuer] Rank. "Computational Steering with Reduced Complexity / Daniel Butnaru. Gutachter: Hans-Joachim Bungartz ; Ernst Rank. Betreuer: Hans-Joachim Bungartz." München : Universitätsbibliothek der TU München, 2013. http://nbn-resolving.de/urn:nbn:de:bvb:91-diss-20130711-1140571-0-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Othman, Hisham H. A. "A novel reduced-complexity approach to hidden Markov modeling of two-dimensional processes with application to face recognition." Thesis, University of Ottawa (Canada), 2002. http://hdl.handle.net/10393/6162.

Full text
Abstract:
The 2-D Hidden Markov Model (HMM) is an extension of the traditional 1-D HMM that has shown distinctive efficiency in modeling 1-D signals. Unlike 1-D HMMs, 2-D HMMs are known for their prohibitively high complexity. This encouraged many researchers to work on alternatives such as Pseudo 2-D HMM and Embedded HMM for 2-D recognition applications to avoid the complexity problem. Those applications include, but are not limited to, Face Recognition, Optical Character Recognition, Face Detection, Image Retrieval, and Object Recognition. The Hidden Layer's complexity of a typical second-order 2-D HM
APA, Harvard, Vancouver, ISO, and other styles
49

Webber, Julian Leonard. "Performance enhancement of multi-user detectors for TD-CDMA by means of polarisation diversity and reduced computational complexity." Thesis, University of Bristol, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.396658.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Luo, Jing. "A reduced complexity detection algorithm employing adaptive LMS filters for CDMAMIMO systems using permutation spreading in slowly varying Rayleigh fading channels." Thesis, University of Ottawa (Canada), 2009. http://hdl.handle.net/10393/28171.

Full text
Abstract:
In wireless communications, research in the area of advanced detection techniques and adaptive filter algorithms for CDMA and MIMO systems in Rayleigh fading channels has been of a great interest in the past several years. On one hand, most detection algorithms can acquire satisfactory performance. On the other hand, however, the performance improvement can be achieved at the cost of an increase in computational complexity. In this thesis, we present a reduced complexity detection technique based on adaptive Least-mean-square (LMS) filtering for CDMA/MIMO systems using permutation spreading in
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!