An Algorithm for High-Speed Digital Filters

Little, W.D.

doi:10.1109/t-c.1974.223968

Cited by 20 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Filtering in DTS schemes is an efficient tool to help the receiver filter out the false data [15,16,17,18,19]. Furthermore, it has been used to protect against the DoS attacks.…”

Section: Data Transfer With Filtering Schemesmentioning

confidence: 99%

See 1 more Smart Citation

Attribute-Based Data Transfer with Filtering Scheme in Cloud Computing

Han

Susilo

et al. 2013

The Computer Journal

View full text Add to dashboard Cite

Attribute-based data transfer with filtering scheme in cloud computing Attribute-based data transfer with filtering scheme in cloud computing Abstract Abstract Data transfer is a transmission of data over a point-to-point or point-to-multipoint communication channel. To protect the confidentiality of the transferred data, public-key cryptography has been introduced in data transfer schemes (DTSs). Data transfer is a transmission of data over a point-to-point or point-to-multipoint communication channel. To protect the confidentiality of the transferred data, public-key cryptography has been introduced in data transfer schemes (DTSs). Unfortunately, there exist some drawbacks in the current DTSs. First, the sender must know who the real receivers are. This is undesirable in a system where the number of the users is very large, such as cloud computing. In practice, the sender only knows some descriptive attributes of the receivers. Secondly, the receiver cannot be guaranteed to only receive messages from the legal senders. Therefore, it remains an elusive and challenging research problem on how to design a DTS scheme where the sender can send messages to the unknown receivers and the receiver can filter out false messages according to the described attributes. In this paper, we propose an attribute-based data transfer with filtering (ABDTF) scheme to address these problems. In our proposed scheme, the receiver can publish an access structure so that only the users whose attributes satisfy this access structure can send messages to him. Furthermore, the sender can encrypt a message under a set of attributes such that only the users who hold these attributes can obtain the message. In particular, we provide an efficient filtering algorithm for the receiver to resist the denial-of-service attacks. Notably, we propose the formal definition and security models for ABDTF schemes. To the best of our knowledge, it is the first time that a provable ABDTF scheme is proposed. Hence, this work provides a new research approach to ABDTF schemes. must know who are the real receivers. This is undesirable in a system where the number of the users is very large, such as cloud computing. In practice, the sender only knows some descriptive attributes of the receivers. Second, the receiver cannot be guaranteed to only receive messages from the legal senders. Therefore, it remains an elusive and challenging research problem on how to design a DTS scheme where the sender can send messages to the unknown receivers and the receiver can filter out false messages according to the described attributes. In this paper, we propose an attribute-based data transfer with filtering (ABDTF) scheme to address these problems. In our proposed scheme, the receiver can publish an access structure so that only the users whose attributes satisfy this access structure can send messages to him. Furthermore, the sender can encrypt a message under a set of attributes such that only the users who hold these attributes can obtain the message. In particular, we pr...

show abstract

“…Filtering in DTS schemes is an efficient tool to help the receiver filter out the false data [15,16,17,18,19]. Furthermore, it has been used to protect against the DoS attacks.…”

Section: Data Transfer With Filtering Schemesmentioning

confidence: 99%

“…Little [17] proposed an efficient algorithm for nonrecursive and recursive digital filters, where the filtering speed is related to the memory space and the time is independent of the order of the filter. Yuen [19] improved Little's scheme by representing the data in two complement forms, instead of the biased form.…”

Section: Data Transfer With Filtering Schemesmentioning

confidence: 99%

Attribute-Based Data Transfer with Filtering Scheme in Cloud Computing

Han

Susilo

et al. 2013

The Computer Journal

View full text Add to dashboard Cite

show abstract

“…A reduction in the time required for the execution of multiplications in digital signal processing in real time using general-purpose microprocessors is usually effected in one of the following ways: (a) using an external multiplier (Geist 1978), (b) using distributed arithmetic (Buttner and Schussler 1976), or (e) using look-up tables (Little 1974). The third method is becoming more attractive nowadays as memories become cheaper.…”

Section: I Introductionmentioning

confidence: 99%

Bandwidth improvement in IIR digital filters

Skodras

Deliyannis

1984

International Journal of Electronics

View full text Add to dashboard Cite

Canonical realization and round‐off noise analysis for combinatorial filters

Kawarai

1982

Electron. Comm. Jpn. Pt. I

View full text Add to dashboard Cite

Recent developments in memory devices have led to the proposal of a direct method of constructing combinatorial logic filter which uses bit serial operation (i.e., memory and reversible adder are used for bitwise summing of the result of weighted addition). By combinatorial construction it is possible to increase operating speed, simplify the hardware and decrease the power consumption, leading to an efficient digital filter. This paper applies bit serial operation to the canonical construction, leading to a combinatorial filter with memory capacity of 1/2N‐1. Then, bit parallel‐serial operation, which sums up the result of multibit weighted addition, is applied to the canonical construction of the second‐order section, leading to a digital filter with t/I times higher speed than in the past. It is noted that the roundoff noise in the combinatorial filter is independent of the input data, and a noise evaluation model is proposed in which the error can be independently discussed. Using the proposed model, the mean‐square error of the filter output can easily be determined. This paper deals with the drawbacks in the past theory of noise evaluation for the direct construction and performs a noise analysis for the canonical construction. The result is useful in application to LSI design for a high‐speed digital filter.

show abstract

An Algorithm for High-Speed Digital Filters

Cited by 20 publications

References 7 publications

Attribute-Based Data Transfer with Filtering Scheme in Cloud Computing

Attribute-Based Data Transfer with Filtering Scheme in Cloud Computing

Bandwidth improvement in IIR digital filters

Canonical realization and round‐off noise analysis for combinatorial filters

Contact Info

Product

Resources

About