googlepages!

Google总是带来惊喜,在Google labs中总是有神奇的发现。
http://www.google.com/mars/
http://moon.google.com/

几天前申请了Google Page的试用,今天收到了Google Page Creator -- Sign up!,try了一下,目前实现的界面,大概相当于PowerPoint,有外观模板和Layout模板,另外支持在线编辑Html源,但这不是真正的源,相关的css是对用户屏蔽的。

对网络支持的功能主要是在线发布,可以进行Site Setting,最大支持100M的空间。

同时对publish进行了Gmail绑定,让你随心所欲的通知friends,这种绑定带来了便捷,也是google商业化之路,总有一天,Google与微软并驾齐驱时,新的帝国势必和现在的微软一样Boring。
帮我把注释换成中文 % Bit error rate of BPSK modulated LDPC codes under AWGN channel % % % Copyright Bagawan S. Nugroho, 2007 % http://bsnugroho.googlepages.com clc; clear all; % LDPC matrix size, rate must be 1/2 % Warning: encoding - decoding can be very long for large LDPC matrix! M = 1000; N = 2000; % Method for creating LDPC matrix (0 = Evencol; 1 = Evenboth) method = 1; % Eliminate length-4 cycle noCycle = 1; % Number of 1s per column for LDPC matrix onePerCol = 3; % LDPC matrix reorder strategy (0 = First; 1 = Mincol; 2 = Minprod) strategy = 2; % EbN0 in dB EbN0 = 0:1:4; % Number of iteration; iter = 5; % Number of frame (N bits per frame) frame = 10; % Make the LDPC matrix H = makeLdpc(M, N, 1, 1, onePerCol); for i = 1:length(EbN0) ber1(i) = 0; ber2(i) = 0; ber3(i) = 0; ber4(i) = 0; % Make random data (0/1) dSource = round(rand(M, frame)); for j = 1:frame fprintf('Frame : %d\n', j); % Encoding message [c, newH] = makeParityChk(dSource(:, j), H, strategy); u = [c; dSource(:, j)]; % BPSK modulation bpskMod = 2*u - 1; % Additional white gaussian noise N0 = 1/(exp(EbN0(i)*log(10)/10)); tx = bpskMod + sqrt(N0/2)*randn(size(bpskMod)); % Decoding (select decoding method) vhat1 = decodeBitFlipping(tx, newH, iter); vhat2 = decodeProbDomain(tx, newH, N0, iter); vhat3 = decodeLogDomain(tx, newH, N0, iter); vhat4 = decodeLogDomainSimple(tx, newH, iter); % Get bit error rate (for brevity, BER calculation includes parity bits) [num1, rat1] = biterr(vhat1', u); ber1(i) = (ber1(i) + rat1); [num2, rat2] = biterr(vhat2', u); ber2(i) = (ber2(i) + rat2); [num3, rat3] = biterr(vhat3', u); ber3(i) = (ber3(i) + rat3); [num4, rat4] = biterr(vhat4', u); ber4(i) = (ber4(i) + rat4); end % for j % Get average of BER ber1(i) = ber1(i)/frame; ber2(i) = ber2(
03-16
帮我解释这个关于LDPC的函数 function [c, newH] = makeParityChk(dSource, H, strategy) % Generate parity check vector bases on LDPC matrix H using sparse LU decomposition % % dSource : Binary source (0/1) % H : LDPC matrix % strategy: Strategy for finding the next non-zero diagonal elements % {0} First : First non-zero found by column search % {1} Mincol : Minimum number of non-zeros in later columns % {2} Minprod: Minimum product of: % - Number of non-zeros its column minus 1 % - Number of non-zeros its row minus 1 % % c : Check bits % % % Copyright Bagawan S. Nugroho, 2007 % http://bsnugroho.googlepages.com % Get the matric dimension [M, N] = size(H); % Set a new matrix F for LU decomposition F = H; % LU matrices L = zeros(M, N - M); U = zeros(M, N - M); % Re-order the M x (N - M) submatrix for i = 1:M % strategy {0 = First; 1 = Mincol; 2 = Minprod} switch strategy % Create diagonally structured matrix using 'First' strategy case {0} % Find non-zero elements (1s) for the diagonal [r, c] = find(F(:, i:end)); % Find non-zero diagonal element candidates rowIndex = find(r == i); % Find the first non-zero column chosenCol = c(rowIndex(1)) + (i - 1); % Create diagonally structured matrix using 'Mincol' strategy case {1} % Find non-zero elements (1s) for the diagonal [r, c] = find(F(:, i:end)); colWeight = sum(F(:, i:end), 1); % Find non-zero diagonal element candidates rowIndex = find(r == i); % Find the minimum column weight [x, ix] = min(colWeight(c(rowIndex))); % Add offset to the chosen row index to match the dimension of the... % original matrix F chosenCol = c(rowIndex(ix)) + (i - 1); % Create
03-14
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值