In order to thoroughly understand what makes Linux tick and why it works so well on a wide variety of systems, you need to delve deep into the heart of the kernel. The kernel handles all interactions between the CPU and the external world, and determines which programs will share processor time, in what order. It manages limited memory so well that hundreds of processes can share the system efficiently, and expertly organizes data transfers so that the CPU isn t kept waiting any longer than necessary for the relatively slow disks.
There is an example of how to use the LDPC encode/decode with AWGN
channel model in files .\ldpc_decode.m and .\GFq\ldpc_decode.m.
There are a few parity check matrices available in the code but
you can use other matrices provided you have enough memory to load
them. I suggest checking out matrices in Alist format available on
David MacKay s web site.You will need to have access to a MEX compiler
to be able to use a few functions written in C.
LDPC的仿真代碼
Problem Statement
You are given a string input. You are to find the longest substring of input such that the reversal of the substring is also a substring of input. In case of a tie, return the string that occurs earliest in input.
Definition
Class: ReverseSubstring
Method: findReversed
Parameters: string
Returns: string
Method signature: string findReversed(string input)
(be sure your method is public)
Notes
The substring and its reversal may overlap partially or completely.
The entire original string is itself a valid substring (see example 4).
Constraints
input will contain between 1 and 50 characters, inclusive.
Each character of input will be an uppercase letter ( A - Z ).
Examples
0)
"XBCDEFYWFEDCBZ"
Returns: "BCDEF"
We see that the reverse of BCDEF is FEDCB, which appears later in the string.
1)
This program demonstrates using watchdog timers to invoke deadline
handlers. CoordinatorTask sends data to the organizer.
OrganizerTask receives data from the coordinatorTask, and resets
the coordinatorTask when no data is sent by the coordinatorTask in
the past five seconds (deadline time). This demonstration program
is automatically stopped after twenty seconds.