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

Suku Nair - One of the best experts on this subject based on the ideXlab platform.

  • Placement of trust anchors in Embedded Computer systems
    2011 IEEE International Symposium on Hardware-Oriented Security and Trust, 2011
    Co-Authors: Stephen Papa, William Casper, Suku Nair
    Abstract:

    The use of Trust Anchors in a well designed Embedded system can help create more secure designs. Trust Anchors can be used to establish, extend, and maintain trust during power-up and run-time operation of a system. A system may contain one or more trust anchors working isolated or in a coordinated manner within the system. Embedded Computer systems may be subject to network and physical attacks and so the use of trust anchors may help protect the system from these attacks. By evaluating potential attacks the placement and functionality of trusted hardware and software in the system may be defined to help mitigate the attacks. This paper uses several different attacks on an Embedded Computer as examples to describe the placement of trust anchors, hardware and software protection mechanisms, and other functionality needed to protect the system against these attacks.

  • HOST - Placement of trust anchors in Embedded Computer systems
    2011 IEEE International Symposium on Hardware-Oriented Security and Trust, 2011
    Co-Authors: Stephen Papa, William Casper, Suku Nair
    Abstract:

    The use of Trust Anchors in a well designed Embedded system can help create more secure designs. Trust Anchors can be used to establish, extend, and maintain trust during power-up and run-time operation of a system. A system may contain one or more trust anchors working isolated or in a coordinated manner within the system. Embedded Computer systems may be subject to network and physical attacks and so the use of trust anchors may help protect the system from these attacks. By evaluating potential attacks the placement and functionality of trusted hardware and software in the system may be defined to help mitigate the attacks. This paper uses several different attacks on an Embedded Computer as examples to describe the placement of trust anchors, hardware and software protection mechanisms, and other functionality needed to protect the system against these attacks.

Masatoshi Ishikawa - One of the best experts on this subject based on the ideXlab platform.

  • Interleaved pixel lookup for Embedded Computer vision
    2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, 2008
    Co-Authors: Kota Yamaguchi, Yoshihiro Watanabe, Takashi Komuro, Masatoshi Ishikawa
    Abstract:

    This paper describes an in-depth investigation and implementation of interleaved memory for pixel lookup operations in Computer vision. Pixel lookup, mapping between coordinates and pixels, is a common operation in Computer vision, but is also a potential bottleneck due to formidable bandwidth requirements for real-time operation. We focus on the acceleration of pixel lookup operations through parallelizing memory banks by interleaving. The key to applying interleaving for pixel lookup is 2D block data partitioning and support for unaligned access. With this optimization of interleaving, pixel lookup operations can output a block of pixels at once without major overhead for unaligned access. An example implementation of our optimized interleaved memory for affine motion tracking shows that the pixel lookup operations can achieve 12.8 Gbps for random lookup of a 4x4 size block of 8-bit pixels under 100 MHz operation. Interleaving can be a cost-effective solution for fast pixel lookup in Embedded Computer vision.

  • CVPR Workshops - Interleaved pixel lookup for Embedded Computer vision
    2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, 2008
    Co-Authors: Kota Yamaguchi, Yoshihiro Watanabe, Takashi Komuro, Masatoshi Ishikawa
    Abstract:

    This paper describes an in-depth investigation and implementation of interleaved memory for pixel lookup operations in Computer vision. Pixel lookup, mapping between coordinates and pixels, is a common operation in Computer vision, but is also a potential bottleneck due to formidable bandwidth requirements for real-time operation. We focus on the acceleration of pixel lookup operations through parallelizing memory banks by interleaving. The key to applying interleaving for pixel lookup is 2D block data partitioning and support for unaligned access. With this optimization of interleaving, pixel lookup operations can output a block of pixels at once without major overhead for unaligned access. An example implementation of our optimized interleaved memory for affine motion tracking shows that the pixel lookup operations can achieve 12.8 Gbps for random lookup of a 4x4 size block of 8-bit pixels under 100 MHz operation. Interleaving can be a cost-effective solution for fast pixel lookup in Embedded Computer vision.

Y. Aoki - One of the best experts on this subject based on the ideXlab platform.

  • Rapid prototyping for simulation debugging environment: an enhanced developing method for Embedded Computer software
    1995 International Conference on Acoustics Speech and Signal Processing, 1995
    Co-Authors: Zhongmin Yu, Y. Aoki
    Abstract:

    Embedded Computers (EC) have been used widely, however, Embedded Computer software is often difficult to develop for the lack of a suitable debugging environment. With the traditional in-circuit debugging method, it is difficult to analyze the reason for errors; also it is impossible to debug a software before the implementation of the associated hardware; moreover, it costs both money and time to create the hardware, so that it can hardly keep up with the ever-changing requirements of a great number of ECs. To tackle the problem, we have researched a prototyping method for a simulation debugging environment (SDE) of Embedded Computer software. Our purpose is to establish an environment to construct SDE and use the software SDE to substitute the traditional in-circuit debugging environment. By the method, users can construct a SDE at a higher speed and lower cost, the development efficiency for Embedded Computer software will also be greatly increased.

  • ICASSP - Rapid prototyping for simulation debugging environment: an enhanced developing method for Embedded Computer software
    1995 International Conference on Acoustics Speech and Signal Processing, 1995
    Co-Authors: Zhongmin Yu, Y. Aoki
    Abstract:

    Embedded Computers (EC) have been used widely, however, Embedded Computer software is often difficult to develop for the lack of a suitable debugging environment. With the traditional in-circuit debugging method, it is difficult to analyze the reason for errors; also it is impossible to debug a software before the implementation of the associated hardware; moreover, it costs both money and time to create the hardware, so that it can hardly keep up with the ever-changing requirements of a great number of ECs. To tackle the problem, we have researched a prototyping method for a simulation debugging environment (SDE) of Embedded Computer software. Our purpose is to establish an environment to construct SDE and use the software SDE to substitute the traditional in-circuit debugging environment. By the method, users can construct a SDE at a higher speed and lower cost, the development efficiency for Embedded Computer software will also be greatly increased.

Stephen Papa - One of the best experts on this subject based on the ideXlab platform.

  • Placement of trust anchors in Embedded Computer systems
    2011 IEEE International Symposium on Hardware-Oriented Security and Trust, 2011
    Co-Authors: Stephen Papa, William Casper, Suku Nair
    Abstract:

    The use of Trust Anchors in a well designed Embedded system can help create more secure designs. Trust Anchors can be used to establish, extend, and maintain trust during power-up and run-time operation of a system. A system may contain one or more trust anchors working isolated or in a coordinated manner within the system. Embedded Computer systems may be subject to network and physical attacks and so the use of trust anchors may help protect the system from these attacks. By evaluating potential attacks the placement and functionality of trusted hardware and software in the system may be defined to help mitigate the attacks. This paper uses several different attacks on an Embedded Computer as examples to describe the placement of trust anchors, hardware and software protection mechanisms, and other functionality needed to protect the system against these attacks.

  • HOST - Placement of trust anchors in Embedded Computer systems
    2011 IEEE International Symposium on Hardware-Oriented Security and Trust, 2011
    Co-Authors: Stephen Papa, William Casper, Suku Nair
    Abstract:

    The use of Trust Anchors in a well designed Embedded system can help create more secure designs. Trust Anchors can be used to establish, extend, and maintain trust during power-up and run-time operation of a system. A system may contain one or more trust anchors working isolated or in a coordinated manner within the system. Embedded Computer systems may be subject to network and physical attacks and so the use of trust anchors may help protect the system from these attacks. By evaluating potential attacks the placement and functionality of trusted hardware and software in the system may be defined to help mitigate the attacks. This paper uses several different attacks on an Embedded Computer as examples to describe the placement of trust anchors, hardware and software protection mechanisms, and other functionality needed to protect the system against these attacks.

Kota Yamaguchi - One of the best experts on this subject based on the ideXlab platform.

  • Interleaved pixel lookup for Embedded Computer vision
    2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, 2008
    Co-Authors: Kota Yamaguchi, Yoshihiro Watanabe, Takashi Komuro, Masatoshi Ishikawa
    Abstract:

    This paper describes an in-depth investigation and implementation of interleaved memory for pixel lookup operations in Computer vision. Pixel lookup, mapping between coordinates and pixels, is a common operation in Computer vision, but is also a potential bottleneck due to formidable bandwidth requirements for real-time operation. We focus on the acceleration of pixel lookup operations through parallelizing memory banks by interleaving. The key to applying interleaving for pixel lookup is 2D block data partitioning and support for unaligned access. With this optimization of interleaving, pixel lookup operations can output a block of pixels at once without major overhead for unaligned access. An example implementation of our optimized interleaved memory for affine motion tracking shows that the pixel lookup operations can achieve 12.8 Gbps for random lookup of a 4x4 size block of 8-bit pixels under 100 MHz operation. Interleaving can be a cost-effective solution for fast pixel lookup in Embedded Computer vision.

  • CVPR Workshops - Interleaved pixel lookup for Embedded Computer vision
    2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, 2008
    Co-Authors: Kota Yamaguchi, Yoshihiro Watanabe, Takashi Komuro, Masatoshi Ishikawa
    Abstract:

    This paper describes an in-depth investigation and implementation of interleaved memory for pixel lookup operations in Computer vision. Pixel lookup, mapping between coordinates and pixels, is a common operation in Computer vision, but is also a potential bottleneck due to formidable bandwidth requirements for real-time operation. We focus on the acceleration of pixel lookup operations through parallelizing memory banks by interleaving. The key to applying interleaving for pixel lookup is 2D block data partitioning and support for unaligned access. With this optimization of interleaving, pixel lookup operations can output a block of pixels at once without major overhead for unaligned access. An example implementation of our optimized interleaved memory for affine motion tracking shows that the pixel lookup operations can achieve 12.8 Gbps for random lookup of a 4x4 size block of 8-bit pixels under 100 MHz operation. Interleaving can be a cost-effective solution for fast pixel lookup in Embedded Computer vision.