Parallel-recusive filter structures for the computation of discrete transforms

A general approach is presented for implementing discrete transforms as a set of first-order or second-order recursive digital filters. Clenshaw's recurrence formulae are used to formulate the second-order filters. The resulting structure is suitable for efficient implementation of discrete transforms in VLSI or FPGA circuits. The general approach is applied to the discrete Legendre transform as an illustration.

Numerical Computation of a Certain Dirichlet Series Attached to Siegel Modular Forms of Degree Two

The Rankin convolution type Dirichlet series D-F,D-G(s) of Siegel modular forms F and G of degree two, which was introduced by Kohnen and the second author, is computed numerically for various F and G. In particular, we prove that the series D-F,D-G(s), which shares the same functional equation and analytic behavior with the spinor L-functions of eigenforms of the same weight are not linear combinations of those. In order to conduct these experiments a numerical method to compute the Petersson scalar products of Jacobi Forms is developed and discussed in detail.

Efficient computation of discrete polynomial transforms

This letter presents a new recursive method for computing discrete polynomial transforms. The method is shown for forward and inverse transforms of the Hermite, binomial, and Laguerre transforms. The recursive flow diagrams require only 2 additions, 2( +1) memory units, and +1multipliers for the +1-point Hermite and binomial transforms. The recursive flow diagram for the +1-point Laguerre transform requires 2 additions, 2( +1) memory units, and 2( +1) multipliers. The transform computation time for all of these transforms is ( )

Computation of discrete cosine transform using Clenshaw's recurence formula

Clenshaw’s recurrenee formula is used to derive recursive algorithms for the discrete cosine transform @CT) and the inverse discrete cosine transform (IDCT). The recursive DCT algorithm presented here requires one fewer delay element per coefficient and one fewer multiply operation per coeflident compared with two recently proposed methods. Clenshaw’s recurrence formula provides a unified development for the recursive DCT and IDCT algorithms. The M v e al gorithms apply to arbitrary lengtb algorithms and are appropriate for VLSI implementation.

Position paper on the management of patients with obstructive sleep apnea and hypertension: joint recommendations by the European Society of Hypertension, by the European Respiratory Society and by the members of European COST (COoperation in Scientific and Technological research) ACTION B26 on obstructive sleep apnea

This article is aimed at addressing the current state of the art in epidemiology, pathophysiology, diagnostic procedures and treatment options for appropriate management of obstructive sleep apnea (OSA) in cardiovascular (particularly hypertensive) patients, as well as for the management of cardiovascular diseases (particularly arterial hypertension) in OSA patients. The present document is the result of the work done by a panel of experts participating in the European Union COST (COoperation in Scientific and Technological research) ACTION B26 on OSA, with the endorsement of the European Respiratory Society (ERS) and the European Society of Hypertension (ESH). These recommendations are particularly aimed at reminding cardiovascular experts to consider the occurrence of sleep-related breathing disorders in patients with high blood pressure. They are at the same time aimed at reminding respiration experts to consider the occurrence of hypertension in patients with respiratory problems at night.