No description available.

No description available.

A novel design methodology of parallel VLSI matrix transposer circuit based on a multi-bank memory architecture is presented. The proposed transposer design is especially suitable for large matrix applications where the use of registers to store the matrix data become inefficient. Due to the limited access ports of single SRAM module, this paper first proposes a two-way group expansion bank allocation algorithm such that each of the input or the output data presented in each cycle belongs to separate banks of memory. Next, the allocation results can be further utilized to automatically synthesize the input and output data-path router based on a two-level data switch architecture. Finally, a dedicated data fetch address generator circuit is also proposed, which divides the address generation into two parts. These parts include group base and offset address generation which can be simply realized by a shift-register array and a small on-chip ROM table, respectively. The proposed design methodology has been implemented as a systematic transposer generator which can generate the soft Verilog code. It can generate very fast transposer which can run at one hundred fifty mega hertz. Our experimental results from several design cases show that our multi-bank memory based transposer can consume much less gates compared with register-based transposer architecture.

No description available.

We make use of a structure known as signed groups, and known sequences with zero autocorrelation to derive new results on the asymptotic existence of Hadamard matrices.

We make use of a structure known as signed groups, and known sequences with zero autocorrelation to derive new results on the asymptotic existence of Hadamard matrices.

No description available.

Bielefeld, Universiẗat, Diss., 1999.

Berlin, Humboldt-University, Diss., 2000.

Universiẗat, Diss., 2001--Kiel.