By Topic

Communications, IEEE Transactions on

Issue 1 • Date January 2011

Filter Results

Displaying Results 1 - 25 of 35
  • Table of contents

    Publication Year: 2011 , Page(s): c1 - c4
    Save to Project icon | Request Permissions | PDF file iconPDF (65 KB)  
    Freely Available from IEEE
  • [Staff list]

    Publication Year: 2011 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (58 KB)  
    Freely Available from IEEE
  • Your Chance to Become an Editor: The Open Call Initiative

    Publication Year: 2011 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (24 KB)  
    Freely Available from IEEE
  • Bounds on the Capacity of Channels with Insertions, Deletions and Substitutions

    Publication Year: 2011 , Page(s): 2 - 6
    Cited by:  Papers (15)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (178 KB) |  | HTML iconHTML  

    We present novel bounds on the capacity of binary channels with independent and identically distributed insertions, deletions, and substitutions. The proposed bounds are obtained by exploiting an auxiliary system where the channel is the same as the one in the system of interest, but the receiver is provided with (partial) genie-aided information on the insertion/deletion process. In particular, we show that, when this information is revealed, we obtain a memoryless channel whose capacity, evaluated by means of the Blahut-Arimoto algorithm, gives an upper bound on the capacity of interest. We also show that capacity lower bounds can be derived as well, by exploiting the same auxiliary system and resorting to suitable information-theoretical inequalities. In most scenarios, the proposed bounds improve the existing ones, and significantly narrow the region to which the actual capacity can belong. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous Classification of Digital Amplitude-Phase Modulated Signals in Flat-Fading Channels

    Publication Year: 2011 , Page(s): 7 - 12
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (256 KB) |  | HTML iconHTML  

    This paper presents a new asynchronous modulation classifier for digital amplitude-phase modulated signals in flat-fading channels when the channel state is assumed unknown. In the design of this classifier, we propose new estimators for the unknown amplitude, time offset, and noise power that are blind to the modulation scheme of the received signal. It is shown that the proposed classifier performs well compared to the optimal classifier with perfect channel knowledge for an adequate estimation interval. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of Equal Gain Combining with Quantized Phases in Rayleigh Fading Channels

    Publication Year: 2011 , Page(s): 13 - 18
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (248 KB) |  | HTML iconHTML  

    In this paper, we analyze the error probability of equal gain combining with quantized channel phase compensation for binary phase shift keying signalling over Rayleigh fading channels. The probability density and characteristic functions of the combined signal amplitude are derived and used to compute the analytic expressions for the bit error probability in dependance of the number of quantization levels L, the number of diversity branches NR and the average received signal-to-noise ratio. The analysis is utilized to outline the trade-off between NR and L and to compare the performance with non-coherent binary frequency shift keying and differential binary phase shift keying schemes under diversity reception. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduction of the Envelope Fluctuations of Multi-Carrier Modulations using Adaptive Neural Fuzzy Inference Systems

    Publication Year: 2011 , Page(s): 19 - 25
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (891 KB) |  | HTML iconHTML  

    In this paper, a novel scheme for reducing the envelope fluctuations in multi-carrier signals applying Adaptive Neural Fuzzy Inference Systems (ANFIS) is proposed and analyzed. Once trained with signals with very low envelope fluctuations, such as those obtained by the Active Constellation Expansion - Approximate Gradient Project (ACE-AGP) algorithm, ANFIS approximately reaches a similar reduction as with ACE-AGP for multi-carrier signals without the complexity and the large convergence time of conventional ACE-AGP. We show that our approach is less complex than other previous schemes and with better performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MIMO Detection Schemes with Interference and Noise Estimation Enhancement

    Publication Year: 2011 , Page(s): 26 - 32
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (278 KB) |  | HTML iconHTML  

    Different detection schemes for multiple-input, multiple-output (MIMO) systems are investigated. By enhancing the interference and noise estimation, we propose a novel MIMO receiver strategy, which is shown to achieve superior performance with moderate increase in computational complexity compared to conventional MIMO detection schemes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimized Iterative Clipping and Filtering for PAPR Reduction of OFDM Signals

    Publication Year: 2011 , Page(s): 33 - 37
    Cited by:  Papers (29)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (339 KB) |  | HTML iconHTML  

    Iterative clipping and filtering (ICF) is a widely used technique to reduce the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals. However, the ICF technique, when implemented with a fixed rectangular window in the frequency-domain, requires many iterations to approach specified PAPR threshold in the complementary cumulative distribution function (CCDF). In this paper, we develop an optimized ICF method which determines an optimal frequency response filter for each ICF iteration using convex optimization techniques. The design of optimal filter is to minimize signal distortion such that the OFDM symbol's PAPR is below a specified value. Simulation results show that our proposed method can achieve a sharp drop of CCDF curve and reduce PAPR to an acceptable level after only 1 or 2 iterations, whereas the classical ICF method would require 8 to 16 iterations to achieve a similar PAPR reduction. Moreover, the clipped OFDM symbols obtained by our optimized ICF method have less distortion and lower out-of-band radiation than the existing method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Two-Level FH-CDMA Scheme for Wireless Communication Systems over Fading Channels

    Publication Year: 2011 , Page(s): 38 - 44
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (919 KB) |  | HTML iconHTML  

    In this paper, we propose a "two-level" frequency-hopping code-division multiple-access (FH-CDMA) scheme for wireless communication systems. The new scheme provides flexibility in the selection of modulation codes and FH patterns. By partitioning the modulation codes, our two-level scheme can be modified to support more possible users without increasing the number of FH patterns. The performance and spectral efficiency (SE) of the scheme are analyzed. Our results show that the partitioned two-level FH-CDMA scheme supports higher data rate and greater SE than Goodman's frequency-shift-keying FH-CDMA scheme under some conditions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Generation of Correlated Gaussian Random Variates by Inverse DTF

    Publication Year: 2011 , Page(s): 45 - 51
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1163 KB) |  | HTML iconHTML  

    In this paper the problem of generating a stationary band-limited Gaussian random vector with arbitrary complex autocorrelation by the inverse discrete Fourier transform (IDTF) algorithm is considered. Instead of using the classical frequency mask (FM), determined from samples of the (band-limited) target power spectral density (PSD) of the process, a new FM is obtained by matching the autocorrelation obtained with the IDFT algorithm to a desired arbitrary autocorrelation. Example results presented show that the new FM is able to significantly increase the autocorrelation accuracy of the generated process at no additional online computational cost. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power Allocation for Distributed Transmit Diversity with Feedback Loop Delay

    Publication Year: 2011 , Page(s): 52 - 58
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (261 KB) |  | HTML iconHTML  

    We study two power allocation (PA) schemes for distributed transmit diversity systems. We first derive the performance of the instantaneous channel gain feedback-based PA (ICG-PA) scheme in the presence of channel variation during feedback delay. We then study channel gain variance feedback-based PA (CGV-PA) to mitigate the performance degradation of ICG-PA caused by feedback delay. Finally, we derive design rules for optimum CGV-PA from a compact and accurate performance expression derived. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Diversity Gain in Dynamic Decode-and-Forward Channels with Imperfect CSIT

    Publication Year: 2011 , Page(s): 59 - 63
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (211 KB) |  | HTML iconHTML  

    We investigate the impact of imperfect channel state information at the transmitter (CSIT) on the diversity gain in dynamic decode-and-forward (DF) relaying channels. A diversity and multiplexing tradeoff analysis is presented, which reveals that power control based on imperfect CSIT significantly improves the achievable diversity gain. It is found that if the multiplexing gain is higher than 1/2, the achievable diversity gain only depends on the CSIT of the source-destination (S-D) link and the relay-destination (R-D) link; otherwise the CSIT of the source-relay (S-R) link might also contribute. It is also found that the CSIT of the R-D link does not contribute to the overall diversity gain if the source has no CSIT. The presented results show that dynamic DF relaying supports not only a higher multiplexing gain but also a higher diversity gain than conventional DF relaying protocols. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Iterative Decoding Algorithm with Backtracking to Lower the Error-Floors of LDPC Codes

    Publication Year: 2011 , Page(s): 64 - 73
    Cited by:  Papers (12)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (744 KB) |  | HTML iconHTML  

    Error-floors are the main reason for excluding LDPC codes from applications requiring very low bit-error rate. They are attributed to a particular structure in the codes' Tanner graphs, known as trapping sets, which traps the message-passing algorithms commonly used to decode LDPC codes, and prevents decoding from converging to the correct codeword. A technique is proposed to break trapping sets while decoding. Based on decoding results leading to a decoding failure, some bits are identified in a previous iteration and flipped and decoding is restarted. This backtracking may enable the decoder to get out of the trapped state. A semi-analytical method is also proposed to predict the error-floor after backtracking. Simulation results indicate the effectiveness of the proposed technique in lowering the error-floor. The technique, which has moderate complexity overhead, is applicable to any code without requiring a prior knowledge of the structure of its trapping sets. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical Quantizer Design for Half-Duplex Estimate-and-Forward Relaying

    Publication Year: 2011 , Page(s): 74 - 83
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (480 KB) |  | HTML iconHTML  

    We propose a quantizer design method for practical half-duplex estimate-and-forward (EF) relaying. First, we identify the regime in which EF relaying yields substantial gains where the SNR is low and the relay-destination link is strong. Then we discover design simplifications that reduce complexity with little loss in the above regime. For relay quantizer design, we first consider mean-squared distortion minimization. To illustrate the unsuitability of the approach, we present an example with AWGN links and a BPSK source where the quantizer with worst mean squared distortion in a given set maximizes achievable rate. A distortion-minimizing quantizer attempts to preserve the received signal at the relay. The quantizer should instead preserve source information. In information theoretical terms, the quantizer should maximize the mutual information between the source transmission and the quantizer output conditioned on the side information at the destination subject to a rate constraint. The above conclusion, derived from information theoretical principles, is then translated to a quantizer design method for the low SNR regime. Using LDPC codes of blocklength 100000, BPSK modulation, and quantizers designed using the proposed criterion, we observe performance less than a decibel away from the achievable rate at a BER of 10-4. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Differential Encoding by a Look-Up Table for Quadrature-Amplitude Modulation

    Publication Year: 2011 , Page(s): 84 - 94
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (416 KB) |  | HTML iconHTML  

    In this paper, we propose a novel differential encoder for QAM (quadrature-amplitude modulation), by a look-up table instead of a rule. Using a table for differential encoding has the advantages of both low complexity and good error performance. We propose algorithms to construct the table for maximizing the minimum noncoherent distance and minimizing the number of different data bits between two codewords with small noncoherent distance. For 16QAM and 32QAM, we show that the differential encoders obtained by the proposed algorithms are optimal in terms of minimum noncoherent distance. Differential detectors for QAM, including a reduced-complexity two-symbol detector and multiple-symbol detectors, are proposed as well. Simulation results of 16QAM show that the proposed differential encoder provides significant gain over existent differential encoders as expected by distance analysis, and the proposed low-complexity multiple-symbol differential detector can further improve the error performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bit-Interleaved Coded Transmission with Multilevel Modulation for Non-Orthogonal Cooperative Systems

    Publication Year: 2011 , Page(s): 95 - 105
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (593 KB) |  | HTML iconHTML  

    This paper proposes a bit-interleaved coded multilevel modulation for non-orthogonal cooperative transmissions. The proposed system encodes and interleaves multiple layers together, using one encoder and one interleaver, in order to average the performance of multiple layers with unequal error probabilities. The multiple layers are mapped by hierarchical symbol mapping. To improve the performance of the proposed system, the relay transmits the layers with a different hierarchical mapping pattern from the source, which is optimally derived for minimizing mean square error. To mitigate error propagation from the relay, we propose a power scaling scheme based on the error performance of the layers. The detected signals at the relay are scaled before being transmitted to the destination. A corresponding destination structure is also presented, where multiple layers can be decoupled by an iterative equalization with improved soft information. To estimate the performance of the proposed system, we develop a density evolution technique, and show that the predicted performances are consistent with simulated performances. Simulation results indicate that by using the optimal mapping pattern, power scaling, and iterative equalization with improved soft information, the proposed technique achieves both cooperative diversity and coding gains, and thus outperforms conventional cooperative schemes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Analysis of Joint Diversity Combining, Adaptive Modulation, and Power Control Schemes

    Publication Year: 2011 , Page(s): 106 - 115
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (394 KB) |  | HTML iconHTML  

    Adaptive modulation and diversity combining represent very important adaptive solutions for future generations of wireless communication systems. Indeed, in order to improve the performance and the efficiency of these systems, these two techniques have been recently used jointly in new schemes named joint adaptive modulation and diversity combining (JAMDC) schemes. Considering the problem of finding low hardware complexity, bandwidth-efficient, and processing-power efficient transmission schemes for a downlink scenario and capitalizing on some of these recently proposed JAMDC schemes, we propose and analyze in this paper three joint adaptive modulation, diversity combining, and power control (JAMDCPC) schemes where a constant-power variable-rate adaptive modulation technique is used with an adaptive diversity combining scheme and a common power control process. More specifically, the modulation constellation size, the number of combined diversity paths, and the needed power level are jointly determined to achieve the highest spectral efficiency with the lowest possible processing power consumption quantified in terms of the average number of combined paths, given the fading channel conditions and the required bit error rate (BER) performance. In this paper, the performance of these three JAMDCPC schemes is analyzed in terms of their spectral efficiency, processing power consumption, and error-rate performance. Selected numerical examples show that these schemes considerably increase the spectral efficiency of the existing JAMDC schemes with a slight increase in the average number of combined paths for the low signal-to-noise ratio range while maintaining compliance with the BER performance and a low radiated power which yields to a substantial decrease in interference to co-existing users and systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space Shift Keying (SSK—) MIMO over Correlated Rician Fading Channels: Performance Analysis And a New Method for Transmit-Diversity

    Publication Year: 2011 , Page(s): 116 - 129
    Cited by:  Papers (20)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (444 KB) |  | HTML iconHTML  

    In this paper, we study the performance of Space Shift Keying (SSK) modulation for a generic Multiple-Input-Multiple-Output (MIMO) wireless system over correlated Rician fading channels. In particular, our contribution is twofold, i) First, we propose a very general framework for computing the Average Bit Error Probability (ABEP) of SSK-MIMO systems over a generic Rician fading channel with arbitrary correlation and channel parameters. The framework relies upon the Moschopoulos method. We show that it is exact for MIMO systems with two transmit-antenna and arbitrary receive-antenna, while an asymptotically-tight upper-bound is proposed to handle the system setup with an arbitrary number of transmit-antenna. ii) Second, moving from the consideration that conventional SSK-MIMO schemes can offer only receive-diversity gains, we propose a novel SSK-MIMO scheme that can exploit the transmit-antenna to increase the diversity order. The new method has its basic foundation on the transmission of signals with good time-correlation properties, and is called Time-Orthogonal-Signal-Design (TOSD-) assisted SSK modulation (TOSD-SSK). It is shown that the proposed method can increase twofold the diversity order for arbitrary transmit- and receive-antenna. In particular, for MIMO systems with two transmit-antenna and Nr receive-antenna full-diversity equal to 2Nr can be achieved. Analytical frameworks and theoretical findings are substantiated via Monte Carlo simulations for various system setups. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Optimum Detector of Trellis Coded MPSK in Phase Noise Channels

    Publication Year: 2011 , Page(s): 130 - 140
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (689 KB) |  | HTML iconHTML  

    This paper presents a novel analytical expression which approximates the bit error rate (BER) of the joint phase and symbol maximum a posteriori (JMAP) sequence estimator for: trellis code modulation (TCM) with M-ary phase shift keying (MPSK) modulation; any arbitrary phase noise model (i.e., not limited to the Wiener process); and either a matched or mismatched decoder. First, we derived convenient closed-form expressions for approximating the pairwise error probability of two code sequences for both matched and mismatched decoders. Since the expressions are formulated either in the time or in the frequency domain, it is possible to indicate the contribution of every frequency in the phase noise spectrum. We then applied the union bound on the code sequence pairwise errors. The analytical expression was tight (usually <;1dB) for MPSK constellations with M ≥ 4 and code rates ≥ 0.5. Once developed, the expressions will assist designers to consider the influence on receiver performance of the code characteristics, decoder implementation and RF synthesizer phase noise. It further enables joint optimization of the RF synthesizer, the code and the decoder for achieving the lowest error rate or other design targets. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multilevel Coupling Modulation for Multi-Resolution Multimedia Broadcast/Multicast Service in OFDM Systems

    Publication Year: 2011 , Page(s): 141 - 150
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (554 KB) |  | HTML iconHTML  

    To meet the growing demand for multimedia services, Multimedia Broadcast/Multicast Service (MBMS) was proposed to enhance bandwidth efficiency in wireless communication systems. Although MBMS supports multimedia streams with several resolutions, streams with different resolutions are treated as separate services and transmitted upon independent radio resources, resulting in inefficient resource utilization. At the receiver, some valuable information embedded in the higher-resolution channels is not utilized to enhance the reception of the data stream in a lower resolution channel. In this work, we propose a multilevel coupling modulation (MCM) scheme aimed to improve the overall system throughput and to extend the service coverage of the multi-resolution MBMS in orthogonal frequency division multiplexing (OFDM) systems. The proposed MCM scheme can fully utilize all the usable information conveyed in different channels, thereby improving the receiving performance. In addition, we derive the symbol error rates of the proposed MCM scheme, in the AWGN and frequency-selective fading channels, for performance evaluation. The analytical and simulation results demonstrate that the proposed MCM scheme can substantially enhance the receiving performance, service accessibility and overall system throughput of multi-resolution MBMS in OFDM systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relay Station Placement Strategy in IEEE 802.16j WiMAX Networks

    Publication Year: 2011 , Page(s): 151 - 158
    Cited by:  Papers (17)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (349 KB) |  | HTML iconHTML  

    In this paper, we study the relay station (RS) placement strategy in IEEE 802.16j WiMAX networks. Specifically, the impact of RS placement on IEEE 802.16j network performance is analyzed. A throughput maximization RS placement problem is mathematically formulated as a binary integer programming problem. We prove the NP-hardness of the formulated problem. To find the sub-optimal solution to the problem with huge input size, we propose an efficient near-optimal placement solution for IEEE 802.16j WiMAX networks. Simulations on the IEEE 802.16j network performance with our RS placement strategy are conducted. The throughput performance shows that with the deployment strategy we proposed, the IEEE 802.16j network capacity can be tremendously enhanced, especially when hotspots are present in the network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indirect Reciprocity Game Modelling for Cooperation Stimulation in Cognitive Networks

    Publication Year: 2011 , Page(s): 159 - 168
    Cited by:  Papers (15)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (472 KB) |  | HTML iconHTML  

    In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their own performance. Thus, how to stimulate cooperation among nodes in cognitive networks is very important. However, most of existing game-theoretic cooperation stimulation approaches rely on the assumption that the interactions between any pair of players are long-lasting. When this assumption is not true, according to the well-known Prisoner's Dilemma and the backward induction principle, the unique Nash equilibrium (NE) is to always play non-cooperatively. In this paper, we propose a cooperation stimulation scheme for the scenario where the number of interactions between any pair of players are finite. The proposed algorithm is based on indirect reciprocity game modelling where the key concept is "I help you not because you have helped me but because you have helped others". We formulate the problem of finding the optimal action rule as a Markov Decision Process (MDP) and propose a modified value iteration algorithm to find the optimal action rule. Using the packet forwarding game as an example, we show that with an appropriate cost-to-gain ratio, the strategy of forwarding the number of packets that is equal to the reputation level of the receiver is an evolutionarily stable strategy (ESS). Finally, simulations are shown to verify the efficiency and effectiveness of the proposed algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient and Agile 1+N Protection

    Publication Year: 2011 , Page(s): 169 - 180
    Cited by:  Papers (12)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (339 KB) |  | HTML iconHTML  

    This paper introduces an efficient implementation of the network coding-based 1+N protection. The strategy provides proactive protection to N link-disjoint full-duplex connections against single link failures. The implementation is efficient and uses a tree shaped minimum cost protection circuit. The protection circuit carries linear combinations of data units originally transmitted on the working circuits, and these linear combinations can be used to recover data units lost due to failures. This recovery is carried out with the assistance of one node on the protection tree, which is chosen to reduce the recovery time. This protection technique requires the same amount of protection resources used by 1:N protection, where the protection circuit is link disjoint from the protected connections. The paper also makes other contributions. It introduces an Integer Linear Program (ILP) formulation to evaluate the cost of protection using this technique, and compares it to the cost of 1+1 protection. The comparison shows that a significant saving in cost can be achieved, while recovering from failures within a short time. The performance of this scheme is further evaluated using an OPNET-based simulation, where it was shown that the recovery time conforms to acceptable industry standards. Availability analysis is also conducted. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Joint Network and Channel Coding Strategy for Wireless Decode-and-Forward Relay Networks

    Publication Year: 2011 , Page(s): 181 - 193
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1028 KB) |  | HTML iconHTML  

    In this paper, we consider a wireless multicast network with multiple sources, relays, and destinations. We adopt a multi-hop decode-and-forward relay protocol such that two canonical subnetworks are relevant, namely broadcast channel with receiver side information (BC-RSI) and orthogonal multiple access channel with correlated sources and receiver side information (MAC-CS-RSI). A joint network and channel coding (JNCC) strategy is proposed by exploiting ARQ, RSI, and correlated sources. The proposed JNCC strategy does not require the knowledge of RSI nor any transmit channel state information, such that each transmitter simply performs retransmissions until the intended receivers have accumulated enough mutual information to successfully decode all desired messages. This successful decoding is then conveyed from the receivers to the respective transmitters via an acknowledgement message. To measure the performance of the proposed JNCC strategy with ARQ, we derive closed-form expressions of network throughput by applying the renewal-reward theorem. Analytical results show that the proposed JNCC strategy outperforms, in terms of network throughput, the conventional separate network and channel coding strategy with random linear network coding. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IEEE Transactions on Communications focuses on all telecommunications including telephone, telegraphy, facsimile, and point-to-point television by electromagnetic propagation.

 

 

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Robert Schober
University of British Columbia