throbber
University of Minnesota
`Patent and Technology Marketing
`Office of Research and Technology Transfer
`1100 W ashin_gton A venue South, Suite 201
`Minneapolis, MN 55415-1226
`
`Number of Pages (including cover) :
`
`3
`
`Date: December 27, 1995
`
`To: Sharon D. Rotter
`NSIC
`
`Fax: (619) 621 - 2551
`
`Nathan A. Malek
`Marketing Assistant
`Tel. :
`612/625-7569
`Fax:
`612/624-4843
`E-mail:
`nathan@ortta.umn.edu
`
`From:
`
`Message
`
`RE : MTR Codes for Data Storage Systems
`U of MN Docket No. 96025
`
`Enclosed is a copy of the letter and invention summary sent to the NSIC members as you
`requested. We have not decided yet ifwe are going to patent this technology, although
`Samsung has stated their interest in covering the cost of patenting. We will notify the
`members 30 days before filing if that is what we decide to do.
`
`Best Regards,
`
`Nathan A. Malek
`
`UMN EXHIBIT 2015
`LSI Corp. et al. v. Regents of Univ. of Minn.
`IPR2017-01068
`
`
`Page 1 of 4
`
`

`

`UNIVERSITY OF MINNESOTA
`
`Patents and Technology Marketing
`Division of Mechanical, Chemical,
`Electrical and Biological Technologies
`
`Suite 201
`1100 Washington Avenue South
`Minneapolis, MN 55415-1226
`612- 624 - 3545
`Fax: 612 - 624 - 4843
`
`December 20, 1995
`
`RE : MTR Codes for Data Storage Systems
`U of MN Docket No. 96025
`NSIC/DARP A Ultra-High-Density Recording (UHDR) Project
`Magnetic Disk Component, Contract No. 972-93-1-009
`
`Dear NSIC Member :
`
`Enclosed is a one-page nonconfidential summary outlining the above referenced technology
`developed at the University of Minnesota by Professor J. Moon as part of the Ultra-High(cid:173)
`Density Recording (UHDR) Project for NSIC.
`
`If you are interested in reviewing the entire confidential report, please send your name, full
`company or University name, and full legal address to my attention within 30 days of receipt
`of this letter. I will forward our standard nondisclosure agreement for signature.
`
`A decision concerning patent protection has not yet been made. We are looking for sponsors
`who would be willing to help cover the cost of filing the patent. If you are interested, please
`contact me at your earliest convenience. I can be reached at (612) 625 - 7569 or by e-mail
`(nathan@ortta. umn. edu ).
`
`Sincerely,
`
`Nathan A Malek
`Technology Transfer Assistant
`
`Enclosure
`
`
`Page 2 of 4
`
`

`

`Invention Summary
`
`MTR Codes for Data Storage Systems
`
`U of MN Docket No. 96025
`
`The demand for greater densities in magnetic storage devices has created a need
`for data retrieval techniques with improved performance. A wide variety of detection and
`equalization methods have been proposed to address this need. This technology,
`developed by a team of Electrical Engineers here at the University, is a novel coding
`technique capable of significantly improving the reliability of sequence estimation
`detectors, such as fixed-delay tree search (FDTS).
`
`This coding scheme, designated maximum transition run (MTR), eliminates certain
`error-prone binary data patterns from the allowable set of input data patterns that are to be
`recorded in the storage medium. As a consequence, the final bit error rate, the most
`important performance measure of any digital recorder, is improved significantly when the
`original data bits are reproduced. This improvement in the bit error rate can also be
`traded for an increase in storage density if the error rate performance of the recorder is
`already satisfactory. More specifically, this new class of codes prohibit certain crowded
`transition patterns that can occur in a recorded sequence. This improves the detector
`performance by increasing the minimum distance for sequence estimator detector methods.
`
`Computer simulations have been used to demonstrate the performance advantage
`of the MTR code combined with a specific detector known as the fixed delay tree search
`(FDTS) with decision feedback over the existing code / detector combinations.
`
`~ 8
`a::
`0..
`~ 7
`0
`'E
`~ 6
`~
`[5

`$4
`:8,
`a::
`~ 3
`
`---Rate 8/9 (0,4)
`---Rate 16/19 MTR
`
`..........
`Rate4/5MTR
`
`DE
`
`tau=4
`tau=3
`tau=2
`tau=1
`FDTS/DF Tree Depth
`
`tau=5
`
`Figure 1 : Summary ofFDTS/DF Performance at BER= 10·5
`
`For a user density of Du= 2.5, simulation results in Figure 1 show up to a 2 dB
`improvement in detector performance over the conventional (O,k) code. This novel
`coding technique results in significant performance gains ( estimated 20% to 40% increase
`in storage capacity~ without a corresponding increase in hardware complexity.
`
`
`Page 3 of 4
`
`

`

`< TRANSACTION REPORT>
`
`12-27-1995(WED) 13:35
`
`[ TRANSMIT
`
`J
`
`NO.
`
`DATE
`
`TIME
`
`DESTINATION STATION
`
`PG. DURATION MODE
`
`RESULT
`
`43013
`
`12-27 13:34
`
`619 621 2551
`
`3
`
`3
`
`0° 01 '30" NORMAL
`
`OK
`
`0° 01 '30"
`
`
`Page 4 of 4
`
`

This document is available on Docket Alarm but you must sign up to view it.


Or .

Accessing this document will incur an additional charge of $.

After purchase, you can access this document again without charge.

Accept $ Charge
throbber

Still Working On It

This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.

Give it another minute or two to complete, and then try the refresh button.

throbber

A few More Minutes ... Still Working

It can take up to 5 minutes for us to download a document if the court servers are running slowly.

Thank you for your continued patience.

This document could not be displayed.

We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.

Your account does not support viewing this document.

You need a Paid Account to view this document. Click here to change your account type.

Your account does not support viewing this document.

Set your membership status to view this document.

With a Docket Alarm membership, you'll get a whole lot more, including:

  • Up-to-date information for this case.
  • Email alerts whenever there is an update.
  • Full text search for other cases.
  • Get email alerts whenever a new case matches your search.

Become a Member

One Moment Please

The filing “” is large (MB) and is being downloaded.

Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.

Your document is on its way!

If you do not receive the document in five minutes, contact support at support@docketalarm.com.

Sealed Document

We are unable to display this document, it may be under a court ordered seal.

If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.


Access Government Site

We are redirecting you
to a mobile optimized page.





Document Unreadable or Corrupt

Refresh this Document
Go to the Docket

We are unable to display this document.

Refresh this Document
Go to the Docket