Patent US3631428A successfully refreshed from Google Patents.
← Back to Patent Explorer
US3631428A Expired / Lapsed US ⏱️ 0.0 years remaining

Quarter-half cycle coding for rotating magnetic memory system

Assignee: PACIFIC MICRONETICS Inc
•
Filing: 1968-11-19
•
Granted: 1971-12-28
•
Expires: 1988-11-19
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A system for coding information in a rotating magnetic memory, the system having means for representing, for example, a ''''1'''' by a one-half cycle portion of a wave such as a rectangular wave, and having a given frequency, and representing a ''''0'''' by onequarter portion of a similarly shaped wave having the same amplitude but only half the frequency of the first wave.

Inventors

  • 👤 Wayne J King

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 20:10
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G11B20/14; G11B20/1403; G11B20/1407; G11B20/1411

Claims Analysis

Total Claims: 16
Claim 1
Independent Claim 159 words
In a rotary magnetic memory system Including an input terminal to which binary information pulses are presented in form of bivalued bits at a particular rate corresponding to a particular bit rate frequency and having means for recording the encoded information pulses in sequential bit frames, one bit frame, and having means for recovering the recorded and encoded information pulses, the improved method for encoding the bits for recording including the steps of: converting each input binary information pulse of a first binary state into a half-cycle pulse of a selected frequency corresponding to half the bit rate frequency of the binary information to be recorded, the half-cycle cycle pulse to be recorded to extend over the entire length of a bit frame; converting each input binary information pulse of the second binary state into a quarter-cycle pulse of one-half said selected frequency, the quarter-cycle pulse to be recorded to extend over the entire length of a bit frame.
Claim 2
Dependent Claim 159 words
In a rotary magnetic memory system Including an input terminal to which binary information pulses are presented in form of bivalued bits at a particular rate corresponding to a particular bit rate frequency and having means for recording the encoded information pulses in sequential bit frames, one bit frame, and having means for recovering the recorded and encoded information pulses, the improved method for encoding the bits for recording including the steps of: converting each input binary information pulse of a first binary state into a half-cycle pulse of a selected frequency corresponding to half the bit rate frequency of the binary information to be recorded, the half-cycle cycle pulse to be recorded to extend over the entire length of a bit frame; converting each input binary information pulse of the second binary state into a quarter-cycle pulse of one-half said selected frequency, the quarter-cycle pulse to be recorded to extend over the entire length of a bit frame.
Claim 3
Dependent Claim 25 words
The method of claim 1 further including the step of decoding the recovered coded information by measuring time between zero-crossings of the coded information pulses.
Claim 4
Dependent Claim 21 words
The method of claim 1 wherein the input binary information is converted to half-cycle and quarter-cycle pulses of generally equal amplitude.
Claim 5
Dependent Claim 17 words
The method of claim 1 wherein the selected frequency is one-half the bit frequency of the system.
Claim 6
Dependent Claim 17 words
The method of claim 1 wherein the step of encoding includes controlling the encoding by timing pulses.
Claim 7
Dependent Claim 95 words
In a rotary magnetic memory system having a system bit frequency and including means for storing information and means for recovering information, the method of coding binary information pulses comprising the steps of: A. receiving binary information pulses; B. providing a code pulse having a frequency of one-half the system bit frequency for each binary information pulse of a first state and providing a code pulse having a frequency of one-quarter the system bit frequency for each binary information pulse of a second state; and C. providing all code pulses to the means for storing.
Claim 8
Dependent Claim 95 words
In a rotary magnetic memory system having a system bit frequency and including means for storing information and means for recovering information, the method of coding binary information pulses comprising the steps of: A. receiving binary information pulses; B. providing a code pulse having a frequency of one-half the system bit frequency for each binary information pulse of a first state and providing a code pulse having a frequency of one-quarter the system bit frequency for each binary information pulse of a second state; and C. providing all code pulses to the means for storing.
Claim 9
Dependent Claim 76 words
The method of claim 6 in which Step B includes the steps of: D. turning on a coded pulse output on receipt of a binary information pulse of either the first or second state. E. counting a period of time equal to one-half the time of the system bit frequency for each binary information pulse of the second state; and F. turning off the coded pulse output at the end of the respective period of time.
Claim 10
Dependent Claim 57 words
The method of claim 6 including the decoding steps of: D. actuating the means for recovering the stored coded pulses; E. amplifying the recovered coded pulses; F. counting the time between zero crossings of the coded pulses; and G. comparing each counted time between zero crossings with system bit frequency time to determine the original binary information.
Claim 11
Independent Claim 181 words
The method of recording bivalued digital data along a track and in sequential bit frames, one frame per bit, each bit frame having a trailing boundary and a leading boundary coinciding with the trailing boundary of the respectively immediately preceding frame, the carrier being in one or the other of two different states of energization along the track, there being transition zones between areas of oppositely different states, comprising the steps of: providing a transition on the trailing boundary of a bit frame for a bit of a first one of the two values to be recorded in the bit frame, only if the leading boundary of the bit frame has not been provided with a transition; and providing a transition on the trailing boundary of a bit frame for a bit of the other one of the two values to be recorded in the bit frame, only if the leading boundary of the frame has been provided with a transition, while providing a midframe transition, only if the leading boundary of the frame has not been provided with a transition.
Claim 12
Independent Claim 181 words
The method of recording bivalued digital data along a track and in sequential bit frames, one frame per bit, each bit frame having a trailing boundary and a leading boundary coinciding with the trailing boundary of the respectively immediately preceding frame, the carrier being in one or the other of two different states of energization along the track, there being transition zones between areas of oppositely different states, comprising the steps of: providing a transition on the trailing boundary of a bit frame for a bit of a first one of the two values to be recorded in the bit frame, only if the leading boundary of the bit frame has not been provided with a transition; and providing a transition on the trailing boundary of a bit frame for a bit of the other one of the two values to be recorded in the bit frame, only if the leading boundary of the frame has been provided with a transition, while providing a midframe transition, only if the leading boundary of the frame has not been provided with a transition.
Claim 13
Independent Claim 199 words
The method of encoding bivalued bits for recOrding the bits sequentially presented at a particular rate, corresponding to a particular bit rate frequency for recording in sequential bit frames, one bit per frame, comprising the steps of: converting each bit of a first value into a half-cycle pulse of a frequency half of the bit rate frequency to be recorded within a bit frame; converting each bit of a second value into a quarter-cycle pulse of one quarter the bit rate frequency to be recorded within a bit frame; and selecting the phase of a pulse in relation to the phase of the preceding pulse corresponding to two sequential bits to be recorded in sequential bit frames to have the same phase angle at the boundary between the two frames; a half-cycle pulse selected to extend from 0* to 180*, 180* to 360*, 90* to 270* or 270* to 90* , at the half-bit rate frequency, and covering the length of a bit frame, a quarter-cycle pulse selected to extend from 0* to 90*, 90* to 180* , 180* to 270* or 270* to 360* at the quarter bit rate frequency and covering the length of a bit frame.
Claim 14
Independent Claim 199 words
The method of encoding bivalued bits for recOrding the bits sequentially presented at a particular rate, corresponding to a particular bit rate frequency for recording in sequential bit frames, one bit per frame, comprising the steps of: converting each bit of a first value into a half-cycle pulse of a frequency half of the bit rate frequency to be recorded within a bit frame; converting each bit of a second value into a quarter-cycle pulse of one quarter the bit rate frequency to be recorded within a bit frame; and selecting the phase of a pulse in relation to the phase of the preceding pulse corresponding to two sequential bits to be recorded in sequential bit frames to have the same phase angle at the boundary between the two frames; a half-cycle pulse selected to extend from 0* to 180*, 180* to 360*, 90* to 270* or 270* to 90* , at the half-bit rate frequency, and covering the length of a bit frame, a quarter-cycle pulse selected to extend from 0* to 90*, 90* to 180* , 180* to 270* or 270* to 360* at the quarter bit rate frequency and covering the length of a bit frame.
Claim 15
Independent Claim 130 words
The method of encoding bivalued bits for recording, the bits sequentially presented at a particular rate corresponding to a particular bit rate frequency, for recording in sequential bit frames, one bit per frame, comprising the steps of: converting each bit of a first value into a half-cycle wave portion of a frequency half of the bit rate frequency, to be recorded within a bit frame; converting each bit of a second value into a quarter-cycle wave portion of a frequency of one quarter the bit rate frequency, to be recorded within a bit frame; and selecting the phase of each wave portion as beginning at a bit frame boundary to be larger by 90* than the selected phase angle of the wave portion as beginning at the preceding frame boundary.
Claim 16
Independent Claim 130 words
The method of encoding bivalued bits for recording, the bits sequentially presented at a particular rate corresponding to a particular bit rate frequency, for recording in sequential bit frames, one bit per frame, comprising the steps of: converting each bit of a first value into a half-cycle wave portion of a frequency half of the bit rate frequency, to be recorded within a bit frame; converting each bit of a second value into a quarter-cycle wave portion of a frequency of one quarter the bit rate frequency, to be recorded within a bit frame; and selecting the phase of each wave portion as beginning at a bit frame boundary to be larger by 90* than the selected phase angle of the wave portion as beginning at the preceding frame boundary.

References Cited (Backward Citations)

US3264623A Cited
US3174141A Cited
US3303486A Cited
US3377583A Cited
US3356934A Cited
US3491349A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1974-12-27 1975-06-28 1975-12-28 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1978-12-27 1979-06-28 1979-12-28 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1982-12-27 1983-06-28 1983-12-28 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag