Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hiroshi Nakada

dblp:57/6330 · DBLP profile ↗
← Back
9ranked-venue papers
2as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 5 · 1 first-authorComputer networks · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
2 papers
Audio and music processing · 55% Image and video coding · 45%
Computer networks
2 papers
Transport protocols and congestion control · 42% Network performance modeling · 42% Internet architecture and protocols · 16%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Audio and music processing
speech coding
0.021990
Variable rate speech coding for asynchronous transfer mode · IEEE Trans. Commun. 1990
Variable rate speech coding and network delay analysis for universal transport network · INFOCOM 1988
Image and video coding
variable-rate coding
0.011990
Variable rate speech coding for asynchronous transfer mode · IEEE Trans. Commun. 1990
Network performance modeling › delay analysis
network delay analysis
0.011988
Variable rate speech coding and network delay analysis for universal transport network · INFOCOM 1988
Transport protocols and congestion control
transport protocols
0.011988
Variable rate speech coding and network delay analysis for universal transport network · INFOCOM 1988
Internet architecture and protocols
ATM networks
0.011990
Variable rate speech coding for asynchronous transfer mode · IEEE Trans. Commun. 1990

Methods — techniques the papers use, named apart from their topics

statistical multiplexing · 0.0block coding · 0.0sensitivity analysis · 0.0computer simulation · 0.0
YearPublicationVenuePosition
2000 Communicating logic: an alternative embedded stream processing paradigm
abstract
This paper introduces a new concurrent processing model called Communicating Logic (CL). As the target architecture we adopt the dual layered Plastic Cell Architecture (PCA). Data-path-oriented processing functionality is encapsulated in asynchronous hardware objects with variable graining and implemented using look-up tables. Communication (i.e. connectivity and control) between the distributed processing objects is achieved by means of inter-object message passing. The key point of the CL approach is that it offers the merits of scalable, high performance hardware implementation with the compilation and linking capabilities unique to software.
Norbert Imlig, Ryusuke Konishi, Tsunemichi Shiozawa, Kiyoshi Oguri, Kouichi Nagami, Hideyuki Ito, Minoru Inamori, Hiroshi Nakada
ASP-DAC8
1997 A New Processor Architecture for Digital Signal Transport Systems
abstract
This paper proposes a new processor architecture for manipulating protocols in digital signal transport systems. To realize flexible and high-performance digital signal transport systems, the architecture has unique application-specific hardware with a core CPU. It is derived from an analysis of functions in real systems. A computer simulation confirms the efficiency of the architecture.
Minoru Inamori, Kenji Ishii, Akihiro Tsutsui, Kazuhiro Shirakawa, Hiroshi Nakada, Toshiaki Miyazaki
ICCD5
1995 Performance improvement technique for synchronous circuits realized as LUT-based FPGAs
abstract
This paper presents a new technique for improving the performance of a synchronous circuit configured as a look-up table based FPGA without changing the initial circuit configuration; only the register location is altered. It improves clock speed and data throughput at the expense of latency. One of the most significant benefits realized by this approach is that the time-consuming and user-uncontrollable reconfiguration processes, i.e., remapping, replacement, and rerouting, are unnecessary when improving circuit performance. After applying our technique to some benchmark circuits, the average performance improvement was 33% for six combinational circuits, and 25% for 18 sequential circuits.>
Toshiaki Miyazaki, Hiroshi Nakada, Akihiro Tsutsui, Kazuhisa Yamada, Naohisa Ohta
IEEE Trans. Very Large Scale Integr. Syst.2
1994 PROTEUS: Programmable Hardware for Telecommunication Systems
abstract
This paper discusses a new architecture for programmable hardware targeted at high-speed digital telecommunication systems and describes a preliminary design. The basic architecture of the programmable hardware is proposed based on the characteristics of functions and an analysis of logic used in actual communication subsystems performing high-speed bit level operations. The proposed architecture, called PROTEUS, includes a pipeline structure of logic and latch groups, and a 2-stage logic block structure that consists of small LUTs and wide gates. The design strategy of a prototype chip and the CAD techniques used to achieve the required performance are also discussed.>
Naohisa Ohta, Hiroshi Nakada, Kazuhisa Yamada, Akihiro Tsutsui, Toshiaki Miyazaki
ICCD2
1992 A 12.8 GFLOPS multi-DSP system for super high definition image processing
abstract
A multicomputer-type parallel processing system has been developed that offers a peak performance of 12.8 GFLOPS. This system is called NOVI-II HiPIPE, and was designed for super-high-definition (SHD) image processing. SHD image is a new image medium and its resolution is higher than that of HDTV. Because SHD image processing requires computing power that exceeds the ability of any single digital signal processor (DSP), current or anticipated, NOVI-II HiPIPE uses a multicomputer-type parallel processing architecture. A 100-MFLOPS vector processor serves as the backend processor of each processing element. The current version of NOVI-II HiPIPE uses 128 mesh connected processing elements and 128 vector processors. The configuration and performance of NOVI-II HiPIPE are described.>
Tomoko Sawabe, Tetsuro Fujii, Hiroshi Nakada, Naohisa Ohta, Sadayasu Ono
ICASSP3
1990 Vector processor design for parallel DSP systems using hierarchical behavioral description based synthesizer
abstract
The VLSI design of a one-chip vector processor (VP) for parallel digital signal processing (DSP) systems is described. The VP aims at a peak performance of 100 MFLOPS (32-b) for typical digital signal processing applications. To achieve this performance based on existing CMOS technology, a very-long-instruction-word-type pipeline architecture was used. The pipeline processing architecture and the functional units configuration are shown. A high-level behavioral-description-based CAD system called PARTHENON was used to design the functions and logic circuits of VP. The suitability and effectiveness of PARTHENON for the VP design are shown in terms of parallel operation and pipeline-stage description. The estimated work load in the VP design with PARTHENON is one order of magnitude smaller compared to conventional CAD tools.>
Hiroshi Nakada, Naoya Sakurai, Yukiharu Kanayama, Naohisa Ohta, Kiyoshi Oguri
ICCD1
1990 Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
Terunao Soneoka, Hiroshi Nakada, Makoto Imase
Discret. Appl. Math.2
1990 Variable rate speech coding for asynchronous transfer mode
abstract
A new speech coding and multiplexing scheme matched to the asynchronous transfer mode is described. A block coding technique that is based on a variable-rate coding algorithm that makes the most of the burstiness of voice information is employed. The main feature of the scheme is considerable bit reduction, which is attained by a fairly simple algorithm. It is demonstrated that the proposed algorithm exhibits better quality than that of a 32 kb/s ADPCM at a mean bit rate of less than 13 kb/s. The effect of statistical multiplexing is verified by means of simulation employing long conversational speech samples. Methods for constructing variable- and fixed-length frames (units of information multiplexed and transferred in the network) are proposed. The proposed coding algorithm is shown to be applicable to both variable- and fixed-length frame strategies.>
Hiroshi Nakada, Ken-ichi Sato
IEEE Trans. Commun.1
1988 Variable rate speech coding and network delay analysis for universal transport network
abstract
An exploration is made of some techniques which will play important roles in the development of the future universal transport network. In the network, the information can be efficiently integrated and transported by making the most of the burstiness of the information flows and of the store-and-forward process at the transport nodes. First, a coding and multiplexing scheme for audio signals matched to the above transportation mode is proposed. The effectiveness of the scheme is demonstrated through computer simulation and the extent of the deviations are provided for some sets of parameters. The analysis provides useful tools to perform sensitivity analysis of network delay performance.>
Ken-ichi Sato, Hiroshi Nakada, Youichi Sato
INFOCOM2