Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Lih-Jyh Weng"'
Autor:
Douglas W. Clark, Lih-Jyh Weng
Publikováno v:
IEEE Transactions on Computers. 43:560-568
A linear feedback shift register, or LFSR, can implement an event counter by shifting whenever an event occurs. A single two-input exclusive-OR gate is often the only additional hardware necessary to allow a shift register to generate, by successive
Autor:
Lih‐Jyh Weng
Publikováno v:
Encyclopedia of Telecommunications
A brief history of coding approaches employed in magnetic recording disk drives is first reviewed. This is followed by a simple example of using the most widely used Reed-Solomon codes to illustrate the concepts and terminology frequently used in dis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d75cedf5a0b1521d03300ab4f8ced1ee
https://doi.org/10.1002/0471219282.eot100
https://doi.org/10.1002/0471219282.eot100
Publikováno v:
GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.
Systematic m-bit symbol codes are constructed by modifying (m+/spl tau/)-bit symbol Reed-Solomon (RS) codes. These new codes are called systematic modified Reed-Solomon (SMRS) codes and have code length that far exceeds 2/sup m/, the length of m-bit
Autor:
Clark, D.W., Lih-Jyh Weng
Publikováno v:
IEEE Transactions on Computers; 1994, Vol. 43 Issue 5, p560-568, 9p
Autor:
Chase, D., Lih-Jyh Weng
Publikováno v:
IEEE Transactions on Information Theory; 1976, Vol. 22 Issue 5, p505-513, 9p
Autor:
Lih-Jyh Weng, Sollman, G.
Publikováno v:
IEEE Transactions on Communication Technology; 1967, Vol. 15 Issue 6, p835-838, 4p
Autor:
Lih-Jyh Weng
Publikováno v:
IEEE Transactions on Information Theory; 1971, Vol. 17 Issue 4, p457-463, 7p
Autor:
Lih-Jyh Weng, D. Chase
Publikováno v:
IEEE Transactions on Information Theory. 22:505-513
Slowly fading channels, such as a troposcatter communication link, are characterized by multiple error bursts which may last for many thousand channel digits, as well as by random errors. It is shown that even the best random error-correcting codes c
Autor:
Lih-Jyh Weng
Publikováno v:
IEEE Transactions on Information Theory. 23:613-615
Some concatenated codes of length 128 and less are constructed. Nineteen of these codes are superior to the best previously known linear codes, as shown by the fact that the wellknown lower bound on the minimum distance of the concatenated code as th
Publikováno v:
GLOBECOM 97 IEEE Global Telecommunications Conference Conference Record; 1997, Issue 3, p1245-1245, 1p