Search

In this paper, we consider a turbo-coded system employed on a flat-fading channel where the transmitter and receiver adapt the encoder, decoder, modulation scheme, and transmit power to the state of the channel. Assuming instantaneous and error-free channel gain and phase knowledge at the transmitter and the receiver, we determine the optimal adaptation strategy that maximizes the throughput of this system, while achieving a given bit-error rate under an average power constraint. Our optimized adaptive modulation strategy is based on an extensive set of existing turbo-coded modulation schemes. We find that adapting both the turbo encoder (rate) and the transmit power can achieve performance within 3 dB of the fading channel capacity. [ABSTRACT FROM AUTHOR]

Focuses on a study which proposed the development of decision-feedback decoder for coded signals transmitted over finite-state Markov channels. Application of maximum-likelihood sequence detection and the Markov structure; Evaluation on the decoding performance of the feedback decoder; Methodology and results.

Presents a path enumeration technique using signal flow graphs combined with equilibrium point analysis to analyze the effect of terminal mobility on the performance of packet reservation multiple access (PRMA) in a cellular environment. Information on PRMA; Details of the Markov model of a mobile terminal in PRMA; Significance of a path enumeration technique in analyzing the effect of terminal mobility.

Presents a study that examined adaptive modulation schemes for flat-fading channels where the data rate, transmit power and instantaneous bit error rate are varied to maximize spectral efficiency. Information on the use of adaptive modulation to increase the data rate that can be transmitted over fading channels; Methodology; Results and discussion.

Presents information on a study which proposed an analytical framework to determine the exact average symbol-error rate of linearly modulated signals over generalized fading channels. Overview on the status of wireless communication systems; Details of the framework; Methodology; Results; Conclusion.

Proposes three design algorithms for jointly optimizing source and channel codes. Criterion to prevent distortion; Measurements of transmission rates and channel code designs; Techniques in the creation of joint code algorithm design.

Shows that coded modulation techniques designed for the additive white Gaussian noise (AWGN) channel can be superimposed on a general class of adaptive modulation schemes. Coset codes with adaptive modulation; Trellis-coded adaptive M-ary quadrature amplitude modulation (MQAM); Comparison with fade-resistant trellis code designs.

This paper formulates the polar-code construction problem for the successive-cancellation list (SCL) decoder as a maze-traversing game, which can be solved by reinforcement-learning techniques. The proposed method provides a novel technique for polar-code construction that no longer depends on sorting and selecting bit-channels by reliability, as in most current algorithms. Instead, this technique decides whether the input bits should be frozen in a purely sequential manner. The equivalence of optimizing the polar-code construction for the SCL decoder under this technique and maximizing the expected reward of traversing a maze is drawn. Simulation results show that the standard polar-code constructions that are designed for the successive-cancellation decoder are no longer optimal for the SCL decoder with respect to the frame error rate (FER). In contrast, the proposed game-based construction method finds code constructions that have similar or lower FER for various code lengths and various list sizes of the SCL decoder, compared to the state-of-the-art construction methods. The advantage of the game-based constructions over the standard constructions increases with the channel signal-to-noise ratio and the list size of SCL decoding. Moreover, the learning is highly efficient in terms of the number of required training samples and computational operations. [ABSTRACT FROM AUTHOR]

We propose a new approach to outage probability analysis of predetection maximal ratio combining (MRC) diversity reception in Nakagami-m fading channels. We generalize prior work in that we consider L independent cochannel interferers with arbitrary powers and fading parameters as well as the effects of additive white Gaussian noise (AWGN). Our approach results in a general expression for outage probability under very broad assumptions. Moreover, our approach leads to a closed-form expression for outage probability in most cases of interest. We also provide numerical results that demonstrate the performance improvement obtained through MRC diversity combining in the presence of cochannel interferers. [ABSTRACT FROM AUTHOR]

