Difference between revisions of "Protocol decoder:Mfm"
Jump to navigation
Jump to search
Uwe Hermann (talk | contribs) m (Uwe Hermann moved page Protocol decoder:MFM to Protocol decoder:Mfm without leaving a redirect) |
|||
| (One intermediate revision by one other user not shown) | |||
| Line 3: | Line 3: | ||
| name = MFM | | name = MFM | ||
| description = Floppy disk FM and MFM | | description = Floppy disk FM and MFM | ||
| status = in progress | |||
| license = GPLv2+ | | license = GPLv2+ | ||
| source_code_dir = mfm | |||
| image = | |||
| input = logic | | input = logic | ||
| output = mfm | |||
| probes = | |||
| optional_probes = | |||
| options = | |||
}} | }} | ||
The '''mfm''' protocol decoder can process the [https://en.wikipedia.org/wiki/Modified_Frequency_Modulation MFM and FM] encodings used by floppy disk drives, with various sampling rates, data rates, etc. | The '''mfm''' protocol decoder can process the [https://en.wikipedia.org/wiki/Modified_Frequency_Modulation MFM and FM] encodings used by floppy disk drives, with various sampling rates, data rates, etc.<BR> | ||
(The source code isn't ready to be submitted to the official repository yet, but for now a preliminary version may be obtained from [http://www.sardis-technologies.com/ufdr/pulseview.htm this site].) | |||
'''PulseView screen captures:''' | '''PulseView screen captures:''' | ||
| Line 16: | Line 23: | ||
File: PulseViewMfm2.jpg | File: PulseViewMfm2.jpg | ||
</gallery> | </gallery> | ||
== Resources == | == Resources == | ||
Latest revision as of 17:04, 1 April 2020
| Name | MFM |
|---|---|
| Description | Floppy disk FM and MFM |
| Status | in progress |
| License | GPLv2+ |
| Source code | decoders/mfm |
| Input | logic |
| Output | mfm |
The mfm protocol decoder can process the MFM and FM encodings used by floppy disk drives, with various sampling rates, data rates, etc.
(The source code isn't ready to be submitted to the official repository yet, but for now a preliminary version may be obtained from this site.)
PulseView screen captures:
