liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Approaches for Assigning Offsets to Signals for Improving Frame Packing in CAN-FD
ECE Department, Virginia Tech, Blacksburg, USA.
Biocomplexity Institute and Initiative, University of Virginia, Charlottesville, USA; Computer Science Department, University at Albany, New York, USA.
ECE Department, Virginia Tech, Blacksburg, USA.
Electrical and Control Systems, Architectures Lab, Research and Development, General Motors, Detroit, USA.
Show others and affiliations
2020 (English)In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, ISSN 0278-0070, E-ISSN 1937-4151, Vol. 39, p. 1109-1122Article in journal (Refereed) Published
Abstract [en]

Controller area network (CAN) is a widely used protocol that allows communication among electronic control units (ECUs) in automotive electronics. It was extended to CAN with flexible data-rate (CAN-FD) to meet the increasing demand for bandwidth generated by the growing number of features in modern automobiles. The signal-to-frame packing problem has been studied in the literature for both CAN and CAN-FD. In this paper, we propose and formulate the signal offset assignment problem (SOAP) in CAN-FD to improve the bus utilization during frame packing. We propose two algorithmic themes to solve SOAP and establish their worst case performance guarantees. The first is a general approximation framework (GAF) which can use any approximation algorithm for the makespan minimization problem (MMP) in multiprocessor systems. Its performance guarantee is the product of the performance guarantee of the MMP algorithm and the number of distinct periods in the frame. The second is a 2-D strip packing-based framework (2DSPF) which uses the bottom left fill algorithm for 2-D strip packing. The performance guarantee is 2G , where G is the minimum number of groups into which the set of signals can be partitioned so that the periods of the signals in the same group form a geometric series. The experimental results for GAF and 2DSPF indicate that by carefully assigning offsets for signals in frame packing schemes, one can achieve about 10.83% improvement in bus utilization in CAN-FD systems.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2020. Vol. 39, p. 1109-1122
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-168910DOI: 10.1109/TCAD.2019.2907921ISI: 000529908600013Scopus ID: 2-s2.0-85063691283OAI: oai:DiVA.org:liu-168910DiVA, id: diva2:1463736
Available from: 2020-09-03 Created: 2020-09-03 Last updated: 2022-09-20Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Bordoloi, Unmesh D.

Search in DiVA

By author/editor
Bordoloi, Unmesh D.Samii, Soheil
In the same journal
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 48 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf