[특허]ECC code mechanism to detect wire stuck-at faults

Hewlett-Packard Development Company, L.P.

검색어에 아래의 연산자를 사용하시면 더 정확한 검색결과를 얻을 수 있습니다.
검색연산자

검색도움말
검색연산자	기능	검색시 예
()	우선순위가 가장 높은 연산자	예1) (나노 (기계 \| machine))
공백	두 개의 검색어(식)을 모두 포함하고 있는 문서 검색	예1) (나노 기계) 예2) 나노 장영실
\|	두 개의 검색어(식) 중 하나 이상 포함하고 있는 문서 검색	예1) (줄기세포 \| 면역) 예2) 줄기세포 \| 장영실
!	NOT 이후에 있는 검색어가 포함된 문서는 제외	예1) (황금 !백금) 예2) !image
*	검색어의 *란에 0개 이상의 임의의 문자가 포함된 문서 검색	예) semi*
""	따옴표 내의 구문과 완전히 일치하는 문서만 검색	예) "Transform and Quantization"

과학기술 지식인프라 ScienceON

연합인증

연합인증 가입 기관의 연구자들은 소속기관의 인증정보(ID와 암호)를 이용해 다른 대학, 연구기관, 서비스 공급자의 다양한 온라인 자원과 연구 데이터를 이용할 수 있습니다.

이는 여행자가 자국에서 발행 받은 여권으로 세계 각국을 자유롭게 여행할 수 있는 것과 같습니다.

연합인증으로 이용이 가능한 서비스는 NTIS, DataON, Edison, Kafe, Webinar 등이 있습니다.

한번의 인증절차만으로 연합인증 가입 서비스에 추가 로그인 없이 이용이 가능합니다.

다만, 연합인증을 위해서는 최초 1회만 인증 절차가 필요합니다. (회원이 아닐 경우 회원 가입이 필요합니다.)

연합인증 절차는 다음과 같습니다.

최초이용시에는
ScienceON에 로그인 → 연합인증 서비스 접속 → 로그인 (본인 확인 또는 회원가입) → 서비스 이용

그 이후에는
ScienceON 로그인 → 연합인증 서비스 접속 → 서비스 이용

연합인증을 활용하시면 KISTI가 제공하는 다양한 서비스를 편리하게 이용하실 수 있습니다.

특허 상세정보

MyON담기

내보내기 페이스북 공유 트위터 공유 카카오톡 공유

ECC code mechanism to detect wire stuck-at faults

특허상세정보
국가/구분	United States(US) Patent 등록
국제특허분류(IPC7판)	H03M-013/00 G01R-031/28
미국특허분류(USC)	714/753; 714/712; 714/777
출원번호	US-0245260 (2002-09-17)
발명자 / 주소	Sharma, Debendra Das
출원인 / 주소	Hewlett-Packard Development Company, L.P.
인용정보	피인용 횟수 : 4 인용 특허 : 8

초록
▼

The inventive mechanism detects wire stuck-at faults, which can be used with any other ECC code. The inventive mechanism determines the number of 1's (or 0's) in the data portion and the ECC code of the data portion. This counted number is then provided with ECC code. The data portion, its ECC, the counted number, and its ECC are transmitted to the destination. At the destination, the message is decoded, and the number of 1's in the received message is compared with the counted number, if there is a discrepancy, then a wire fault is signaled. The mechani...

대표
청구항
▼

