Jacques Hauri

dblp:271/8804 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1979
—ORCID · none

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

Computer networks · 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 networks
1 paper
Routing and switching · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching
switching networks
0.011979
Development of a Time-Division Switching Network Usable in a Very Large Range of Capacities · IEEE Trans. Commun. 1979
Routing and switching › switching
time-division switching
0.011979
Development of a Time-Division Switching Network Usable in a Very Large Range of Capacities · IEEE Trans. Commun. 1979
Memory systems
semiconductor memory
0.011979
Development of a Time-Division Switching Network Usable in a Very Large Range of Capacities · IEEE Trans. Commun. 1979

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

time-division multiplexing · 0.0
YearPublicationVenuePosition
1979 Development of a Time-Division Switching Network Usable in a Very Large Range of Capacities
abstract
Well adapted to medium size systems, theTswitching networks fully proved the operational value of the time division principles. For higher capacities, the more usual realizations are now STS and mainly TST networks. These are attractive as the growth of the equipment proportional to the square of the number of subscribers is limited to the intermediate stage (or stages). Drastic improvements in semiconductor technology, particularly in the memory field, allow another step: mixing in the same I.C. can, theTandSstages. In this concept, staggering or even functional discrimination ofTandSappears to be useless and artificial. The resulting matrix circuit has quite symmetrical input-outputs and the multiple incoming bit positions are distributed to the output in whatever time and space arrangement that is needed. This paper describes the networks based on this concept.
Pierre Charransol, Jacques Hauri, Claude Athènes, Daniel Hardy
IEEE Trans. Commun.2