11 research outputs found
Network Coherence Time Matters - Aligned Image Sets and the Degrees of Freedom of Interference Networks with Finite Precision CSIT and Perfect CSIR
This work obtains the first bound that is provably sensitive to network
coherence time, i.e., coherence time in an interference network where all
channels experience the same coherence patterns. This is accomplished by a
novel adaptation of the aligned image sets bound, and settles various open
problems noted previously by Naderi and Avestimehr and by Gou et al. For
example, a necessary and sufficient condition is obtained for the optimality of
1/2 DoF per user in a partially connected interference network where the
channel state information at the receivers (CSIR) is perfect, the channel state
information at the transmitters (CSIT) is instantaneous but limited to finite
precision, and the network coherence time is T_c= 1. The surprising insight
that emerges is that even with perfect CSIR and instantaneous finite precision
CSIT, network coherence time matters, i.e., it has a DoF impact.Comment: 19 pages, 4 figure
Antenna Systems
This book offers an up-to-date and comprehensive review of modern antenna systems and their applications in the fields of contemporary wireless systems. It constitutes a useful resource of new material, including stochastic versus ray tracing wireless channel modeling for 5G and V2X applications and implantable devices. Chapters discuss modern metalens antennas in microwaves, terahertz, and optical domain. Moreover, the book presents new material on antenna arrays for 5G massive MIMO beamforming. Finally, it discusses new methods, devices, and technologies to enhance the performance of antenna systems
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
Near-capacity fixed-rate and rateless channel code constructions
Fixed-rate and rateless channel code constructions are designed for satisfying conflicting design tradeoffs, leading to codes that benefit from practical implementations, whilst offering a good bit error ratio (BER) and block error ratio (BLER) performance. More explicitly, two novel low-density parity-check code (LDPC) constructions are proposed; the first construction constitutes a family of quasi-cyclic protograph LDPC codes, which has a Vandermonde-like parity-check matrix (PCM). The second construction constitutes a specific class of protograph LDPC codes, which are termed as multilevel structured (MLS) LDPC codes. These codes possess a PCM construction that allows the coexistence of both pseudo-randomness as well as a structure requiring a reduced memory. More importantly, it is also demonstrated that these benefits accrue without any compromise in the attainable BER/BLER performance. We also present the novel concept of separating multiple users by means of user-specific channel codes, which is referred to as channel code division multiple access (CCDMA), and provide an example based on MLS LDPC codes. In particular, we circumvent the difficulty of having potentially high memory requirements, while ensuring that each user’s bits in the CCDMA system are equally protected. With regards to rateless channel coding, we propose a novel family of codes, which we refer to as reconfigurable rateless codes, that are capable of not only varying their code-rate but also to adaptively modify their encoding/decoding strategy according to the near-instantaneous channel conditions. We demonstrate that the proposed reconfigurable rateless codes are capable of shaping their own degree distribution according to the nearinstantaneous requirements imposed by the channel, but without any explicit channel knowledge at the transmitter. Additionally, a generalised transmit preprocessing aided closed-loop downlink multiple-input multiple-output (MIMO) system is presented, in which both the channel coding components as well as the linear transmit precoder exploit the knowledge of the channel state information (CSI). More explicitly, we embed a rateless code in a MIMO transmit preprocessing scheme, in order to attain near-capacity performance across a wide range of channel signal-to-ratios (SNRs), rather than only at a specific SNR. The performance of our scheme is further enhanced with the aid of a technique, referred to as pilot symbol assisted rateless (PSAR) coding, whereby a predetermined fraction of pilot bits is appropriately interspersed with the original information bits at the channel coding stage, instead of multiplexing pilots at the modulation stage, as in classic pilot symbol assisted modulation (PSAM). We subsequently demonstrate that the PSAR code-aided transmit preprocessing scheme succeeds in gleaning more information from the inserted pilots than the classic PSAM technique, because the pilot bits are not only useful for sounding the channel at the receiver but also beneficial for significantly reducing the computational complexity of the rateless channel decoder
Abstracts on Radio Direction Finding (1899 - 1995)
The files on this record represent the various databases that originally composed the CD-ROM issue of "Abstracts on Radio Direction Finding" database, which is now part of the Dudley Knox Library's Abstracts and Selected Full Text Documents on Radio Direction Finding (1899 - 1995) Collection. (See Calhoun record https://calhoun.nps.edu/handle/10945/57364 for further information on this collection and the bibliography).
Due to issues of technological obsolescence preventing current and future audiences from accessing the bibliography, DKL exported and converted into the three files on this record the various databases contained in the CD-ROM.
The contents of these files are:
1) RDFA_CompleteBibliography_xls.zip [RDFA_CompleteBibliography.xls: Metadata for the complete bibliography, in Excel 97-2003 Workbook format; RDFA_Glossary.xls: Glossary of terms, in Excel 97-2003 Workbookformat; RDFA_Biographies.xls: Biographies of leading figures, in Excel 97-2003 Workbook format];
2) RDFA_CompleteBibliography_csv.zip [RDFA_CompleteBibliography.TXT: Metadata for the complete bibliography, in CSV format; RDFA_Glossary.TXT: Glossary of terms, in CSV format; RDFA_Biographies.TXT: Biographies of leading figures, in CSV format];
3) RDFA_CompleteBibliography.pdf: A human readable display of the bibliographic data, as a means of double-checking any possible deviations due to conversion
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