7,063 research outputs found
Vector quantization
During the past ten years Vector Quantization (VQ) has developed from a theoretical possibility promised by Shannon's source coding theorems into a powerful and competitive technique for speech and image coding and compression at medium to low bit rates. In this survey, the basic ideas behind the design of vector quantizers are sketched and some comments made on the state-of-the-art and current research efforts
FORM Matters: Fast Symbolic Computation under UNIX
We give a brief introduction to FORM, a symbolic programming language for
massive batch operations, designed by J.A.M. Vermaseren. In particular, we
stress various methods to efficiently use FORM under the UNIX operating system.
Several scripts and examples are given, and suggestions on how to use the vim
editor as development platform.Comment: 10 pages, PDF document (PDFLaTeX source available upon request) with
2 JPG figures; submitted to Computers & Mathematics with Application
Re-Pair Compression of Inverted Lists
Compression of inverted lists with methods that support fast intersection
operations is an active research topic. Most compression schemes rely on
encoding differences between consecutive positions with techniques that favor
small numbers. In this paper we explore a completely different alternative: We
use Re-Pair compression of those differences. While Re-Pair by itself offers
fast decompression at arbitrary positions in main and secondary memory, we
introduce variants that in addition speed up the operations required for
inverted list intersection. We compare the resulting data structures with
several recent proposals under various list intersection algorithms, to
conclude that our Re-Pair variants offer an interesting time/space tradeoff for
this problem, yet further improvements are required for it to improve upon the
state of the art
A class of AM-QFT algorithms for power-of-two FFT
This paper proposes a class of power-of-two FFT (Fast Fourier Transform)
algorithms, called AM-QFT algorithms, that contains the improved QFT (Quick
Fourier Transform), an algorithm recently published, as a special case. The
main idea is to apply the Amplitude Modulation Double Sideband - Suppressed
Carrier (AM DSB-SC) to convert odd-indices signals into even-indices signals,
and to insert this elaboration into the improved QFT algorithm, substituting
the multiplication by secant function. The 8 variants of this class are
obtained by re-elaboration of the AM DSB-SC idea, and by means of duality. As a
result the 8 variants have both the same computational cost and the same memory
requirements than improved QFT. Differently, comparing this class of 8 variants
of AM-QFT algorithm with the split-radix 3add/3mul (one of the most performing
FFT approach appeared in the literature), we obtain the same number of
additions and multiplications, but employing half of the trigonometric
constants. This makes the proposed FFT algorithms interesting and useful for
fixed-point implementations. Some of these variants show advantages versus the
improved QFT. In fact one of this variant slightly enhances the numerical
accuracy of improved QFT, while other four variants use trigonometric constants
that are faster to compute in `on the fly' implementations
Multiuser MIMO techniques with feedback
Kooperative Antennenanlagen haben vor kurzem einen heißen Forschungsthema geworden, da Sie deutlich höhere spektrale Effizienz als herkömmliche zelluläre Systeme versprechen. Der Gewinn wird durch die Eliminierung von Inter-Zelle Störungen (ICI) durch Koordinierung der-Antenne Übertragungen erworben. Vor kurzem, verteilte Organisation Methoden vorgeschlagen. Eine der größten Herausforderungen für das Dezentrale kooperative Antennensystem ist Kanalschätzung für den Downlink Kanal besonders wenn FDD verwendet wird. Alle zugehörigen Basisstationen im genossenschaftlichen Bereich müssen die vollständige Kanal Informationen zu Wissen, die entsprechenden precoding Gewicht Matrix zu berechnen. Diese Information ist von mobilen Stationen übertragen werden Stationen mit Uplink Ressourcen zu stützen. Wird als mehrere Basisstationen und mehreren mobilen Stationen in kooperativen Antennensysteme und jede Basisstation und Mobilstation beteiligt sind, können mit mehreren Antennen ausgestattet sein, die Anzahl der Kanal Parameter wieder gefüttert werden erwartet, groß zu sein. In dieser Arbeit wird ein effizientes Feedback Techniken der downlink Kanal Informationen sind für die Multi-user Multiple Input Multiple Output Fall vorgeschlagen, der insbesondere auf verteilte kooperative Antennensysteme zielt. Zuerst wird ein Unterraum-basiertes Kanalquantisierungsverfahren vorgeschlagen, das ein vorbestimmtes Codebuch verwendet. Ein iterativer Codebuchentwurfsalgorithmus wird vorgeschlagen, der zu einem lokalen optimalen Codebuch konvergiert. Darüber hinaus werden Feedback-Overhead-Reduktionsverfahren entwickelt, die die zeitliche Korrelation des Kanals ausnutzen. Es wird gezeigt, dass das vorgeschlagene adaptive Codebuchverfahren in Verbindung mit einem Datenkomprimierungsschema eine Leistung nahe an dem perfekten Kanalfall erzielt, was viel weniger Rückkopplungsoverhead im Vergleich zu anderen Techniken erfordert. Das auf dem Unterraum basierende Kanalquantisierungsverfahren wird erweitert, indem mehrere Antennen auf der Senderseite und/oder auf der Empfängerseite eingeführt werden, und die Leistung eines Vorcodierungs- (/Decodierungs-) Schemas mit regulierter Blockdiagonalisierung (RBD) wurde untersucht. Es wird ein kosteneffizientes Decodierungsmatrixquantisierungsverfahren vorgeschlagen, dass eine komplexe Berechnung an der Mobilstation vermeiden kann, während es nur eine leichte Verschlechterung zeigt. Die Arbeit wird abgeschlossen, indem die vorgeschlagenen Feedback-Methoden hinsichtlich ihrer Leistung, ihres erforderlichen Feedback-Overheads und ihrer Rechenkomplexität verglichen werden.Cooperative antenna systems have recently become a hot research topic, as they promise significantly higher spectral efficiency than conventional cellular systems. The gain is acquired by eliminating inter-cell interference (ICI) through coordination of the base antenna transmissions. Recently, distributed organization methods have been suggested. One of the main challenges of the distributed cooperative antenna system is channel estimation for the downlink channel especially when FDD is used. All of the associated base stations in the cooperative area need to know the full channel state information to calculate the corresponding precoding weight matrix. This information has to be transferred from mobile stations to base stations by using uplink resources. As several base stations and several mobile stations are involved in cooperative antenna systems and each base station and mobile station may be equipped with multiple antennas, the number of channel state parameters to be fed back is expected to be big. In this thesis, efficient feedback techniques of the downlink channel state information are proposed for the multi-user multiple-input multiple-output case, targeting distributed cooperative antenna systems in particular. First, a subspace based channel quantization method is proposed which employs a predefined codebook. An iterative codebook design algorithm is proposed which converges to a local optimum codebook. Furthermore, feedback overhead reduction methods are devised exploiting temporal correlation of the channel. It is shown that the proposed adaptive codebook method in conjunction with a data compression scheme achieves a performance close to the perfect channel case, requiring much less feedback overhead compared with other techniques. The subspace based channel quantization method is extended by introducing multiple antennas at the transmitter side and/or at the receiver side and the performance of a regularized block diagonalization (RBD) precoding(/decoding) scheme has been investigated as well as a zero-forcing (ZF) precoding scheme. A cost-efficient decoding matrix quantization method is proposed which can avoid a complex computation at the mobile station while showing only a slight degradation. The thesis is concluded by comparing the proposed feedback methods in terms of their performance, their required feedback overhead, and their computational complexity. The techniques that are developed in this thesis can be useful and applicable for 5G, which is envisioned to support the high granularity/resolution codebook and its efficient deployment schemes. Keywords: MU-MIMO, COOPA, limited feedback, CSI, CQ, feedback overhead reduction, Givens rotatio
Connectionist natural language parsing
The key developments of two decades of connectionist parsing are reviewed. Connectionist parsers are assessed according to their ability to learn to represent syntactic structures from examples automatically, without being presented with symbolic grammar rules. This review also considers the extent to which connectionist parsers offer computational models of human sentence processing and provide plausible accounts of psycholinguistic data. In considering these issues, special attention is paid to the level of realism, the nature of the modularity, and the type of processing that is to be found in a wide range of parsers
Low-Complexity 3D-DWT video encoder applicable to IPTV
3D-DWT encoders are good candidates for applications like professional video editing,
IPTV video surveillance, live event IPTV broadcast, multispectral satellite imaging, HQ
video delivery, etc., where a frame must be reconstructed as fast as possible. However,
the main drawback of the algorithms that compute the 3D-DWT is the huge memory
requirement in practical implementations. In this paper, and in order to considerably
reduce the memory requirements of this kind of video encoders, we present a new
3D-DWT video encoder based on (a) the use of a novel frame-based 3D-DWT transform
that avoids video sequence partitioning in Groups Of Pictures (GOP) and (b) a very fast
run-length encoder. Furthermore, an exhaustive evaluation of the proposed encoder
(3D-RLW) has been performed, analyzing the sensibility of the ¿lters employed in the
3D-DWT transform and comparing the evaluation results with other video encoders in
terms of R/D, coding/decoding delay and memory consumptionThanks to Spanish Ministry of Education and Science under grants DPI2007-66796-C03-03 for funding.López ., O.; Piñol ., P.; Martinez Rach, MO.; Perez Malumbres, MJ.; Oliver Gil, JS. (2011). Low-Complexity 3D-DWT video encoder applicable to IPTV. Signal Processing: Image Communication. 26(7):358-369. https://doi.org/10.1016/j.image.2011.01.008S35836926
- …