Spelling suggestions: "subject:"coded modulation"" "subject:"noded modulation""
11 |
Error-correcting Codes for Fibre-optic Communication SystemsSmith, Benjamin Peter 11 January 2012 (has links)
Electronic signal processing techniques have assumed a prominent role in the design of
fibre-optic communication systems. However, state-of-the-art systems operate at per-channel data rates of 100 Gb/s, which constrains the class of communication algorithms that can be practically implemented. Relative to LDPC-like codes, product-like codes with syndrome-based decoding have decoder dataflow requirements that are smaller by more than two orders of magnitude, which strongly motivates the search for powerful product-like codes. This thesis presents a new class of high-rate binary error-correcting codes, staircase codes, whose construction combines ideas from convolutional and block coding. A G.709-compliant staircase code is proposed, and FPGA-based simulation results show that performance within 0.5 dB of the Shannon Limit is attained for bit-error-rates below 1E-15. An error-floor analysis technique is presented, and the G.709-compliant staircase code is shown to have an error floor below 1E-20. Using staircase codes, a pragmatic approach for coded modulation in fibre-optic communication systems is presented that provides reliable communications to within 1 bit/s/Hz of the capacity of a QAM-modulated system modeled via the generalized non-linear Schrodinger equation. A system model for a real-world DQPSK receiver with correlated bit-errors is presented, along with an analysis technique to estimate the resulting error floor for the G.709-
compliant staircase code. By applying a time-varying pseudorandom interleaver of size
2040 to the output of the encoder, the error
floor of the resulting system is shown to be
less than 1E-20.
|
12 |
Combined source-channel coding for a power and bandwidth constrained noisy channelRaja, Nouman Saeed 17 February 2005 (has links)
This thesis proposes a framework for combined source-channel coding under power and bandwidth constrained noisy channel. The framework is then applied to progressive image coding transmission using constant envelope M-ary Phase Shift Key (MPSK) signaling over an Additive White Gaussian Channel (AWGN) channel. First the framework for uncoded MPSK signaling is developed. Then, its extended to include coded modulation using Trellis Coded Modulation (TCM) for MPSK signaling. Simulation results show that coded MPSK signaling performs 3.1 to 5.2 dB better than uncoded MPSK signaling depending on the constellation size. Finally, an adaptive TCM system is presented for practical implementation of the proposed scheme, which outperforms uncoded MPSK system over all signal to noise ratio (Es/No) ranges for various MPSK modulation formats.
In the second part of this thesis, the performance of the scheme is investigated from the channel capacity point of view. Using powerful channel codes like Turbo and Low Density Parity Check (LDPC) codes, the combined source-channel coding scheme is shown to be within 1 dB of the performance limit with MPSK channel signaling.
|
13 |
Repeat-punctured turbo trellis-coded modulation.Bhownath, Rinel. January 2010 (has links)
Ever since the proposal of turbo code in 1993, there has been extensive research carried out
to improve both the performance and spectrum efficiency. One of the methods used to
improve the spectrum efficiency was to combine turbo code with a trellis-coded modulation
scheme, called turbo trellis-coded modulation (TTCM). The scheme is used in various
applications such as deep-space communication, wireless communication and other fields.
It is a well established fact that an increase in an interleaver size of a TTCM system results in
an improved performance in the bit error rate (BER). In this thesis repeat-punctured turbo
trellis-coded modulation (RPTTCM) is proposed. In RPTTCM, the effect of repeat-puncture
is investigated on a TTCM system, repetition of the information bits increases the interleaver
size, followed by an appropriate puncturing scheme to maintain the respective code rate. The
TTCM and RPTTCM systems are simulated in an Additive White Gaussian Noise (AWGN)
channel. To understand how the RPTTCM scheme will perform in a wireless channel, the
Rayleigh flat fading channel (with channel state information known at the receiver) will be
used. The BER performance bound for the TTCM scheme is derived for AWGN and
Rayleigh flat fading channels. Thereafter repeat-punctured is introduced into the TTCM
system. The BER performance bound is then extended to include repeat-puncturing. The
performances of the TTCM and RPTTCM systems are then compared. It was found that the
RPTTCM system performed better at high signal-to-noise ratio (SNR) in both AWGN and
Rayleigh flat fading channels. The RPTTCM scheme achieved a coding gain of
approximately 0.87 dB at a BER of for an AWGN channel and 1.9 dB at a BER of
for a Rayleigh flat fading channel, for an information size of N=800. / Thesis (M.Sc.Eng.)-University of KwaZulu-Natal, Durban, 2010.
|
14 |
Turbo coded pulse position modulation for optical communicationsAlahmari, Abdallah Said 05 1900 (has links)
No description available.
|
15 |
Multi-edge Low-density Parity-check Coded ModulationZhang, Lei 04 January 2012 (has links)
A method for designing low-density parity-check (LDPC) codes for bandwidth-efficient high-order coded modulation is proposed. Code structure utilizes the multi-edge-type LDPC code ensemble to achieve an improved match between codeword bit protection ca- pabilities and modulation bit-channel capacities over existing LDPC coded modulation techniques. The multi-dimensional EXIT vector field for the specific multi-edge parame- terization is developed for the analysis and design of code ensembles. A multi-dimensional EXIT decoding convergence condition is derived to enable efficient optimization. Code design results in terms of ensemble thresholds and finite-length Monte-Carlo simulations indicate that the new technique improves on the state-of-the-art performance, with sig- nificantly lower design and implementation complexity.
|
16 |
Multi-edge Low-density Parity-check Coded ModulationZhang, Lei 04 January 2012 (has links)
A method for designing low-density parity-check (LDPC) codes for bandwidth-efficient high-order coded modulation is proposed. Code structure utilizes the multi-edge-type LDPC code ensemble to achieve an improved match between codeword bit protection ca- pabilities and modulation bit-channel capacities over existing LDPC coded modulation techniques. The multi-dimensional EXIT vector field for the specific multi-edge parame- terization is developed for the analysis and design of code ensembles. A multi-dimensional EXIT decoding convergence condition is derived to enable efficient optimization. Code design results in terms of ensemble thresholds and finite-length Monte-Carlo simulations indicate that the new technique improves on the state-of-the-art performance, with sig- nificantly lower design and implementation complexity.
|
17 |
Interleaver design for the circular simplex turbo block coded modulatorChinchilla, Rigoberto. January 2003 (has links)
Thesis (Ph. D.)--Ohio University, November, 2003. / Title from PDF t.p. Includes bibliographical references (leaves 84-85).
|
18 |
Noncoherent communications using space-time trellis codes : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Engineering in Electrical and Electronic Engineering from the University of Canterbury, Christchurch, New Zealand /Gu, Yu. January 1900 (has links)
Thesis (M.E.)--University of Canterbury, 2008. / Typescript (photocopy). "June 2008." Includes bibliographical references (p. 87-96). Also available via the World Wide Web.
|
19 |
An investigation of spectrally efficient turbo coded modulation /Biella, Bruno, January 1900 (has links)
Thesis (M. App. Sc.)--Carleton University, 2004. / Includes bibliographical references (p. 52-55). Also available in electronic format on the Internet.
|
20 |
Encoding of trellises with strong tailbiting property /Kotwal, Mithilesh N. January 2005 (has links)
Thesis (M.S)--Ohio University, March, 2005. / Includes bibliographical references (p. 44-45)
|
Page generated in 0.0696 seconds