Comprehensive Two-Point Analyses of Weak Gravitational Lensing Surveys

We present a framework for analyzing weak gravitational lensing survey data, including lensing and source-density observables, plus spectroscopic redshift calibration data. All two-point observables are predicted in terms of parameters of a perturbed Robertson-Walker metric, making the framework independent of the models for gravity, dark energy, or galaxy properties. For Gaussian fluctuations the 2-point model determines the survey likelihood function and allows Fisher-matrix forecasting. The framework includes nuisance terms for the major systematic errors: shear measurement errors, magnification bias and redshift calibration errors, intrinsic galaxy alignments, and inaccurate theoretical predictions. We propose flexible parameterizations of the many nuisance parameters related to galaxy bias and intrinsic alignment. For the first time we can integrate many different observables and systematic errors into a single analysis. As a first application of this framework, we demonstrate that: uncertainties in power-spectrum theory cause very minor degradation to cosmological information content; nearly all useful information (excepting baryon oscillations) is extracted with ~3 bins per decade of angular scale; and the rate at which galaxy bias varies with redshift substantially influences the strength of cosmological inference. The framework will permit careful study of the interplay between numerous observables, systematic errors, and spectroscopic calibration data for large weak-lensing surveys.Comment: submitted to Ap

Random Access in Massive MIMO by Exploiting Timing Offsets and Excess Antennas

Massive MIMO systems, where base stations are equipped with hundreds of antennas, are an attractive way to handle the rapid growth of data traffic. As the number of user equipments (UEs) increases, the initial access and handover in contemporary networks will be flooded by user collisions. In this paper, a random access protocol is proposed that resolves collisions and performs timing estimation by simply utilizing the large number of antennas envisioned in Massive MIMO networks. UEs entering the network perform spreading in both time and frequency domains, and their timing offsets are estimated at the base station in closed-form using a subspace decomposition approach. This information is used to compute channel estimates that are subsequently employed by the base station to communicate with the detected UEs. The favorable propagation conditions of Massive MIMO suppress interference among UEs whereas the inherent timing misalignments improve the detection capabilities of the protocol. Numerical results are used to validate the performance of the proposed procedure in cellular networks under uncorrelated and correlated fading channels. With $2.5\times10^3$ UEs that may simultaneously become active with probability 1\% and a total of $16$ frequency-time codes (in a given random access block), it turns out that, with $100$ antennas, the proposed procedure successfully detects a given UE with probability 75\% while providing reliable timing estimates.Comment: 30 pages, 6 figures, 1 table, submitted to Transactions on Communication

AMPA experimental communications systems

The program was conducted to demonstrate the satellite communication advantages of Adaptive Phased Array Technology. A laboratory based experiment was designed and implemented to demonstrate a low earth orbit satellite communications system. Using a 32 element, L-band phased array augmented with 4 sets of weights (2 for reception and 2 for transmission) a high speed digital processing system and operating against multiple user terminals and interferers, the AMPA system demonstrated: communications with austere user terminals, frequency reuse, communications in the face of interference, and geolocation. The program and experiment objectives are described, the system hardware and software/firmware are defined, and the test performed and the resultant test data are presented

Reduced-Dimension Linear Transform Coding of Correlated Signals in Networks

A model, called the linear transform network (LTN), is proposed to analyze the compression and estimation of correlated signals transmitted over directed acyclic graphs (DAGs). An LTN is a DAG network with multiple source and receiver nodes. Source nodes transmit subspace projections of random correlated signals by applying reduced-dimension linear transforms. The subspace projections are linearly processed by multiple relays and routed to intended receivers. Each receiver applies a linear estimator to approximate a subset of the sources with minimum mean squared error (MSE) distortion. The model is extended to include noisy networks with power constraints on transmitters. A key task is to compute all local compression matrices and linear estimators in the network to minimize end-to-end distortion. The non-convex problem is solved iteratively within an optimization framework using constrained quadratic programs (QPs). The proposed algorithm recovers as special cases the regular and distributed Karhunen-Loeve transforms (KLTs). Cut-set lower bounds on the distortion region of multi-source, multi-receiver networks are given for linear coding based on convex relaxations. Cut-set lower bounds are also given for any coding strategy based on information theory. The distortion region and compression-estimation tradeoffs are illustrated for different communication demands (e.g. multiple unicast), and graph structures.Comment: 33 pages, 7 figures, To appear in IEEE Transactions on Signal Processin

Study of radar pulse compression for high resolution satellite altimetry

Pulse compression techniques are studied which are applicable to a satellite altimeter having a topographic resolution of + 10 cm. A systematic design procedure is used to determine the system parameters. The performance of an optimum, maximum likelihood processor is analysed, which provides the basis for modifying the standard split-gate tracker to achieve improved performance. Bandwidth considerations lead to the recommendation of a full deramp STRETCH pulse compression technique followed by an analog filter bank to separate range returns. The implementation of the recommended technique is examined

Study of a navigation and traffic control technique employing satellites. Volume 3 - User hardware Interim report

User hardware configurations and requirements for navigation and air traffic control technique using satellite

Method and apparatus for decoding compatible convolutional codes

This invention relates to learning decoders for decoding compatible convolutional codes. The decoder decodes signals which have been encoded by a convolutional coder and allows performance near the theoretical limit of performance for coded data systems. The decoder includes a sub-bit shift register wherein the received sub-bits are entered after regeneration and shifted in synchronization with a clock signal recovered from the received sub-bit stream. The received sub-bits are processed by a sub-bit decision circuit, entered into a sub-bit shift register, decoded by a decision circuit, entered into a data shift register, and updated to reduce data errors. The bit decision circuit utilizes stored sub-bits and stored data bits to determine subsequent data-bits. Data errors are reduced by using at least one up-date circuit

Random Access in Uplink Massive MIMO Systems: How to exploit asynchronicity and excess antennas

Massive MIMO systems, where the base stations are equipped with hundreds of antennas, are an attractive way to handle the rapid growth of data traffic. As the number of users increases, the initial access and handover in contemporary networks will be flooded by user collisions. In this work, we propose a random access procedure that resolves collisions and also performs timing, channel, and power estimation by simply utilizing the large number of antennas envisioned in massive MIMO systems and the inherent timing misalignments of uplink signals during network access and handover. Numerical results are used to validate the performance of the proposed solution under different settings. It turns out that the proposed solution can detect all collisions with a probability higher than 90%, at the same time providing reliable timing and channel estimates. Moreover, numerical results demonstrate that it is robust to overloaded situations.Comment: submitted to IEEE Globecom 2016, Washington, DC US