Work Files Saved Searches
   My Account                                                  Search:   Quick/Number   Boolean   Advanced   Derwent    Help   


 The Delphion Integrated View

  Buy Now:   Buy PDF- 11pp  PDF  |   File History  |   Other choices   
  Tools:  Citation Link  |  Add to Work File:    
  View:  Expand Details   |  INPADOC   |  Jump to: 
  Go to:  Derwent  
 Email this to a friend  Email this to a friend 
       
Title: US6430713: System and method for constructing low complexity block coders
[ Derwent Title ]


Country: US United States of America

View Images High
Resolution

 Low
 Resolution

 
11 pages

 
Inventor: Marcus, Brian Harry; Los Altos, CA
Modha, Dharmendra Shantilal; San Jose, CA

Assignee: International Business Machines Corporation, Armonk, NY
other patents from INTERNATIONAL BUSINESS MACHINES CORPORATION (280070) (approx. 44,393)
 News, Profiles, Stocks and More about this company

Published / Filed: 2002-08-06 / 1999-06-30

Application Number: US1999000345579

IPC Code: Advanced: H03M 5/14; G11B 20/14;
Core: H03M 5/00; more...
IPC-7: G06F 11/00; H03M 7/00;

ECLA Code: H03M5/14B;

U.S. Class: 714/701; 341/058; 341/059; 341/095; 341/106; 360/040; 360/048;

Field of Search: 714/752,746,795,796,700,701 341/058,59,95,81,65,68,106,61,69 360/032,40,48 375/241,290,341 711/200,202,206 382/232

Priority Number:
1999-06-30  US1999000345579

Abstract: A method for designing a computer program for finding a low-complexity coder for constrained block codes for application to timing recovery or error control in data recording systems. The method includes (1) decomposing an input set of candidate codewords into simple subsets of codewords, (2) providing, for each simple subset of codewords, a respective subset of datawords, and (3) filling in certain coordinates in the datawords by values of certain coordinates in the codewords.

Attorney, Agent or Firm: Rogitz, John L. ;

Primary / Asst. Examiners: Moise, Emmanuel L.;

INPADOC Legal Status: Show legal status actions

Family: None

First Claim:
Show all 22 claims
We claim:     1. A computer system, comprising:
  • a general purpose computer; and
  • a program of instructions accessible by the computer to undertake method acts to map p-bit datawords to q-bit codewords, the method acts comprising:
    • receiving an input set of q-bit candidate codewords;
    • using the input set of codewords, establishing plural simple subsets of codewords;
    • associating the subsets with respective p-bit datawords; and
    • mapping codewords to datawords using the subsets.


Background / Summary: Show background / summary

Drawing Descriptions: Show drawing descriptions

Description: Show description

       
U.S. References: Go to Result Set: All U.S. references   |  No patents reference this one   |   Backward references (12)   |   Citation Link

Buy
PDF
Patent  Pub.Date  Inventor Assignee   Title
Buy PDF- 15pp US4707681  1987-11 Eggenberger et al.  International Business Machines Corporation Method and apparatus for implementing optimum PRML codes
Buy PDF- 9pp US4786890  1988-11 Marcus et al.  International Business Machines Corporation Method and apparatus for implementing a PRML code
Buy PDF- 21pp US4864303  1989-09 Ofek  Board of Trustees of the University of Illinois Encoder/decoder system and methodology utilizing conservative coding with block delimiters, for serial communication
Buy PDF- 20pp US4893199  1990-01 Okada  Sony Corporation Digital signal recording apparatus with a digital subdata converting capability
Buy PDF- 13pp US5196849  1993-03 Galbraith  International Business Machines Corporation Method and apparatus for implementing PRML codes with maximum ones
Buy PDF- 10pp US5241395  1993-08 Chen  Bell Communications Research, Inc. Adaptive transform coding using variable block size
Buy PDF- 11pp US5448642  1995-09 Yeh  The United States of America as represented by the Administrator of the National Aeronautics and Space Administration Method for coding low entrophy data
Buy PDF- 20pp US5600812  1997-02 Park  Samsung Electronics Co., Ltd. Variable-length-code decoders storing decoding results and corresponding code-bit-length information in memory
Buy PDF- 301pp US5784631  1998-07 Wise  Discovision Associates Huffman decoder
Buy PDF- 19pp US6016330  2000-01 Ashley et al.  International Business Machines Corporation Encoding and detection of balanced codes
Buy PDF- 17pp US6204781  2001-03 Aziz et al.  Lucent Technologies Inc. General rate N/(N+1) (0, G) code construction for data coding
Buy PDF- 34pp US6241778  2001-06 De Lind Van Wijngaarden et al.  Lucent Technologies Inc. Methods and apparatus for implementing run-length limited and maximum transition run codes
       
Foreign References: None

Other References:
  • PUBLICATION:"Finite-State Modulation Codes for Data Storage." Marcus et al. IEEE Journal on Selected Areas in Communications. vol. 10, No. 1. pp. 5-37. Jan. 1992. (33 pages) Cited by 28 patents [ISI abstract]


  • Inquire Regarding Licensing

    Powered by Verity


    Plaques from Patent Awards      Gallery of Obscure PatentsNominate this for the Gallery...

    Thomson Reuters Copyright © 1997-2010 Thomson Reuters 
    Subscriptions  |  Web Seminars  |  Privacy  |  Terms & Conditions  |  Site Map  |  Contact Us  |  Help