نتایج جستجو برای: bit swapping linear feedback shift register bs

تعداد نتایج: 830261  

Orthogonal frequency division multiplexing (OFDM) has become a promising method for many wireless communication applications. However, one main drawback of OFDM systems is the high peak-to-average power ratio (PAPR). Selected mapping (SLM) is a well-known technique to decrease the problem of high PAPR in OFDM systems. In this method, transmitter is obliged to send some bits named side informati...

1998
Cunsheng Ding Tor Helleseth Weijuan Shan

In this correspondence we determine the linear complexity of all Legendre sequences and the (monic) feedback polynomial of the shortest linear feedback shift register that generates such a Legendre sequence. The result of this correspondence shows that Legendre sequences are quite good from the linear complexity viewpoint.

2002
Giorgos Dimitrakopoulos Dimitris Nikolos Dimitris Bakalis

Arithmetic function modules which are available in many circuits can be utilized to generate test patterns and compact test responses. Recently, it was shown that an adder or an accumulator cannot be used as a bit serial test pattern generator due to the poor random properties of the generated sequences. Thus, accumulator-multiplier or adder-multiplier structures have been proposed. In this pap...

2012
Fazal Noor Basha

The design for low power has become one of the greatest challenges in high-performance very large scale integration (VLSI) design. It has been found that the power consumed during test mode operation is often much higher than during normal mode operation. This is because most of the consumed power results from the switching activity in the nodes of the circuit under test (CUT), which is much hi...

Journal: :IACR Cryptology ePrint Archive 2012
Elena Dubrova

Non-Linear Feedback Shift Registers (NLFSRs) are a generalization of Linear Feedback Shift Registers (LFSRs) in which a current state is a nonlinear function of the previous state. While the theory behind LFSRs is wellunderstood, many fundamental problems related to NLFSRs remain open. Probably the most important one is finding a systematic procedure for constructing NLFSRs with a guaranteed lo...

2012
Janaki Rani S. Malarkkan Adrian Nunez Borivoje Nikolic Yongpan Liu Robert P. Dick Li Shang Huazhong Yang M. C. Johnson D. Somasekhar L. Y. Chiou

As the CMOS technology is scaling down, leakage power has become one of the most critical design concerns for the chip designer. This paper proposes a low leakage linear feedback shift register that can be used in a crypto-processor. In this work, three bit, four bit and five bit linear feedback shift registers are implemented in 90nm and 65nm technology . This paper also proposes two leakage r...

Journal: :IEICE Transactions 2010
Çagdas Çalik Meltem Sönmez Turan Ferruh Özbudak

Feedback shift registers are basic building blocks for many cryptographic primitives. Due to the insecurities of Linear Feedback Shift Register (LFSR) based systems, the use of Nonlinear Feedback Shift Registers (NFSRs) became more popular. In this work, we study the feedback functions of NFSRs with period 2n. First, we provide two new necessary conditions for feedback functions to be maximum l...

Journal: :IEEE Trans. Information Theory 2011
Elena Dubrova

This paper presents a method for constructing n-stage Galois NLFSRs with period 2n − 1 from n-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a nonlinear Boolean function to the feedback polynomial of the LFSR. Each assignment of variables for which this function evaluates to 1 acts as a crossing point for the LFSR state cycle. By adding a copy of the same func...

Journal: :CoRR 2009
Shohreh Sharif Mansouri Elena Dubrova

A common approach to protect confidential information is to use a stream cipher which combines plain text bits with a pseudo-random bit sequence. Among the existing stream ciphers, Non-Linear Feedback Shift Register (NLFSR)based ones provide the best trade-off between cryptographic security and hardware efficiency. In this paper, we show how to further improve the hardware efficiency of Grain s...

1998
Rajendra S. Katti

In testing certain systems, checking for burst errors is important. This is due to the fact that errors are confined to a certain number of bits. If signature analysis is used to test a circuit then the testing capabilities depend on the polynomial that defines the linear feedback shift register (LFSR) used in the test. In this paper we show that the LFSR that is suitable for checking for burst...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید