1,817 research outputs found
Ălekande sĂŒsteemi: Alamouti indeks-kodeerimine
Consider a wireless broadcast channel with a number of receivers, where each receiver possesses
some side information. In an index coding problem, the transmitter aims at delivering
different messages to different receivers. It is desirable to minimize the total number of message
transmissions in order to improve the bandwidth efficiency. It is known that the minimum
number of transmissions can be achieved by solving a minimum rank problem for a given side
information graph, which is a known NP-hard problem.
In this thesis, the index coding problem over additive white Gaussian noise and Rayleigh fading
channels is studied. Modulation techniques, such as phase shift keying and quadrature amplitude
modulation, are tested, and it is shown that a careful choice of modulation can improve the
performance.
It is also shown that a careful choice of a generator matrix can provide for further performance
gains, in particular for âprioritizedâ receivers. A probabilistic soft information detection (PSID)
is compared to a simple hard decision scheme, and the PSID performance is shown superior in
achieving a lower error rate. Additional improvement in performance is achieved by using diversity,
when employing two transmit and two receive antenna system in conjunction with the
Alamouti code. All these techniques provide for the lower error rates and higher throughput
when compared to the traditional schemes
Bit-Metric Decoding of Non-Binary LDPC Codes with Probabilistic Amplitude Shaping
A new approach for combining non-binary low-density parity-check (NB-LDPC)
codes with higher-order modulation and probabilistic amplitude shaping (PAS) is
presented. Instead of symbol-metric decoding (SMD), a bit-metric decoder (BMD)
is used so that matching the field order of the non-binary code to the
constellation size is not needed, which increases the flexibility of the coding
scheme. Information rates, density evolution thresholds and finite-length
simulations show that the flexibility comes at no loss of performance if PAS is
used.Comment: Accepted for IEEE Communication Letter
Practical LDPC coded modulation schemes for the fading broadcast channel with confidential messages
The broadcast channel with confidential messages is a well studied scenario
from the theoretical standpoint, but there is still lack of practical schemes
able to achieve some fixed level of reliability and security over such a
channel. In this paper, we consider a quasi-static fading channel in which both
public and private messages must be sent from the transmitter to the receivers,
and we aim at designing suitable coding and modulation schemes to achieve such
a target. For this purpose, we adopt the error rate as a metric, by considering
that reliability (security) is achieved when a sufficiently low (high) error
rate is experienced at the receiving side. We show that some conditions exist
on the system feasibility, and that some outage probability must be tolerated
to cope with the fading nature of the channel. The proposed solution exploits
low-density parity-check codes with unequal error protection, which are able to
guarantee two different levels of protection against noise for the public and
the private information, in conjunction with different modulation schemes for
the public and the private message bits.Comment: 6 pages, 4 figures, to be presented at IEEE ICC'14 - Workshop on
Wireless Physical Layer Securit
Iterative decoding and detection for physical layer network coding
PhD ThesisWireless networks comprising multiple relays are very common and it is
important that all users are able to exchange messages via relays in the
shortest possible time. A promising technique to achieve this is physical
layer network coding (PNC), where the time taken to exchange messages
between users is achieved by exploiting the interference at the relay due
to the multiple incoming signals from the users. At the relay, the interference
is demapped to a binary sequence representing the exclusive-OR of
both usersâ messages. The time to exchange messages is reduced because
the relay broadcasts the network coded message to both users, who can
then acquire the desired message by applying the exclusive-OR of their
original message with the network coded message. However, although
PNC can increase throughput it is at the expense of performance degradation
due to errors resulting from the demapping of the interference to
bits.
A number of papers in the literature have investigated PNC with an iterative
channel coding scheme in order to improve performance. However,
in this thesis the performance of PNC is investigated for end-to-end
(E2E) the three most common iterative coding schemes: turbo codes,
low-density parity-check (LDPC) codes and trellis bit-interleaved coded
modulation with iterative decoding (BICM-ID). It is well known that in
most scenarios turbo and LDPC codes perform similarly and can achieve
near-Shannon limit performance, whereas BICM-ID does not perform
quite as well but has a lower complexity. However, the results in this
thesis show that on a two-way relay channel (TWRC) employing PNC,
LDPC codes do not perform well and BICM-ID actually outperforms
them while also performing comparably with turbo codes. Also presented
in this thesis is an extrinsic information transfer (ExIT) chart
analysis of the iterative decoders for each coding scheme, which is used
to explain this surprising result. Another problem arising from the use
of PNC is the transfer of reliable information from the received signal at
the relay to the destination nodes. The demapping of the interference to
binary bits means that reliability information about the received signal
is lost and this results in a significant degradation in performance when
applying soft-decision decoding at the destination nodes. This thesis
proposes the use of traditional angle modulation (frequency modulation
(FM) and phase modulation (PM)) when broadcasting from the relay,
where the real and imaginary parts of the complex received symbols
at the relay modulate the frequency or phase of a carrier signal, while
maintaining a constant envelope. This is important since the complex
received values at the relay are more likely to be centred around zero and
it undesirable to transmit long sequences of low values due to potential
synchronisation problems at the destination nodes. Furthermore, the
complex received values, obtained after angle demodulation, are used to
derive more reliable log-likelihood ratios (LLRs) of the received symbols
at the destination nodes and consequently improve the performance of
the iterative decoders for each coding scheme compared with conventionally
coded PNC.
This thesis makes several important contributions: investigating the performance
of different iterative channel coding schemes combined with
PNC, presenting an analysis of the behaviour of different iterative decoding
algorithms when PNC is employed using ExIT charts, and proposing
the use of angle modulation at the relay to transfer reliable information
to the destination nodes to improve the performance of the iterative decoding
algorithms. The results from this thesis will also be useful for
future research projects in the areas of PNC that are currently being
addressed, such as synchronisation techniques and receiver design.Iraqi Ministry of Higher
Education and Scientific Research
Generalised MBER-based vector precoding design for multiuser transmission
We propose a generalized vector precoding (VP) design based on the minimum bit error rate (MBER) criterion for multiuser transmission in the downlink of a multiuser system, where the base station (BS) equipped with multiple transmitting antennas communicates with single-receiving-antenna mobile station (MS) receivers each having a modulo device. Given the knowledge of the channel state information and the current information symbol vector to be transmitted, our scheme directly generates the effective symbol vector based on the MBER criterion using the particle swarm optimization (PSO) algorithm. The proposed PSO-aided generalized MBER VP scheme is shown to outperform the powerful minimum mean-square-error (MMSE) VP and improved MMSE-VP benchmarks, particularly for rank-deficient systems, where the number of BS transmitting antennas is lower than the number of MSs supported
- âŠ