FPGA-Based Channel Coding Architectures for 5G Wireless Using High-Level Synthesis

We propose strategies to achieve a high-throughput FPGA architecture for quasi-cyclic low-density parity-check codes based on circulant-1 identity matrix construction. By splitting the node processing operation in the min-sum approximation algorithm, we achieve pipelining in the layered decoding schedule without utilizing additional hardware resources. High-level synthesis compilation is used to design and develop the architecture on the FPGA hardware platform. To validate this architecture, an IEEE 802.11n compliant 608 Mb/s decoder is implemented on the Xilinx Kintex-7 FPGA using the LabVIEW FPGA Compiler in the LabVIEW Communication System Design Suite. Architecture scalability was leveraged to accomplish a 2.48 Gb/s decoder on a single Xilinx Kintex-7 FPGA. Further, we present rapidly prototyped experimentation of an IEEE 802.16 compliant hybrid automatic repeat request system based on the efficient decoder architecture developed. In spite of the mixed nature of data processing—digital signal processing and finite-state machines—LabVIEW FPGA Compiler significantly reduced time to explore the system parameter space and to optimize in terms of error performance and resource utilization. A 4x improvement in the system throughput, relative to a CPU-based implementation, was achieved to measure the error-rate performance of the system over large, realistic data sets using accelerated, in-hardware simulation

Enabling Technology in Optical Fiber Communications: From Device, System to Networking

This book explores the enabling technology in optical fiber communications. It focuses on the state-of-the-art advances from fundamental theories, devices, and subsystems to networking applications as well as future perspectives of optical fiber communications. The topics cover include integrated photonics, fiber optics, fiber and free-space optical communications, and optical networking

D 3. 3 Final performance results and consolidated view on the most promising multi -node/multi -antenna transmission technologies

This document provides the most recent updates on the technical contributions and research challenges focused in WP3. Each Technology Component (TeC) has been evaluated under possible uniform assessment framework of WP3 which is based on the simulation guidelines of WP6. The performance assessment is supported by the simulation results which are in their mature and stable state. An update on the Most Promising Technology Approaches (MPTAs) and their associated TeCs is the main focus of this document. Based on the input of all the TeCs in WP3, a consolidated view of WP3 on the role of multinode/multi-antenna transmission technologies in 5G systems has also been provided. This consolidated view is further supported in this document by the presentation of the impact of MPTAs on METIS scenarios and the addressed METIS goals.Aziz, D.; Baracca, P.; De Carvalho, E.; Fantini, R.; Rajatheva, N.; Popovski, P.; Sørensen, JH.... (2015). D 3. 3 Final performance results and consolidated view on the most promising multi -node/multi -antenna transmission technologies. http://hdl.handle.net/10251/7675

13th Annual Review of Progress in Applied Computational Electromagnetics at the Naval Postgraduate School, Monterey, CA, March 17-21, 1997, Conference Proceedings Volumes I & II

Includes Volumes 1 &

Middle Atmosphere Program. Handbook for MAP, volume 28

Extended abstracts from the fourth workshop on the technical and scientific aspects of MST (mesosphere stratosphere troposphere) radar are presented. Individual sessions addressed the following topics: meteorological applications of MST and ST radars, networks, and campaigns; dynamics of the equatorial middle atmosphere; interpretation of radar returns from clear air; techniques for studying gravity waves and turbulence; intercomparison and calibration of wind and wave measurements at various frequencies; progress in existing and planned MST and ST radars; hardware design for MST and ST radars and boundary layer/lower troposphere profilers; signal processing; and data management

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words