1,036 research outputs found
Quasi-orthogonal space-frequency coding in non-coherent cooperative broadband networks
© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.So far, complex valued orthogonal codes have been used differentially in cooperative broadband networks. These codes however achieve less than unitary code rate when utilized in cooperative networks with more than two relays. Therefore, the main challenge is how to construct unitary rate codes for non-coherent cooperative broadband networks with more than two relays while exploiting the achievable spatial and frequency diversity. In this paper, we extend full rate quasi-orthogonal codes to differential cooperative broadband networks where channel information is unavailable. From this, we propose a generalized differential distributed quasi-orthogonal space-frequency coding (DQSFC) protocol for cooperative broadband networks. Our proposed scheme is able to achieve full rate, and full spatial and frequency diversity in cooperative networks with any number of relays. Through pairwise error probability analysis we show that the diversity gain of our scheme can be improved by appropriate code construction and sub-carrier allocation. Based on this, we derive sufficient conditions for the proposed code structure at the source node and relay nodes to achieve full spatial and frequency diversity.Peer reviewe
Cyclic Distributed Space–Time Codes for Wireless Relay Networks With No Channel Information
In this paper, we present a coding strategy for half duplex wireless relay networks, where we assume no channel knowledge at any of the transmitter, receiver, or relays. The coding scheme uses distributed space–time coding, that is, the relay nodes cooperate to encode the transmitted signal so that the receiver senses a space–time codeword. It is inspired by noncoherent differential techniques. The proposed strategy is available for any number of relays nodes. It is analyzed, and shown to yield a diversity linear in the number of relays. We also study the resistance of the scheme to relay node failures, and show that a network with R relay nodes and d of them down behaves, as far as diversity is concerned, as a network with R-d nodes. Finally, our construction can be easily generalized to the case where the transmitter and receiver nodes have several antennas
A universal space-time architecture for multiple-antenna aided systems
In this tutorial, we first review the family of conventional multiple-antenna techniques, and then we provide a general overview of the recent concept of the powerful Multiple-Input Multiple-Output (MIMO) family based on a universal Space-Time Shift Keying (STSK) philosophy. When appropriately configured, the proposed STSK scheme has the potential of outperforming conventional MIMO arrangements
An optimal path to transition in a duct
This paper is concerned with the transition of the laminar flow in a duct of
square cross-section. Like in the similar case of the pipe flow, the motion is
linearly stable for all Reynolds numbers, rendering this flow a suitable
candidate for a study of the 'bypass' path to turbulence. It has already been
shown \citep{Biau_JFM_2008} that the classical linear optimal perturbation
problem, yielding optimal disturbances in the form of longitudinal vortices,
fails to provide an 'optimal' path to turbulence, i.e. optimal perturbations do
not elicit a significant nonlinear response from the flow. Previous simulations
have also indicated that a pair of travelling waves generates immediately, by
nonlinear quadratic interactions, an unstable mean flow distortion, responsible
for rapid breakdown. By the use of functions quantifying the sensitivity of the
motion to deviations in the base flow, the 'optimal' travelling wave associated
to its specific defect is found by a variational approach. This optimal
solution is then integrated in time and shown to display a qualitative
similarity to the so-called 'minimal defect', for the same parameters. Finally,
numerical simulations of a 'edge state' are conducted, to identify an unstable
solution which mediates laminar-turbulent transition and relate it to results
of the optimisation procedure
Two-group decodable distributed differential space-time code for wireless relay networks based on SAST codes 2
Space-time code can be implemented in wireless relay networks when all relays cooperate to generate the code at the receiver. In this case, it is called distributed space-time code. If the channel response changes very quickly, the idea of differential space-time coding is needed to overcome the difficulty of updating the channel state information at the receiver. As a result, the transmitted signal can be demodulated without any knowledge of the channel state information at the relays or the receiver. In this paper, development of new low decoding complexity distributed differential space-time codes is considered. The developed codes are designed using semiorthogonal algebraic space-time codes. They work for networks with an even number of relays and have a two-group decodable maximum likelihood receiver. The performance of the new codes is analyzed via MATLAB simulation which demonstrates that they outperform both cyclic codes and circulant codes
Source-channel coding for robust image transmission and for dirty-paper coding
In this dissertation, we studied two seemingly uncorrelated, but conceptually
related problems in terms of source-channel coding: 1) wireless image transmission
and 2) Costa ("dirty-paper") code design.
In the first part of the dissertation, we consider progressive image transmission
over a wireless system employing space-time coded OFDM. The space-time coded
OFDM system based on a newly built broadband MIMO fading model is theoretically
evaluated by assuming perfect channel state information (CSI) at the receiver for
coherent detection. Then an adaptive modulation scheme is proposed to pick the
constellation size that offers the best reconstructed image quality for each average
signal-to-noise ratio (SNR).
A more practical scenario is also considered without the assumption of perfect
CSI. We employ low-complexity decision-feedback decoding for differentially space-
time coded OFDM systems to exploit transmitter diversity. For JSCC, we adopt a
product channel code structure that is proven to provide powerful error protection and
bursty error correction. To further improve the system performance, we also apply
the powerful iterative (turbo) coding techniques and propose the iterative decoding
of differentially space-time coded multiple descriptions of images.
The second part of the dissertation deals with practical dirty-paper code designs. We first invoke an information-theoretical interpretation of algebraic binning and
motivate the code design guidelines in terms of source-channel coding. Then two
dirty-paper code designs are proposed. The first is a nested turbo construction based
on soft-output trellis-coded quantization (SOTCQ) for source coding and turbo trellis-
coded modulation (TTCM) for channel coding. A novel procedure is devised to
balance the dimensionalities of the equivalent lattice codes corresponding to SOTCQ
and TTCM. The second dirty-paper code design employs TCQ and IRA codes for
near-capacity performance. This is done by synergistically combining TCQ with IRA
codes so that they work together as well as they do individually. Our TCQ/IRA
design approaches the dirty-paper capacity limit at the low rate regime (e.g., < 1:0
bit/sample), while our nested SOTCQ/TTCM scheme provides the best performs so
far at medium-to-high rates (e.g., >= 1:0 bit/sample). Thus the two proposed practical
code designs are complementary to each other
A Belief Propagation Based Framework for Soft Multiple-Symbol Differential Detection
Soft noncoherent detection, which relies on calculating the \textit{a
posteriori} probabilities (APPs) of the bits transmitted with no channel
estimation, is imperative for achieving excellent detection performance in
high-dimensional wireless communications. In this paper, a high-performance
belief propagation (BP)-based soft multiple-symbol differential detection
(MSDD) framework, dubbed BP-MSDD, is proposed with its illustrative application
in differential space-time block-code (DSTBC)-aided ultra-wideband impulse
radio (UWB-IR) systems. Firstly, we revisit the signal sampling with the aid of
a trellis structure and decompose the trellis into multiple subtrellises.
Furthermore, we derive an APP calculation algorithm, in which the
forward-and-backward message passing mechanism of BP operates on the
subtrellises. The proposed BP-MSDD is capable of significantly outperforming
the conventional hard-decision MSDDs. However, the computational complexity of
the BP-MSDD increases exponentially with the number of MSDD trellis states. To
circumvent this excessive complexity for practical implementations, we
reformulate the BP-MSDD, and additionally propose a Viterbi algorithm
(VA)-based hard-decision MSDD (VA-HMSDD) and a VA-based soft-decision MSDD
(VA-SMSDD). Moreover, both the proposed BP-MSDD and VA-SMSDD can be exploited
in conjunction with soft channel decoding to obtain powerful iterative
detection and decoding based receivers. Simulation results demonstrate the
effectiveness of the proposed algorithms in DSTBC-aided UWB-IR systems.Comment: 14 pages, 12 figures, 3 tables, accepted to appear on IEEE
Transactions on Wireless Communications, Aug. 201
Co-Efficient Vector Based Differential Distributed Quasi-Orthogonal Space Time Frequency Coding
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).Distributed space time frequency coding (DSTFC) schemes address problems of performance degradation encountered by cooperative broadband networks operating in highly mobile environments. Channel state information (CSI) acquisition is, however, impractical in such highly mobile environments. Therefore, to address this problem, designers focus on incorporating differential designs with DSTFC for signal recovery in environments where neither the relay nodes nor destination have CSI. Traditionally, unitary matrix-based differential designs have been used to generate the differentially encoded symbols and codeword matrices. Unitary based designs are suitable for cooperative networks that utilize the amplify-and-forward protocol where the relay nodes are typically required to forego differential decoding. In considering other scenarios where relay nodes are compelled to differentially decode and re-transmit information signals, we propose a novel co-efficient vector differential distributed quasi-orthogonal space time frequency coding (DQSTFC) scheme for decode-and-forward cooperative networks. Our proposed space time frequency coding scheme relaxes the need for constant channel gain in the temporal and frequency dimensions over long symbol periods; thus, performance degradation is reduced in frequency-selective and time-selective fading environments. Simulation results illustrate the performance of our proposed co-efficient vector differential DQSTFC scheme under different channel conditions. Through pair-wise error probability analysis, we derive the full diversity design criteria for our code.Peer reviewe
A Coding Strategy for Wireless Networks with no Channel Information
In this paper, we present a coding strategy for wireless relay networks, where we assume no channel knowl-edge. More precisely, the relays operate without knowing the channel that affected their received signal, and the receiver decodes knowing none of the channel paths. The coding scheme is inspired by noncoherent differential space-time coding, and is shown to yield a diversity linear in the number of relays. It is furthermore available for any number of relay nodes
- …