Mapping of Trellises Associated with General Encoders onto High-Performance VLSI Architectures

A rate 1/n binary generic convolutional encoder is a shift-register circuit where the inputs are information bits and the outputs are blocks of n bits generated as linear combinations on the appropriate shift register contents. The decoding of the outputs of a convolutional encoder can be carried out by the well-known Viterbi algorithm. The communication pattern of the Viterbi Algorithm is given as a graph, called trellis, associated to the state diagram of the corresponding encoder. In this paper we present a methodology that permits the efficient mapping of the Viterbi algorithm onto a column of an arbitrary number of processors. This is done through the representation of the data flow by using mathematical operators which present an inmediate hardware projection. A single operator string has been obtained to represent a generic encoder through the study of the data flow of free-forward encoders and feed-back encoders. The formal model developed is employed for the partitioning of the computations among an arbitrary number of processors in such a way that the data are recirculated opimizing the use of the processors and the communications. As a result, we obtain a highly regular and modular architecture suitable for VLSI implementation.     

Bemerkungen zum Biot-Savartschen Gesetz

Übersicht Die folgende Arbeit verfolgt u. a. auch didaktische Absichten. Das Biot-Savartsche Gesetz wird oft falsch oder mindestens sehr mißverständlich dargestellt und auch auf unzulässige Weise benutzt. Ausgangspunkt der Mißverständnisse ist die auch in vielen Lehrbüchern anzutreffende unkorrekte Aussage, man könne einem von StromI durchflossenen Linienelement ds ein magnetostatisches Feld dB [entsprechend der Gleichung (32) des folgenden Beitrags] zuordnen. Im folgenden werden derartige Aussagen untersucht und in modifizierter Form korrekt dargestellt.

---

Remarks concerning the Law of Biot-Savart

Contents The following paper is at least partly of a didactic nature. The Biot-Savart law of magnetostatics is often interpreted in an illegitimate manner and consequently applied incorrectly. The source of these misunderstandings and errors is the incorrect statement that a magnetic field dB [as given by equation (32) of this paper] is caused by an electric currentI flowing along a line element ds, a statement very popular also in many textbooks. Questions related to this problem are investigated and widespread misleading statements are replaced by correct ones.

     

Guaranteed inclusions for the complex generalized eigenproblem

A method is described which produces guaranteed bounds for a solution of the generalized complex eigenproblem. The method extends a similar approach for general systems of nonlinear equations to the special case of complex pencils, where under weaker assumptions stronger assertions can be proved.     

Twisted axially loaded rod with shear and compressibility

Summary Stability of a twisted and axially compressed elastic rod is analysed using the Euler method of adjacent equilibrium configuration. The constitutive equations of the rod are assumed in the form that takes into account both shear of the cross-sections and compressibility of the rod axis. It is shown that bifurcation points of the non-linear system of equations describing equilibrium are determined from the linearized system of equations. The influence of shear and compressibility on the critical values of twisting couple and compressive force is obtained. Moreover, the bifurcation pattern is examined by using the Liapunov-Schmidt method.     

INTEGER analysis of two-dimensional polygonal objects

A consistent modelling scheme for digital images is presented, with the grey-level raster image as input and the list-oriented polygonal image as output. The output information consists of two parts: The metric of the polygonal object, represented by coordinates of marked positions, and the global topology, which takes the form of a two-dimensional topologic order. The central problem, which has to be solved, is to select a digital polygon, approximating a digital arc such that the essential feature of the arc is represented at a predefined precision level. The proposed algorithm uses simple incremental calculations of INTEGER quantities to solve the problem.     

Influence of various types of load-dependent supports on the stability of a compressible column model

Summary The nonlinear behaviour and static stability of a compressible elastic column whose flexural resistance changes as it is loaded is studied. A two-degree-of-freedom, compressible rod model of the column is analysed. Various types of load-stiffness relationships are considered. Post-buckling behaviour under static unidirectional loads is investigated. Singularities of the equilibrium paths of the column are classified according to the slenderness ratio of the column and the load-stiffness relationship of its support.On leave from Department of Mechanical Engineering, University of Toronto, 5 King's College Road Toronto, Ontario, Canada, M5S 1A4     

Analysis of ink flow in a mimeograph printer based on the mechanics of fluid-filled poroelastic solids

Summary To understand some main ink flow mechanisms in a mimeograph printer, the continuum mechanics theory of fluid-saturated porous solids is applied to analyze the ink flow through screens and a printing master, which are modeled by a fluid-filled poroelastic single layer. The layer is assumed to be pressed by a press roller from below and to be subjected from above to the hydrodynamic lubrication pressure induced between a printing drum and an ink roller. Nonlinear elasticity of the layer and dependence of the permeability on its deformation are taken into account. The numerical results show some important results: e.g., squeezing-out of the ink from the layer by the layer compaction by the press roller plays an important role, especially for the case where the compression duration is small in comparison with the characteristic time of the ink-filled poroelastic layer.     

Algorithms for processing the group K nearest-neighbor query on distributed frameworks

Distributed and Parallel Databases - Given two datasets of points (called Query and Training), the Group (K) Nearest-Neighbor (GKNN) query retrieves (K) points of the Training with the smallest sum...