The Experts below are selected from a list of 15273 Experts worldwide ranked by ideXlab platform

S.p. Voinigescu - One of the best experts on this subject based on the ideXlab platform.

  • an 80 gb s 2 sup 31 1 pseudorandom Binary Sequence generator in sige bicmos technology
    IEEE Journal of Solid-state Circuits, 2005
    Co-Authors: T.o. Dickson, E. Laskin, I. Khalid, R. Beerkens, B. Karajica, S.p. Voinigescu
    Abstract:

    A 2/sup 31/-1 pseudorandom Binary Sequence (PRBS) generator with adjustable output data rates up to 80 Gb/s is reported in a production 130-nm BiCMOS process with 150-GHz f/sub T/ SiGe heterojunction bipolar transistor (HBT). The pseudorandom Sequence is generated at 20 Gb/s using a linear feedback shift register (FSR), which is then multiplexed up to 80 Gb/s with a 4:1 multiplexer. A BiCMOS logic family combining MOSFETs and SiGe HBTs on high-speed paths is employed throughout the PRBS generator to maximize building block switching speed. Adjustable delay cells are inserted into critical clock paths to improve timing margins throughout the system. The PRBS generator consumes 9.8 W from a 3.3-V supply and can deliver an output voltage swing of up to 430 mV single-ended at 80 Gb/s.

  • An 80-Gb/s 2/sup 31/-1 pseudorandom Binary Sequence generator in SiGe BiCMOS technology
    IEEE Journal of Solid-State Circuits, 2005
    Co-Authors: T.o. Dickson, E. Laskin, I. Khalid, R. Beerkens, B. Karajica, S.p. Voinigescu
    Abstract:

    A 2/sup 31/-1 pseudorandom Binary Sequence (PRBS) generator with adjustable output data rates up to 80 Gb/s is reported in a production 130-nm BiCMOS process with 150-GHz f/sub T/ SiGe heterojunction bipolar transistor (HBT). The pseudorandom Sequence is generated at 20 Gb/s using a linear feedback shift register (FSR), which is then multiplexed up to 80 Gb/s with a 4:1 multiplexer. A BiCMOS logic family combining MOSFETs and SiGe HBTs on high-speed paths is employed throughout the PRBS generator to maximize building block switching speed. Adjustable delay cells are inserted into critical clock paths to improve timing margins throughout the system. The PRBS generator consumes 9.8 W from a 3.3-V supply and can deliver an output voltage swing of up to 430 mV single-ended at 80 Gb/s.

T.o. Dickson - One of the best experts on this subject based on the ideXlab platform.

  • an 80 gb s 2 sup 31 1 pseudorandom Binary Sequence generator in sige bicmos technology
    IEEE Journal of Solid-state Circuits, 2005
    Co-Authors: T.o. Dickson, E. Laskin, I. Khalid, R. Beerkens, B. Karajica, S.p. Voinigescu
    Abstract:

    A 2/sup 31/-1 pseudorandom Binary Sequence (PRBS) generator with adjustable output data rates up to 80 Gb/s is reported in a production 130-nm BiCMOS process with 150-GHz f/sub T/ SiGe heterojunction bipolar transistor (HBT). The pseudorandom Sequence is generated at 20 Gb/s using a linear feedback shift register (FSR), which is then multiplexed up to 80 Gb/s with a 4:1 multiplexer. A BiCMOS logic family combining MOSFETs and SiGe HBTs on high-speed paths is employed throughout the PRBS generator to maximize building block switching speed. Adjustable delay cells are inserted into critical clock paths to improve timing margins throughout the system. The PRBS generator consumes 9.8 W from a 3.3-V supply and can deliver an output voltage swing of up to 430 mV single-ended at 80 Gb/s.

  • An 80-Gb/s 2/sup 31/-1 pseudorandom Binary Sequence generator in SiGe BiCMOS technology
    IEEE Journal of Solid-State Circuits, 2005
    Co-Authors: T.o. Dickson, E. Laskin, I. Khalid, R. Beerkens, B. Karajica, S.p. Voinigescu
    Abstract:

    A 2/sup 31/-1 pseudorandom Binary Sequence (PRBS) generator with adjustable output data rates up to 80 Gb/s is reported in a production 130-nm BiCMOS process with 150-GHz f/sub T/ SiGe heterojunction bipolar transistor (HBT). The pseudorandom Sequence is generated at 20 Gb/s using a linear feedback shift register (FSR), which is then multiplexed up to 80 Gb/s with a 4:1 multiplexer. A BiCMOS logic family combining MOSFETs and SiGe HBTs on high-speed paths is employed throughout the PRBS generator to maximize building block switching speed. Adjustable delay cells are inserted into critical clock paths to improve timing margins throughout the system. The PRBS generator consumes 9.8 W from a 3.3-V supply and can deliver an output voltage swing of up to 430 mV single-ended at 80 Gb/s.

