Method and apparatus for computing 'N-bit at a time' CRC's of data frames of lengths not multiple of N

The present invention discloses CRC checking 'N-bit at a time' of data frames of lengths not necessarily in a multiple of the N-bit. While receiving the data frame, the data frame length is extracted from the protocol header and a misalignment is computed versus the 'N-bit at a time&#...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Glaise, Rene, Verplanken, Fabrice
Format: Patent
Sprache:eng
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Glaise, Rene
Verplanken, Fabrice
description The present invention discloses CRC checking 'N-bit at a time' of data frames of lengths not necessarily in a multiple of the N-bit. While receiving the data frame, the data frame length is extracted from the protocol header and a misalignment is computed versus the 'N-bit at a time' value. Simultaneously, CRC is computed on each received N-bit of the data frame and an FCS register is updated. At each cycle, a checking is performed to know whether the data frame length has been extracted from the protocol header. While the data frame length is not yet known and more bits are left to process, the data frame is continued to be received and computed 'N-bit at a time'. When the data frame length is known and no more bits are to be processed, the current value of the FCS register is compared to a pre-stored vector corresponding to the misalignment. If a match occurs, checking of the data frame passes and the data frame is accepted. If a match does not occur, checking of the data frame fails and the data frame may be rejected. Therefore, the present invention is capable of computing CRC of a data frame 'N-bit at a time' while the data frame length is not yet known.
format Patent
fullrecord <record><control><sourceid>uspatents_EFH</sourceid><recordid>TN_cdi_uspatents_grants_07103822</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>07103822</sourcerecordid><originalsourceid>FETCH-uspatents_grants_071038223</originalsourceid><addsrcrecordid>eNqNirsKwkAURNNYiPoP06UKxKTQPkRsTCH2cjV3k4V9sXv3_03EDxBmOJxhtoW6scx-BLmlIVAkyQnKR7y9DVm0m1AO1UsLaAlEWy7R3bsywSuMJAQVyfJXDbtJ5gTnBTYb0cHwug_7YqPIJD78uCtw6R_dtcopkLCT9JwirahPx7o9N037x-UDy1M94Q</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Method and apparatus for computing 'N-bit at a time' CRC's of data frames of lengths not multiple of N</title><source>USPTO Issued Patents</source><creator>Glaise, Rene ; Verplanken, Fabrice</creator><creatorcontrib>Glaise, Rene ; Verplanken, Fabrice ; International Business Machines Corporation</creatorcontrib><description>The present invention discloses CRC checking 'N-bit at a time' of data frames of lengths not necessarily in a multiple of the N-bit. While receiving the data frame, the data frame length is extracted from the protocol header and a misalignment is computed versus the 'N-bit at a time' value. Simultaneously, CRC is computed on each received N-bit of the data frame and an FCS register is updated. At each cycle, a checking is performed to know whether the data frame length has been extracted from the protocol header. While the data frame length is not yet known and more bits are left to process, the data frame is continued to be received and computed 'N-bit at a time'. When the data frame length is known and no more bits are to be processed, the current value of the FCS register is compared to a pre-stored vector corresponding to the misalignment. If a match occurs, checking of the data frame passes and the data frame is accepted. If a match does not occur, checking of the data frame fails and the data frame may be rejected. Therefore, the present invention is capable of computing CRC of a data frame 'N-bit at a time' while the data frame length is not yet known.</description><language>eng</language><creationdate>2006</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/7103822$$EPDF$$P50$$Guspatents$$Hfree_for_read</linktopdf><link.rule.ids>230,308,778,800,883,64020</link.rule.ids><linktorsrc>$$Uhttps://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/7103822$$EView_record_in_USPTO$$FView_record_in_$$GUSPTO$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Glaise, Rene</creatorcontrib><creatorcontrib>Verplanken, Fabrice</creatorcontrib><creatorcontrib>International Business Machines Corporation</creatorcontrib><title>Method and apparatus for computing 'N-bit at a time' CRC's of data frames of lengths not multiple of N</title><description>The present invention discloses CRC checking 'N-bit at a time' of data frames of lengths not necessarily in a multiple of the N-bit. While receiving the data frame, the data frame length is extracted from the protocol header and a misalignment is computed versus the 'N-bit at a time' value. Simultaneously, CRC is computed on each received N-bit of the data frame and an FCS register is updated. At each cycle, a checking is performed to know whether the data frame length has been extracted from the protocol header. While the data frame length is not yet known and more bits are left to process, the data frame is continued to be received and computed 'N-bit at a time'. When the data frame length is known and no more bits are to be processed, the current value of the FCS register is compared to a pre-stored vector corresponding to the misalignment. If a match occurs, checking of the data frame passes and the data frame is accepted. If a match does not occur, checking of the data frame fails and the data frame may be rejected. Therefore, the present invention is capable of computing CRC of a data frame 'N-bit at a time' while the data frame length is not yet known.</description><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2006</creationdate><recordtype>patent</recordtype><sourceid>EFH</sourceid><recordid>eNqNirsKwkAURNNYiPoP06UKxKTQPkRsTCH2cjV3k4V9sXv3_03EDxBmOJxhtoW6scx-BLmlIVAkyQnKR7y9DVm0m1AO1UsLaAlEWy7R3bsywSuMJAQVyfJXDbtJ5gTnBTYb0cHwug_7YqPIJD78uCtw6R_dtcopkLCT9JwirahPx7o9N037x-UDy1M94Q</recordid><startdate>20060905</startdate><enddate>20060905</enddate><creator>Glaise, Rene</creator><creator>Verplanken, Fabrice</creator><scope>EFH</scope></search><sort><creationdate>20060905</creationdate><title>Method and apparatus for computing 'N-bit at a time' CRC's of data frames of lengths not multiple of N</title><author>Glaise, Rene ; Verplanken, Fabrice</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-uspatents_grants_071038223</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2006</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Glaise, Rene</creatorcontrib><creatorcontrib>Verplanken, Fabrice</creatorcontrib><creatorcontrib>International Business Machines Corporation</creatorcontrib><collection>USPTO Issued Patents</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Glaise, Rene</au><au>Verplanken, Fabrice</au><aucorp>International Business Machines Corporation</aucorp><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Method and apparatus for computing 'N-bit at a time' CRC's of data frames of lengths not multiple of N</title><date>2006-09-05</date><risdate>2006</risdate><abstract>The present invention discloses CRC checking 'N-bit at a time' of data frames of lengths not necessarily in a multiple of the N-bit. While receiving the data frame, the data frame length is extracted from the protocol header and a misalignment is computed versus the 'N-bit at a time' value. Simultaneously, CRC is computed on each received N-bit of the data frame and an FCS register is updated. At each cycle, a checking is performed to know whether the data frame length has been extracted from the protocol header. While the data frame length is not yet known and more bits are left to process, the data frame is continued to be received and computed 'N-bit at a time'. When the data frame length is known and no more bits are to be processed, the current value of the FCS register is compared to a pre-stored vector corresponding to the misalignment. If a match occurs, checking of the data frame passes and the data frame is accepted. If a match does not occur, checking of the data frame fails and the data frame may be rejected. Therefore, the present invention is capable of computing CRC of a data frame 'N-bit at a time' while the data frame length is not yet known.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_uspatents_grants_07103822
source USPTO Issued Patents
title Method and apparatus for computing 'N-bit at a time' CRC's of data frames of lengths not multiple of N
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T05%3A23%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-uspatents_EFH&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Glaise,%20Rene&rft.aucorp=International%20Business%20Machines%20Corporation&rft.date=2006-09-05&rft_id=info:doi/&rft_dat=%3Cuspatents_EFH%3E07103822%3C/uspatents_EFH%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true