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 a wireless networked control system (WNCS), physical processes are periodically observed and corresponding single analog measurements are digitized by scalar quantizers. Subsequently, these data are transmitted via a digital wireless communication system. A new source/channel coding scheme is presented that achieves a very low mean square error (MSE) of the analog physical values when they are...
Using mutually shift orthogonal spreading codes, block spread code division multiple access (BS-CDMA) systems have been shown to achieve multiuser interference (MUI) free reception when signals of all the users arrive at the base station synchronously. In practice, imperfect synchronization destroys the orthogonality among users and causes MUI. We present in this paper the design of spreading and...
Some mobile ad hoc networks (MANETs) such as inter-vehicle communications require a transmission scheme that is robust to mobility and asynchronous reception with low setup overhead. However, many existing cooperative MANETs have complex MAC protocol and high overhead. In this paper, we propose a cross-layer design across the routing, MAC and PHY layers, called delay-tolerant cooperative diversity...
Polar coding is a recently introduced capacity-achieving code constructing method for binary-input discrete memoryless channels. We present a method to improve the finite-length performance of polar codes together with successive cancellation (SC) decoding by means of simple and short inner block codes. Example simulations show an improvement of about 0.3 dB.
In this paper, we investigate the cooperative communication performance involving space-time block codes (STBC), channel coding, network code and turbo decoding in a wireless Ad-hoc network scenario where two relays are employed for communications from a number of senders to a common sink. To reduce bandwidth and achieve diversity gain, STBC is applied at the two relays. Based on whether network coding...
In this paper, we propose a multi-antenna system concatenated Low-density Parity-check (LDPC) codes and Differential Space-time Block codes (DSTBC), in which channel state information (CSI) is unknown to the transmitter and the receiver. The system performance is given through computer simulation, we can see that the proposed system not only provides transmit diversity gain but also coding gain.
In this paper, we present a construction method of terminated non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an expansion of Felstrom and Zigangirov construction [1] for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary LDPC convolutional codes is also discussed. The proposed rate-compatible code is designed from one single mother...
In this paper we propose two image watermarking algorithms, which are robust to cropping operation using self-synchronization mechanism. In both algorithms, the watermark sequence is firstly encoded by non-cyclic Low Density Parity Check Codes (LDPC) and then it is embedded into the block-wised Discrete Cosine Transform (DCT) coefficients using the Quantization Index Modulation (QIM) algorithm. In...
Topological quantum error-correcting codes are defined by geometrically local checks on a two-dimensional lattice of quantum bits (qubits), making them particularly well suited for fault-tolerant quantum information processing. Here, we present a decoding algorithm for topological codes that is faster than previously known algorithms and applies to a wider class of topo-logical codes. Our algorithm...
This paper gives the system model and the STBC encoding and decoding schemes in MIMO-OFDM system according to STBC coding theories. It focuses on researching and simulating the MIMO-OFDM system's performances, which had added STBC. We had analyzed and simulated BER performance of the system with different number of transceiver antennas. At the same time, BER performance of the system with different...
A multiple-input multiple-output (MIMO) single-carrier frequency domain equalization (SC-FDE) testbed which can emulate a practical broadband system is described. A scheme combining space-time transmit diversity with SC-FDE was implemented and evaluated on the testbed. After the hardware configuration, software algorithms incorporating the space-time block coding and decoding, synchronization, channel...
Recently, Guo and Xia gave sufficient conditions for an STBC to achieve full diversity when a PIC (Partial Interference Cancellation) or a PIC-SIC (PIC with Successive Interference Cancellation) decoder is used at the receiver. In this paper, we give alternative conditions for an STBC to achieve full diversity with PIC and PIC-SIC decoders, which are equivalent to Guo and Xia's conditions, but are...
We introduce a new class of constant dimension codes called orbit codes. The basic properties of these codes are derived. It will be shown that many of the known families of constant dimension codes in the literature are actually orbit codes.
In this paper, we investigate Causal Cognitive Interference Channel (CC-IFC) with delay in which the cognitive user transmission can depend on L future received symbols as well as the past ones. We study two special cases: CC-IFC without delay (L = 1), where the cognitive user can use only current and past received symbols, and CC-IFC with a block length delay (L = n), wherein the entire received...
Linear block codes over noisy channels causing both erasures and errors can be decoded by deleting the erased symbols and decoding the resulting vector with respect to a punctured code and then retrieving the erased symbols. This can be accomplished using separating parity-check matrices. For a given maximum number of correctable erasures, such matrices yield parity-check equations that do not check...
A coding scheme for the discrete memoryless broadcast channel with (possible noisy) feedback is proposed, and the corresponding achievable region derived. The scheme is based on a block-Markov strategy where in each block the transmitter sends fresh data and update information that allows the receivers to improve the channel outputs observed in the previous block. The region is analyzed for two specific...
We present a class of algorithms for encoding data in memories with stuck cells. These algorithms rely on earlier code constructions termed cyclic Partitioned Linear Block Codes. For the corresponding q-ary BCH-like codes for u stucks in a codeword of length n, our encoding algorithm has complexity O((u logq n)2) Fq operations, which we will show compares favorably to a generic approach based on Gaussian...
A threshold analysis of terminated generalized LDPC convolutional codes (GLDPC CCs) is presented for the binary erasure channel. Different ensembles of protograph-based GLDPC CCs are considered, including braided block codes (BBCs). It is shown that the terminated PG-GLDPC CCs have better thresholds than their block code counterparts. Surprisingly, our numerical analysis suggests that for large termination...
In this paper, a new construction of quasi-cyclic low-density parity-check (QC-LDPC) codes for unequal error protection (UEP) is proposed. We first give a new class of UEP block codes. QC-LDPC codes with binomial-term parity-check matrices which can avoid girths less than 8 and achieve an enlarged upper bound on the minimum distance are also introduced. An effective UEP scheme based on the proposed...
Bit-wise unequal error protection problem with two layers is considered for variable length block-codes with feedback. Inner and outer bounds are derived for achievable performance for finite expected decoding time. These bounds completely characterize the error exponent of the special bits as a function of overall rate R, overall error exponent E and the rate of the special bits Rs. Single message...
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.