816 research outputs found
Short Packets over Block-Memoryless Fading Channels: Pilot-Assisted or Noncoherent Transmission?
We present nonasymptotic upper and lower bounds on the maximum coding rate
achievable when transmitting short packets over a Rician memoryless
block-fading channel for a given requirement on the packet error probability.
We focus on the practically relevant scenario in which there is no \emph{a
priori} channel state information available at the transmitter and at the
receiver. An upper bound built upon the min-max converse is compared to two
lower bounds: the first one relies on a noncoherent transmission strategy in
which the fading channel is not estimated explicitly at the receiver; the
second one employs pilot-assisted transmission (PAT) followed by
maximum-likelihood channel estimation and scaled mismatched nearest-neighbor
decoding at the receiver. Our bounds are tight enough to unveil the optimum
number of diversity branches that a packet should span so that the energy per
bit required to achieve a target packet error probability is minimized, for a
given constraint on the code rate and the packet size. Furthermore, the bounds
reveal that noncoherent transmission is more energy efficient than PAT, even
when the number of pilot symbols and their power is optimized. For example, for
the case when a coded packet of symbols is transmitted using a channel
code of rate bits/channel use, over a block-fading channel with block
size equal to symbols, PAT requires an additional dB of energy per
information bit to achieve a packet error probability of compared to
a suitably designed noncoherent transmission scheme. Finally, we devise a PAT
scheme based on punctured tail-biting quasi-cyclic codes and ordered statistics
decoding, whose performance are close ( dB gap at packet error
probability) to the ones predicted by our PAT lower bound. This shows that the
PAT lower bound provides useful guidelines on the design of actual PAT schemes.Comment: 30 pages, 5 figures, journa
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
Successive-relaying-aided decode-and-forward coherent versus noncoherent cooperative multicarrier space–time shift keying
Abstract—Successive-relaying-aided (SR) cooperative multi-carrier (MC) space–time shift keying (STSK) is proposed for frequency-selective channels. We invoke SR to mitigate the typical 50% throughput loss of conventional half-duplex relaying schemes and MC code-division multiple access (MC-CDMA) to circumvent the dispersive effects of wireless channels and to reduce the SR-induced interference. The distributed relay terminals form two virtual antenna arrays (VAAs), and the source node (SN) successively transmits frequency-domain (FD) spread signals to one of the VAAs, in addition to directly transmitting to the destination node (DN). The constituent relay nodes (RNs) of each VAA activate cyclic-redundancy-checking-based (CRC) selective decode-and-forward (DF) relaying. The DN can jointly detect the signals received via the SN-to-DN and VAA-to-DN links using a low-complexity single-stream-based joint maximum-likelihood (ML) detector. We also propose a differentially encoded cooperative MC-CDMA STSK scheme to facilitate communications over hostile dispersive channels without requiring channel estimation (CE). Dispensing with CE is important since the relays cannot be expected to altruistically estimate the SN-to-RN links for simply supporting the source. Furthermore, we propose soft-decision-aided serially concatenated recursive systematic convolutional (RSC) and unity-rate-coded (URC) cooperative MC STSK and investigate its performance in both coherent and noncoherent scenarios
- …