The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper we consider a two-way relaying system with two sources A, B and one relay R, where the two sources desire to exchange information through the relay. The transmission consists of two states: multiple access (MAC) stage, where A and B transmit the channel-coded signals to R simultaneously, and broadcast (BC) stage, where R transmits towards both A and B. One critical process at R is to...
We analyze the outage probability of frequency domain minimum mean squared error turbo equalization over frequency-selective Rayleigh fading channels with exponential delay power profile. A correlation chart analysis is used to evaluate the convergence property of the iterative system. Based on the convergence characteristic of the equalizer and decoder, we derive a closed form approximation to the...
Motivated from results for the point-to-point block MIMO channels without channel knowledge, we investigate possible communication schemes for the non-coherent two-way relaying channel. We propose one construction where the code is constructed from packings in Grassmann manifolds and evaluate the performance of the coding scheme.
Adaptive relaying schemes significantly improve the performance of relay networks by switching the forwarding technique according to the reliability of the received signal. In adaptive relaying without ARQ all the relays forward irrespective of the decoding status at the destination. This leads to inefficient resource utilization. In ARQ relay networks, the message is repeated upon the request from...
In order to approach the theoretical limit of the decode-and-forward strategy for the half-duplex relay channel, distributed LDPC coding schemes have been proposed. In these schemes, the code applied at the source should be decodable at the relay to yield correct parity bits. With the help of the parity bits the destination should also be able to estimate the transmitted information correctly. For...
In this paper we consider a network of distributed sensors which simultaneously measure a physical parameter of interest, subject to a certain probability of sensing error. The sensed information at each of such nodes is channel-encoded and forwarded to a central receiver through parallel independent AWGN channels. In this scenario, several recent contributions have shown that the end-to-end Bit Error...
This paper proposes a structure that combines iterative equalization and turbo decoding, denoted as spatial turbo coding (STC), for single carrier signaling to achieve near capacity performance in multipath-rich fading channels. Instead of multiplexing the encoded bits in the time domain as in the standard turbo codes, the proposed STC transmits coded bits in the space domain by employing multiple-input...
In order to reduce the peak-to-average power ratio (PAR) of multi-antenna orthogonal frequency-division multiplexing (MIMO OFDM) systems selected mapping (SLM) and its MIMO extensions are considered. With SLM the transmission of some side information is necessary. In this paper, we focus on the approach of embedding the side information into the OFDM frame using combinations of unrotated and ??/4...
Iterative tree search algorithms like K-Best or sphere decoder algorithms are promising candidates for the upcoming wireless communications systems. In this paper a square root and division free Givens rotation (SDFG) algorithm is merged into a common sphere decoder algorithm to decrease the entire complexity. Furthermore, the algorithm is speeded up due to parallelizing the computation by taking...
Iterative low-density parity-check (LDPC) coded multiple-input multiple-output (MIMO) systems are known to be able to theoretically achieve excellent performance by computer simulation. If the systems can exploit time interleaving long enough to cover a fading cycle, excellent error rate performance should be obtained in mobile line-of-sight (LOS) environments. This paper describes an iterative LDPC...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.