This paper proposes a novel Nyquist-rate analog-to-digital (A/D) conversion algorithm which achieves exponential accuracy in the bit-rate despite using imperfect components. The proposed algorithm is based on a robust implementation of a beta-encoder where the value of the base beta is equal to golden mean. It was previously shown that beta-encoders can be implemented in such a way that their exponential accuracy is robust against threshold offsets in the quantizer element. This paper extends this result by allowing for imperfect analog multipliers with imprecise gain values as well. A formal computational model for algorithmic encoders and a general test bed for evaluating their robustness is also proposed.
In this paper we present a block coded modulation scheme for a 2 x 2 MIMO system over slow fading channels, where the inner code is the Golden Code. The scheme is based on a set partitioning of the Golden Code using two-sided ideals whose norm is a power of two. In this case, a lower bound for the minimum determinant is given by the minimum Hamming distance. The description of the ring structure of the quotients suggests further optimization in order to improve the overall distribution of determinants. Performance simulations show that the GC-RS schemes achieve a significant gain over the uncoded Golden Code.
In this study, we propose a flexible construction of complementary sequences (CSs) that can contain zero-valued elements. To derive the construction, we use Boolean functions to represent a polynomial generated with a recursion. By applying this representation to recursive CS constructions, we show the impact of construction parameters such as sign, amplitude, phase rotation used in the recursion on the elements of the synthesized CS. As a result, we extend Davis and Jedwabs CS construction by obtaining independent functions for the amplitude and phase of each element of the CS, and the seed sequence positions in the CS. The proposed construction shows that a set of distinct CSs compatible with non-contiguous resource allocations for orthogonal frequency-division multiplexing (OFDM) and various constellations can be synthesized systematically. It also leads to a low peak-to-mean-envelope-power ratio (PMEPR) multiple accessing scheme in the uplink and a low-complexity recursive decoder. We demonstrate the performance of the proposed encoder and decoder through comprehensive simulations.
We construct a strongly local regular Dirichlet form on the golden ratio Sierpinski gasket, which is a self-similar set without any finitely ramified cell structure, via a study on the trace of electrical networks on an infinite graph. The Dirichlet form is self-similar in the sense of an infinite iterated function system, and is decimation invariant with respect to a graph-directed construction. A theorem of uniqueness is also provided. Lastly, the associated process satisfies the two-sided sub-Gaussian heat kernel estimate.
A simple analytical tool based on stochastic ordering is developed to compare the distributions of carrier-to-interference ratio at the mobile station of two cellular systems where the base stations are distributed randomly according to certain non-homogeneous Poisson point processes. The comparison is conveniently done by studying only the base station densities without having to solve for the distributions of the carrier-to-interference ratio, that are often hard to obtain.
We discuss the Waring rank of binary forms of degree 4 and 5, without multiple factors, and point out unexpected relations to the harmonic cross-ratio, j-invariants and the golden ratio. These computations of ranks for binary forms are used to show that the combinatorics of a line arrangement in the complex projective plane does not determine the Waring rank of the defining equation even in very simple situations.