1. A method for forming a data message for transmission, comprising:determining a counter value that represents a number of a specific bit present in the data message; forming an error code (EC) portion that is associated with the counter value; and encoding the data message with the counter value and the EC portion. 2. The method of claim 1, wherein the data message comprises a data portion, the method further comprising:forming another EC portion that is associated with the data portion. 3. The method of claim 1, wherein the specific bit is selected from the group consisting of a binary one and a binary zero.4. The method of claim 1, wherein the encoded data message is delivered to a receiving entity, the method further comprising:using, by the receiving entity, the encoded counter value to determine whether an error exists in the data message from a wire failure during transmission of the data message. 5. The method of claim 4, wherein the using, by the receiving entity, the encoded counter value, comprises:splitting the message into at least two sub-messages, with the first sub-message comprising a data portion of the message and the second sub-message comprising the counter value and the EC portion; determining another counter value that represents a number of the specific bit present in the first sub-message; comparing the another counter value with the counter value of the second sub-message; and signaling an error if the step of comparison indicates that the another counter value is different from the counter value. 6. The method of claim 5, wherein the using, by the receiving entity, the encoded counter value, further comprises:detecting errors in the second sub-message via the EC portion; and wherein detecting errors operates prior to the determining another counter value. 7. The method of claim 6, wherein:the EC portion is one of a single error correcting and double error detecting code, and a single error detecting code. 8. The method of claim 1, wherein a size of the counter value and the EC portion is larger than a size that can be protected by the EC portion when compared to a width of a transmission path used in the transmission of the message, the method further comprising:creating a subsequent counter value that represents a number of the specific bit present in the preceding counter value and the preceding EC portion; forming a subsequent EC portion that is associated with the subsequent counter value; and repeating the steps of creating and forming until a size of the subsequent counter value and the subsequent EC is no larger than the size that can be protected by the subsequent ECC when compared to the width of the transmission path. 9. The method of claim 1, wherein a size of the counter value and the EC portion is larger than a size that can be protected by the EC portion when compared to a width of a transmission path used in the transmission of the message, the method further comprising:separating the counter value into a plurality of counter value portions; and forming a plurality EC portions, each of which is associated with a particular one of the plurality of counter value portions; wherein a size of each counter value portion and its associated EC portion is no larger than the size that can be protected by the associated EC when compared to the width of the transmission path. 10. The method of claim 1, further comprising the steps of:truncating the counter value by removing the higher order bits such that the remaining bits are wide enough to indicate twice a number of cycles required to transmit the data message; wherein the step of truncating operates prior to the step of forming the EC portion. 11. A method for forming a data message for transmission, wherein the data message comprises a data portion, the method comprising:determining a counter value that represents a number of a specific bit present in the data portion; truncating the counter value by removing the higher order bits such that the remaining bits are wide enough to indicate twice a number of cycles required to transmit the data portion; and encoding the data message with the truncated counter value. 12. The method of claim 11, wherein the specific bit is selected from the group consisting of a binary one and a binary zero.13. The method of claim 11, wherein the encoded data message is delivered to a receiving entity, the method further comprising:using, by the receiving entity, the encoded counter value to determine whether an error exists in the data portion from a wire failure during transmission of the data message. 14. A computer program product having a computer readable medium having computer program logic recorded thereon for forming a data message for transmission, the computer program product comprising:means for determining a counter value that represents a number of a specific bit present in the data message; means for forming an error code (EC) portion that is associated with the counter value; and means for encoding the data message with the counter value and the EC portion. 15. The computer program produce of claim 14, further comprising:means for using the encoded counter value to determine whether an error exists in the data message from a wire failure during transmission of the data message. 16. The computer program product of claim 15, wherein the means for using comprises:means for splitting the message into at least two sub-messages, with the first sub-message comprising a data portion of the data message, and the second sub-message comprising the counter value and the EC portion; means for determining another counter value that represents a number of the specific bit present in the first sub-message; means for comparing the another counter value with the counter value of the second sub-message; and means for signaling an error if the step of comparison indicates that the another counter value is different from the counter value. 17. The computer program product of claim 16, wherein the means for using further comprises:means for detecting errors in the second sub-message via the EC portion; wherein the means for detecting errors operates prior to the means for determining another counter value. 18. The computer program produce of claim 14, wherein the data message comprises a data portion and another EC portion that is associated with the data portion.19. The computer program produce of claim 14, wherein the specific bit is selected from the group consisting of a binary one and a binary zero.20. The computer program product of claim 14, wherein:the EC portion is one of a single error correcting and double error detecting code, and a single error detecting code. 21. The computer program product of claim 14, wherein a size of the counter value and the EC portion is larger than a size that can be protected by the EC portion when compared to a width of a transmission path used in the transmission of the message, the computer program product further comprising:means for creating a subsequent counter value that represents a number of the specific bit present in the preceding counter value and the preceding EC portion; means for forming a subsequent EC portion that is associated with the subsequent counter value; and means for repeating the steps of creating and forming until a size of the subsequent counter value and the subsequent EC is no larger than the size that can be protected by the subsequent ECC when compared to the width of the transmission path. 22. The computer program product of claim 14, wherein a size of the counter value and the EC portion is larger than a size that can be protected by the EC portion when compared to a width of a transmission path used in the transmission of the message, the computer program product further comprising:means for separating the counter value into a plurality of counter value portions; and means for forming a plurality EC portions, each of which is associated with a particular one of the plurality of counter value portions; wherein a size of each counter value portion and its associated EC portion is no larger than the size that can be protected by the associated EC when compared to the width of the transmission path. 23. The computer program product of claim 14, further comprising:means for truncating the counter value by removing the higher order bits such that the remaining bits are wide enough to indicate twice a number of cycles required to transmit the data message; wherein the means for truncating operates prior to the means for forming the EC portion. 24. A computer program product having a computer readable medium having computer program logic recorded thereon for forming a data message for transmission, wherein the data message comprises a data portion, the computer program product comprising:means for determining a counter value that represents a number of a specific bit present in the data portion; means for truncating the counter value by removing the higher order bits such that the remaining bits are wide enough to indicate twice a number of cycles required to transmit the data portion; and means for encoding the data message with the truncated counter value. 25. The computer program product of claim 24, further comprising:means for using the encoded counter value to determine whether an error exists in the data portion from a wire failure during transmission of the data message. 26. The computer program product of claim 24, wherein the specific bit is selected from the group consisting of a binary one and a binary zero.

