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.
RF fingerprinting exploits the variations in the RF chain of radios to uniquely identify transmitters, and distinguish adversarial transmissions from transmissions of legitimate nodes. We provide a systematic approach rooted from information theory to evaluate basic performance limits of RF fingerprinting. We develop a novel channel model for RF fingerprinting, where the imperfections in the RF chain...
This paper compares the performance of a blind relay communication system with that of a non-blind relay communication system. For a blind system, a differential space-time block code (DSTBC) or a blind Viterbi detection is used, and for a non-blind system, a space-time block code (STBC) is used. Also, this paper takes another blind detection mechanism, the Zhang's code, and compares its performance...
This paper presents a novel parallel breadth-first detection scheme for Multiple-Input Multiple-Output (MIMO) systems called Partial Inter-layer Parallel Sphere Decoder (PIPS-D). By introducing a new form of complex-to-real lattice transformation, the proposed algorithm can simultaneously compute every two adjacent layers of the equivalent search tree, thus significantly reducing the total execution...
Fountain code is a class of graph-based linear erasure codes, which can effectively solve the problems such as network congestion and feedback cracking for its characteristics of rateless and can resume when interrupted, and has a lower complexity of encoding and decoding. However, there are still some problems in the process of encoding and decoding, including the degree distribution structure may...
This paper proposes two schemes for a two-way relay channel based on Alamouti code. The proposed schemes enable symbol-by-symbol decoding and improve the diversity gain.
In this paper we present a code design technique which produces codes for syndrome coding which have better secrecy than the best error correcting codes. Code examples are given for the case where the number of parity bits of the code is equal to 15. The code design technique presented is based on extensions of the parity check matrix of a set of good equivocation codes of shorter length. It is also...
Parallel Turbo decoding encounters conflicts during parallel data accesses because of the sequential data interleaving, and the conflicts lead to a serious decrease of throughput. Traditional conflict-free memory mapping schemes often require a huge cost of hardware, such as the area of memory, which is also a bottleneck in practical implementations. In this work, DSATUR (Degree of Saturation) coloring...
In wireless single-hop multicast with network coding based Automatic Repeat reQuest (NC-ARQ) scheme, the sender needs to combine one or several lost packets as one retransmission packet to reduce the number of multicast transmissions. This paper proposes a new scheme, called Dynamic Network Coding based ARQ (DNC-ARQ), to improve the efficiency of the multicast transmissions. The main idea is to allow...
We propose a new irregular repeat-accumulate (IRA) coded physical-layer network coding (PNC) scheme for Gaussian two-way relay channels (TWRCs). In the scheme, a same random-coset IRA code over GF(q) is employed at the two users, which directly maps the q-ary message sequences into coded q-PAM symbol sequences. The relay computes the network coded message sequence directly from the superimposed signal...
The list demapper has been widely implemented in a coded multiple-input multiple-output (MIMO) receiver, where only a part of total signal vectors are examined in the calculation of likelihood ratio for low complexity. Generally, the list is generated either in the original or the lattice-reduced domain. In the latter, thanks to the operation of lattice reduction (LR), a better-conditioned MIMO channel...
Sphere decoding (SD) algorithm, as one of the main vector detection mechanisms in digital communication systems, has been referred to have polynomial complexity over a wide range of signal-to-noise ratios (SNRs), rates, and numbers of antennas. The first part of this paper discusses the expected complexity of the SD algorithm over all input SNRs and numbers of antennas, and derives the upper bound...
An enlargement of candidate vector set of QR-LRL (QR — Least Reliable Layer) based MIMO detector for efficient soft output generation is proposed. Previous work [8] shows that QR-LRL based MIMO detector approaches hard decision output ML performance, but does not match the soft output ML performance due to empty candidate vector set problem. Performance degradation is more severe when modulation order...
We investigate iterative detection and decoding, a.k.a. turbo detection, for multiple-input multiple-output (MIMO) transmission. This investigation is based on a low complexity softoutput MIMO detector with a priori information feedback. We show that maximum a posteriori performance (without turbo iteration) can be achieved, at a much lower computational cost, by using the proposed soft-output MIMO...
For spatially multiplexed MIMO systems, conventional detection methods such as MLD and QRD-M requires high computational complexity when the number of antennas or modulation level increases. This paper presents a method for reducing the computational complexity with the aid of parity information sent through one of the transmitted symbols. The method utilizes QR decomposition of the channel matrix...
For direct model predictive control schemes with current reference tracking, the underlying integer least-squares (ILS) problem is reformulated to reduce the computational complexity of the solution stage. This is achieved by exploiting the geometry of the ILS problem and by reducing the computations needed for its formulation and solution. A lattice reduction and a sphere decoding algorithm are implemented...
Multilateration (MLAT) and Automatic Dependent Surveillance — Broadcast (ADS-B) systems exploiting the Secondary Surveillance Radar (SSR) channel suffer from garbling. This means that if two or more mode S signals impinge on the receiver at the same or very near time they could not be decoded. To alleviate this problem, many solutions have been proposed, one in particular [1] is effective for a large...
Robust multi-view video transmission over error prone networks is a technical challenge problem for multi-view video coding (MVC). In this paper, a frame loss error concealment scheme is proposed for MVC to address the challenging problem at the decoder side. Different from traditional motion information derivation in temporal domain for single-view video coding, two novel information derivation schemes,...
In this paper, a new method is proposed for constructing frame length specific LDPC codes which consume low power in encoding and decoding processes. A seed matrix is used and extended to form the parity check matrix having frame lengths divisible by 32 and 64. This method can be used to construct the LDPC codes with frame lengths divisible by even higher power of 2. The memory requirements for encoding...
Although the K-best algorithm is well-known as an efficient suboptimal version of the maximum likelihood detection (MLD), its complexity is still significantly affected by the constellation size W. Especially, its sorting task is known as the major bottleneck. In this paper we propose a two dimensional (2D) sorter-based K-best algorithm, whose complexity is negligibly affected by W. Instead of considering...
Polar codes have a regular recursive structure which is feasible for hardware implementation in practice. Quantization is a critical issue in hardware implementation. In this paper, a quantization scheme for successive-cancellation (SC) decoding of polar codes is proposed based on the equivalent channel cutoff rate optimization. Moreover, a modified Gaussian approximation (GA) method exploiting the...
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.