224 research outputs found
Orthogonal transmultiplexers : extensions to digital subscriber line (DSL) communications
An orthogonal transmultiplexer which unifies multirate filter bank theory and communications theory is investigated in this dissertation. Various extensions of the orthogonal transmultiplexer techniques have been made for digital subscriber line communication applications.
It is shown that the theoretical performance bounds of single carrier modulation based transceivers and multicarrier modulation based transceivers are the same under the same operational conditions. Single carrier based transceiver systems such as Quadrature Amplitude Modulation (QAM) and Carrierless Amplitude and Phase (CAP) modulation scheme, multicarrier based transceiver systems such as Orthogonal Frequency Division Multiplexing (OFDM) or Discrete Multi Tone (DMT) and Discrete Subband (Wavelet) Multicarrier based transceiver (DSBMT) techniques are considered in this investigation.
The performance of DMT and DSBMT based transceiver systems for a narrow band interference and their robustness are also investigated. It is shown that the performance of a DMT based transceiver system is quite sensitive to the location and strength of a single tone (narrow band) interference. The performance sensitivity is highlighted in this work. It is shown that an adaptive interference exciser can alleviate the sensitivity problem of a DMT based system. The improved spectral properties of DSBMT technique reduces the performance sensitivity for variations of a narrow band interference. It is shown that DSBMT technique outperforms DMT and has a more robust performance than the latter. The superior performance robustness is shown in this work.
Optimal orthogonal basis design using cosine modulated multirate filter bank is discussed. An adaptive linear combiner at the output of analysis filter bank is implemented to eliminate the intersymbol and interchannel interferences. It is shown that DSBMT is the most suitable technique for a narrow band interference environment.
A blind channel identification and optimal MMSE based equalizer employing a nonmaximally decimated filter bank precoder / postequalizer structure is proposed. The performance of blind channel identification scheme is shown not to be sensitive to the characteristics of unknown channel. The performance of the proposed optimal MMSE based equalizer is shown to be superior to the zero-forcing equalizer
Frequency-Domain Signal Processing for Spectrally-Enhanced CP-OFDM Waveforms in 5G New Radio
Orthogonal frequency-division multiplexing (OFDM) has been selected as the
basis for the fifth-generation new radio (5G-NR) waveform developments.
However, effective signal processing tools are needed for enhancing the OFDM
spectrum in various advanced transmission scenarios. In earlier work, we have
shown that fast-convolution (FC) processing is a very flexible and efficient
tool for filtered-OFDM signal generation and receiver-side subband filtering,
e.g., for the mixed-numerology scenarios of the 5G-NR. FC filtering
approximates linear convolution through effective fast Fourier transform
(FFT)-based circular convolutions using partly overlapping processing blocks.
However, with the continuous overlap-and-save and overlap-and-add processing
models with fixed block-size and fixed overlap, the FC-processing blocks cannot
be aligned with all OFDM symbols of a transmission frame. Furthermore, 5G-NR
numerology does not allow to use transform lengths shorter than 128 because
this would lead to non-integer cyclic prefix (CP) lengths. In this article, we
present new FC-processing schemes which solve the mentioned limitations. These
schemes are based on dynamically adjusting the overlap periods and
extrapolating the CP samples, which make it possible to align the FC blocks
with each OFDM symbol, even in case of variable CP lengths. This reduces
complexity and latency, e.g., in mini-slot transmissions and, as an example,
allows to use 16-point transforms in case of a 12-subcarrier-wide subband
allocation, greatly reducing the implementation complexity. On the receiver
side, the proposed scheme makes it possible to effectively combine cascaded
inverse and forward FFT units in FC-filtered OFDM processing. Transform
decomposition is used to simplify these computations. Very extensive set of
numerical results is also provided, in terms of radio-link performance and
associated processing complexity.Comment: This work has been submitted to the IEEE Transactions on Wireless
Communications for possible publication. Copyright may be transferred without
notice, after which this version may no longer be accessibl
Distributed space time block coding and application in cooperative cognitive relay networks
The design and analysis of various distributed space time block coding
schemes for cooperative relay networks is considered in this thesis.
Rayleigh frequency flat and selective fading channels are assumed to
model the links in the networks, and interference suppression techniques
together with an orthogonal frequency division multiplexing (OFDM)
type transmission approach are employed to mitigate synchronization
errors at the destination node induced by the different delays through
the relay nodes.
Closed-loop space time block coding is first considered in the context
of decode-and-forward (regenerative) networks. In particular, quasi orthogonal
and extended orthogonal coding techniques are employed for
transmission from four relay nodes and parallel interference cancellation
detection is exploited to mitigate synchronization errors. Availability
of a direct link between the source and destination nodes is studied.
Outer coding is then added to gain further improvement in end-to-end
performance and amplify-and-forward (non regenerative) type networks
together with distributed space time coding are considered to reduce
relay node complexity. A novel detection scheme is then proposed
for decode-and-forward and amplify-and-forward networks with closed-loop
extended orthogonal coding and closed-loop quasi-orthogonal coding
which reduce the computational complexity of the parallel interference cancellation. The near-optimum detector is presented for relay
nodes with single or dual antennas. End-to-end bit error rate simulations
confirm the potential of the approach and its ability to mitigate
synchronization errors
DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models
The work identifies the first general, explicit, and non-random MIMO
encoder-decoder structures that guarantee optimality with respect to the
diversity-multiplexing tradeoff (DMT), without employing a computationally
expensive maximum-likelihood (ML) receiver. Specifically, the work establishes
the DMT optimality of a class of regularized lattice decoders, and more
importantly the DMT optimality of their lattice-reduction (LR)-aided linear
counterparts. The results hold for all channel statistics, for all channel
dimensions, and most interestingly, irrespective of the particular lattice-code
applied. As a special case, it is established that the LLL-based LR-aided
linear implementation of the MMSE-GDFE lattice decoder facilitates DMT optimal
decoding of any lattice code at a worst-case complexity that grows at most
linearly in the data rate. This represents a fundamental reduction in the
decoding complexity when compared to ML decoding whose complexity is generally
exponential in rate.
The results' generality lends them applicable to a plethora of pertinent
communication scenarios such as quasi-static MIMO, MIMO-OFDM, ISI,
cooperative-relaying, and MIMO-ARQ channels, in all of which the DMT optimality
of the LR-aided linear decoder is guaranteed. The adopted approach yields
insight, and motivates further study, into joint transceiver designs with an
improved SNR gap to ML decoding.Comment: 16 pages, 1 figure (3 subfigures), submitted to the IEEE Transactions
on Information Theor
Intelligent Processing in Wireless Communications Using Particle Swarm Based Methods
There are a lot of optimization needs in the research and design of wireless communica- tion systems. Many of these optimization problems are Nondeterministic Polynomial (NP) hard problems and could not be solved well. Many of other non-NP-hard optimization problems are combinatorial and do not have satisfying solutions either. This dissertation presents a series of Particle Swarm Optimization (PSO) based search and optimization algorithms that solve open research and design problems in wireless communications. These problems are either avoided or solved approximately before.
PSO is a bottom-up approach for optimization problems. It imposes no conditions on the underlying problem. Its simple formulation makes it easy to implement, apply, extend and hybridize. The algorithm uses simple operators like adders, and multipliers to travel through the search space and the process requires just five simple steps. PSO is also easy to control because it has limited number of parameters and is less sensitive to parameters than other swarm intelligence algorithms. It is not dependent on initial points and converges very fast.
Four types of PSO based approaches are proposed targeting four different kinds of problems in wireless communications. First, we use binary PSO and continuous PSO together to find optimal compositions of Gaussian derivative pulses to form several UWB pulses that not only comply with the FCC spectrum mask, but also best exploit the avail- able spectrum and power. Second, three different PSO based algorithms are developed to solve the NLOS/LOS channel differentiation, NLOS range error mitigation and multilateration problems respectively. Third, a PSO based search method is proposed to find optimal orthogonal code sets to reduce the inter carrier interference effects in an frequency redundant OFDM system. Fourth, a PSO based phase optimization technique is proposed in reducing the PAPR of an frequency redundant OFDM system. The PSO based approaches are compared with other canonical solutions for these communication problems and showed superior performance in many aspects. which are confirmed by analysis and simulation results provided respectively. Open questions and future
Open questions and future works for the dissertation are proposed to serve as a guide for the future research efforts
D4.1 Draft air interface harmonization and user plane design
The METIS-II project envisions the design of a new air interface in order to fulfil all the performance requirements of the envisioned 5G use cases including some extreme low latency use cases and ultra-reliable transmission, xMBB requiring additional capacity that is only available in very high frequencies, as well as mMTC with extremely densely distributed sensors and very long battery life requirements. Designing an adaptable and flexible 5G Air Interface (AI), which will tackle these use cases while offering native multi-service support, is one of the key tasks of METIS-II WP4. This deliverable will highlight the challenges of designing an AI required to operate in a wide range of spectrum bands and cell sizes, capable of addressing the diverse services with often diverging requirements, and propose a design and suitability assessment framework for 5G AI candidates.Aydin, O.; Gebert, J.; Belschner, J.; Bazzi, J.; Weitkemper, P.; Kilinc, C.; Leonardo Da Silva, I.... (2016). D4.1 Draft air interface harmonization and user plane design. https://doi.org/10.13140/RG.2.2.24542.0288
- …