Fast SC decoding overcomes the latency caused by the serial nature of the SC decoding by identifying new nodes in the upper levels of the SC decoding tree and implementing their fast parallel decoders. In this work, we first present a novel sequence repetition node corresponding to a particular class of bit sequences. Most existing special node types are special cases of the proposed sequence repetition node. Then, a fast parallel decoder is proposed for this class of node. To further speed up the decoding process of general nodes outside this class, a threshold-based hard-decision-aided scheme is introduced. The threshold value that guarantees a given error-correction performance in the proposed scheme is derived theoretically. Analysis and hardware implementation results on a polar code of length 1024 with code rates 1/4, 1/2, and 3/4 show that our proposed algorithm reduces the required clock cycles by up to 8%, and leads to a 10% improvement in the maximum operating frequency compared to state-of-the-art decoders without tangibly altering the error-correction performance. In addition, using the proposed threshold-based hard-decision-aided scheme, the decoding latency can be further reduced by 57% at Eb/N0 = 5.0 dB. [ABSTRACT FROM AUTHOR]

For nano-scale communications, there must be cooperation and simultaneous communication between nano devices. To this end, in this paper, we investigate two-way (a.k.a. bi-directional) molecular communications between nano devices. If different types of molecules are used for the communication links, the two-way system eliminates the need to consider self-interference. However, in many systems, it is not feasible to use a different type of molecule for each communication link. Thus, we propose a two-way molecular communication system that uses a single type of molecule. We derive a channel model for this system and use it to analyze the proposed system’s bit error rate, throughput, and self-interference. Moreover, we propose analog- and digital- self-interference cancellation techniques. The enhancement of link-level performance using these techniques is confirmed with both particle-based simulations and analytical results. [ABSTRACT FROM AUTHOR]

We study non-coherent detection schemes for molecular communication (MC) systems with negligible inter-symbol interference that do not require knowledge of the channel state information (CSI). In particular, we first derive the optimal maximum likelihood (ML) multiple-symbol (MS) detector for MC systems. As a special case of the optimal MS detector, we show that the optimal ML symbol-by-symbol (SS) detector can be equivalently written in the form of a threshold-based detector, where the optimal decision threshold is constant and depends only on the statistics of the MC channel. The main challenge of the MS detector is the complexity associated with the calculation of the optimal detection metric. To overcome this issue, we propose an approximate MS detection metric that can be expressed in closed form. In addition, we develop a non-coherent decision-feedback detector, which introduces a lower detection delay compared with the optimal MS detector, and a suboptimal blind detector, which has a significantly lower complexity than the optimal MS detector. Finally, we derive analytical expressions for the bit error rate (BER) of the optimal SS detector, as well as upper and lower bounds for the BER of the optimal MS detector. Simulation results confirm the analysis and reveal the effectiveness of the proposed optimal and suboptimal detection schemes compared with the benchmark scheme that assumes perfect CSI knowledge, particularly, when the number of observations used for detection is sufficiently large. Simulation results are also presented that show the performance of the proposed detectors, when inter-symbol interference is non-negligible. [ABSTRACT FROM AUTHOR]

In this paper, we consider the full-duplex and half-duplex Gaussian relay channels where the noises at the relay and destination are arbitrarily correlated. We first derive the capacity upper bound and the achievable rates with three existing schemes: Decode-and-Forward (DF), Compress-and-Forward (CF), and Amplify-and-Forward (AF). We present two capacity results under specific noise correlation coefficients, one being achieved by DF and the other being achieved by direct link transmission (or a special case of CF). The channel for the former capacity result is equivalent to the traditional Gaussian degraded relay channel and the latter corresponds to the Gaussian reversely-degraded relay channel. For CF and AF schemes, we show that their achievable rates are strictly decreasing functions of the correlation coefficient when the correlation coefficient is negative. Moreover, when the noise correlation coefficient is positive, the CF achievable rate may also outperform the independent-noise case if the noise correlation coefficient is within a certain range. Through numerical comparisons under different channel settings, we observe that although DF completely disregards the noise correlation while the other two can potentially exploit such extra information, none of the three relay schemes always outperforms the others over different correlation coefficients. Moreover, the exploitation of noise correlation by CF and AF accrues more benefit when the source-relay link is weak. This paper also considers the optimal power allocation problem under the correlated-noise channel setting. With individual power constraints at the relay and the source, it is shown that the relay should use all its available power to maximize the achievable rates under any correlation coefficient. With a total power constraint across the source and the relay, the achievable rates are proved to be concave functions over the power allocation factor for AF and CF under full-duplex mode, where the closed-form power allocation strategy is derived. [ABSTRACT FROM PUBLISHER]