2020
DOI: 10.1007/s12239-020-0144-2
|View full text |Cite
|
Sign up to set email alerts
|

Multi-Level Data Arrangement Algorithm for Can Data Compression

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 9 publications
(12 citation statements)
references
References 12 publications
0
10
0
Order By: Relevance
“…Fig. 5 shows typical compression ratios achieved by different arrangement levels [24]. As can be seen from the figure, compression ratios usually improve as arrangement levels change from eight bit to two bit.…”
Section: A Message Compression By Vmlda and Encryptionmentioning
confidence: 99%
See 4 more Smart Citations
“…Fig. 5 shows typical compression ratios achieved by different arrangement levels [24]. As can be seen from the figure, compression ratios usually improve as arrangement levels change from eight bit to two bit.…”
Section: A Message Compression By Vmlda and Encryptionmentioning
confidence: 99%
“…i-th bit of the compressed message length successive CAN frames with the same message identifier do not change rapidly [17]- [24]. In PMDV-based CAN data compression algorithms, the difference value is only transmitted if the difference between the current and preceding CAN messages does not exceed the PMDV.…”
Section: L(•)mentioning
confidence: 99%
See 3 more Smart Citations