이 특허에 인용된 특허 (8)

이 특허를 인용한 특허 피인용횟수: 4

IPC 상위 출원인

내보내기

상세정보
내보내기 구분	파일저장 인쇄 메일전송
구성항목	관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표IPC 관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 공고번호, 공고일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표출원인, 출원인국적, 출원인주소, 발명자, 발명자E, 발명자코드, 발명자주소, 발명자 우편번호, 발명자국적, 대표IPC, IPC코드, 요약, 미국특허분류, 대리인주소, 대리인코드, 대리인(한글), 대리인(영문), 국제공개일자, 국제공개번호, 국제출원일자, 국제출원번호, 우선권, 우선권주장일, 우선권국가, 우선권출원번호, 원출원일자, 원출원번호, 지정국, Citing Patents, Cited Patents
저장형식	Text(ASCII format) Excel format PIAS분석(.xls)
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	> 총 건의 자료가 검색되었습니다. > 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) > 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. > 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) > 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오 > ~ > Text(ASCII format) Excel format

과학기술 지식인프라 ScienceON

ScienceON Chatbot

연합인증

특허 상세정보

ECC code mechanism to detect wire stuck-at faults

초록
▼

대표
청구항
▼

이 특허에 인용된 특허 (8)

이 특허를 인용한 특허 피인용횟수: 4

IPC 상위 출원인

과제정보

상세정보조회

원문조회

IPC 상세정보(version : 201201)

연구과제 성과물(0)

참여연구원의 다른 문헌(0)

처리중입니다.

잠시만 기다려주세요.

ScienceON Chatbot

연합인증

특허 상세정보

ECC code mechanism to detect wire stuck-at faults

초록 ▼

대표청구항 ▼

이 특허에 인용된 특허 (8)

이 특허를 인용한 특허 피인용횟수: 4

IPC 상위 출원인

과제정보

상세정보조회

원문조회

IPC 상세정보(version : 201201)

연구과제 성과물(0)

참여연구원의 다른 문헌(0)

처리중입니다.

잠시만 기다려주세요.

초록
▼

대표
청구항
▼