Ali Md. Arshad - One of the best experts on this subject based on the ideXlab platform.

  • linear complexity of pseudo random Binary Sequence generated by trace function and legendre symbol over proper sub extension field
    International Workshop on Signal Design and its Applications in Communications, 2017
    Co-Authors: Ali Md. Arshad, Yasuyuki Nogami, Satoshi Uehara, Shoji Heguri, Takeru Miyazaki, Robert Moreloszaragoza
    Abstract:

    The authors have proposed an approach for generating a pseudo random Binary Sequence by using primitive polynomial, trace function, and Legendre symbol over the proper sub extension field. There are many uses of pseudo random Binary Sequence in security applications. The linear complexity of a Sequence is considered as the most important property to be analyzed in these types of applications. In this paper, the authors have restricted the discussion on the linear complexity and linear complexity profile properties of the proposed Sequence based on some experimental results. According to the results, the proposed Sequence always holds a maximum value of the linear complexity.

  • a pseudo random Binary Sequence generated by using primitive polynomial of degree 2 over odd characteristic field fp
    International Conference on Consumer Electronics, 2016
    Co-Authors: Ali Md. Arshad, Yasuyuki Nogami
    Abstract:

    Let p be an odd prime number as the characteristic of finite field, this paper introduces a pseudo random Binary Sequence generated by a primitive polynomial of degree 2 over Fp, trace function, and Legendre symbol. Then, its period and autocorrelation are introduced with a small example.

  • Linear complexity of signed Binary Sequence over odd characteristic field
    2016 19th International Conference on Computer and Information Technology (ICCIT), 2016
    Co-Authors: Ali Md. Arshad, Chiaki Ogawa, Yasuyuki Nogami
    Abstract:

    In our previous work, well balanced pseudo random signed Binary Sequence generated by using trace function and Legendre symbol has been researched. Our previous Sequence generated by applying primitive polynomial over odd characteristic field Fp, trace function and Legendre symbol. The important features such as period, periodic autocorrelation, and cross-correlation have already been well discussed in our previous work. In this paper, the signed Binary Sequence is generated by utilizing one additional parameter A. Let p be an odd prime and Fp is an odd characteristic prime field and m be the degree of the primitive polynomial f(x). The procedure for generating Sequence is as follows: primitive polynomial f(x) generates maximum length vector Sequence, then trace function TY(-) maps an element of extension field Fpm to an element of prime field Fp, next a non-zero scalar A ∈ Fp is added to the trace value and finally Legendre symbol is used to map the scalars into signed Binary Sequence. In this paper, the authors have restricted the discussion on linear complexity and linear complexity profile properties of signed Binary Sequence based on some experimental results.

  • A new approach for generating well balanced Pseudo-random signed Binary Sequence over odd characteristic field
    2016 International Symposium on Information Theory and Its Applications (ISITA), 2016
    Co-Authors: Ali Md. Arshad, Chiaki Ogawa, Yasuyuki Nogami, Satoshi Uehara, Robert Morelos-zaragoza, Kazuyoshi Tsuchiya
    Abstract:

    In our previous work, pseudo random Binary Sequence generated by using trace function, Legendre symbol and mapping function has been researched. Our previous Sequence generated by applying primitive polynomial over odd characteristics field Fp, trace function, and Legendre symbol. The previous Sequence contained only 0 and 1 values. It has some interesting features such as period, periodic autocorrelation, and linear complexity. However, it has a major drawback also that is the appearance of 0 and 1 are inconsistent in each period. For this reason, in the periodic autocorrelation graph except the peak values other parts always consists some values and that is not 0. When we apply this type of Binary Sequence in any security applications, it will lead some security vulnerabilities. In this paper, the authors have proposed a new approach to generate pseudo random signed Binary Sequence. An important point about our proposed Sequence is, it overcomes the drawback of our previous work. Our proposed Sequence includes 0,1, and -1 values. Its features, such as the period and periodic autocorrelation are also explained in this paper. According to the results, this has interesting feature such as the appearance of 0, 1 and - 1 are identical in each period.

