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

Ting-Sheng Chen

dblp:70/8884 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0003-0456-9790ORCID · corroborated

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

Systems, architecture and hardware · 3 · 1 first-authorComputer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 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
Software-defined and programmable networks · 54% Internet architecture and protocols · 23% Network measurement and analytics · 23%

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

TopicWeightPapersLastEvidence papers
Network measurement and analytics › sketch data structures
bloom filter
0.312018
Dynamically Updatable Ternary Segmented Aging Bloom Filter for OpenFlow-Compliant Low-Power Packet Processing · IEEE/ACM Trans. Netw. 2018
Software-defined and programmable networks
openflow
0.312018
Dynamically Updatable Ternary Segmented Aging Bloom Filter for OpenFlow-Compliant Low-Power Packet Processing · IEEE/ACM Trans. Netw. 2018
Internet architecture and protocols
packet processing
0.312018
Dynamically Updatable Ternary Segmented Aging Bloom Filter for OpenFlow-Compliant Low-Power Packet Processing · IEEE/ACM Trans. Netw. 2018
Software-defined and programmable networks
programmable data plane
0.312018
Dynamically Updatable Ternary Segmented Aging Bloom Filter for OpenFlow-Compliant Low-Power Packet Processing · IEEE/ACM Trans. Netw. 2018

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

ternary segmented aging bloom filter · 0.3
YearPublicationVenuePosition
2019 More Effective Power Network Prototyping by Analytical and Centroid Learning
abstract
Recently a prior work has been proposed to improve the power distribution network (PDN) design with some practical methodologies. However, we found that such approach will cause redundant resources, resulting in the waste of the metal application. In this paper, we present a more effective design flow to automatically generate a PDN verified by the commercial tool without IR-Drop violation. We propose an analytical model and consider the different types of macros to determine the total metal width of PDN. Moreover, the optimization is based on a centroid learning method from unsupervised learning to consolidate PDN. Our work has experimented on real designs in 65 nm process, 0.18 um generic process, and 40 nm process. The results show that our framework can satisfy the given IR-Drop constraints and simultaneously save lots of metal resource (means no overdesign).
Yu-Hsiang Chuang, Chang-Tzu Lin, Hung-Ming Chen, Chi-Han Lee, Ting-Sheng Chen
ISCAS5
2019 Low-Complexity Compressed-Sensing-Based Watermark Cryptosystem and Circuits Implementation for Wireless Sensor Networks
abstract
The emerging compressed sensing (CS) technique provides lightweight data compression with zero-cost encryption. Therefore, CS enables reduced-complexity designs for sensor nodes and saves transmission power in wireless sensor networks (WSNs). However, CS's linear encoding process makes it vulnerable to several attacks, which may lead to privacy leakage issues. In this article, leveraging the characteristic that CS reconstruction is sensitive to measurement noise, we propose a CS-based watermark cryptosystem for WSNs. In the front-end sensor, a low-dimension watermark is embedded in measurements. In the back-end solver, we present a CS-based watermark decryption/reconstruction engine for the Internet of Things (IoT) gateway. Without synchronization of the key, the proposed cryptosystem can resist ciphertext-only attack and known-plaintext attack effectively. Furthermore, leveraging watermarks as a digital signature, the proposed engine can detect denial of service attack effectively before signal reconstruction. For real-time signal processing, multiple-indices updating algorithm and VLSI architecture are applied to eliminate the throughput degradation from watermark removal. Finally, this CS decoder is fabricated in 40-nm CMOS, and it can support the simultaneous reconstruction of over 10 000 wireless sensors in real time while offering synchronization-free watermark decryption. Therefore, the proposed cryptosystem is suitable for the emerging IoT applications that need encryption strength with limited complexity.
Ting-Sheng Chen, Kai-Ni Hou, Win-Ken Beh, An-Yeu Wu
IEEE Trans. Very Large Scale Integr. Syst.1
2018 Low-Complexity Secure Watermark Encryption for Compressed Sensing-Based Privacy Preserving
abstract
The emerging compressed sensing (CS) technique enables new reduced-complexity designs of sensor nodes and helps to save overall transmission power in wireless sensor network. Because of the linearity of its encoding process, CS is vulnerable to Ciphertext-Only Attack (COA) and Known-Plaintext Attack (KPA). The prior works use multiple sensing matrices as the shared secret key, however, the complexity overhead of frontend sensor and synchronization issue arising from multiple keys should be well considered. In this paper, by leveraging the characteristic of CS that is sensitive to destroyed sparsity, a low-dimension watermark is randomly chosen and embedded in measurement in front-end part. Then, in back-end solver, the proposed decrypting basis can decipher the encrypted signals without synchronization. Simulation results show that the proposed scheme achieves effective protection against COA and KPA with only 5% storage overhead. It furtherly eases the encryption complexity of front-end sensor by 98.8% under our experiments.
Kai-Ni Hou, Ting-Sheng Chen, Hung-Chi Kuo, Tzu-Hsuan Chen, An-Yeu Wu
ICASSP2
2018 Dynamically Updatable Ternary Segmented Aging Bloom Filter for OpenFlow-Compliant Low-Power Packet Processing
Sheng-Chun Kao, Ding-Yuan Lee, Ting-Sheng Chen, An-Yeu Wu
IEEE/ACM Trans. Netw.3
2010 CAD reference flow for 3D via-last integrated circuits
abstract
Next-decade computing power and interconnect bottle-neck challenge conventional IC design due to the ever increasing demands for high frequency and great bandwidth. Three-dimensional large-scale integration (3D-LSI) provides an opportunity to realize such high performance cores while reducing long latency. In this paper, we present a reference flow for the implementation of 3D via-last ICs in scalable face-to-back bonding style which leverages a mature set of 2D IC physical design tools. The first enabling technology of 3D-LSI is through-silicon via (TSV). Two kinds of TSV diameters are exemplified in the flow, namely, 5¿m and 50¿m. We propose an easy-to-adopt method to address the TSV-aware mixed-sized placement by considering the obstructions generated from adjacent-tier's floorplan, subject to certain TSV alignment constraints. Furthermore, the technique of clock tree synthesis (CTS) for a homogeneous die stack is developed to dramatically reduce the clock latency and skew. The mixed-sized placement and CTS of each tier can be done without iteration. To the best of our knowledge, no work has ever been published in literature discussing CTS for 3D via-last integration in a face-to-back fashion. Finally, to complete the proposed flow 2D timing-driven routing and modified off-line design rule check (DRC) and layout versus schematic (LVS) verification are performed very well.
Chang-Tzu Lin, Ding-Ming Kwai, Yung-Fa Chou, Ting-Sheng Chen, Wen Ching Wu
ASP-DAC4