for an n-by-n complex matrix a in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of a. in this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...

We consider the problem of efficiently generating sequences in hardware for use in certain cryptographic algorithms. The conventional method of doing this is to use a counter. We show that sequences generated by linear feedback shift registers (LFSRs) can be tailored to suit the appropriate algorithms. For hardware implementation, this reduces both time and chip area. As a result, we are able t...

A basic theory of two-dimensional cyclic codes (TDC codes) is presented. This theory is applicable to the binary TDC codes of odd area, i.e., the TDC codes with an odd number of symbols from GF(2). It is shown that such TDC codes are completely characterized by the common zeros, which correspond to the roots for ordinary cyclic codes. The fundamental structure of the codes such as the positions...

1 One of the main drawbacks of the conventional reseeding architecture is the limited seed efficiency due to the variance in the number of specified bits per vector. This paper proposes a new LFSR reseeding architecture that essentially solves this problem, resulting in a significant compression ratio. The compression ratio is very close to the entropy in terms of #total bits / #specified bits....

For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...

The existing implementations of block shift based filtering algorithms for deblocking are hard to achieve good smoothing performance and low computation complexity simultaneously due to their fixed block size and small shifting range. In this paper, we propose to integrate quadtree (QT) decomposition with the block-shift filtering for deblocking. By incorporating the QT decomposition, we can ea...