Yasuyuki Nogami - One of the best experts on this subject based on the ideXlab platform.

  • Binary Sequence Generated by Alternative Trace Map Function and Its Properties
    2019 Seventh International Symposium on Computing and Networking Workshops (CANDARW), 2019
    Co-Authors: Fatema Akhter, Yasuyuki Nogami, Takuya Kusaka, Yuki Taketa, Tomoya Tatara
    Abstract:

    In this paper, we propose a new pseudo random Binary Sequence generated from a primitive polynomial over an extension field. The Sequence has maximum period and high linear complexity suitable for security applications. While generation, a new mapping function is proposed which is faster than conventional trace map and translates extension field elements to prime field elements. The output of mapping function is a p-ary Sequence with elements 0~ (p-1) that is balanced in pattern distribution and has ideal autocorrelation. Then, a binarization method is utilized to derive Binary Sequence from p-ary Sequence. Period, autocorrelation, linear complexity and computation time of the proposed Sequence are studied and experimental results are presented. Finally, the efficiency of the proposal is verified by comparing with existing Sequences in terms of period, linear complexity and generation time for Sequences of different length.

  • linear complexity of pseudo random Binary Sequence generated by trace function and legendre symbol over proper sub extension field
    International Workshop on Signal Design and its Applications in Communications, 2017
    Co-Authors: Ali Md. Arshad, Yasuyuki Nogami, Satoshi Uehara, Shoji Heguri, Takeru Miyazaki, Robert Moreloszaragoza
    Abstract:

    The authors have proposed an approach for generating a pseudo random Binary Sequence by using primitive polynomial, trace function, and Legendre symbol over the proper sub extension field. There are many uses of pseudo random Binary Sequence in security applications. The linear complexity of a Sequence is considered as the most important property to be analyzed in these types of applications. In this paper, the authors have restricted the discussion on the linear complexity and linear complexity profile properties of the proposed Sequence based on some experimental results. According to the results, the proposed Sequence always holds a maximum value of the linear complexity.

  • a pseudo random Binary Sequence generated by using primitive polynomial of degree 2 over odd characteristic field fp
    International Conference on Consumer Electronics, 2016
    Co-Authors: Ali Md. Arshad, Yasuyuki Nogami
    Abstract:

    Let p be an odd prime number as the characteristic of finite field, this paper introduces a pseudo random Binary Sequence generated by a primitive polynomial of degree 2 over Fp, trace function, and Legendre symbol. Then, its period and autocorrelation are introduced with a small example.

  • Linear complexity of signed Binary Sequence over odd characteristic field
    2016 19th International Conference on Computer and Information Technology (ICCIT), 2016
    Co-Authors: Ali Md. Arshad, Chiaki Ogawa, Yasuyuki Nogami
    Abstract:

    In our previous work, well balanced pseudo random signed Binary Sequence generated by using trace function and Legendre symbol has been researched. Our previous Sequence generated by applying primitive polynomial over odd characteristic field Fp, trace function and Legendre symbol. The important features such as period, periodic autocorrelation, and cross-correlation have already been well discussed in our previous work. In this paper, the signed Binary Sequence is generated by utilizing one additional parameter A. Let p be an odd prime and Fp is an odd characteristic prime field and m be the degree of the primitive polynomial f(x). The procedure for generating Sequence is as follows: primitive polynomial f(x) generates maximum length vector Sequence, then trace function TY(-) maps an element of extension field Fpm to an element of prime field Fp, next a non-zero scalar A ∈ Fp is added to the trace value and finally Legendre symbol is used to map the scalars into signed Binary Sequence. In this paper, the authors have restricted the discussion on linear complexity and linear complexity profile properties of signed Binary Sequence based on some experimental results.

  • A new approach for generating well balanced Pseudo-random signed Binary Sequence over odd characteristic field
    2016 International Symposium on Information Theory and Its Applications (ISITA), 2016
    Co-Authors: Ali Md. Arshad, Chiaki Ogawa, Yasuyuki Nogami, Satoshi Uehara, Robert Morelos-zaragoza, Kazuyoshi Tsuchiya
    Abstract:

    In our previous work, pseudo random Binary Sequence generated by using trace function, Legendre symbol and mapping function has been researched. Our previous Sequence generated by applying primitive polynomial over odd characteristics field Fp, trace function, and Legendre symbol. The previous Sequence contained only 0 and 1 values. It has some interesting features such as period, periodic autocorrelation, and linear complexity. However, it has a major drawback also that is the appearance of 0 and 1 are inconsistent in each period. For this reason, in the periodic autocorrelation graph except the peak values other parts always consists some values and that is not 0. When we apply this type of Binary Sequence in any security applications, it will lead some security vulnerabilities. In this paper, the authors have proposed a new approach to generate pseudo random signed Binary Sequence. An important point about our proposed Sequence is, it overcomes the drawback of our previous work. Our proposed Sequence includes 0,1, and -1 values. Its features, such as the period and periodic autocorrelation are also explained in this paper. According to the results, this has interesting feature such as the appearance of 0, 1 and - 1 are identical in each period.

