Patents by Inventor Roy D. Cideciyan

Roy D. Cideciyan has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20190214053
    Abstract: A system includes, according to one embodiment, a magnetic head having a plurality of write transducers configured to store data to tracks of a sequential access medium and a plurality of read transducers. Each read transducer is configured to read data from the sequential access medium after being written thereto by a corresponding write transducer. A first of the read transducers is aligned with a first of the write transducers, wherein the output of the first read transducer is produced during read-while-write. The system also includes a controller and logic integrated with and/or executable by the controller. The logic is configured to read, using the plurality of read transducers, encoded data from a plurality of tracks of the sequential access medium simultaneously.
    Type: Application
    Filed: March 19, 2019
    Publication date: July 11, 2019
    Inventors: Kevin D. Butt, Roy D. Cideciyan, Simeon Furrer, Mark A. Lantz
  • Patent number: 10339971
    Abstract: In one embodiment, a system includes a magnetic head having a plurality of write transducers and a plurality of read transducers. Each read transducer is configured to read data from a sequential access medium after being written thereto by a corresponding write transducer. The system also includes a controller and logic integrated with and/or executable by the controller. The logic is configured to read, using the plurality of read transducers, encoded data from a plurality of tracks of the sequential access medium simultaneously. The logic is also configured to determine that one or more tracks of the sequential access medium are dead within a sliding window. Moreover, the logic is configured to rewrite a set of encoded data from the one or more dead tracks to live tracks in a rewrite area of the sequential access medium. Other systems, methods, and computer program products are described according to more embodiments.
    Type: Grant
    Filed: December 19, 2017
    Date of Patent: July 2, 2019
    Assignee: International Business Machines Corporation
    Inventors: Kevin D. Butt, Roy D. Cideciyan, Simeon Furrer, Mark A. Lantz
  • Publication number: 20190189156
    Abstract: In one embodiment, a system includes a magnetic head having a plurality of write transducers and a plurality of read transducers. Each read transducer is configured to read data from a sequential access medium after being written thereto by a corresponding write transducer. The system also includes a controller and logic integrated with and/or executable by the controller. The logic is configured to read, using the plurality of read transducers, encoded data from a plurality of tracks of the sequential access medium simultaneously. The logic is also configured to determine that one or more tracks of the sequential access medium are dead within a sliding window. Moreover, the logic is configured to rewrite a set of encoded data from the one or more dead tracks to live tracks in a rewrite area of the sequential access medium. Other systems, methods, and computer program products are described according to more embodiments.
    Type: Application
    Filed: December 19, 2017
    Publication date: June 20, 2019
    Inventors: Kevin D. Butt, Roy D. Cideciyan, Simeon Furrer, Mark A. Lantz
  • Publication number: 20190189157
    Abstract: In one embodiment, a method includes writing a data set to a sequential access medium. The method also includes reading the data set immediately after being written to the sequential access medium in a read-while-write process to identify one or more faulty encoded data blocks, each of the one or more faulty encoded data blocks including at least one faulty codeword having symbols at least 10 bits in size. Moreover, the method includes rewriting a first of the one or more faulty encoded data blocks within a first encoded data block set to a particular logical track in the rewrite area of the sequential access medium selected from a predetermined subset of logical tracks. The predetermined subset of logical tracks includes D1+D2+1 logical tracks. Only one faulty encoded data block from a particular sub data set is rewritten in a single encoded data block set in the rewrite area.
    Type: Application
    Filed: December 19, 2017
    Publication date: June 20, 2019
    Inventors: Roy D. Cideciyan, Simeon Furrer, Mark A. Lantz
  • Patent number: 10298272
    Abstract: In one embodiment, a system includes a controller and logic integrated with and/or executable by the controller. The logic is configured to perform iterative decoding on encoded data to obtain decoded data. The logic is also configured to perform post-decoding error diagnostics on a first portion of the decoded data in response to not obtaining a valid product codeword in the first portion after the iterative decoding of the encoded data. Other systems, methods, and computer program products for producing post-decoding error signatures are presented in accordance with more embodiments.
    Type: Grant
    Filed: June 13, 2016
    Date of Patent: May 21, 2019
    Assignee: International Business Machines Corporation
    Inventors: Steven R. Bentley, Roy D. Cideciyan, Robert A. Hutchins, Keisuke Tanaka
  • Patent number: 10243591
    Abstract: Sequence detectors and detection methods are provided for detecting symbol values corresponding to a sequence of input samples obtained from an ISI channel. The sequence detector comprises a branch metric unit (BMU) and a path metric unit (PMU). The BMU, which comprises an initial set of pipeline stages, is adapted to calculate, for each input sample, branch metrics for respective possible transitions between states of a trellis. To calculate these branch metrics, the BMU selects hypothesized input values, each dependent on a possible symbol value for the input sample and L>0 previous symbol values corresponding to possible transitions between states of the trellis. The BMU then calculates differences between the input sample and each hypothesized input value. The BMU compares these differences and selects, as the branch metric for each possible transition, an optimum difference in dependence on a predetermined state in a survivor path through the trellis.
    Type: Grant
    Filed: August 30, 2016
    Date of Patent: March 26, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Giovanni Cherubini, Roy D. Cideciyan, Simeon Furrer, Thomas H. Toifl, Hazar Yuksel
  • Patent number: 10229713
    Abstract: In one embodiment, an apparatus includes a controller and logic integrated with and/or executable by the controller. The logic is configured to perform track-dependent erasure decoding on encoded data based on detection of one or more time-varying signal quality issues associated with at least one of a plurality of tracks read simultaneously from a data storage medium. In another embodiment, a method includes determining, by a magnetic tape drive, track signal quality reliability for a plurality of tracks read simultaneously from a magnetic tape medium. In addition, the method includes performing, by the magnetic tape drive, track-dependent erasure decoding on encoded data based on detection of one or more time-varying signal quality issues associated with at least one of the plurality of simultaneously-read tracks.
    Type: Grant
    Filed: October 16, 2017
    Date of Patent: March 12, 2019
    Assignee: International Business Machines Corporation
    Inventors: Steven R. Bentley, Roy D. Cideciyan, Simeon Furrer, Keisuke Tanaka
  • Publication number: 20190036551
    Abstract: Sequence detectors and detection methods are provided for detecting symbol values corresponding to a sequence of input samples obtained from an ISI channel. The sequence detector comprises a branch metric unit (BMU) and a path metric unit (PMU). The BMU, which comprises an initial set of pipeline stages, is adapted to calculate, for each input sample, branch metrics for respective possible transitions between states of a trellis. To calculate these branch metrics, the BMU selects hypothesized input values, each dependent on a possible symbol value for the input sample and L>0 previous symbol values corresponding to possible transitions between states of the trellis. The BMU then calculates differences between the input sample and each hypothesized input value. The BMU compares these differences and selects, as the branch metric for each possible transition, an optimum difference in dependence on a predetermined state in a survivor path through the trellis.
    Type: Application
    Filed: October 1, 2018
    Publication date: January 31, 2019
    Inventors: Giovanni CHERUBINI, II, Roy D. CIDECIYAN, Simeon FURRER, Thomas H. TOIFL, Hazar YUEKSEL
  • Patent number: 10177876
    Abstract: A sequence detector is provided for detecting symbol values corresponding to a sequence of input samples obtained from a transmission channel. The sequence detector comprises a branch metric unit (BMU), a path metric unit (PMU) and a survivor memory unit. The branch metric unit calculates branch metrics for respective possible transitions between states of a trellis. The path metric unit accumulates branch metrics provided by the branch metric unit in order to establish path metrics. The survivor memory unit selects a survivor path based on the path metrics and outputs a survivor sequence of the detected symbols corresponding to the survivor path. The sequence detector is configured such that the synchronization length is different than the survivor path memory length.
    Type: Grant
    Filed: March 8, 2018
    Date of Patent: January 8, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Giovanni Cherubini, Roy D. Cideciyan, Thomas H. Toifl, Hazar Yuksel
  • Patent number: 10152375
    Abstract: In one embodiment, a system includes a controller and logic integrated with and/or executable by the controller. The logic is configured to read data stored as a plurality of first codeword sets on a first write section of a magnetic medium. The logic is also configured to read at least some of the data stored as one or more rewritten codeword sets on a rewrite section of the magnetic medium. A length of at least one rewritten row stored to the rewrite section of the magnetic medium is greater than: a length of another rewritten row in the same rewritten codeword set, and/or a length of at least one row in a codeword set stored to the first write section of the magnetic medium.
    Type: Grant
    Filed: May 13, 2016
    Date of Patent: December 11, 2018
    Assignee: International Business Machines Corporation
    Inventors: Roy D. Cideciyan, Simeon Furrer, Robert A. Hutchins, Keisuke Tanaka
  • Patent number: 10153788
    Abstract: In one embodiment, a method includes reading a codeword stored to a memory, computing a syndrome word based on a product of the codeword and a parity check matrix derived from a linear block code, setting a flag to a first value indicating that the codeword includes no errors in response to a first determination requiring that the syndrome word is an all-zero vector, setting the flag to a second value indicating that the codeword includes exactly one single-bit error in response to a second determination requiring that the syndrome word equals a column of the parity check matrix, setting the flag to a third value indicating that the codeword includes an odd number of multiple bit errors in response to a third determination, and setting the flag to a fourth value indicating that the codeword includes an even number of multiple bit errors in response to a fourth determination.
    Type: Grant
    Filed: April 27, 2016
    Date of Patent: December 11, 2018
    Assignee: International Business Machines Corporation
    Inventors: Roy D. Cideciyan, Mark A. Lantz, Scott J. Schaffer
  • Patent number: 10120599
    Abstract: In one embodiment, a method includes reading a plurality of narrow-spread (NS) codewords from M tracks of a magnetic tape medium using a plurality of read elements, the plurality of NS codewords collectively comprising data logically organized as a predetermined number of two-dimensional arrays. Each two-dimensional array includes a predetermined number of NS codewords positioned orthogonally to a predetermined number of wide-spread (WS) codewords, with a first NS codeword from a first two-dimensional array being read in its entirety from the magnetic tape medium prior to reading a second NS codeword from the first two-dimensional array. The method also includes laterally decoding each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium in succession prior to decoding any WS codewords from the first two-dimensional array. The NS codewords are protected with a stronger encoding than the WS codewords within each two-dimensional array.
    Type: Grant
    Filed: December 15, 2016
    Date of Patent: November 6, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Roy D. Cideciyan, Simeon Furrer, Ernest S. Gale, Mark A. Lantz
  • Patent number: 10055289
    Abstract: In one embodiment, a system includes a controller and logic integrated with and/or executable by the controller. The logic is configured to cause data to be written to a first write section of a magnetic medium as a plurality of first codeword sets, and cause at least some of the data to be written to a rewrite section of the magnetic medium as one or more rewritten codeword sets. A length of at least one rewritten row stored to the rewrite section of the magnetic medium is greater than either a length of another rewritten row in the same rewritten codeword set and/or a length of at least one row in a codeword set stored to the first write section of the magnetic medium.
    Type: Grant
    Filed: May 13, 2016
    Date of Patent: August 21, 2018
    Assignee: International Business Machines Corporation
    Inventors: Roy D. Cideciyan, Simeon Furrer, Robert A. Hutchins, Keisuke Tanaka
  • Publication number: 20180198558
    Abstract: A sequence detector is provided for detecting symbol values corresponding to a sequence of input samples obtained from a transmission channel. The sequence detector comprises a branch metric unit (BMU), a path metric unit (PMU) and a survivor memory unit. The branch metric unit calculates branch metrics for respective possible transitions between states of a trellis. The path metric unit accumulates branch metrics provided by the branch metric unit in order to establish path metrics. The survivor memory unit selects a survivor path based on the path metrics and outputs a survivor sequence of the detected symbols corresponding to the survivor path. The sequence detector is configured such that the synchronization length is different than the survivor path memory length.
    Type: Application
    Filed: March 8, 2018
    Publication date: July 12, 2018
    Inventors: Giovanni Cherubini, Roy D. Cideciyan, Thomas H. Toifl, Hazar Yuksel
  • Publication number: 20180173440
    Abstract: In one embodiment, a method includes reading a plurality of narrow-spread (NS) codewords from M tracks of a magnetic tape medium using a plurality of read elements, the plurality of NS codewords collectively comprising data logically organized as a predetermined number of two-dimensional arrays. Rach two-dimensional array includes a predetermined number of NS codewords positioned orthogonally to a predetermined number of wide-spread (WS) codewords, with a first NS codeword from a first two-dimensional array being read in its entirety from the magnetic tape medium prior to reading a second NS codeword from the first two-dimensional array. The method also includes laterally decoding each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium in succession prior to decoding any WS codewords from the first two-dimensional array. The NS codewords are protected with a stronger encoding than the WS codewords within each two-dimensional array.
    Type: Application
    Filed: December 15, 2016
    Publication date: June 21, 2018
    Inventors: Roy D. Cideciyan, Simeon Furrer, Ernest S. Gale, Mark A. Lantz
  • Publication number: 20180173439
    Abstract: In one embodiment, a method includes receiving data to store to a magnetic tape medium using a tape drive, the data being organized into a predetermined number of two-dimensional arrays, each two-dimensional array including a plurality of narrow-spread (NS) codewords positioned orthogonally to a plurality of wide-spread (WS) codewords (relative spread referring to space occupied on the magnetic tape medium when written). The method also includes successively writing each of the NS codewords onto a plurality of tracks of the magnetic tape medium using a first number of channels of the tape drive capable of writing data to tape tracks simultaneously. A first NS codeword from a first two-dimensional array is completely written to the magnetic tape medium prior to starting to write a second NS codeword from the first two-dimensional array. Also, the plurality of NS codewords are protected with a stronger encoding than the plurality of WS codewords.
    Type: Application
    Filed: December 15, 2016
    Publication date: June 21, 2018
    Inventors: Roy D. Cideciyan, Simeon Furrer, Ernest S. Gale, Mark A. Lantz
  • Patent number: 9998144
    Abstract: Provided are a computer program product, system, and method for generating a code alphabet for use by a deployed program to determine codewords for words. A first code alphabet has a first number of symbols that provide variable length codings of the words. A second code alphabet is generated having a second number of symbols formed by merging the symbols in the first code alphabet, wherein the second code alphabet comprises the code alphabet used by the deployed program.
    Type: Grant
    Filed: June 28, 2016
    Date of Patent: June 12, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Roy D. Cideciyan, Glen A. Jaquette, Thomas Mittelholzer
  • Patent number: 9985658
    Abstract: In one embodiment, a method includes receiving data and in an iterative process until decoded data is output or a predetermined number of full iterations have occurred: C1 decoding all first subsets of the data, determining whether to stop decoding the data after the C1 decoding, incrementing a half iteration counter to indicate completion of a half iteration, C2 decoding all second subsets of the data two or more times in each half iteration using two or more C2-decoding methods in response to a determination that a second subset is not decoded successfully using a first C2-decoding method, determining whether to stop decoding the data after the C2 decoding, incrementing the half iteration counter to indicate completion of another half iteration, and outputting the set of decoded data in response to a determination that all subsets of the data are decoded successfully.
    Type: Grant
    Filed: May 1, 2017
    Date of Patent: May 29, 2018
    Assignee: International Business Machines Corporation
    Inventors: Roy D. Cideciyan, Simeon Furrer, Robert A. Hutchins
  • Patent number: 9942005
    Abstract: A sequence detector is provided for detecting symbol values corresponding to a sequence of input samples obtained from a transmission channel. The sequence detector comprises a branch metric unit (BMU), a path metric unit (PMU) and a survivor memory unit. The branch metric unit calculates branch metrics for respective possible transitions between states of a trellis. The path metric unit accumulates branch metrics provided by the branch metric unit in order to establish path metrics. The survivor memory unit selects a survivor path based on the path metrics and outputs a survivor sequence of the detected symbols corresponding to the survivor path. The sequence detector is configured such that the synchronization length is different than the survivor path memory length.
    Type: Grant
    Filed: August 30, 2016
    Date of Patent: April 10, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Giovanni Cherubini, Roy D. Cideciyan, Thomas H. Toifl, Hazar Yuksel
  • Publication number: 20180062790
    Abstract: A sequence detector is provided for detecting symbol values corresponding to a sequence of input samples obtained from a transmission channel. The sequence detector comprises a branch metric unit (BMU), a path metric unit (PMU) and a survivor memory unit. The branch metric unit calculates branch metrics for respective possible transitions between states of a trellis. The path metric unit accumulates branch metrics provided by the branch metric unit in order to establish path metrics. The survivor memory unit selects a survivor path based on the path metrics and outputs a survivor sequence of the detected symbols corresponding to the survivor path. The sequence detector is configured such that the synchronization length is different than the survivor path memory length.
    Type: Application
    Filed: August 30, 2016
    Publication date: March 1, 2018
    Inventors: Giovanni Cherubini, Roy D. Cideciyan, Thomas H. Toifl, Hazar Yuksel