889 research outputs found

    Cross Z-Complementary Pairs for Optimal Training in Spatial Modulation Over Frequency Selective Channels

    Get PDF
    The contributions of this article are twofold: Firstly, we introduce a novel class of sequence pairs, called “cross Z-complementary pairs (CZCPs),” each displaying zero-correlation zone (ZCZ) properties for both their aperiodic autocorrelation sums and crosscorrelation sums. Systematic constructions of perfect CZCPs based on selected Golay complementary pairs (GCPs) are presented. Secondly, we point out that CZCPs can be utilized as a key component in designing training sequences for broadband spatial modulation (SM) systems. We show that our proposed SM training sequences derived from CZCPs lead to optimal channel estimation performance over frequency-selective channels

    The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure

    Full text link
    Powerful Quantum Error Correction Codes (QECCs) are required for stabilizing and protecting fragile qubits against the undesirable effects of quantum decoherence. Similar to classical codes, hashing bound approaching QECCs may be designed by exploiting a concatenated code structure, which invokes iterative decoding. Therefore, in this paper we provide an extensive step-by-step tutorial for designing EXtrinsic Information Transfer (EXIT) chart aided concatenated quantum codes based on the underlying quantum-to-classical isomorphism. These design lessons are then exemplified in the context of our proposed Quantum Irregular Convolutional Code (QIRCC), which constitutes the outer component of a concatenated quantum code. The proposed QIRCC can be dynamically adapted to match any given inner code using EXIT charts, hence achieving a performance close to the hashing bound. It is demonstrated that our QIRCC-based optimized design is capable of operating within 0.4 dB of the noise limit

    Cyclic Prefix-Free MC-CDMA Arrayed MIMO Communication Systems

    No full text
    The objective of this thesis is to investigate MC-CDMA MIMO systems where the antenna array geometry is taken into consideration. In most MC-CDMA systems, cyclic pre xes, which reduce the spectral e¢ ciency, are used. In order to improve the spectral efficiency, this research study is focused on cyclic pre x- free MC-CDMA MIMO architectures. Initially, space-time wireless channel models are developed by considering the spatio-temporal mechanisms of the radio channel, such as multipath propaga- tion. The spatio-temporal channel models are based on the concept of the array manifold vector, which enables the parametric modelling of the channel. The array manifold vector is extended to the multi-carrier space-time array (MC-STAR) manifold matrix which enables the use of spatio-temporal signal processing techniques. Based on the modelling, a new cyclic pre x-free MC- CDMA arrayed MIMO communication system is proposed and its performance is compared with a representative existing system. Furthermore, a MUSIC-type algorithm is then developed for the estimation of the channel parameters of the received signal. This proposed cyclic pre x-free MC-CDMA arrayed MIMO system is then extended to consider the effects of spatial diffusion in the wireless channel. Spatial diffusion is an important channel impairment which is often ignored and the failure to consider such effects leads to less than satisfactory performance. A subspace-based approach is proposed for the estimation of the channel parameters and spatial spread and reception of the desired signal. Finally, the problem of joint optimization of the transmit and receive beam- forming weights in the downlink of a cyclic pre x-free MC-CDMA arrayed MIMO communication system is investigated. A subcarrier-cooperative approach is used for the transmit beamforming so that there is greater flexibility in the allocation of channel symbols. The resulting optimization problem, with a per-antenna transmit power constraint, is solved by the Lagrange multiplier method and an iterative algorithm is proposed

    On Asynchronous Communication Systems: Capacity Bounds and Relaying Schemes

    Get PDF
    abstract: Practical communication systems are subject to errors due to imperfect time alignment among the communicating nodes. Timing errors can occur in different forms depending on the underlying communication scenario. This doctoral study considers two different classes of asynchronous systems; point-to-point (P2P) communication systems with synchronization errors, and asynchronous cooperative systems. In particular, the focus is on an information theoretic analysis for P2P systems with synchronization errors and developing new signaling solutions for several asynchronous cooperative communication systems. The first part of the dissertation presents several bounds on the capacity of the P2P systems with synchronization errors. First, binary insertion and deletion channels are considered where lower bounds on the mutual information between the input and output sequences are computed for independent uniformly distributed (i.u.d.) inputs. Then, a channel suffering from both synchronization errors and additive noise is considered as a serial concatenation of a synchronization error-only channel and an additive noise channel. It is proved that the capacity of the original channel is lower bounded in terms of the synchronization error-only channel capacity and the parameters of both channels. On a different front, to better characterize the deletion channel capacity, the capacity of three independent deletion channels with different deletion probabilities are related through an inequality resulting in the tightest upper bound on the deletion channel capacity for deletion probabilities larger than 0.65. Furthermore, the first non-trivial upper bound on the 2K-ary input deletion channel capacity is provided by relating the 2K-ary input deletion channel capacity with the binary deletion channel capacity through an inequality. The second part of the dissertation develops two new relaying schemes to alleviate asynchronism issues in cooperative communications. The first one is a single carrier (SC)-based scheme providing a spectrally efficient Alamouti code structure at the receiver under flat fading channel conditions by reducing the overhead needed to overcome the asynchronism and obtain spatial diversity. The second one is an orthogonal frequency division multiplexing (OFDM)-based approach useful for asynchronous cooperative systems experiencing excessive relative delays among the relays under frequency-selective channel conditions to achieve a delay diversity structure at the receiver and extract spatial diversity.Dissertation/ThesisPh.D. Electrical Engineering 201

    Investigation of code reconfigurable fibre Bragg gratings for Optical Code Division Multiple Access (OCDMA) and Optical Packet Switching (OPS) Networks

    No full text
    This thesis documents my work in the telecommunication system laboratory at the Optoelectronics Research Centre, towards the implementation of code reconfigurable OCDMA and all-optical packet switching nodes based on fibre Bragg grating (FBG) technology. My research work involves characterizing the performance of various gratings, specifically high reflectivity, short chip duration, long code sequences, multiple phase level and tunable superstructured fiber Bragg gratings (SSFBGs), by using the recently proposed Frequency-Resolved Optical Gating technique based on Electro-Absorption Modulator (EAM-FROG). This technology can obtain the complex code profile along the grating, making it a powerful method to understand the thermally-induced code-reconfigurable grating. Efforts have been made to improve the grating design to achieve better system performance. Three different types of FBGs optical encoder/decoder, e.g. conventional discrete phaseshift SSFBGs, code-reconfigurable gratings, and novel continuous phase-shift SSFBGs, have been investigated comparatively, as well as their performance in various optical coding/decoding systems. This thesis also discusses the possibility of reducing multiple access interference (MAI) using a Two-Photon Absorption (TPA) process. The advanced grating devices enable the improvement of system performance. A dynamically reconfigurable optical packet processing system and a 16-channel reconfigurable OCDMA/DWDM system with 50GHz DWDM intervals has been demonstrated.These results highlight the feasibility of FBG-based optical coding/decoding techniques, with improved system flexibility and sustainability

    Polarization-ring-switching for nonlinearity-tolerant geometrically-shaped four-dimensional formats maximizing generalized mutual information

    Get PDF
    In this paper, a new four-dimensional 64-ary polarization ring switching (4D-64PRS) modulation format with a spectral efficiency of 6 bit/4D-sym is introduced. The format is designed by maximizing the generalized mutual information (GMI) and by imposing a constant-modulus on the 4D structure. The proposed format yields an improved performance with respect to state-of-the-art geometrically shaped modulation formats for bit-interleaved coded modulation systems at the same spectral efficiency. Unlike previously published results, the coordinates of the constellation points and the binary labeling of the constellation are jointly optimized. When compared with polarization-multiplexed 8-ary quadrature-amplitude modulation (PM-8QAM), gains of up to 0.7 dB in signal-to-noise ratio are observed in the additive white Gaussian noise (AWGN) channel. For a long-haul nonlinear optical fiber system of 8,000 km, gains of up to 0.27 bit/4D-sym (5.5% data capacity increase) are observed. These gains translate into a reach increase of approximately 16% (1,100 km). The proposed modulation format is also shown to be more tolerant to nonlinearities than PM-8QAM. Results with LDPC codes are also presented, which confirm the gains predicted by the GMI.Comment: 12 pages, 12 figure

    Data Chunking in Quasi-Synchronous DS-CDMA

    Get PDF
    DS-CDMA is a popular multiple access technique used in many mobile networks to efficiently share channel resources between users in a cell. Synchronization between users maximizes the user capacity of these systems. However, it is difficult to perfectly synchronize users in the reverse link due to the geographic diversity of mobile users in the cell. As a result, most commercial DS-CDMA networks utilize an asynchronous reverse link resulting in a reduced user capacity. A possible compromise to increase the user capacity in the reverse link is to implement a quasi-synchronous timing scheme, a timing scheme in which users are allowed to be slightly out of synchronization. This paper suggests a possible way to implement a quasi-synchronous DS-CDMA reverse link using the method of “data chunking”. The basic premise is derived by making a link between TDMA and synchronous DS-CDMA. By considering some basic TDMA limitations, a proposed “data chunked” quasi-synchronous DS-CDMA system is derived from a TDMA system. The effects of such a system are compared to those of a chip interleaved system. MATLAB simulations are performed to analyze the performance of the system in the presence of small synchronization errors between users. Implementation of guard bands is explored to further reduce errors due to imperfect synchronization between users
    • …
    corecore