Zheng Zhou - One of the best experts on this subject based on the ideXlab platform.

  • Binary Sequence pair based time-domain superimposed training for OFDM
    2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013
    Co-Authors: Zhaoxi Fang, Ting Jiang, Zheng Zhou
    Abstract:

    This paper introduces a class of perfect Binary Sequence pair (PBSP), which is characterized by the impulse-equivalent periodic autocorrelation function (PACF) and the length of N=2k. The proposed PBSP can be generated from a class of difference set pairs (DSP). Considering the desirable properties of the proposed Sequence pair, orthogonal frequency division multiplexing (OFDM) transmission with time-domain superimposed training is proposed. Simulation results show that our Binary Sequence pair is ideal for channel estimation in terms of complexity, accuracy and efficiency.

  • Uniqueness of punctured Binary Sequence pairs
    2009 9th International Symposium on Communications and Information Technology, 2009
    Co-Authors: Ting Jiang, Zheng Zhou, Cheng-shi Zhao
    Abstract:

    The uniqueness of punctured Binary Sequence pairs is proposed and proved. In particular, perfect punctured Binary Sequence pairs (PPBSP), almost perfect punctured Binary Sequence pairs (APPBSP), pseudorandom punctured Binary Sequence pairs(PRBPSP) and punctured Binary Sequence pairs with two-level autocorrelation(PBSPT) are proved as the specific cases of perfect punctured LCZ/ZCZ Sequence pairs. As a result, the unique receiving is guaranteed theoretically when they are applied in engineering.

  • On Complementary Punctured Binary Sequence Pairs
    2006 IEEE International Symposium on Information Theory, 2006
    Co-Authors: Ting Jiang, Zhaobin Li, Zheng Zhou
    Abstract:

    This paper proposes a completely new complementary Sequence - complementary punctured Binary Sequence pair (CPBSP). We present the definitions of CPBSP and its transformation properties. To reduce the searching range and improve the searching efficiency of CPBSP, the limited conditions of CPBSP are discussed to decide the punctured locations within the Sequence pair. Searching results of perfect CPBSP (PCPBSP) with length no more than 15 shows that high-energy efficiency can be achieved at PCPBSP length 5 and 9. Such high-energy efficiency PCPBSP is feasible for engineering applications as synchronization codes and multi-user codes

  • RESEARCH ON PERFECT DYADIC Binary Sequence PAIR
    Journal of Electronics (china), 2006
    Co-Authors: Ting Jiang, Chenglin Zhao, Zheng Zhou
    Abstract:

    In this paper, the perfect dyadic Binary Sequence pair with one-value dyadic correlation functions is presented. That is, the perfect dyadic Binary Sequence pair is a perfect discrete signal, for its dyadic relative function is δ-function. The transformation features and some existing admissibility conditions of perfect dyadic Binary Sequence pair are discussed, and the properties for this kind of code in Walsh transformation spectrum and weight spectrum are also analyzed. From above, It is found that the perfect dyadic Binary Sequence pair can easily differentiate from its dyadic shifting. So these good signals can used in engineering as synchronization code, multi-user code and so on.

  • On almost perfect punctured Binary Sequence pair
    2006 First International Conference on Communications and Networking in China, 2006
    Co-Authors: Luyong Zhang, Zheng Zhou
    Abstract:

    This paper proposes a completely new periodic correlation signal-almost perfect punctured Binary Sequence pair (APPBSP). We present the definitions of APPBSP and its transformation properties. To reduce the searching range and improve the searching efficiency of APPBSP, limited conditions of APPBSP are discussed to decide the punctured locations within the Sequence pair. Searching results of APPBSP with length no more than 20 show that high energy efficiency can be achieved at APPBSP length 5, 9, 10, 11, 12, 13 and 16, Such high energy efficiency APPBSP is feasible for engineering applications as synchronization codes and multi-user codes.