Bandwidth compression of noisy signals with square-wave subcarrier

This article discusses a method for downconverting the square-wave subcarrier of spacecraft signals, such as the one from Galileo, which results in a compression bandwidth that lowers the sample rate significantly. The study is focused on three issues. The first is the selection of an adequate down-mixing signal for the resulting signal to have a format similar to that of the original signal, except at a lower subcarrier frequency. The second is the control of the noise level so that the signal to noise ratio is not degraded due to the downconversion. The third is to determine the bandwidth of the downconverted signal considering the uncertainty of the residual carrier frequency

Symbol signal-to-noise ratio loss in square-wave subcarrier downconversion

This article presents the simulated results of the signal-to-noise ratio (SNR) loss in the process of a square-wave subcarrier down conversion. In a previous article, the SNR degradation was evaluated at the output of the down converter based on the signal and noise power change. Unlike in the previous article, the SNR loss is defined here as the difference between the actual and theoretical symbol SNR's for the same symbol-error rate at the output of the symbol matched filter. The results show that an average SNR loss of 0.3 dB can be achieved with tenth-order infinite impulse response (IIR) filters. This loss is a 0.2-dB increase over the SNR degradation in the previous analysis where neither the signal distortion nor the symbol detector was considered

SNR degradation in square-wave subcarrier downconversion

This article presents a study of signal-to-noise ratio (SNR) degradation in the process of square-wave subcarrier downconversion. The study shows three factors that contribute to the SNR degradation: the cutoff of the higher frequency components in the data, the approximation of a square wave with a finite number of harmonics, and nonideal filtering. Both analytical and simulation results are presented

Constructions of Large Graphs on Surfaces

We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface $\Sigma$ and integers $\Delta$ and $k$, determine the maximum order $N(\Delta,k,\Sigma)$ of a graph embeddable in $\Sigma$ with maximum degree $\Delta$ and diameter $k$. We introduce a number of constructions which produce many new largest known planar and toroidal graphs. We record all these graphs in the available tables of largest known graphs. Given a surface $\Sigma$ of Euler genus $g$ and an odd diameter $k$, the current best asymptotic lower bound for $N(\Delta,k,\Sigma)$ is given by $$\sqrt{\frac{3}{8}g}\Delta^{\lfloor k/2\rfloor}.$$ Our constructions produce new graphs of order \begin{cases}6\Delta^{\lfloor k/2\rfloor}& \text{if $\Sigma$ is the Klein bottle}\\ \(\frac{7}{2}+\sqrt{6g+\frac{1}{4}}\)\Delta^{\lfloor k/2\rfloor}& \text{otherwise,}\end{cases} thus improving the former value by a factor of 4.Comment: 15 pages, 7 figure

On large bipartite graphs of diameter 3

We consider the bipartite version of the {\it degree/diameter problem}, namely, given natural numbers $d\ge2$ and $D\ge2$, find the maximum number $\N^b(d,D)$ of vertices in a bipartite graph of maximum degree $d$ and diameter $D$. In this context, the bipartite Moore bound \M^b(d,D) represents a general upper bound for $\N^b(d,D)$. Bipartite graphs of order \M^b(d,D) are very rare, and determining $\N^b(d,D)$ still remains an open problem for most $(d,D)$ pairs. This paper is a follow-up to our earlier paper \cite{FPV12}, where a study on bipartite $(d,D,-4)$-graphs (that is, bipartite graphs of order \M^b(d,D)-4) was carried out. Here we first present some structural properties of bipartite $(d,3,-4)$-graphs, and later prove there are no bipartite $(7,3,-4)$-graphs. This result implies that the known bipartite $(7,3,-6)$-graph is optimal, and therefore $\N^b(7,3)=80$. Our approach also bears a proof of the uniqueness of the known bipartite $(5,3,-4)$-graph, and the non-existence of bipartite $(6,3,-4)$-graphs. In addition, we discover three new largest known bipartite (and also vertex-transitive) graphs of degree 11, diameter 3 and order 190, result which improves by 4 vertices the previous lower bound for $\N^b(11,3)$

Applying stress-testing on value at risk (VaR) methodologies

In recent years, Value at Risk (VaR) methodologies, i. e., Parametric VaR, Historical Simulation and the Monte Carlo Simulation have experienced spectacular growth within the new regulatory framework which is Basle II. Moreover, complementary analyses such a Stress-testing and Back-testing have also demonstrated their usefulness for financial risk managers. In this paper, we develop an empirical Stress-Testing exercise by using two historical scenarios of crisis. In particular, we analyze the impact of the 11-S attacks (2001) and the Latin America crisis (2002) on the level of risk, previously calculated by different statistical methods. Consequently, we have selected a Spanish stock portfolio in order to focus on market risk

Writers and Exile: Carlos Bulosan and Dolores Stephens Feria

This paper explores the links between two writers in exile – Carlos Bulosan, aFilipino migrant in the United States, and Dolores Stephens Feria, an Americanmigrant in the Philippines. Its aim is to gather more insight into the “conditionof exile” as a framework for understanding writers and literary traditions. Forthe author, being the daughter of Dolores, this is both a personal and academicexploration