`// //
`// IRA.h //
`// Head file for IRA //
`//************************************************//
`//
`// Author: Hui Jin
`// Modification: Mar 10, 2000 First version
`// This file defines the class of Irregular Repeat Accumulate code.
`// the code essentially is a concatenate of LDGM code and Accumulate
`code.
`
`#ifndef _IRA_H
`#define _IRA_H
`
`#include <iostream.h>
`#include <stdlib.h>
`
`#include "ldpc.h"
`#include "node.h"
`#include "random.hh"
`
`class IRAcode
`
`{
`
` private:
` RandomGenerator *Rand; //random generator, used to simulate
`noise.
`
` int infobits_len; //length of information
`bits
` int codebits_len; //length of code bits
` int checkbits_len; //length of check bits
` double rate; //related by rate of this
`code.
`
` int LEdge_num; //edges number on the left. LDGM
`part.
` int REdge_num; //edges number on the right, Acc.
`part.
`
` int *Interleaver; // the permutation of LDGM code. Length
`is
` // LEdge_num.
` double *y_r; //received codebits. Length codebits_len.
` double sigma; //sigma, noise standard deviation, channel.
`
`
` degree_sequence *pLV; //LDGM variable degree profile.
` degree_sequence *pLC; //LDGM check degree profile.
`
`0001
`
`CALTECH - EXHIBIT 2023
`Apple Inc. v. California Institute of Technology
`IPR2017-00701
`
`
`
` // passed by calling function.
`
` double * LMessage; // the message updated between left
` // variable and check nodes.
` // Length should be LEdge_num.
` double * RMessage; // The message update between check
`nodes and
` // variable nodes on right.
`
` int * Lbelief; //the belief from left variables, through
`edges.
` int * Rbelief; //the belief from right varibles, through
`edges.
`
` var_node *RVarNode; //for LDPC codes, only L exists.
` var_node *LVarNode;
` check_node * CheckNode; //check nodes.
`
` void getYrAWGN();
`
`
`
` //initialize Left variable nodes.
` void initLVNode(int nv[]);
` //initialize right variable nodes.
` void initRVNode();
`
` //initialize check nodes.
` void initCNode();
` void initMessage();
` void initM0();
`
`//debug function.
`
`
` public:
` IRAcode() { }
` IRAcode(int info_len, int check_len, int _LEdgenum, int nv[],
`degree_sequence * _pLV, degree_sequence * _pLC, \
` double _sigma, RandomGenerator *_Rand, int *_Interleaver);
`
` ~IRAcode() {
` delete [] LMessage;
` delete [] RMessage;
` delete [] Lbelief;
` delete [] Rbelief;
` delete [] RVarNode;
` delete [] LVarNode;
`
`0002
`
`
`
` delete [] CheckNode;
` delete [] Interleaver;
` delete [] y_r;
` }
`
` void update_message();//update message by message passing.
`
` int wrong_bits(); // total wrong bits after belief
`propagation is stoped.
` bool state_check(); //1 if every parity check is satisfied.
` //0 otherwise
` void iteration(int num); // do message passing in num
`iterations.
` int smartIteration(); // do iterations in a smart way.
`
`
`//debug function.
` void displayConnection();
` void displayMessage();
`};
`
`/*
`this function gets the received sequence after AWGN channel. Given
`sigma, and
`assuming all zero is transmitted.
`*/
`
`inline void IRAcode::getYrAWGN() {
` int codeseq[codebits_len];
` for(int i=0; i<codebits_len; i++)
` codeseq[i]=0;
`
` Rand->binAWGNchannel(codeseq, codebits_len, sigma, y_r);
`
`} /
`
`*
`This function initializes all the message to zero.
`*/
`
`inline void IRAcode::initMessage()
`
`{
`
` int i;
` for(i=0; i<LEdge_num; i++)
` {
` LMessage[i]=0;
` Lbelief[i]=1;
` }
` for(i=0; i<REdge_num; i++)
` {
`
`0003
`
`
`
` RMessage[i]=0;
` Rbelief[i]=1;
` }
`}
`
`/*
`this function displays the connection between nodes.
`*/
`
`inline void IRAcode::displayConnection()
`
`{
`
` int i;
` for(i=0; i<infobits_len; i++)
` LVarNode[i].display_edgeid();
` for(i=0; i<checkbits_len; i++)
` {
` RVarNode[i].display_edgeid();
` CheckNode[i].display_edgeid();
` }
`
`} /
`
`*
`this function displays the message on all edges.
`*/
`inline void IRAcode::displayMessage()
`
`{
`
` int i;
` for(i=0; i<LEdge_num; i++)
` cout << i << " " << LMessage[i] << " " << endl;
` for(i=0; i<REdge_num; i++)
` cout << i << " " << RMessage[i] << " " << endl;
`
`endif _IRA_H
`
`} #
`
`0004
`
`
`
`0005
`
`0005
`
`
Accessing this document will incur an additional charge of $.
After purchase, you can access this document again without charge.
Accept $ Charge
Still Working On It
This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.
Give it another minute or two to complete, and then try the refresh button.
A few More Minutes ... Still Working
It can take up to 5 minutes for us to download a document if the court servers are running slowly.
Thank you for your continued patience.
This document could not be displayed.
We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.
Your account does not support viewing this document.
You need a Paid Account to view this document. Click here to change your account type.
Your account does not support viewing this document.
Set your membership
status to view this document.
With a Docket Alarm membership, you'll
get a whole lot more, including:
- Up-to-date information for this case.
- Email alerts whenever there is an update.
- Full text search for other cases.
- Get email alerts whenever a new case matches your search.
One Moment Please
The filing “” is large (MB) and is being downloaded.
Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.
Your document is on its way!
If you do not receive the document in five minutes, contact support at support@docketalarm.com.
Sealed Document
We are unable to display this document, it may be under a court ordered seal.
If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.
Access Government Site
