A unified framework for tree search decoding: rediscovering the sequential decoder

We consider receiver design for coded transmission over linear Gaussian channels. We restrict ourselves to the class of lattice codes and formulate the joint detection and decoding problem as a closest lattice point search (CLPS). Here, a tree search framework for solving the CLPS is adopted. In our framework, the CLPS algorithm is decomposed into the preprocessing and tree search stages. The role of the preprocessing stage is to expose the tree structure in a form matched to the search stage. We argue that the forward and feedback (matrix) filters of the minimum mean-square error decision feedback equalizer (MMSE-DFE) are instrumental for solving the joint detection and decoding problem in a single search stage. It is further shown that MMSE-DFE filtering allows for solving underdetermined linear systems and using lattice reduction methods to diminish complexity, at the expense of a marginal performance loss. For the search stage, we present a generic method, based on the branch and bound (BB) algorithm, and show that it encompasses all existing sphere decoders as special cases. The proposed generic algorithm further allows for an interesting classification of tree search decoders, sheds more light on the structural properties of all known sphere decoders, and inspires the design of more efficient decoders. In particular, an efficient decoding algorithm that resembles the well-known Fano sequential decoder is identified. The excellent performance-complexity tradeoff achieved by the proposed MMSE-DFE Fano decoder is established via simulation results and analytical arguments in several multiple-input multiple-output (MIMO) and intersymbol interference (ISI) scenarios.     

Assembly and Characterizations of Bifunctional Fluorescent and Magnetic Microneedles With One Decade Length Tunability

This report presents the fabrication of bifunctional magnetic and fluorescent microneedles (µNDs) made of a ternary mixture of magnetic nanoparticles (NPs), quantum dots (QDs), and polyelectrolyte. The assembly relies on the electrostatic complexation of negatively charged NPs with positively charged polymer strands and is controlled by the charge ratio between the nanoparticle building blocks and the polymer mortar. The resulting 1D objects can be actuated using an external magnetic field and can be imaged using fluorescence microscopy, thanks to the fluorescent and superparamagnetic properties inherited from their NP constituents. Using a combination of core and surface characterizations and a state‐of‐the‐art image analysis algorithm, the dependence of the brightness and length on the ternary composition is thoroughly investigated. In particular, statistics on hundreds of µNDs with a range of compositions show that the µNDs have a log‐lormal length distribution and that their mean length can be robustly tuned in the 5–50 µm range to match the relevant length scales of various applications in micromixing, bioassays or biomechanics.     

Dual Band PIFA MIMO Antenna Design with High Isolation for Mobile and Wireless Applications by Using the Genetics Algorithms and Non-uniform Overlapping Method

Wireless Personal Communications - Due to the development and growth of Internet platforms and web services as communication resources, the competition for the network and its limited resources is...     

Improved Turbo Decoding Using Soft Combining Principle

One great challenge in wireless communication systems is to ensure reliable communications. Turbo codes are known by their interesting capabilities to deal with transmission errors. In this paper, we present a novel turbo decoding scheme based on soft combining principle. Our method improves decoding performance using soft combining technique inside the turbo decoder. Working on Max-Log-Maximum a Posteriori (Max-Log-MAP) turbo decoding algorithm and using an Additive White Gaussian Noise (AWGN) channel model and 16 Quadrature Amplitude Modulation (16QAM), simulation results show that the suggested solution is efficient and outperforms the conventional Max-Log-MAP algorithm in terms of Bit Error Rate (BER). The performance analysis is carried out in terms of BER by varying parameters such as the Energy per bit to Noise power spectral density ratio ( \(\text {E}_{\text {b}}/\text {N}_{\text {o}}\) ), and decoding iterations number. We call our proposed solution Soft Combined Turbo Codes.     

A Multichannel QoS MAC with Dynamic Transmit Opportunity for VANets

One of the most challenging issues facing vehicular networks lies in the design of an efficient MAC protocol due to the mobile nature of nodes and the interference associated with the dynamic environment. Moreover delay constraints for safety applications add complexity and latency requirements to the design. Existing MAC protocols overcome some challenges however don’t provide an integrated solution. Hence, the merit if this work lies in designing an efficient MAC protocol that incorporates various VANet’s challenges in a complete end-to-end solution. In this work, we propose an efficient Multichannel QoS Cognitive MAC (MQOG). MQOG assesses the quality of channel prior to transmission employing dynamic channel allocation and negotiation algorithms to achieve significant increase in channel reliability, throughput and delay constraints while simultaneously addressing Quality of Service. The uniqueness of MQOG lies in making use of the free unlicensed bands. The proposed protocols were implemented in OMNET++ 4.1, and extensive experiments demonstrated a faster and more efficient reception of safety messages compared to existing VANet MAC Protocols. Finally, improvements in delay, packet delivery ratios and throughput were captured.     

Traffic classification and scheduling in ATM networks

Virtual paths (VPs) are an integral part of the resource management and control hierarchy of ATM (asynchronous transfer mode) networks. To improve the utilization of network resources and facilitate management and control, source types are organized into traffic classes. Each traffic class is transported by its own virtual path subnetwork. In this paper, we consider issues related to the design of traffic classes. We consider an ATM switch node to which cells arrive from a diverse set of source types. Traffic classes are assumed to be served according to a weighted round robin policy, while cells belonging to a given traffic class are served in first-come-first-served order. We consider the problem of determining the optimal set of traffic classes. Under suitable simplifying assumptions, it is shown that the above problem can be modeled as a set-partitioning problem. The structure of the problem at hand is then exploited to develop an efficient heuristic. Several examples are given to illustrate the developed methodology.Supported partially through NSF Grant NCR-891447 and AT&T Grant 5-23690.     

On the generation of test patterns for multiple faults

This article presents a new method to generate test patterns for multiple stuck-at faults in combinational circuits. We assume the presence of all multiple faults of all multiplicities and we do not resort to their explicit enumeration: the target fault is a single component of possibly several multiple faults. New line and gate models are introduced to handle multiple fault effect propagation through the circuits. The method tries to generate test conditions that propagate the effect of the target fault to primary outputs. When these conditions are fulfilled, the input vector is a test for the target fault and it is guaranteed that all multiple faults of all multiplicities containing the target fault as component are also detected. The method uses similar techniques to those in FAN and SOCRATES algorithms to guide the search part of the algorithm, and includes several new heuristics to enhance the performance and fault detection capability. Experiments performed on the ISCAS'85 benchmark circuits show that test sets for multiple faults can be generated with high fault coverage and a reasonable increase in cost over test generation for single stuck-at faults.     

Modified tracking loop for DS spread spectrum systems

A nonconventional pseudo-noise (PN) code tracking loop for direct sequence (DS) spread spectrum systems is presented. It solves problems of component imbalance while maintaining hardware simplicity.<>